X-man

导航

2013年5月13日 #

xiangtan OJ God Lin’s Harem

摘要: http://202.197.224.59/OnlineJudge2/index.php/Problem/read/id/1159#include<stdio.h>#include<string.h>#include<set>#include<vector>using namespace std;struct node{ int num; int like; friend bool operator <(node a, node b) { if(a.like>b.like)return true; if(a.like==b.like& 阅读全文

posted @ 2013-05-13 17:43 雨钝风轻 阅读(287) 评论(0) 推荐(0) 编辑

XiangTan University1163 查询成绩

摘要: #include<stdio.h>#include<string>#include<string.h>#include<iostream>using namespace std;string s1,s2;int main(){ char a[200]; char b[200]; int i,j,k; while(scanf("%s %s",a,b+1)!=EOF) { b[0]='*';//正确密码的片段(可能首缺) s1=a; s2=b; i=0,j=0,k=0; //s2.push_fron... 阅读全文

posted @ 2013-05-13 11:51 雨钝风轻 阅读(176) 评论(0) 推荐(0) 编辑