[ZJd658[UVA11636] Hello World!

題目：
http://zerojudge.tw/ShowProblem?problemid=d658

---------------------------------------------------------------------------------------------------
#include<cstdio>
#include<cmath>
int main()
{
int n,T=1;
while(scanf("%d",&n) == 1 && n > 0)
printf("Case %d: %d\n",T++,(int)ceil(log2(n)));
return 0;
}

留言

張貼留言

這個網誌中的熱門文章

[ZJ]b513: 判斷質數-商競103

題目： http://zerojudge.tw/ShowProblem?problemid=b513 -------------------------------------------------------------------------------------------- #include<cstdio> #include<cmath> int isprime(int n) { if(n == 2) return 1; int x = 2, flag = 1; while(x <= sqrt(n)) { if(!(n%x)) { flag = 0; break; } x++; } return flag; } int main() { int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); printf("%c\n",isprime(n)?'Y':'N'); } return 0; }
閱讀完整內容

[ZJ]d212: 東東爬階梯

題目： http://zerojudge.tw/ShowProblem?problemid=d212 --------------------------------------------------------------------------------- #include<cstdio> typedef long long int LL; int main() { int n; while(scanf("%d",&n)!=EOF) { LL a = 1, b = 2, x = a + b; for(int i=3;i<=n;i++) { x = a + b; a = b; b = x; } if(n == 1) printf("%lld\n",a); else if(n == 2) printf("%lld\n",b); else printf("%lld\n",x); } return 0; }
閱讀完整內容