Submission #3413683
Source Code Expand
//$g++ -std=c++11 Template.cpp
//#include <bits/stdc++.h>
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <climits>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define ROF(i, j, k) for(int i = (int)(j); i >= (int)(k); --i)
#define FORLL(i, n, m) for(long long i = n; i < (long long)(m); i++)
#define SORT(v, n) sort(v, v+n)
#define REVERSE(v) reverse((v).begin(), (v).end())
using namespace std;
using ll = long long;
const ll MOD=1000000007LL;
typedef pair<int, int> P;
ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
priority_queue<int> q_descending;
priority_queue<int, vector<int>, greater<int> > q_ascending;
int dp[101][10001];
int ans;
int
main(void){
int n;
cin >> n;
int p[n];
REP(i, n) cin >> p[i];
dp[0][0] = 1;
REP(i, n){
REP(j, 10001){
dp[i+1][j] |= dp[i][j];
if(j - p[i] >= 0) dp[i+1][j] |= dp[i][j-p[i]];
}
}
REP(i, 10001) ans += dp[n][i];
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - コンテスト |
User |
motacapla |
Language |
C++14 (GCC 5.4.1) |
Score |
2 |
Code Size |
1642 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
4096 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 |
2 ms |
640 KB |
01 |
AC |
3 ms |
2176 KB |
02 |
AC |
5 ms |
4096 KB |
90 |
AC |
1 ms |
384 KB |
91 |
AC |
1 ms |
640 KB |