| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 20661 | 陶俊宸 | 印度国王的棋盘 | C++ | Wrong Answer | 10 | 0 MS | 268 KB | 265 | 2021-06-19 17:08:12 |
#include<iostream> #include<cmath> short k,n,b3; int ans; int main(){ scanf("%hd,%hd",&k,&n); ans=pow(2,n)-pow(2,k-1); if(ans<1000000) printf("%d",ans); else{ b3=ans%1000; while(ans>=1000) ans/=10; printf("%03hd,%hd",b3,ans); } return 0; }