Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
20685 | 欧阳漌 | 印度国王的棋盘 | C++ | Wrong Answer | 0 | 0 MS | 256 KB | 226 | 2021-06-19 19:45:15 |
#include<bits/stdc++.h> using namespace std; int k,m; unsigned long long s=0,t[101]; int main(){ scanf("%d%d",&k,&m); t[1]=1; for(int i=2;i<=m;i++) t[i]=t[i-1]*2; for(int i=k;i<=m;i++) s+=t[i]; printf("%d",s); }