Online Judge
| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 54391 | 王籽易 | 国王的米粒 | C++ | Accepted | 100 | 0 MS | 268 KB | 201 | 2022-07-29 15:13:32 |
Tests(5/5):
#include <bits/stdc++.h> using namespace std; int m,n,t; int ans=0; int main(){ cin>>m>>n; for(int i=min(m,n);i<=max(m,n);i++){ t=pow(2,i-1); ans+=t; } cout<<ans; return 0; }