| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 79118 | sh25_shenpy | 计算2的N次方 | C++ | Wrong Answer | 0 MS | 256 KB | 177 | 2025-12-28 20:18:14 |
#include<bits/stdc++.h> using namespace std; int main() { int n; long long w,m; cin>>n; w=pow(2,64); m=pow(2,n-64); cout<<w*m; return 0; }