摘要： #include #include using namespace std; int m,n,k; struct A { int gongji,lingdao; char data[501][101]; char name[101]; } p[501]; bool cmp(A a1,A a2) { if(a1.gongji!=a2.gongji) { ... 阅读全文

摘要： Fire MazeTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 53(19 users)Total Accepted: 26(17 users)Rating: Special Judge: NoDescriptionAfter escap... 阅读全文

摘要： 变形金刚Time Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 27(8 users)Total Accepted: 6(6 users)Rating: Special Judge: NoDescription新一轮变形金刚来袭，这次霸天虎的头领叫... 阅读全文

摘要： 模Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 10(7 users)Total Accepted: 7(7 users)Rating: Special Judge: NoDescription已知一个N进制的B位数X，要求找一个同为N进... 阅读全文

摘要： 最快通过Time Limit: 6000 MSMemory Limit: 32768 KTotal Submit: 24(11 users)Total Accepted: 12(10 users)Rating:Special Judge: NoDescriptionsp省有n个城市，它们之间有道路相... 阅读全文

摘要： 中间的球Time Limit: 1000 MSMemory Limit: 32767 KTotal Submit: 97(37 users)Total Accepted: 48(35 users)Rating: Special Judge: NoDescription有N个外形一样但重量不同的球，N... 阅读全文

摘要： 小z的卡片Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 56(18 users)Total Accepted: 15(12 users)Rating: Special Judge: NoDescription小w和小z想到了一个新游戏，在... 阅读全文

摘要： Merge IntervalsTime Limit: 1000 MSMemory Limit: 65535 KTotal Submit: 58(24 users)Total Accepted: 27(23 users)Rating: Special Judge: NoDescriptionGiven... 阅读全文

摘要： 充电Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 97(45 users)Total Accepted: 49(42 users)Rating:Special Judge: NoDescription玻璃小屋内有n个插排，屋内有 m个需要... 阅读全文

摘要： 密码锁Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 153(129 users)Total Accepted: 135(126 users)Rating:Special Judge: NoDescription小D在尝试打开一个很有挑战性... 阅读全文

摘要： 一个函数Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 48(37 users)Total Accepted: 38(35 users)Rating:Special Judge: NoDescription现在用一个函数来处理一个字符串（该... 阅读全文

摘要： 泡泡Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 52(27 users)Total Accepted: 28(26 users)Rating:Special Judge: NoDescription深海里面有无数泡泡，每个泡泡上都写着一... 阅读全文

摘要： Knight GamesTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 39(21 users)Total Accepted: 30(21 users)Rating: Special Judge: NoDescriptionThe knig... 阅读全文

摘要： 装修Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 410(225 users)Total Accepted: 262(212 users)Rating: Special Judge: NoDescriptionhero为了能顺利娶prin... 阅读全文

摘要： Next PermutationTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 96(47 users)Total Accepted: 58(44 users)Rating: Special Judge: NoDescriptionA pe... 阅读全文

摘要： Leyni, LOLI and ToastsTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 47(37 users)Total Accepted: 37(37 users)Rating: Special Judge: NoDescripti... 阅读全文

摘要： A Simple Problem with IntegersTime Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 178(48 users)Total Accepted: 51(36 users)Rating:Special Judge: NoD... 阅读全文

摘要： Marshal's confusion IITime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 239(80 users)Total Accepted: 73(66 users)Rating: Special Judge: NoDescript... 阅读全文

摘要： Marshal's Confusion IIITime Limit: 3000 MSMemory Limit: 65536 KTotal Submit: 236(62 users)Total Accepted: 74(51 users)Rating: Special Judge: NoDescrip... 阅读全文

摘要： 筛选法求素数：void getprime(){int i,j;memset(b,1,sizeof(b));b[0]=0;b[1]=0;for(i=2;i*i<=100000;i++){if(b[i]){for(j=i*i;i<=100000;j+=i){p[j]=0;}}}}快速判断一个数是否为素数... 阅读全文