摘要：
#include<cstdio>#include<algorithm>using namespace std;const int MAXN = 500000;struct node{ int i; bool is; bool operator < (const node& x)const { return i>x.i; }};int main(){ int T; int n; struct node a[MAXN]; scanf("%d",&T); while(T--) { scanf("%d",&am 阅读全文
posted @ 2013-03-20 19:17
Lt.Royce"Phantom"
阅读(125)
评论(0)
推荐(0)
摘要：
#include<cstdio>#include<algorithm>using namespace std;const int MAXN = 500000;struct node{ int i; bool is; bool operator < (const node& x)const { return i>x.i; }};int main(){ int T; int n; struct node a[MAXN]; scanf("%d",&T); while(T--) { scanf("%d",&am 阅读全文
posted @ 2013-03-20 17:52
Lt.Royce"Phantom"
阅读(116)
评论(0)
推荐(0)
摘要：
#include<cstdio>#include<cmath>using namespace std;int main(){ int n,T=1; while(scanf("%d",&n),n>0) { printf("Case %d: %d\n",T++,(int)ceil(log10(n)/log10(2))); //换底公式 } return 0;} 阅读全文
posted @ 2013-03-20 15:43
Lt.Royce"Phantom"
阅读(80)
评论(0)
推荐(0)
浙公网安备 33010602011771号