Run ID | 作者 | 问题 | 语言 | 测评结果 | 分数 | 时间 | 内存 | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|---|
65000 | 2020姚瑶 | NOIP2020(CSP) 普及:第一题 优秀的拆分 | C++ | 通过 | 100 | 0 MS | 264 KB | 338 | 2022-10-02 12:10:15 |
using namespace std; int n; int a[10000002],cnt; int main() {//2 4 8 16 32 64... int i,j,k; scanf("%d",&n); if(n%2!=0) printf("-1"); else { for(i=2;i<=n;i*=2) a[++cnt]=i; while(n>0) { i=cnt; while(a[i]>n) i--; printf("%d ",a[i]); n-=a[i]; } } return 0; }
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0
exit code: 0, checker exit code: 0