| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 77861 | sh25_shenpy | 集合求和 | C++ | Accepted | 0 MS | 256 KB | 284 | 2025-12-26 14:55:37 |
#include<iostream> #include<cmath> using namespace std; int a[31],i=0,j; long long s=0; int main(){ //cout<<s; while(cin>>a[i++]);//合写cin>>a[i];i++; for(j=0;j<i;j++){ s+=a[j]; } s*=pow(2,i-2);//注意,i-2! cout<<s; return 0; }