Bitset

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19706    Accepted Submission(s): 14852 Problem Description Give you a number on base ten,you should output it on base two.(0 < n < 1000)   Input For each case there is a postive number n on base ten, end of file.   Output For each case output a number on base two.   Sample Input 1 2 3   Sample Output 1 10 11   Author

8600 && xhd

刚第一眼看题目是，觉得好高大上，结果仔细一看，就是十进制转二进制，还弄个英文的，我没想起来啥好办法，

用的比较笨的办法。

#include <stdio.h> int main() { int t,a[12],i; while(~scanf("%d",&t)) { i=0; while(t) { a[i++]=t%2; t=t/2; } i--; for(;i>=0;i--) printf("%d",a[i]); printf("\n"); } return 0; }