Submission #97312
Source Code Expand
#include<iostream> #include<string> #include<algorithm> #include<vector> #include<cstdio> #include<cstring> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define REP(n) rep(i,n) #define all(n) n.begin(),n.end() #define foreach(it,c) for(typeof(c.begin()) it=c.begin();it!=c.end();++it) const int MAXP = 100, MAXN = 100; int main() { int pat[MAXP * MAXN + 1000] = {}; pat[0] = 1; int n, p; cin >> n; rep(j,n) { cin >> p; for(int i = MAXP * MAXN + 1; i >= 0; i--)if(pat[i]) pat[i + p] = 1; } int ans = 0; REP(MAXP * MAXN) ans += pat[i]; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - コンテスト |
User | ryo_kun |
Language | C++ (G++ 4.6.4) |
Score | 2 |
Code Size | 688 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 848 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 2 / 2 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00, 01, 02, 90, 91 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00 | AC | 22 ms | 756 KB |
01 | AC | 21 ms | 780 KB |
02 | AC | 24 ms | 848 KB |
90 | AC | 19 ms | 776 KB |
91 | AC | 19 ms | 772 KB |