Online Judge
| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 55042 | 202203xhl | 国王的米粒 | C++ | Wrong Answer | 20 | 0 MS | 272 KB | 177 | 2022-07-29 19:01:30 |
Tests(1/5):
#include<bits/stdc++.h> using namespace std; long long m,n; int main(){ cin>>m>>n; if(m<n) cout<<pow(2,n)-pow(2,m-1); if(m>=n) cout<<pow(2,m)-pow(2,n-1); return 0; }