HDU 5417 Victor and Machine】的更多相关文章

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5417 Problem Description Victor has a machine. When the machine starts up, it will pop out a ball immediately. After that, the machine will pop out a ball every w seconds. However, the machine has some f…
Victor and Machine Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 240    Accepted Submission(s): 134 Problem Description Victor has a machine. When the machine starts up, it will pop out a ba…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5417 水题,一开始题目读错了做了好久,每次停工以后都是重新计时. 需要注意的是,先除后乘注意加括号 #include<stdio.h> int main(){ int x, y, w, n; int per, tmp; while(~scanf("%d %d %d %d",&x,&y,&w,&n)){ per = x + y; if( x <…
HDU 5418 Victor and World Time Limit:2000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64u After trying hard for many years, Victor has finally received a pilot license. To have a celebration, he intends to buy himself an airplane and fl…
题目链接: hdu: http://acm.hdu.edu.cn/showproblem.php?pid=5418 bestcoder(中文): http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=619&pid=1002 Victor and World  Accepts: 99  Submissions: 644  Time Limit: 4000/2000 MS (Java/Others)  Memory…
Victor and World Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others) Total Submission(s): 1463    Accepted Submission(s): 682 Problem Description After trying hard for many years, Victor has finally received a pilot…
Victor and String Time Limit: 1000ms Memory Limit: 262144KB This problem will be judged on HDU. Original ID: 542164-bit integer IO format: %I64d      Java class name: Main Victor loves to play with string. He thinks a string is charming as the string…
Victor and Proposition Time Limit: 6000ms Memory Limit: 524288KB This problem will be judged on HDU. Original ID: 542064-bit integer IO format: %I64d      Java class name: Main At the very beginning, Victor has a proposition, then this proposition pr…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4052 初始给你w*h的矩阵,给你n个矩形(互不相交),按这些矩形尺寸把初始的矩形扣掉,形成一个新的'矩形'.然后给你1*m大小的矩形,问这个矩形在新'矩形'中有多少种放法. 一开始没想法==,然后看了看题解,说是线段树做的. 要是m为1的话,那答案就是剩下的面积了. 不为1的话,可以把n个矩形的面积扩展一下(我是向右扩展),比如x1 y1 x2 y2 的矩形扣掉,就相当于x1  y1  x2+m-1…
Harry And Dig Machine Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 435    Accepted Submission(s): 153 Problem Description   As we all know, Harry Porter learns magic at Hogwarts School. Howe…