| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 54413 | 安一宸 | 国王的米粒 | C++ | Accepted | 100 | 0 MS | 252 KB | 251 | 2022-07-29 15:20:39 |
#include<bits/stdc++.h> using namespace std; long long m,n,a[31]={1},ans; int main(){ cin>>m>>n; for(int i=1;i<=min(m,n);i++){ a[i]=a[i-1]*2; } for(int i=min(m,n);i<=max(m,n);i++){ ans+=a[i]=a[i-1]*2; } cout<<ans/2; return 0; }