| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 54365 | 王籽易 | 国王的米粒 | C++ | Wrong Answer | 0 | 0 MS | 264 KB | 259 | 2022-07-29 14:56:48 |
#include <bits/stdc++.h> using namespace std; long long m,n,a[66]; long long ans; int main(){ cin>>m>>n; m=max(m,n); n=min(m,n); for(long long i=1;i<=m;i++){ a[i]=pow(2,i-1); if(i>=n){ ans+=a[i]; } } cout<<ans; return 0; }