模拟
我要满满的AC
不积跬步,无以至千里
展开
-
POJ1132 Border
#include #includeint main(){ //freopen("t.txt","r",stdin); char a[81],ans[81]; int c1[81],c2[81],c3[81]; int k1,k2,k3,i,j,b1,b2,b3; for(;;){ scanf("%d%d%d",&k1,&k2,&原创 2014-07-18 22:11:10 · 409 阅读 · 0 评论 -
POJ1107 W's Cipher
#include #includeint main(){ //freopen("t.txt","r",stdin); char a[81],ans[81]; int c1[81],c2[81],c3[81]; int k1,k2,k3,i,j,b1,b2,b3; for(;;){ scanf("%d%d%d",&k1,&k2,&原创 2014-07-18 22:11:23 · 463 阅读 · 0 评论 -
POJ1245 Programmer, Rank Thyself
#include#include#include#includestruct node{public:char name[11];int time[7];int count,sum,tot,geo;double dui;}team[20];int cmp(const void *a,const void *b){struct node原创 2014-07-18 22:13:55 · 438 阅读 · 0 评论 -
POJ1008 1008 Maya Calendar
#include#includeusing namespace std;char month[19][10]={"pop","no","zip","zotz","tzec","xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu","uayet"}原创 2014-07-18 22:08:22 · 362 阅读 · 0 评论