摘要:
HDU1398#includeusing namespace std;int main(){ //freopen("C:\\Users\\Sky\\Desktop\\1.in","r",stdin);//PLEASE DELETE IT!!!!!!!!!!!!!!!!!!!!!!!! int a[350],b[350],i,j,k,n; while(cin>>n&&n) { for(i=0; i#includeconst int N=102;int min[N],max[N],c1[N],c2[N];int main(){ i 阅读全文
posted @ 2013-07-24 20:42
Sky-J
阅读(223)
评论(0)
推荐(0)
摘要:
atof(将字符串转换成浮点型数)atoi(将字符串转换成整型数)atol(将字符串转换成长整型数)strtod(将字符串转换成浮点数)strtol(将字符串转换成长整型数)strtoul(将字符串转换成无符号长整型数)toascii(将整型数转换成合法的ASCII 码字符)toupper(将小写字母转换成大写字母)tolower(将大写字母转换成小写字母) 阅读全文
posted @ 2013-07-24 17:13
Sky-J
阅读(197)
评论(0)
推荐(0)
摘要:
Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3771Accepted Submission(s): 2586 Problem DescriptionAs we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to cal 阅读全文
posted @ 2013-07-24 16:36
Sky-J
阅读(285)
评论(0)
推荐(0)
摘要:
Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15571Accepted Submission(s): 5772 Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(becau 阅读全文
posted @ 2013-07-24 16:08
Sky-J
阅读(253)
评论(0)
推荐(0)
浙公网安备 33010602011771号