블루베리의 블로그

#includeusing namespace std;int main(){ int N; string S; cin >> N; for(int i=0; i> S; if(S.length() >= 6 && S.length()

보호되어 있는 글입니다.

#include #include #include #include #include using namespace std;const double PI = acos(-1);typedef complex cpx;void FFT(vector &f, cpx w){ int n = f.size(); if(n == 1) return; vector even(n / 2), odd(n / 2); for(int i=0; i multiply(vector a, vector b){ int n = 1; while(n c(n); cpx w(cos(2 * PI / n), sin(2 * PI / n)); FFT(a, w); FFT(b, w); for(int i=0; i> A >> B; ..

#include #include #include using namespace std;int N, M, Arr[31];bool dp[31][15001];void solve(int a, int b){ if(a > N || dp[a][b]){ return; } dp[a][b] = true; solve(a + 1, b + Arr[a]); solve(a + 1, abs(b - Arr[a])); solve(a + 1, b); return;}int main(){ cin >> N; for(int i=0; i> Arr[i]; } solve(0, 0); cin >> M; int cnt; for(int i=0; i> cnt..

#include #include #include #include using namespace std;vector Score;vector> Graph;map Map;int solution(vector friends, vector gifts) { int answer = 0; Score = vector(friends.size(), 0); for(int i=0; i>(friends.size(), vector(friends.size(), 0)); for(int i=0; i tmp; while(getline(ss, buf, ' ')){ tmp.push_back(buf); } Graph[Map[tmp[0]]][Map[tmp..

#include using namespace std;long long N, M, L;long long Arr[1001][1001];long long Sum[1001][1001];int main(){ cin >> N >> M >> L; for(int i=1; i> Arr[i][j]; } } for(int i=1; i> a >> b >> c >> d; cout

#include #include #include using namespace std;int N, M, sum;int Arr[101], Cos[101];int DP[101][10001];int main(){ cin >> N >> M; for(int i=1; i> Arr[i]; } for(int i=1; i> Cos[i]; sum += Cos[i]; } for(int i=1; i= 0){ DP[i][j] = max(DP[i][j], DP[i-1][j - Cos[i]] + Arr[i]); } DP[i][j] = max(DP[i][j], DP[i-1][j]); } } ..

#include using namespace std;int N, M;int Arr[21];int DP[10001];int main(){ int T; cin >> T; while(T--){ for(int i=0; i> N; for(int i=0; i> Arr[i]; } cin >> M; DP[0] = 1; for(int i=0; i

#include using namespace std;int N, M;int Arr[21];int Pag[21];int DP[21][201];int Ans;int main(){ cin >> N >> M; int a, b; for(int i=1; i> Arr[i] >> Pag[i]; } for(int i=1; i=0; j--){ if(j - Arr[i] >= 0){ DP[i][j] = max(DP[i-1][j], DP[i-1][j - Arr[i]] + Pag[i]); } else{ DP[i][j] = DP[i-1][j]; } Ans..

#include using namespace std;int n, k;pair map[101];bool check[101];int dp[101][100001];void sol(){ for(int i=1; i= map[i].first) dp[i][j] = max(dp[i-1][j], dp[i-1][j-map[i].first] + map[i].second); else dp[i][j] = dp[i-1][j]; } } cout >n>>k; for(int i=1; i>map[i].first>>map[i].second; } sol();}