Submission #3268622
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <cmath> #include <cstdio> #include <functional> #include <numeric> #include <stack> #include <queue> #include <map> #include <set> #include <utility> #include <sstream> #include <complex> #include <fstream> #include <bitset> #include <time.h> #include <tuple> #include <iomanip> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; typedef vector<ll> V; typedef complex<double> Point; #define PI acos(-1.0) #define EPS 1e-10 const ll INF = 1e16; const ll MOD = 1e9 + 7; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define rep(i,N) for(int i=0;i<(N);i++) #define ALL(s) (s).begin(),(s).end() #define EQ(a,b) (abs((a)-(b))<EPS) #define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) ) #define fi first #define se second #define N_SIZE (1LL << 20) #define NIL -1 ll sq(ll num) { return num*num; } ll mod_pow(ll x, ll n) { if (n == 0)return 1; if (n == 1)return x%MOD; ll res = sq(mod_pow(x, n / 2)); res %= MOD; if (n % 2 == 1) { res *= x; res %= MOD; } return res; } ll mod_add(ll a, ll b) { return (a + b) % MOD; } ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; } ll mod_mul(ll a, ll b) { return a*b % MOD; } int n; int p[100]; bool dp[101][10001]; int main(){ cin >> n; rep(i,n)cin >> p[i]; dp[0][0] = true; rep(i,n){ rep(j,10001){ if(j+p[i] <= 10000)dp[i+1][j+p[i]] |= dp[i][j]; dp[i+1][j] |= dp[i][j]; } } int ans = 0; rep(i,10001)ans += dp[n][i]; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - コンテスト |
User | jimmy |
Language | C++14 (GCC 5.4.1) |
Score | 2 |
Code Size | 1646 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 1280 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 | 1 ms | 384 KB |
01 | AC | 2 ms | 768 KB |
02 | AC | 3 ms | 1280 KB |
90 | AC | 1 ms | 256 KB |
91 | AC | 1 ms | 384 KB |