随笔分类 -  搜索

摘要：Fill the blanksTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 283Accepted Submission(s): 115Probl... 阅读全文

摘要：6450 Social AdvertisingYou have decided to start up a new social networking company. Other existing popular social networksalready have billions of us... 阅读全文

摘要：Quoit DesignTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29344Accepted Submission(s): 7688Prob... 阅读全文

摘要：We have a grid of sizeNxN. Each cell of the grid initially contains a zero(0) or a one(1).Theparityof a cell is the number of 1s surrounding that cell... 阅读全文

摘要：There are N (1 ≤ N ≤ 105) colored blocks (numbered 1 to N from left to right) which are lined up in a row. And the i-th block's color is Ci (1 ≤ Ci ≤ ... 阅读全文

摘要：MinesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1110Accepted Submission(s): 280Problem Descr... 阅读全文

摘要：1605 - Gene recombinationTime Limit:2sMemory Limit:64MBSubmissions: 264 Solved: 46DESCRIPTIONAs a gene engineer of a gene engineering project, Enigma ... 阅读全文

摘要：题意：给定一个平面图 . 为空地（不着火） # 为草开始可以选1-2个草堆点燃，每隔一秒会把上下左右的草引燃（开始时间为0秒）问把所有草烧光的最少时间#include#include#include#includeusing namespace std;const int INF=1000000000;inline int min(int a,int b){return ab?a:b;}char mp[15][15];int v[15][15];int R,C;int dir[4][2]={0,1,0,-1,1,0,-1,0};struct Node{ int x,y; Node(... 阅读全文

摘要：题目大意：求n范围内最大的反素数（反素数定义：f(x)表示x的因子数，f(x)>f(x1) （0=p2>=......>=pn证明：若pi#includeusing namespace std;typedef long long LL;int prime[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};LL n,ans,Max;void dfs(LL sum,LL num,LL k,LL t){ if(sum>Max) {Max=sum;ans=num;} if(sum==Max && num14) retu 阅读全文

摘要：In most professional sporting events, cheerleaders play a major role in entertaining the spectators. Their roles are substantial during breaks and prior to start of play. The world cup soccer is no exception. Usually the cheerleaders form a group and perform at the centre of the field. In addition t 阅读全文

摘要：RemainderTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2122Accepted Submission(s): 449 Problem DescriptionCoco is a clever boy, who is good at mathematics. However, he is puzzled by a difficult mathematics problem. The problem is: Given three in 阅读全文

摘要：三个水杯时间限制：1000 ms | 内存限制：65535 KB难度：4描述 给出三个水杯，大小不一，并且只有最大的水杯的水是装满的，其余两个为空杯子。三个水杯之间相互倒水，并且水杯没有标识，只能根据给出的水杯体积来计算。现在要求你写出一个程序，使其输出使初始状态到达目标状态的最少次数。 输入第一行一个整数N(0<N<50)表示N组测试数据 接下来每组测试数据有两行，第一行给出三个整数V1 V2 V3 (V1>V2>V3 V1<100 V3>0)表示三个水杯的体积。 第二行给出三个整数E1 E2 E3 （体积小于等于相应水杯体积）表示我们需要的最终状态输出每 阅读全文