Acm Timus Ru 1087
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <math.h> #include <limits.h> using namespace std; // Datatypes typedef vector<int> vi; typedef vector<string> vs; typedef vector<vi> vvi; typedef pair<int,int> ii; typedef long long ll; typedef long double ld; // Define #define sz(a) int((a).size()) #define pb push_back #define all(c) (c).begin(),(c).end() #define present(c,x) ((c).find(x) != (c).end()) #define cpresent(c,x) (find(all(c),x) != (c).end()) #define FOR(_i,_n) for(int (_i) = 0; (_i) < (_n); (_i)++) #define MP make_pair // Constants const double eps = 1e-8; const double PI = 3.1415926535897932384626433832795; int w[500]; int N; long long m[10010]; int main(void) { #ifdef ALEX freopen("input.in", "r", stdin); freopen("output.out", "w", stdout); #endif int N,K; cin >> N >> K; for(int i = 0; i < K; i++) cin >> w[i]; m[0] = 1; for(int i = 1; i <= N; i++) { int s = 0; int ss = 0; for(int j = 0; j < K; j++) { if((i - w[j]) >= 0) { ss ++; s += m[i-w[j]]; } } if(s != ss) m[i] = 1; else m[i] = 0; } if(m[N] == 0) cout << 2; else cout << 1; return 0; }
page revision: 0, last edited: 30 Mar 2008 10:08