扩大
缩小

2012年7月21日

hduoj1089A+B for Input-Output Practice (I)

摘要： A+B for Input-Output Practice (I)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45988Accepted Submission(s): 25909Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I specially designed the problem for acm beginners.You must 阅读全文

posted @ 2012-07-21 13:22 LinuxPanda 阅读(155) 评论(0) 推荐(0) 编辑

hduoj1090A+B for Input-Output Practice (II)

摘要： A+B for Input-Output Practice (II)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34997Accepted Submission(s): 23258Problem DescriptionYour task is to Calculate a + b.InputInput contains an integer N in the first line, and then N lines follow. Each 阅读全文

posted @ 2012-07-21 13:20 LinuxPanda 阅读(126) 评论(0) 推荐(0) 编辑

hduoj1091A+B for Input-Output Practice (III)

摘要： A+B for Input-Output Practice (III)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42013Accepted Submission(s): 21378Problem DescriptionYour task is to Calculate a + b.InputInput contains multiple test cases. Each test case contains a pair of integ 阅读全文

posted @ 2012-07-21 13:18 LinuxPanda 阅读(148) 评论(0) 推荐(0) 编辑

hduoj1092

摘要： A+B for Input-Output Practice (V)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27247Accepted Submission(s): 18476Problem DescriptionYour task is to calculate the sum of some integers.InputInput contains an integer N in the first line, and then N 阅读全文

posted @ 2012-07-21 13:16 LinuxPanda 阅读(147) 评论(0) 推荐(0) 编辑

hduoj1093A+B for Input-Output Practice (V)

摘要： A+B for Input-Output Practice (V)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27247Accepted Submission(s): 18476Problem DescriptionYour task is to calculate the sum of some integers.InputInput contains an integer N in the first line, and then N 阅读全文

posted @ 2012-07-21 13:14 LinuxPanda 阅读(173) 评论(0) 推荐(0) 编辑

hduoj1094A+B for Input-Output Practice (VI)

摘要： A+B for Input-Output Practice (VI)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25607Accepted Submission(s): 17325Problem DescriptionYour task is to calculate the sum of some integers.InputInput contains multiple test cases, and one case one line 阅读全文

posted @ 2012-07-21 13:11 LinuxPanda 阅读(250) 评论(0) 推荐(0) 编辑

hduoj1095A+B for Input-Output Practice (VII)

摘要： A+B for Input-Output Practice (VII)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25686Accepted Submission(s): 16904Problem DescriptionYour task is to Calculate a + b.InputThe input will consist of a series of pairs of integers a and b, separated 阅读全文

posted @ 2012-07-21 13:06 LinuxPanda 阅读(118) 评论(0) 推荐(0) 编辑

hduoj1096A+B for Input-Output Practice (VIII)

摘要： A+B for Input-Output Practice (VIII)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55289Accepted Submission(s): 16787Problem DescriptionYour task is to calculate the sum of some integers.InputInput contains an integer N in the first line, and then 阅读全文

posted @ 2012-07-21 13:03 LinuxPanda 阅读(130) 评论(0) 推荐(0) 编辑

hduoj1108最小公倍数

摘要： 最小公倍数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20327Accepted Submission(s): 11001Problem Description给定两个正整数，计算这两个数的最小公倍数。Input输入包含多组测试数据，每组只有一行，包括两个不大于1000的正整数.Output对于每个测试用例，给出这两个数的最小公倍数，每个实例输出一行。Sample Input10 14Sample Output70SourcePOJView 阅读全文

posted @ 2012-07-21 12:57 LinuxPanda 阅读(205) 评论(0) 推荐(0) 编辑

nyoj1008 Elevator

摘要： ElevatorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24439Accepted Submission(s): 13116Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floo 阅读全文

posted @ 2012-07-21 12:54 LinuxPanda 阅读(129) 评论(0) 推荐(0) 编辑

hduoj1097A hard puzzle

摘要： A hard puzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18634Accepted Submission(s): 6631Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,s 阅读全文

posted @ 2012-07-21 12:51 LinuxPanda 阅读(125) 评论(0) 推荐(0) 编辑

hduoj1018 Big Number

摘要： Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15789Accepted Submission(s): 6977Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, 阅读全文

posted @ 2012-07-21 12:47 LinuxPanda 阅读(125) 评论(0) 推荐(0) 编辑

hduoj1019 Least Common Multiple

摘要： View Code #include<stdio.h>int gcd(int a,int b){ int t,aa=a,bb=b; if(a<b) {t=a;a=b;b=t;} while(b) {t=a%b;a=b;b=t;} //printf("%d\n",(int)((double)aa/a*bb));// return (int)((double)aa/a*bb);}int main(){ int ncase,m,t,x; scanf("%d",&ncase); while(ncase--) { scanf... 阅读全文

posted @ 2012-07-21 12:44 LinuxPanda 阅读(200) 评论(0) 推荐(0) 编辑

hduoj1021 Fibonacci Again

摘要： Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21014Accepted Submission(s): 10045Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence 阅读全文

posted @ 2012-07-21 12:33 LinuxPanda 阅读(122) 评论(0) 推荐(0) 编辑

nyoj5 Binary String Matching

摘要： Binary String Matching时间限制：3000ms | 内存限制：65535KB难度：3描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a substring of B? For example, the text string B is ‘1001110110’ while the pattern string A is ‘11’, you should output 3 阅读全文

posted @ 2012-07-21 02:13 LinuxPanda 阅读(162) 评论(0) 推荐(0) 编辑

nyoj73 比大小

摘要： 比大小时间限制：3000ms | 内存限制：65535KB难度：2描述给你两个很大的数，你能不能判断出他们两个数的大小呢？比如123456789123456789要大于-123456输入每组测试数据占一行，输入两个不超过1000位的10进制整数a,b数据保证输入的a,b没有前缀的0。如果输入0 0表示输入结束。测试数据组数不超过10组输出如果a>b则输出“a>b”，如果a<b则输出“a<b”,如果相等则输出“a==b”。样例输入111111111111111111111111111 88888888888888888888-11111111111111111111111 阅读全文

posted @ 2012-07-21 02:10 LinuxPanda 阅读(509) 评论(0) 推荐(0) 编辑

nyoj429 骨牌铺方格

摘要： 骨牌铺方格时间限制：1000ms | 内存限制：65535KB难度：2描述在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数.例如n=3时,为2× 3方格，骨牌的铺放方案有三种,如下图：输入输入数据由多行组成，每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (0<n<=50)。输出对于每个测试实例，请输出铺放方案的总数，每个实例的输出占一行。样例输入126样例输出1213View Code #include<stdio.h>int main(){ int n,i;long long 阅读全文

posted @ 2012-07-21 02:07 LinuxPanda 阅读(281) 评论(0) 推荐(0) 编辑

nyoj312 20岁生日

摘要： 20岁生日时间限制：1000ms | 内存限制：65535KB难度：1描述路过这的20岁生日就要到了，他当然很开心，可是他突然想到一个问题，是不是每个人从出生开始，到达20岁生日时所经过的天数都是一样的呢？似乎并不全都是这样，所以他想请你帮忙计算一下他和他的几个朋友从出生到达20岁生日所经过的总天数，让他好来比较一下。输入一个数T，后面T行每行有一个日期，格式是YYYY-MM-DD。如我的生日是1988-03-07。输出T行，每行一个数，表示此人从出生到20岁生日所经过的天数。如果这个人没有20岁生日，就输出-1。样例输入11988-03-07样例输出7305View Code #inclu. 阅读全文

posted @ 2012-07-21 02:04 LinuxPanda 阅读(364) 评论(0) 推荐(0) 编辑

nyoj168房间安排

摘要： 房间安排时间限制：3000ms | 内存限制：65535KB难度：1描述2010年上海世界博览会(Expo2010),是第41届世界博览会。于2010年5月1日至10月31日期间，在中国上海市举行。本次世博会也是由中国举办的首届世界博览会。上海世博会以“城市，让生活更美好”(Better City,Better Life)为主题，将充分探索21世纪城市生活。这次世博会总投资达450亿人民币，创造了世界博览会史上的最大规模记录。吸引200个国家和国际组织参展。预计有7000万人次的参观者。为了更好地接待在这期间来自世界各地的参观者，如何合理安排各宾馆的住房问题提到了日程。组委会已接到了大量的客户 阅读全文

posted @ 2012-07-21 01:57 LinuxPanda 阅读(439) 评论(0) 推荐(0) 编辑

nyoj67三角形面积

摘要： 三角形面积时间限制：3000ms | 内存限制：65535KB难度：2描述给你三个点，表示一个三角形的三个顶点，现你的任务是求出该三角形的面积输入每行是一组测试数据，有6个整数x1,y1,x2,y2,x3,y3分别表示三个点的横纵坐标。（坐标值都在0到10000之间）输入0 0 0 0 0 0表示输入结束测试数据不超过10000组输出输出这三个点所代表的三角形的面积，结果精确到小数点后1位（即使是整数也要输出一位小数位）样例输入0 0 1 1 1 30 1 1 0 0 00 0 0 0 0 0样例输出1.00.5View Code #include<stdio.h>#include 阅读全文

posted @ 2012-07-21 01:44 LinuxPanda 阅读(205) 评论(0) 推荐(0) 编辑

导航