煮人为乐

摘要： 本题和南阳上的那个 房间安排 一个道理，不过就是加了个是两排房子，需要化简;简单思想：初始化数组，如果需要移动，自增一，代表一个操作，最后便历，找出操作数做多的那个，就是我们需要的最长时间代码：#include<stdio.h>#include<string.h>int main(){ int T,a[250],max,i,j,f,t,n,x; scanf("%d",&T); while(T--) { scanf("%d",&n); memset(a,0,sizeof(a)); for(i=0;i<n;++i 阅读全文

摘要： PacketsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 36708Accepted: 12227DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square parcels of the same h 阅读全文

摘要： In ActionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2165Accepted Submission(s): 713Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared acros 阅读全文