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