Submission #1521403
Source Code Expand
#pragma GCC optimize("O3") #include<bits/stdc++.h> #define rc(x) return cout<<x<<endl,0 #define pb push_back #define in insert #define er erase #define fr first #define sc second const int inf=INT_MAX; const int nmax=1e5+5; const int mod=1e9+7; typedef long long ll; using namespace std; int n,i,a[101],sum; int main() { ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); //freopen("sol.in","r",stdin); cin>>n; for(i=1;i<=n;i++)cin>>a[i],sum+=a[i]; sort(a+1,a+n+1); if((sum%10))cout<<sum<<endl; else { for(i=1;i<=n;i++)if((a[i]%10))break; if(i<=n)cout<<sum-a[i]<<endl; else cout<<0<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Bugged |
User | abcde2002 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 665 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |