摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1155Problem DescriptionOnce again, James Bond is fleeing from some evil people who want to see him dead. Fortunately, he has left a bungee rope on a nearby highway bridge which he can use to escape from his enemies. His plan is to attach one end of the rope 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1316How Many Fibs?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2354Accepted Submission(s): 955Problem DescriptionRecall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1715View Code 1 import java.math.BigInteger; 2 import java.util.Scanner; 3 4 5 public class Main { 6 public static void main(String[] args) { 7 BigInteger f[]=new BigInteger[1010]; 8 int a[]=new int[1010]; 9 Scanner cinScanner=... 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1789Doing Homework againTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3168Accepted Submission(s): 1836Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of home 阅读全文

摘要： A. Old Peykantime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n cities in the country where the Old Peykan lives. These cities are located on a straight line, we'll denote them from left to right as c1, c2, ..., cn. The Old Peykan wa 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4452英语弱成渣，没看懂题目之前，样例没看明白。。trun around没注意。还有交换方向的时候理解错一句话，应该是题目写错了。模拟就是View Code 1 #include <stdio.h> 2 #include <stdlib.h> 3 4 int main() 5 { 6 int n,t1,s1,t2,s2,k; 7 char ch1,ch2; 8 char temp1,temp2; 9 int x1,y1,x2,y2; 10 int ... 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4451View Code 1 #include <stdio.h> 2 #include<string.h> 3 #include <stdlib.h> 4 int main() 5 { 6 int n,m,k,n1,m1,k1; 7 int in[1010]; 8 int to[1010]; 9 int c,i,num1,num2;10 char str1[20],str2[20];11 while(~scanf("%d%d%d",&n,&am 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4450巨水题，不解释View Code 1 #include<stdio.h> 2 int main() 3 { 4 int n; 5 int c; 6 int i; 7 while(~scanf("%d",&n),n) 8 { 9 int sum=0;10 for(i=0;i<n;i++)11 {12 scanf("%d",&c);13 sum+=c*c;14 ... 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4442比赛时做得很差，考虑时没考虑清楚，也正因为这样，才拖了很久，，最后一分钟提交，拿了个顽强拼搏奖，哈哈哈。。贪心：设已经排好一些，花时间t，然后考虑两情况哪种好(node[i].a,node[i].b),node[j].a,node[j].b),必有t+node[i].a+node[i].b*t+node[j].a+node[j].b(t+node[i].a+node[i].b*t)<=t+node[j].a+node[j].b*t+node[i].a+node[i].b(t+node[j].a+n 阅读全文

摘要： 位运算比关系运算优先级低，果断被坑了…………a=1,b=1;if(a^b>=0) printf("YES\n");else printf("NO\n");//输出NO，我以为YES。。。巨囧。。。 阅读全文