Submission #2207391
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <queue> #include <limits> #include <map> #define REP(i,n) for(long (i)=0;(i)<(n);(i)++) #define INF numeric_limits<double>::infinity() constexpr long MOD = 1e9 + 7; using namespace std; int scores[10001]; int main() { int n; cin >> n; long s; REP(i,n) { cin >> s; for (int j = 10000; j >= 0; j--) { if (scores[j]) { scores[j + s] = 1; } } scores[s] = 1; } long ans = 0; REP(i,10001) { if (scores[i] && i % 10) { ans = i; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Bugged |
User | xuzijian629 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 712 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
b06 | AC | 2 ms | 256 KB |
b07 | AC | 2 ms | 256 KB |
b08 | AC | 2 ms | 256 KB |
b09 | AC | 2 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 2 ms | 256 KB |
b12 | AC | 2 ms | 256 KB |