| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 75036 | sh25_zhuwy | 计算2的N次方 | C++ | Wrong Answer | 0 MS | 248 KB | 152 | 2025-12-05 15:04:41 |
#include<bits/stdc++.h> using namespace std; int main() { int n,k=1; cin>>n; for(int i=1;i<=n;i++) { k=k*2; } cout<<k; return 0; }