摘要：
Calculate S(n)Time Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9102Accepted Submission(s): 3325Pro... 阅读全文
posted @ 2015-02-02 13:10
JoneZP
阅读(230)
评论(0)
推荐(0)
摘要：
数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28544Accepted Submission(s): 17166Problem Descri... 阅读全文
posted @ 2015-01-30 17:02
JoneZP
阅读(156)
评论(0)
推荐(0)
摘要：
#include #includeint main(){ int e, i, o, u,n; char a,b; a='6'; b='0'; printf("%d %d\n",a,b);// '6'对应的ASCII码是54，'0'对应的ASCII码是48； printf("%d\n",a-b); p... 阅读全文
posted @ 2015-01-27 12:53
JoneZP
阅读(199)
评论(0)
推荐(0)
摘要：
求最小公倍数一种办法通过求最大公约数求得再通过公式（最小公倍数=两个数的乘积/最大公约数）最大公约数通过辗转相除法求得。#include int Gcd (int a, int b){ int tmp; while (b != 0){ tmp = a; a... 阅读全文
posted @ 2015-01-23 11:20
JoneZP
阅读(155)
评论(0)
推荐(0)
摘要：
畅通工程 Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38471Accepted Submission(s): 20404Problem Des... 阅读全文
posted @ 2015-01-23 11:16
JoneZP
阅读(187)
评论(0)
推荐(0)
浙公网安备 33010602011771号