摘要： Time Limit:2000MSMemory Limit:65536KTotal Submissions:5473Accepted:2379DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start an 阅读全文

摘要： Time Limit:2000MSMemory Limit:65536KTotal Submissions:11196Accepted:4587DescriptionFarmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤moneyi≤ 10,000) that he will need to spen 阅读全文

摘要： Time Limit:2000MSMemory Limit:65536KTotal Submissions:11435Accepted:3040DescriptionThe young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic keys are created from the produc 阅读全文

摘要： Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5183Accepted Submission(s): 1868Problem DescriptionXX星球有很多城市，每个城市之间有一条或多条飞行通道，但是并不是所有的路都是很安全的，每一条路有一个安全系数s,s是在 0 和 1 间的实数(包括0，1)，一条从u 到 v 的通道P 的安全度为Safe(P) = s(e1)*s(e2)…*s(ek) e1,e2,ek是P 上的边 ，现在8600 阅读全文

摘要： Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4479Accepted Submission(s): 1942Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these 阅读全文

摘要： Time Limit: 1000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1630Accepted Submission(s): 664Problem Description杭州有N个景区，景区之间有一些双向的路来连接，现在8600想找一条旅游路线，这个路线从A点出发并且最后回到A点，假设经过的路线为V1,V2,....VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区，而且不能重复经过同一个景区。现在8600需要你帮他找一条这样的 阅读全文

摘要： 比赛中经常会遇到大数问题，自己写了一个大数相乘的模板，可能会有Bug,先凑合看吧；#include#includeconst int M = 100;void GetDigit(char s[],int a[]){ int i; memset(a,0,sizeof(int)*M); int len = strlen(s); for(i = 0; i = 0; i--) printf("%d",c[i]); printf("\n"); } return 0;} 阅读全文

摘要： MMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends HZ took some (N) strawberries which MMM likes very much to decorate the cake (of course they also eat strawberries, not just for decoration). HZ is in charge of the decoration, and he 阅读全文

摘要： XX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒适度”有特殊要求，即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求，flycar必须瞬间提速/降速，痛苦呀 ),但XX星人对时间却没那么多要求。要你找出一条城市间的最舒适的路径。(SARS是双向的）。Input输入包括多个测试实例，每个实例包括：第一行有2个正整数n (1 2 #include 3 #include 4 using 阅读全文

摘要： http://poj.org/problem?id=1942题意：一个n*m的格子，从左下角走到右上角有多少种走法，规定只能向上或向右走；思路：解法挺水的，高中学组合数的时候老师给讲过；求C[m+n][n]就可以； 但是这里n,m是32位以内的数，要用double,输出的时候只输出整数部分； 1 #include 2 #include 3 using namespace std; 4 5 double n,m,ans; 6 int main() 7 { 8 cout>n>>m)10 {11 if(n == 0 && m == 0)12 ... 阅读全文