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