| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19666 | 王循 | 印度国王的棋盘 | C++ | Wrong Answer | 20 | 0 MS | 256 KB | 442 | 2021-05-19 15:30:49 |
#include <bits/stdc++.h> int k,m; int main() { scanf("%d,%d",&k,&m); long long a=1,b=1,s=0,t; for(int i=1;i<=k-1;i++)a*=2; for(int i=1;i<=m;i++)b*=2; t=b-a; while(t)s++,t/=10; t=1; for(int i=1;i<=s-3;i++)t*=10; if(b-a<1000000)std::cout<<b-a<<std::endl; else std::cout<<(b-a)/t<<','<<(b-a)%1000<<std::endl; }