| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 12188 | 陈颖钧 | 判奇偶求和 | C++ | Accepted | 100 | 0 MS | 264 KB | 378 | 2025-07-08 11:08:52 |
#include<bits/stdc++.h> using namespace std; int n,i,sum,j; int ou(int n){ for(i=2;i<=n;i+=2){ sum+=i; } return sum; } int yue(int n){ j=1; sum=0; while(j!=n){ if(n%j==0){ sum+=j; } j++; } return sum+n; } int main(){ cin>>n; if(n%2!=0){ cout<<ou(n); }else{ cout<<yue(n); } }