buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 101;
const int W = 10001;
int dp[N][W];
int weight[N];
int value[N];
int f(int i, int j) {
if (i <= 0 || j <= 0)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int a = max(f(i - 1, j), f(i, j - 1));
if (j < weight[i - 1])
... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 101;
const int W = 10001;
int dp[N][W];
int weight[N];
int value[N];
int f(int i, int j) {
if (i <= 0 || j <= 0)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int a = max(f(i - 1, j), f(i, j - 1));
if (j < weight[i - 1])
... | [["+", 0, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 249 | 4 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, n) for (int i = 0; i < (n); i++)
#define loops(i, f, n) for (int i = (f); i < (n); i++)
#define VEC vector<int>
#define INF INT_MAX
#define debug(a) cout << a
// vector<... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, n) for (int i = 0; i < (n); i++)
#define loops(i, f, n) for (int i = (f); i < (n); i++)
#define VEC vector<int>
#define INF INT_MAX
#define debug(a) cout << a
// vector<... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 295 | 3 |
#include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int val[1000], weight[10000];
for (int i = 0; i < N; i++) {
cin >> val[i] >> weight[i];
}
int res[1000][10000];
// res[number][weight]
for (int i = 0; i < N + 1; i++) {
res[i][0] = 0;
}
for (int i = 0; i < W + 1... | #include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int val[110], weight[10010];
for (int i = 0; i < N; i++) {
cin >> val[i] >> weight[i];
}
int res[110][10010];
// res[number][weight]
for (int i = 0; i < N + 1; i++) {
res[i][0] = 0;
}
for (int i = 0; i < W + 1; ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13]] | 1 | 263 | 8 |
///
// File: dpl_1_b.cpp
// Author: ymiyamoto
//
// Created on Wed Nov 1 23:21:00 2017
//
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
struct item_t {
int32_t value;
int32_t weight;
};
#define MAX_NUM 101
#define MAX_WEIGHT 10001
static vector<item_t> weights;
static int32_t ... | ///
// File: dpl_1_b.cpp
// Author: ymiyamoto
//
// Created on Wed Nov 1 23:21:00 2017
//
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
struct item_t {
int32_t value;
int32_t weight;
};
#define MAX_NUM 101
#define MAX_WEIGHT 10001
static vector<item_t> weights;
static int32_t ... | [["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 236 | 2 |
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <bits/stdc++.h>
const static int NMAX = 100;
const static int WMAX = 10000;
static const int INF = (1 << 29);
struct item {
int value, weight;
};
int main() {
int bag[NMAX + 1][WMAX + 1];
item items[NMAX + 1];
int N, W;
cin >> N >> W;
items[0]... | #define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <bits/stdc++.h>
const static int NMAX = 100;
const static int WMAX = 10000;
static const int INF = (1 << 29);
struct item {
int value, weight;
};
int main() {
int bag[NMAX + 1][WMAX + 1];
item items[NMAX + 1];
int N, W;
cin >> N >> W;
items[0]... | [["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 295 | 2 |
#include <bits/stdc++.h>
using namespace std;
int dp[111][11111], N, W, c[111], d[111], bnu;
int kei(int i, int j) {
if (dp[i][j])
return dp[i][j];
if (i == N) {
return 0;
}
if (j < d[i]) {
return kei(i + 1, j);
}
return dp[i][j] = bnu = max(kei(i + 1, j), kei(i + 1, j - d[i]) + c[i]);
}
int mai... | #include <bits/stdc++.h>
using namespace std;
int dp[111][11111], N, W, c[111], d[111], bnu;
int kei(int i, int j) {
if (dp[i][j])
return dp[i][j];
if (i == N) {
return 0;
}
if (j < d[i]) {
return kei(i + 1, j);
}
return dp[i][j] = bnu = max(kei(i + 1, j), kei(i + 1, j - d[i]) + c[i]);
}
int mai... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 184 | 6 |
#include <bits/stdc++.h>
using namespace std;
int dp[111][11111], N, W, c[111], d[111], bnu;
int kei(int i, int j) {
if (dp[i][j])
return dp[i][j];
if (i == N) {
return 0;
}
if (j < d[i]) {
return kei(i + 1, j);
}
return dp[i][j] = bnu = max(kei(i + 1, j), kei(i + 1, j - d[i]) + c[i]);
}
int mai... | #include <bits/stdc++.h>
using namespace std;
int dp[111][11111], N, W, c[111], d[111], bnu;
int kei(int i, int j) {
if (dp[i][j])
return dp[i][j];
if (i == N)
return 0;
if (j < d[i])
return kei(i + 1, j);
return dp[i][j] = bnu = max(kei(i + 1, j), kei(i + 1, j - d[i]) + c[i]);
}
int main() {
cin ... | [["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 184 | 6 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
us... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
us... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 526 | 4 |
#include <bits/stdc++.h>
using namespace std;
int KnapsackProblem(int c, int s, vector<int> &v, vector<int> &w) {
int dp[s + 1][c + 1];
int a, b;
for (a = 0; a < s; a++) {
for (b = 0; b < c; b++) {
if (a == 0 || b == 0) {
dp[a][b] = 0;
} else if (w[a - 1] <= b) {
dp[a][b] = max(v... | #include <bits/stdc++.h>
using namespace std;
int KnapsackProblem(int c, int s, vector<int> &v, vector<int> &w) {
int dp[s + 1][c + 1];
int a, b;
for (a = 0; a <= s; a++) {
for (b = 0; b <= c; b++) {
if (a == 0 || b == 0) {
dp[a][b] = 0;
} else if (w[a - 1] <= b) {
dp[a][b] = max... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22]] | 1 | 270 | 6 |
//#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++) //初期値a,i<bの範囲でループ
#define REP(i, n) FOR(i, 0, n) //初期値0,i<nの範囲でループ
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n;
int w[110];
int v... | //#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++) //初期値a,i<bの範囲でループ
#define REP(i, n) FOR(i, 0, n) //初期値0,i<nの範囲でループ
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n;
int w[110];
int v... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 198 | 3 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int dp[101][10001];
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i <= W; i++)
dp[0][i] = 0;
for (int i = 0; i < n; i++)... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int dp[101][10001];
int main() {
int n, W;
cin >> n >> W;
vector<int> w(n), v(n);
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i];
for (int i = 0; i <= W; i++)
dp[0][i] = 0;
for (int i = 0; i < n; i++)... | [["-", 8, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 8, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["-", 0, 7, 8, 1, 0, 16, 12, 69, 28, 22], ["+", 0, 7, 8, 1, 0, 16, 12, 69, 28, 22]] | 1 | 216 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, W;
int v[1001];
int w[1001];
int dp[20000][20000];
int dfs(int i, int j) {
int res;
if (dp[i][j] >= 0)
return res = dp[i][j];
if (i == N)
res = 0;
else if (j < w[i])
res = dfs(i + 1, j); //ここ代入し忘れてた
else
res = max(dfs(i + 1, j), dfs(i + 1,... | #include <bits/stdc++.h>
using namespace std;
int N, W;
int v[1001];
int w[1001];
int dp[101][10001];
int dfs(int i, int j) {
int res;
if (dp[i][j] >= 0)
return res = dp[i][j];
if (i == N)
res = 0;
else if (j < w[i])
res = dfs(i + 1, j); //ここ代入し忘れてた
else
res = max(dfs(i + 1, j), dfs(i + 1, j... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["+", 8, 9, 0,... | 1 | 238 | 8 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define NMAX 105
#define WMAX 10005
#define DIAGONAL 1
#define TOP 0
struct Item {
int value, weight;
};
int N, W;
Item items[NMAX + 1];
int C[NMAX + 1][WMAX + 1], G[NMAX + 1][WMAX + 1];
void compute(int &maxValue, vector<int> &sele... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define NMAX 105
#define WMAX 10005
#define DIAGONAL 1
#define TOP 0
struct Item {
int value, weight;
};
int N, W;
Item items[NMAX + 1];
int C[NMAX + 1][WMAX + 1], G[NMAX + 1][WMAX + 1];
void compute(int &maxValue, vector<int> &sele... | [["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 463 | 2 |
/*
* Contents : AOJ DPL 1 B
* Author : KitauraHiromi
* LastUpdate : 20180610
* Since : 20180610
*/
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int N, W;
int dp[101][10001]; // valueを保持
int value[101], weight[101];
int main(void) {
cin >> N >> W;
memset(dp, 0, sizeof(... | /*
* Contents : AOJ DPL 1 B
* Author : KitauraHiromi
* LastUpdate : 20180610
* Since : 20180610
*/
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int N, W;
int dp[101][10001]; // valueを保持
int value[101], weight[101];
int main(void) {
cin >> N >> W;
memset(dp, 0, sizeof(... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 200 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int n, W;
int weight[110], value[110];
int dp[110][10010];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> weight[i] >> value[i];
}
// dp[0][w]=0
for ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int n, W;
int weight[110], value[110];
int dp[110][10010];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> value[i] >> weight[i];
}
// dp[0][w]=0
for ... | [["-", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["-", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22]] | 1 | 221 | 4 |
#include <algorithm>
#include <cstdio>
using namespace std;
int dp(int, int);
int w[101];
int v[101];
int memo[101][10001];
int main() {
int N, W;
scanf("%d %d", &N, &W);
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 10001; j++) {
memo[i][j] = -1;
}
}
for (int i = 0; i < N; i++) {
... |
#include <algorithm>
#include <cstdio>
using namespace std;
int dp(int, int);
int w[1001];
int v[101];
int memo[101][10001];
int main() {
int N, W;
scanf("%d %d", &N, &W);
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 10001; j++) {
memo[i][j] = -1;
}
}
for (int i = 0; i < N; i++) {
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 278 | 4 |
n = eval(input())
ps = [list(map(int, input().split())) for i in range(n)]
def intersection(p1, p2, q1, q2):
dx0 = p2[0] - p1[0]
dy0 = p2[1] - p1[1]
dx1 = q2[0] - q1[0]
dy1 = q2[1] - q1[1]
a = dy0*dx1; b = dy1*dx0; c = dx0*dx1; d = dy0*dy1
if a == b: return None
x = (a*p1[0] - b*q1[0] + c*(q... | n = eval(input())
ps = [list(map(int, input().split())) for i in range(n)]
def intersection(p1, p2, q1, q2):
dx0 = p2[0] - p1[0]
dy0 = p2[1] - p1[1]
dx1 = q2[0] - q1[0]
dy1 = q2[1] - q1[1]
a = dy0*dx1; b = dy1*dx0; c = dx0*dx1; d = dy0*dy1
if a == b: return None
x = (a*p1[0] - b*q1[0] + c*(q... | [["-", 31, 23, 0, 657, 31, 657, 31, 657, 31, 22], ["+", 31, 23, 0, 657, 31, 657, 31, 657, 31, 22], ["-", 3, 668, 0, 659, 12, 652, 3, 4, 0, 22], ["+", 0, 659, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 467 | 7 |
#include <bits/stdc++.h>
using namespace std;
int n;
double bx, by;
pair<double, double> p[100009];
int main() {
scanf("%d", &n);
double sq = sin(1.234), cq = cos(1.234);
for (int i = 0; i < n; i++) {
scanf("%lf%lf", &bx, &by);
double ex = bx * cq - by * sq;
double ey = bx * sq + by * cq;
p[i] = m... | #include <bits/stdc++.h>
using namespace std;
int n;
double bx, by;
pair<double, double> p[100009];
int main() {
scanf("%d", &n);
double sq = sin(1.234), cq = cos(1.234);
for (int i = 0; i < n; i++) {
scanf("%lf%lf", &bx, &by);
double ex = bx * cq - by * sq;
double ey = bx * sq + by * cq;
p[i] = m... | [["-", 0, 43, 49, 50, 51, 16, 31, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 16, 31, 118, 119, 120], ["-", 0, 43, 49, 50, 51, 16, 12, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 16, 12, 118, 119, 120]] | 1 | 248 | 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << x << endl
using ld = long double;
using P = complex<ld>;
using G = vector<P>;
const ld pi = acos(-1);
namespace... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << x << endl
using ld = long double;
using P = complex<ld>;
using G = vector<P>;
const ld pi = acos(-1);
namespace... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 597 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
typedef complex<double> V;
typedef vector<P> vecP;
typedef pair<P, P> L;
typedef pair<P, P> S;
typedef pair<P, double> C;
const double eps = 1e-8;
const double PI = acos(-1);
const double PI2 = PI * 2.0;
namespace std {
bool operator<(const P &a,... | #include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
typedef complex<double> V;
typedef vector<P> vecP;
typedef pair<P, P> L;
typedef pair<P, P> S;
typedef pair<P, double> C;
const double eps = 1e-8;
const double PI = acos(-1);
const double PI2 = PI * 2.0;
namespace std {
bool operator<(const P &a,... | [["-", 0, 41, 15, 16, 31, 2, 63, 118, 119, 120], ["+", 0, 41, 15, 16, 31, 2, 63, 118, 119, 120], ["-", 0, 37, 0, 23, 0, 41, 15, 16, 17, 60], ["+", 0, 37, 0, 23, 0, 41, 15, 16, 17, 79], ["-", 0, 41, 15, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 41, 15, 16, 12, 2, 63, 118, 119, 120]] | 1 | 3,569 | 6 |
// 線分の交差問題
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <queue>
#include <set>
#include <vector>
using namespace std;
// 浮動小数点のゼロ判定
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// 点を... | // 線分の交差問題
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <queue>
#include <set>
#include <vector>
using namespace std;
// 浮動小数点のゼロ判定
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// 点を... | [["-", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["-", 51, 2, 3, 4, 0, 118, 28, 118, 119, 120], ["+", 51, 2, 3, 4, 0, 118, 28, 118, 119, 120]] | 1 | 999 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
#define EPS 1e-10
#define equals(a, b) (fabs((a) - (b)) < EPS)
class Point {
public:
double x, y;
Point(){};
Point(double x, double y) : x(x), y(y) {}
Point operator+(const Poin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
#define EPS 1e-10
#define equals(a, b) (fabs((a) - (b)) < EPS)
class Point {
public:
double x, y;
Point(){};
Point(double x, double y) : x(x), y(y) {}
Point operator+(const Poin... | [["-", 0, 23, 0, 41, 64, 16, 31, 118, 28, 22], ["-", 0, 23, 0, 41, 64, 16, 31, 118, 17, 131], ["-", 0, 23, 0, 41, 64, 16, 31, 118, 119, 120], ["+", 0, 37, 0, 23, 0, 41, 64, 16, 31, 22], ["-", 0, 41, 64, 16, 12, 118, 28, 118, 17, 131], ["-", 0, 41, 64, 16, 12, 118, 28, 118, 119, 120], ["-", 0, 23, 0, 41, 64, 16, 12, 118... | 1 | 962 | 8 |
#include <algorithm>
#include <iostream>
#include <set>
#include <unordered_map>
#include <vector>
#define MAX (200000 + 1)
using namespace std;
int t[MAX], N;
struct segment {
bool vertical;
bool start;
int x, y1, y2;
};
vector<segment> space;
set<int> appear;
unordered_map<int, int> index;
int sum(int n) ... | #include <algorithm>
#include <iostream>
#include <set>
#include <unordered_map>
#include <vector>
#define MAX (200000 + 1)
using namespace std;
int t[MAX], N;
struct segment {
bool vertical;
bool start;
int x, y1, y2;
};
vector<segment> space;
set<int> appear;
unordered_map<int, int> index;
int sum(int n) ... | [["-", 0, 57, 75, 76, 0, 57, 64, 37, 0, 147], ["+", 0, 57, 75, 76, 0, 57, 64, 37, 0, 146], ["-", 0, 57, 75, 76, 0, 57, 64, 37, 0, 146], ["+", 0, 57, 75, 76, 0, 57, 64, 37, 0, 147]] | 1 | 723 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef vector<int> VI;
typed... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef vector<int> VI;
typed... | [["-", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120]] | 1 | 2,195 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// 点类
class Point {
public:
double x, y;
Point(){};
Point(double x, double y) : x(x), y(y) {}
Poin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
// 点类
class Point {
public:
double x, y;
Point(){};
Point(double x, double y) : x(x), y(y) {}
Poin... | [["-", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120]] | 1 | 2,621 | 2 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
// BEGIN CUT HERE
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define PI 3.141592653589793238
// COUNTER CLOCKWISE
static const int CCW_COUNTER_CLOCKWISE = 1;
static const int CCW_CLOCKWISE = -1;
static const int CCW_ONLINE_BACK... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
// BEGIN CUT HERE
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define PI 3.141592653589793238
// COUNTER CLOCKWISE
static const int CCW_COUNTER_CLOCKWISE = 1;
static const int CCW_CLOCKWISE = -1;
static const int CCW_ONLINE_BACK... | [["-", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120]] | 1 | 8,210 | 2 |
///
// File: dpl_1_d.cpp
// Author: ymiyamoto
//
// Created on Thu Nov 2 08:05:56 2017
//
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int32_t main() {
uint32_t N;
cin >> N;
vector<uint32_t> arr(N, 0);
for (uint32_t i = 0; i < N; i++) {
cin >> arr[... | ///
// File: dpl_1_d.cpp
// Author: ymiyamoto
//
// Created on Thu Nov 2 08:05:56 2017
//
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
int32_t main() {
uint32_t N;
cin >> N;
vector<uint64_t> arr(N, 0);
for (uint32_t i = 0; i < N; i++) {
cin >> arr[... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 162 | 8 |
/**
* Combinatorial - Longest Increasing Subsequence
*/
#include <iostream>
using namespace std;
const int INF = 1 << 29;
int main() {
int N;
int A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = a;
}
int dp[100001];
fill(dp, dp + 100001, INF);
dp[0] = -1;
... | /**
* Combinatorial - Longest Increasing Subsequence
*/
#include <iostream>
using namespace std;
const int INF = 1 << 30;
int main() {
int N;
int A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = a;
}
int dp[100001];
fill(dp, dp + 100001, INF);
dp[0] = -1;
... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 143 | 6 |
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#define MAX 100000
#define INF 100000000
using namespace std;
typedef long long ll;
int a[MAX + 1], b[MAX + 1];
int main() {
int n, length = 1;
cin >... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#define MAX 100000
#define INF 100000000
using namespace std;
typedef long long ll;
int a[MAX + 1], b[MAX + 1];
int main() {
int n, length = 1;
cin >... | [["-", 0, 11, 31, 69, 341, 342, 0, 27, 28, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 27, 28, 22]] | 1 | 172 | 2 |
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef long long i64;
int CeilIndex(const vector<i64> &tail, int l, int r, i64 key) {
while (r - l > 1) {
int m = (l + r) / 2;
if (tail[m] >= key)
r = m;
else
l = m;
}
return r;
}
vector<i64> LIS(const vector<i64... | #include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef long long i64;
int CeilIndex(const vector<i64> &tail, int l, int r, i64 key) {
while (r - l > 1) {
int m = (l + r) / 2;
if (tail[m] >= key)
r = m;
else
l = m;
}
return r;
}
vector<i64> LIS(const vector<i64... | [["-", 31, 69, 341, 342, 0, 2, 3, 4, 0, 13], ["+", 31, 69, 341, 342, 0, 2, 3, 4, 0, 13], ["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 3, 4, 0, 16, 31, 2, 63, 118, 28, 22], ["+", 341, 342, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 341, 342, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 273 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int A[100100], L[100100], P[100100];
int n, ans;
void simple_DP() {
A[0] = -1;
P[0] = -1;
for (int i = 1; i <= n; ++i) { // DP about A[i]
int k = 0;
for (int j = 0; j < i; ++j) { // define recurrence relation
if (L[j] > L[k] && A[j] < A... | #include <algorithm>
#include <iostream>
using namespace std;
int A[100100], L[100100], P[100100];
int n, ans;
void simple_DP() {
//添字が一つずれていることに注意
A[0] = -1;
P[0] = -1;
for (int i = 1; i <= n; ++i) { // DP about A[i]
int k = 0;
for (int j = 0; j < i; ++j) { // define recurrence relation
if (L[j... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 305 | 4 |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
private interface Solver {
int solve(int W, List<Integer> values, List<Integer> weights);
}
private static cl... |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
private interface Solver {
int solve(int W, List<Integer> values, List<Integer> weights);
}
private static cla... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 500, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 500, 22]] | 3 | 445 | 2 |
import java.io.*;
import java.util.*;
import javax.xml.crypto.Data;
public class Main {
public static int n;
public static int MAX = 500000;
public static long a[] = new long[MAX + 1];
public static void main(String[] args) throws IOException {
//??\???
/*
BufferedReader br = new BufferedReader(... |
import java.io.*;
import java.util.*;
import javax.xml.crypto.Data;
public class Main {
public static int n;
public static int MAX = 500000;
public static long a[] = new long[MAX + 1];
public static void main(String[] args) throws IOException {
//??\???
/*
BufferedReader br = new BufferedReader(... | [["+", 0, 16, 31, 504, 516, 504, 71, 16, 17, 33], ["+", 0, 16, 31, 504, 516, 504, 71, 16, 12, 499]] | 3 | 735 | 2 |
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Main main = new Main();
main.run();
}
void run() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int W = sc.nextInt();
int[] value ... | import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Main main = new Main();
main.run();
}
void run() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int W = sc.nextInt();
int[] value ... | [["-", 3, 4, 0, 504, 516, 504, 71, 16, 17, 72], ["-", 3, 4, 0, 504, 516, 504, 71, 16, 12, 499], ["-", 0, 492, 3, 4, 0, 504, 71, 16, 17, 72], ["-", 0, 492, 3, 4, 0, 504, 71, 16, 12, 499]] | 3 | 332 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
private static Scanner sc;
private static int[][] neg8 = new int[][] {
{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}, {1, 1}};
private static int[][] neg4 = new int[][] {{1, 0}, ... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
private static Scanner sc;
private static int[][] neg8 = new int[][] {
{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}, {1, 1}};
private static int[][] neg4 = new int[][] {{1, 0}, ... | [["-", 0, 124, 49, 200, 51, 227, 497, 505, 0, 499], ["+", 0, 124, 49, 200, 51, 227, 497, 505, 0, 499]] | 3 | 921 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int n = sc.nextInt();
int w = sc.nextInt();
int[] v = new int[n + 1];
int[] we = new int[n + 1];
int[][] dp = new int[n + 1][w + 1];
for (int i ... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int n = sc.nextInt();
int w = sc.nextInt();
int[] v = new int[n + 1];
int[] we = new int[n + 1];
int[][] dp = new int[n + 1][w + 1];
for (int i ... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 267 | 4 |
// mainメソッドを含むKPクラスを書く
import java.io.*;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
// ファイルの読み込み
Scanner reader = new Scanner(System.in);
String firstData[] = {};
// まず、1行目を特別なものとして読み込む
firstData = reader.nextLine().split(" ", -1);
// それをもとに各種フィールドを設定する
... | // mainメソッドを含むKPクラスを書く
import java.io.*;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
// ファイルの読み込み
Scanner reader = new Scanner(System.in);
String firstData[] = {};
// まず、1行目を特別なものとして読み込む
firstData = reader.nextLine().split(" ", -1);
// それをもとに各種フィールドを設定する
... | [["-", 0, 11, 12, 492, 3, 4, 0, 504, 71, 499], ["+", 0, 11, 12, 492, 3, 4, 0, 504, 71, 499]] | 3 | 700 | 4 |
#include <stdio.h>
#include <stdlib.h>
int duzina[101][10001], prethodni[1001][1001];
int main() {
int N, M, W[101], P[101], optimalni[1000];
int i, j;
scanf("%d", &N);
scanf("%d", &M);
for (i = 0; i < N; ++i) {
scanf("%d", &W[i]);
scanf("%d", &P[i]);
}
for (i = 0; i <= M; ++i) {
duzina[0... | #include <stdio.h>
#include <stdlib.h>
int duzina[101][10001], prethodni[1001][1001];
int main() {
int N, M, W[101], P[101], optimalni[1000];
int i, j;
scanf("%d", &N);
scanf("%d", &M);
for (i = 0; i < N; ++i) {
scanf("%d", &P[i]);
scanf("%d", &W[i]);
}
for (i = 0; i <= M; ++i) {
duzina[0... | [["-", 0, 2, 3, 4, 0, 66, 28, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 28, 22]] | 0 | 352 | 4 |
#include <algorithm>
#include <cctype>
#include <deque>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define REP(i, b, e) for (int i = (int)b; i < (int)e; i++)
#define Rep(i, n) REP(i, 0, n)
typedef long long ll;
struct Item {
int value;
int weight;
};
int N, W;
Item items[102];
int C[... | #include <algorithm>
#include <cctype>
#include <deque>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define REP(i, b, e) for (int i = (int)b; i < (int)e; i++)
#define Rep(i, n) REP(i, 0, n)
typedef long long ll;
struct Item {
int value;
int weight;
};
int N, W;
Item items[102];
int C[... | [["-", 0, 14, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+... | 1 | 230 | 9 |
#include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int v[N], w[N];
for (int i = 0; i < N; i++)
cin >> v[i] >> w[i];
int DP[5][6];
for (int j = 0; j <= W; j++)
DP[0][j] = 0;
for (int i = 1; i <= N; i++)
for (int j = 0; j <= W; j++)
if (j < w[i - 1])
... | #include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int v[N], w[N];
for (int i = 0; i < N; i++)
cin >> v[i] >> w[i];
int DP[N + 1][W + 1];
for (int j = 0; j <= W; j++)
DP[0][j] = 0;
for (int i = 1; i <= N; i++)
for (int j = 0; j <= W; j++)
if (j < w[i - 1])... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 31, 22], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["+", ... | 1 | 255 | 8 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | [["-", 0, 14, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 377 | 7 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define ll long long
using namespace std;
signed main() {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
vector<int> now(W, 0), prev(W, 0);
for (int i = 0; i < N; i++) {
for (in... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define ll long long
using namespace std;
signed main() {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
vector<int> now(W + 1, 0), prev(W + 1, 0);
for (int i = 0; i < N; i++) {
... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 196 | 6 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int N, W;
int v[1000], w[1000];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> v[i] >> w[i];
}
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int N, W;
int v[1000], w[1000];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> v[i] >> w[i];
}
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; ... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 210 | 4 |
#include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int N, W;
int weight[110], value[110];
int dp[110][10010];
std::cin >> N >> W;
for (int i = 0; i < N; i++)
std::cin >> value[i] >> weight[i];
for (int i = 0; i <= W; i++)
dp[0][i] = 0;
for (int i = ... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int N, W;
int weight[110], value[110];
int dp[110][10010];
std::cin >> N >> W;
for (int i = 0; i < N; i++)
std::cin >> value[i] >> weight[i];
for (int i = 0; i <= W; i++)
dp[0][i] = 0;
for (int i = ... | [["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 73]] | 1 | 214 | 5 |
// 0-1 Knapsack Problem
#include <algorithm>
#include <iostream>
using namespace std;
struct Item {
public:
int v, w;
Item() {}
Item(int v, int w) : v(v), w(w) {}
};
int main() {
int N, W, v, w;
cin >> N >> W;
Item items[N];
for (int i = 0; i < N; i++) {
cin >> v >> w;
items[i] = Item(v, w);
... | // 0-1 Knapsack Problem
#include <algorithm>
#include <iostream>
using namespace std;
struct Item {
public:
int v, w;
Item() {}
Item(int v, int w) : v(v), w(w) {}
};
int main() {
int N, W, v, w;
cin >> N >> W;
Item items[N];
for (int i = 0; i < N; i++) {
cin >> v >> w;
items[i] = Item(v, w);
... | [["-", 0, 11, 12, 16, 31, 23, 0, 16, 17, 85], ["+", 0, 11, 12, 41, 15, 23, 0, 16, 17, 18], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 0, 101], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 64, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 0, 102], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 69,... | 1 | 308 | 8 |
#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int larger(int x, int y) {
if (x > y) {
return x;
} else {
return y;
}
}
int main() {
int N, W;
cin >> N >> W;
int values[N];
int weight[N];
for (int i = 0; i < N; i++) {
cin >> values[i] >> w... | #include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int larger(int x, int y) {
if (x > y) {
return x;
} else {
return y;
}
}
int main() {
int N, W;
cin >> N >> W;
int values[N];
int weight[N];
for (int i = 0; i < N; i++) {
cin >> values[i] >> w... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 273 | 2 |
#include <algorithm>
#include <iostream>
int main(void) {
// input
int n, W;
std::cin >> n >> W;
int weight[n], value[n];
for (int i = 0; i < n; i++)
std::cin >> weight[i] >> value[i];
// DP table
int dp[n + 1][W + 1];
for (int w = 0; w <= W; w++) {
dp[0][w] = 0;
}
for (int i = 0; i < n; ... | #include <algorithm>
#include <iostream>
int main(void) {
// input
int n, W;
std::cin >> n >> W;
int weight[n], value[n];
for (int i = 0; i < n; i++)
std::cin >> value[i] >> weight[i];
// DP table
int dp[n + 1][W + 1];
for (int w = 0; w <= W; w++) {
dp[0][w] = 0;
}
for (int i = 0; i < n; ... | [["-", 8, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 8, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["-", 0, 7, 8, 1, 0, 16, 12, 69, 28, 22], ["+", 0, 7, 8, 1, 0, 16, 12, 69, 28, 22]] | 1 | 228 | 4 |
#include <iostream>
using namespace std;
#define MAX_N 100
#define MAX_W 10000
void solve();
int N, W;
int v[MAX_N + 1], w[MAX_N + 1];
int dp[MAX_N + 1][MAX_W + 1];
int main() {
cin >> N >> W;
//品物0
v[0] = 0;
w[0] = 0;
//品物1~
for (int i = 1; i <= N; i++) {
cin >> v[i] >> w[i];
}
solve();
... | #include <iostream>
using namespace std;
#define MAX_N 100
#define MAX_W 10000
void solve();
int N, W;
int v[MAX_N + 1], w[MAX_N + 1];
int dp[MAX_N + 1][MAX_W + 1];
int main() {
cin >> N >> W;
//品物0
v[0] = 0;
w[0] = 0;
//品物1~
for (int i = 1; i <= N; i++) {
cin >> v[i] >> w[i];
}
solve();
... | [["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 73]] | 1 | 235 | 5 |
#include <algorithm> //max(a,b) min(a,b) swap(a,b) sort(f,t) reverse(f,t) count(f,t,x) fill(f,t,x) sort(f,t greater<int>())
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue> //front(),priority_queue<int,vector<int>,greater<int>>
#include <set> //.insert()
#include <stack> ... | #include <algorithm> //max(a,b) min(a,b) swap(a,b) sort(f,t) reverse(f,t) count(f,t,x) fill(f,t,x) sort(f,t greater<int>())
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <queue> //front(),priority_queue<int,vector<int>,greater<int>>
#include <set> //.insert()
#include <stack> ... | [["+", 0, 30, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 332 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 114514810
#define ELEM(array) (sizeof(array) / sizeof *(array))
#define MAX_N 100
#define SAFE_FREE(ptr) \
if (ptr != ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 114514810
#define ELEM(array) (sizeof(array) / sizeof *(array))
#define MAX_N 100
#define SAFE_FREE(ptr) \
if (ptr != ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 31, 69, 28, 69, 28, 2, 3, 4, 0, 22], ["+", 31, 69, 28, 69, 28, 2, 3, 4, 0, 13]] | 1 | 272 | 4 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define FOR(I, F, N) for (int I = F; I < (int... | [["-", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 316 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
vector<int> dp(100000);
int main() {
int N, W;
int v[1000];
int w[1000];
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
for (int j = 0; j < N; j++) {
for (int i ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
vector<int> dp(100000);
int main() {
int N, W;
int v[2000];
int w[2000];
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
for (int j = 0; j < N; j++) {
for (int i ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22]] | 1 | 201 | 6 |
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX_N = 100;
const int MAX_W = 10000;
int w[MAX_N];
int v[MAX_N];
int dp[MAX_N][MAX_W + 1];
int n, W;
int rec(int i, int j) {
if (dp[i][j] >= 0) {
return dp[i][j];
}
int res;
if (i == n) {
res = 0;
} else if (... | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAX_N = 100;
const int MAX_W = 10000;
int w[MAX_N];
int v[MAX_N];
int dp[MAX_N + 1][MAX_W + 1];
int n, W;
int rec(int i, int j) {
if (dp[i][j] >= 0) {
return dp[i][j];
}
int res;
if (i == n) {
res = 0;
} else ... | [["+", 0, 43, 49, 80, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 251 | 4 |
#include <algorithm>
#include <stdio.h>
using namespace std;
const int MAX_N = 100;
const int MAX_W = 10000;
int N, W;
int v[MAX_N];
int w[MAX_N];
int dp[MAX_N + 1][MAX_W + 1];
void solve() {
for (int i = 0; i < N; i++) {
for (int j = 0; j < W; j++) {
if (j < w[i]) {
dp[i + 1][j] = dp[i][j];
}... | #include <algorithm>
#include <stdio.h>
using namespace std;
const int MAX_N = 100;
const int MAX_W = 10000;
int n, W;
int v[MAX_N];
int w[MAX_N];
int dp[MAX_N + 1][MAX_W + 1];
void solve() {
for (int i = 0; i < n; i++) {
for (int j = 0; j <= W; j++) {
if (j < w[i]) {
dp[i + 1][j] = dp[i][j];
... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4,... | 1 | 246 | 12 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int item_v[100], item_w[100];
rep(i, n) { cin >> item_v[i] >> item_w[i]; }
int dp[101][10100] = {};
for (int i = 1; i < n; i++) {
rep(j, 100001) {
dp[i][j] = d... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int item_v[100], item_w[100];
rep(i, n) { cin >> item_v[i] >> item_w[i]; }
int dp[101][10100] = {};
for (int i = 1; i <= n; i++) {
rep(j, 10001) {
dp[i][j] = d... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 212 | 8 |
#include <algorithm>
#include <iostream>
#include <vector>
class solver {
public:
solver(int n, int z, std::vector<int> _v, std::vector<int> _w);
void solve();
private:
const int n;
const int z;
const std::vector<int> w;
const std::vector<int> v;
std::vector<std::vector<int>> dp;
};
solver::solver(int ... | #include <algorithm>
#include <iostream>
#include <vector>
class solver {
public:
solver(int n, int z, std::vector<int> _v, std::vector<int> _w);
void solve();
private:
const int n;
const int z;
const std::vector<int> w;
const std::vector<int> v;
std::vector<std::vector<int>> dp;
};
solver::solver(int ... | [["-", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["-", 0, 1, 0, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 1, 0, 16, 12, 2, 63, 118, 28, 22]] | 1 | 432 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, M, s[505], v[505], dp[505];
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> s[i] >> v[i];
}
memset(dp, 0, sizeof(dp));
for (int i = 0; i < N; i++) {
for (int j = M; j >= s[i]; j--) {
dp[j] = max(dp[j], dp[j - s[i]] + v[i]... | #include <bits/stdc++.h>
using namespace std;
int N, M, s[505], v[505], dp[10005];
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> v[i] >> s[i];
}
memset(dp, 0, sizeof(dp));
for (int i = 0; i < N; i++) {
for (int j = M; j >= s[i]; j--) {
dp[j] = max(dp[j], dp[j - s[i]] + v[... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["-", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 69, 28, 22]] | 1 | 181 | 6 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int Knapsack(int N, int W, vector<int> v, vector<int> w) {
vector<vector<int>> V(N + 1, vector<int>(W + 1));
for (int i = 0; i <= N; ++i)
for (int j = 0; j <= W; ++j) {
if (i == 0 || j == 0)
V[i][j] = 0;
else if ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int Knapsack(int N, int W, vector<int> v, vector<int> w) {
vector<vector<int>> V(N + 1, vector<int>(W + 1));
for (int i = 0; i <= N; ++i)
for (int j = 0; j <= W; ++j) {
if (i == 0 || j == 0)
V[i][j] = 0;
else if ... | [["-", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22]] | 1 | 272 | 4 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ll long long
#define ull unsigned long long
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define ll long long
#define ull unsigned long long
... | [["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 292 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define ll long long
#define LL long long
#define ULL unsigned long long
#define ull un... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define ll long long
#define LL long long
#define ULL unsigned long long
#define ull un... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 281 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dp[10001];
int main(void) {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
for (int i = 0; i < N; i++)
cin >> v[i] >> w[i];
fill(dp, dp + 10001, 0);
for (int i = 0; i < N; i++)
for (int j = N; j >= 0; j--)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int dp[10001];
int main(void) {
int N, W;
cin >> N >> W;
vector<int> v(N), w(N);
for (int i = 0; i < N; i++)
cin >> v[i] >> w[i];
fill(dp, dp + 10001, 0);
for (int i = 0; i < N; i++)
for (int j = W; j >= 0; j--)
... | [["-", 0, 7, 8, 7, 10, 43, 49, 50, 51, 22], ["+", 0, 7, 8, 7, 10, 43, 49, 50, 51, 22]] | 1 | 197 | 2 |
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] sequence = new int[n];
for (int i = 0; i < sequence.length; i++) {
sequence[i] = sc.nextInt();
}
System.out.print... | import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] sequence = new int[n];
for (int i = 0; i < sequence.length; i++) {
sequence[i] = sc.nextInt();
}
System.out.print... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18]] | 3 | 246 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int[] num = new int[a];
for (int i = 0; i < a; ++i) {
num[i] = sc.nextInt();
}
int[] dp = new int[a];
dp[0] = n... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int[] num = new int[a];
for (int i = 0; i < a; ++i) {
num[i] = sc.nextInt();
}
int[] dp = new int[a];
dp[0] = n... | [["+", 0, 503, 49, 200, 51, 492, 3, 4, 0, 499], ["+", 0, 503, 49, 200, 51, 492, 3, 4, 0, 21], ["+", 49, 200, 51, 492, 3, 4, 0, 16, 31, 22], ["+", 49, 200, 51, 492, 3, 4, 0, 16, 17, 33], ["+", 49, 200, 51, 492, 3, 4, 0, 16, 12, 499]] | 3 | 270 | 6 |
import java.util.Arrays;
import java.util.Scanner;
// 155
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), dp[] = new int[n], length = 0;
Arrays.fill(dp, Integer.MAX_VALUE);
for (int i = 0; i < n; i++) {
int tmp = sc.nextInt();
... | import java.util.Arrays;
import java.util.Scanner;
// 155
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), dp[] = new int[n], length = 0;
Arrays.fill(dp, Integer.MAX_VALUE);
for (int i = 0; i < n; i++) {
int tmp = sc.nextInt();
... | [["+", 0, 57, 64, 196, 0, 1, 0, 27, 0, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 27, 0, 29], ["+", 75, 196, 0, 57, 64, 196, 0, 1, 0, 35], ["-", 0, 1, 0, 11, 31, 504, 71, 16, 17, 72], ["-", 0, 1, 0, 11, 31, 504, 71, 16, 12, 499]] | 3 | 189 | 5 |
#include <stdio.h>
#define MAX 100000
#define INF 100000000
int N;
int a[MAX];
int dp[MAX];
int max(int a, int b) { return a > b ? a : b; }
int l_bound(int x) {
int l, h, m;
l = 0;
int i;
h = N - 1;
while (h - l > 1) {
m = (l + h) / 2;
if (dp[m] > x)
h = m;
else
l = m;
}
if (dp[l] ... | #include <stdio.h>
#define MAX 100000
#define INF 1000000001
int N;
int a[MAX];
int dp[MAX];
int max(int a, int b) { return a > b ? a : b; }
int l_bound(int x) {
int l, h, m;
l = 0;
int i;
h = N - 1;
while (h - l > 1) {
m = (l + h) / 2;
if (dp[m] >= x)
h = m;
else
l = m;
}
if (dp[l... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 269 | 6 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#define NUM 100000
#define INF 1000000000
int main(void) {
int n;
int a[NUM];
int length = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int A[NUM];
for (int i = 0; i < n; i++) {
A[i] = ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#define NUM 100000
#define INF 1000000000
int main(void) {
int n;
int a[NUM];
int length = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int A[NUM];
for (int i = 0; i < n; i++) {
A[i] = ... | [["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 171 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define INF 1e9
int main(void) {
int n, input;
cin >> n;
vector<int> dp(n + 1, INF);
dp[0] = -INF;
for (int i = 0; i < n; i++) {
cin >> input;
vector<int>::iterator it = upper_bound(dp.begin(), dp.end(), input);
if... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define INF 1e9
int main(void) {
int n, input;
cin >> n;
vector<int> dp(n + 2, INF);
dp[0] = -INF;
for (int i = 0; i < n; i++) {
cin >> input;
vector<int>::iterator it = upper_bound(dp.begin(), dp.end(), input);
if... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 141 | 2 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_D
// Pattern - Combinatorial - Longest Increasing Subsequence
// status: [solve][review]
#define SUBMIT
#include <algorithm>
#include <iostream>
#include <numeric>
#include <sstream>
#include <vector>
using namespace std;
using ui64 = unsigned long lo... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_D
// Pattern - Combinatorial - Longest Increasing Subsequence
// status: [solve][review]
#define SUBMIT
#include <algorithm>
#include <iostream>
#include <numeric>
#include <sstream>
#include <vector>
using namespace std;
using ui64 = unsigned long lo... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 218 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (1e9) + 100;
int main() {
int n;
cin >> n;
vector<int> DP(n + 1, INF);
DP[0] = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
int id = lower_bound(DP.begin(), DP.end(), a) - DP.begin();
DP[id] = ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (1e9) + 100;
int main() {
int n;
cin >> n;
vector<int> DP(n + 1, INF);
DP[0] = -INF;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
int id = lower_bound(DP.begin(), DP.end(), a) - DP.begin();
DP[id]... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 91, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 91, 28, 22]] | 1 | 141 | 3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main() {
int n;
int a[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int dp[100000];
fill(dp, dp + n + 1, INF);
dp[0] = -1;
for (int i = 0; i < n; i++) {
int *ptr = lower_bound(dp, dp... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main() {
int n;
int a[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int dp[100000];
fill(dp, dp + n + 1, INF);
dp[0] = -1;
for (int i = 0; i < n; i++) {
int *ptr = lower_bound(dp, dp... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 48], ["-", 0, 2, 3, 4, 0, 66, 28, 23, 0, 24], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 2, 3, 4, 0, 66, 28, 23, 0, 25]] | 1 | 177 | 5 |
#include <algorithm>
#include <bits/stdc++.h>
#include <list>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
int n, a, chk = 0, ans = 0;
int INF = (int)1e9;
scanf("%d", &n);
int dp[n + 1];
fill(dp, dp + n, INF);
vector<int> l(n);
for (auto &e : l) {
scanf("%d", ... | #include <algorithm>
#include <bits/stdc++.h>
#include <list>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
int n, a, chk = 0, ans = 0;
int INF = (int)1e9;
scanf("%d", &n);
int dp[n];
fill(dp, dp + n, INF);
vector<int> l(n);
for (auto &e : l) {
scanf("%d", &e);... | [["-", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["-", 8, 9, 0, 43, 49, 80, 81, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 163 | 4 |
#include <cstdio>
#include <iostream>
#include <set>
std::multiset<int> s;
int N, curr;
int main() {
std::cin >> N;
for (int i = 0; i < N; ++i) {
scanf("%d", &curr);
s.insert(curr);
auto it = s.upper_bound(curr);
if (it != s.end())
s.erase(it);
}
std::cout << s.size() << "\n";
} | #include <cstdio>
#include <iostream>
#include <set>
std::multiset<int> s;
int N, curr;
int main() {
std::cin >> N;
for (int i = 0; i < N; ++i) {
scanf("%d", &curr);
s.insert(curr);
auto it = s.lower_bound(curr);
if (++it != s.end())
s.erase(it);
}
std::cout << s.size() << "\n";
} | [["-", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["+", 0, 57, 15, 339, 51, 16, 31, 27, 17, 29]] | 1 | 105 | 3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int N;
int dp[100010];
int main() {
cin >> N;
fill_n(dp, N + 3, INF);
dp[0] = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
*lower_bound(dp, dp + N + 3, A) = A;
}
cout << lower_bound(dp, dp + N + 3, INF) - dp - 1 <... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int N;
int dp[100010];
int main() {
cin >> N;
fill_n(dp, N + 3, INF);
dp[0] = -1;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
*lower_bound(dp, dp + N + 3, A) = A;
}
cout << lower_bound(dp, dp + N + 3, INF) - dp - 1 ... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 109 | 9 |
#include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int ans[100001] = {0};
int main() {
int n = 0;
cin >> n;
for (int i = 1; i < n + 1; i++) {
ans[i] = INT_MAX;
}
for (int i = 0; i < n; i++) {
int input = 0;
cin >> input;
ans[lower_bound(ans, ans + n, input) - a... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int ans[100001] = {-1};
int main() {
int n = 0;
cin >> n;
for (int i = 1; i < n + 1; i++) {
ans[i] = INT_MAX;
}
for (int i = 0; i < n; i++) {
int input = 0;
cin >> input;
ans[lower_bound(ans, ans + n, input) - ... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13]] | 1 | 127 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int N = 100001;
int n;
int A[N], L[N], P[N];
// slow implementation
void lis() {
L[0] = 0;
A[0] = 0;
P[0] = -1;
int i, j, k;
for (i = 1; i <= n; i++) {
k = 0;
for (j = 0; j < i; j++) {
if (A[j] < A[i] && L[j] > L[k])
... | #include <algorithm>
#include <iostream>
using namespace std;
static const int N = 100001;
int n;
int A[N], L[N], P[N];
// slow implementation
void lis() {
L[0] = 0;
A[0] = 0;
P[0] = -1;
int i, j, k;
for (i = 1; i <= n; i++) {
k = 0;
for (j = 0; j < i; j++) {
if (A[j] < A[i] && L[j] > L[k])
... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, ... | 1 | 331 | 8 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define inf 1999999999
#define pa pair<int, int>
using namespace std;
int nibun(int a[], int d, int l, int h) {
// cout<<"l="<<l<<" h="<<h<<" ";
... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define inf 1999999999
#define pa pair<int, int>
using namespace std;
int nibun(int a[], int d, int l, int h) {
// cout<<"l="<<l<<" h="<<h<<" ";
... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 305 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 1000000
int dp[MAX_N], N, a[MAX_N];
int main() {
cin >> N;
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (cnt == 0) {
dp[cnt] = a[i];
cnt++;
} else {
if (dp[cnt - 1] <= a[i]) {
dp[cnt] ... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 1000000
int dp[MAX_N], N, a[MAX_N];
int main() {
cin >> N;
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (cnt == 0) {
dp[cnt] = a[i];
cnt++;
} else {
if (dp[cnt - 1] < a[i]) {
dp[cnt] =... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 156 | 2 |
#include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 291 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1, -1);
int l = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (v[l] < a) {
v[l + 1] = a;
l++;
} else {
*lower_bound(v.begin(), v.end(), a) = a;
}
}
cout << l << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1, -1);
int l = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (v[l] < a) {
v[l + 1] = a;
l++;
} else {
*lower_bound(v.begin(), v.begin() + l, a) = a;
}
}
cout << l <... | [["-", 28, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 3, 4, 0, 16, 31, 2, 63, 118, 119, 120], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 12, 22]] | 1 | 115 | 4 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 9999999999
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1,... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 2000000000
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1,... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 219 | 2 |
#include <algorithm>
#include <cstdio>
#include <limits>
constexpr int INF_I = std::numeric_limits<int>::max();
constexpr int MAX_N = 100000;
int main() {
int N;
int L[MAX_N], length = 1;
std::fill(L, L + MAX_N, INF_I);
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
int A;
scanf("%d", &A);
*std:... | #include <algorithm>
#include <cstdio>
#include <limits>
constexpr int INF_I = std::numeric_limits<int>::max();
constexpr int MAX_N = 100000;
int main() {
int N;
int L[MAX_N], length = 1;
std::fill(L, L + MAX_N, INF_I);
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
int A;
scanf("%d", &A);
*std:... | [["-", 0, 11, 31, 66, 28, 2, 63, 343, 141, 22], ["+", 0, 11, 31, 66, 28, 2, 63, 343, 141, 22], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 140 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int A[n];
for (int i = 0; i < n; ++i) {
int v;
scanf("%d", &v);
A[i] = v;
}
int length = 1;
int L[n];
L[0] = A[0];
for (int i = 1; i < n; ++i) {
if (A[i] > L[length - 1]) {
L[length... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int A[n];
for (int i = 0; i < n; ++i) {
int v;
scanf("%d", &v);
A[i] = v;
}
int length = 1;
int L[n];
L[0] = A[0];
for (int i = 1; i < n; ++i) {
if (A[i] > L[length - 1]) {
L[length... | [["-", 0, 57, 75, 76, 0, 9, 0, 43, 39, 40], ["-", 75, 76, 0, 9, 0, 43, 49, 50, 49, 22], ["-", 75, 76, 0, 9, 0, 43, 49, 50, 0, 32], ["-", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 75, 76, 0, 9, 0, 43, 0, 35], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 216 | 26 |
#include <algorithm>
#include <iostream>
using namespace std;
int N;
const int MAX_N = 10 ^ 9, INF = 1000000000;
int a[MAX_N];
int dp[MAX_N]; // dp????????????
void solve() {
fill(dp, dp + N, INF);
for (int i = 0; i < N; i++) {
*lower_bound(dp, dp + N, a[i]) = a[i];
}
cout << lower_bound(dp, dp + N, INF) ... | #include <algorithm>
#include <iostream>
using namespace std;
int N;
const int MAX_N = 100000, INF = 1000000000;
int a[MAX_N];
int dp[MAX_N]; // dp????????????
void solve() {
fill(dp, dp + N, INF);
for (int i = 0; i < N; i++) {
*lower_bound(dp, dp + N, a[i]) = a[i];
}
cout << lower_bound(dp, dp + N, INF) ... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 31, 13], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 17, 140], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 146 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
int N, A[100005], L[100005];
int main() {
L[0] = 0;
cin >> N;
int i, j;
for (i = 1; i <= N; i++) {
cin >> A[i];
}
int len = 1;
L[0] = A[1];
for (i = 1; i <= N; i++) {
if (L[len - 1] < A[i])
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
int N, A[100005], L[100005];
int main() {
L[0] = 0;
cin >> N;
int i, j;
for (i = 1; i <= N; i++) {
cin >> A[i];
}
int len = 1;
L[0] = A[1];
for (i = 1; i <= N; i++) {
if (L[len - 1] < A[i])
... | [["-", 0, 11, 31, 66, 28, 2, 3, 4, 0, 22], ["+", 0, 11, 31, 66, 28, 2, 3, 4, 0, 22], ["-", 31, 66, 28, 2, 3, 4, 0, 16, 31, 22], ["+", 31, 66, 28, 2, 3, 4, 0, 16, 31, 22]] | 1 | 154 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N), v(N);
for (ll i = 0; i < N; i++)
cin >> v[i] >> w[i];
vector<vector<ll>> dp(N + 1, vector<ll>(N * 100 + 1, INT_MAX));
dp[0][0] = 0;
for (ll i = 0; i < N; i++) {
for (ll j = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, W;
cin >> N >> W;
vector<ll> w(N), v(N);
for (ll i = 0; i < N; i++)
cin >> v[i] >> w[i];
vector<vector<ll>> dp(N + 1, vector<ll>(N * 100 + 1, INT_MAX));
dp[0][0] = 0;
for (ll i = 0; i < N; i++) {
for (ll j = 0... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 273 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, W;
int main() {
cin >> N >> W;
vector<int> v(N), w(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
sum += v[i];
}
vector<vector<int>> dp(N + 1, vector<int>(sum + 1, 99999999));
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int N, W;
int main() {
cin >> N >> W;
vector<int> v(N), w(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
sum += v[i];
}
vector<vector<int>> dp(N + 1, vector<int>(sum + 1, 1999999999));
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
... | [["-", 49, 50, 51, 4, 0, 2, 3, 4, 0, 13], ["+", 49, 50, 51, 4, 0, 2, 3, 4, 0, 13], ["-", 0, 57, 64, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 57, 64, 1, 0, 11, 12, 2, 63, 22]] | 1 | 254 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int main() {
int n, w, a, b, dp[MAX], i, j;
fill(dp, dp + MAX, 1e9 + 1);
dp[0] = 0;
cin >> n >> w;
for (i = 0; i < n; i++) {
cin >> a >> b;
for (j = MAX - 1; j >= a; j--)
if (dp[j - a] != 1e9 + 1)
dp[j] = min(dp[j], dp[j - ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int main() {
int n, w, a, b, dp[MAX], i, j;
fill(dp, dp + MAX, 1e9 + 1);
dp[0] = 0;
cin >> n >> w;
for (i = 0; i < n; i++) {
cin >> a >> b;
for (j = MAX - 1; j >= a; j--)
if (dp[j - a] != 1e9 + 1)
dp[j] = min(dp[j], dp[j - ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 79], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 164 | 2 |
N, W = map(int, input().split())
dp = [0] + [W+1] * (N*100)
for i in range(N):
x, y = map(int, input().split())
for j in range(i*100, -1, -1):
if dp[j+y] > dp[j] + x:
dp[j+y] = dp[j] + x
for v, w in zip(range(N*100, -1, -1), dp[::-1]):
if w < W+1:
print(v)
break
| N, W = map(int, input().split())
dp = [0] + [W+1] * (N*100)
for i in range(N):
v, w = map(int, input().split())
for j in range(i*100, -1, -1):
if dp[j+v] > dp[j] + w:
dp[j+v] = dp[j] + w
for v, w in zip(range(N*100, -1, -1), dp[::-1]):
if w < W+1:
print(v)
break
| [["-", 8, 196, 0, 1, 0, 662, 31, 684, 0, 22], ["+", 8, 196, 0, 1, 0, 662, 31, 684, 0, 22], ["-", 0, 57, 15, 666, 0, 206, 206, 657, 12, 22], ["+", 0, 57, 15, 666, 0, 206, 206, 657, 12, 22], ["-", 8, 196, 0, 57, 15, 666, 0, 657, 12, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 12, 22], ["-", 0, 1, 0, 662, 31, 206, 206, 657... | 5 | 142 | 12 |
from math import isfinite
from itertools import dropwhile
n, knapsack = map(int, input().split())
dpn = n * 100 # MAX VALUE
dp = [float('inf')] * (dpn + 1)
dp[0] = 0
for i in range(n):
value, weight = map(int, input().split())
for j in range(dpn - value, 0, -1):
if not isfinite(dp[j]):
con... | from math import isfinite
from itertools import dropwhile
n, knapsack = map(int, input().split())
dpn = n * 100 # MAX VALUE
dp = [float('inf')] * (dpn + 1)
dp[0] = 0
for i in range(n):
value, weight = map(int, input().split())
for j in range(dpn - value, 0, -1):
if not isfinite(dp[j]):
con... | [["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 22], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 667, 19], ["+", 0, 7, 8, 196, 0, 57, 15, 679, 17, 355]] | 5 | 177 | 24 |
#! /usr/bin/python
# -*- coding:utf-8 -*-
N, W = map(int, input().split())
vs = []
ws = []
for i in range(N):
v, w = map(int, input().split())
vs.append(v)
ws.append(w)
dp = dict()
dp[0] = 0
max_v = -1
for i in range(N):
tmp = dp.copy()
for k, v in tmp.items():
dp.setdefault(k+vs[i], float... | #! /usr/bin/python
# -*- coding:utf-8 -*-
N, W = map(int, input().split())
vs = []
ws = []
for i in range(N):
v, w = map(int, input().split())
vs.append(v)
ws.append(w)
dp = dict()
dp[0] = 0
max_v = 0
for i in range(N):
tmp = dp.copy()
for k, v in tmp.items():
dp.setdefault(k+vs[i], float(... | [["-", 0, 656, 0, 1, 0, 662, 12, 664, 17, 33], ["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612]] | 5 | 181 | 3 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX 100005
static const int INF = 1 << 19;
int main() {
int N, W;
int dp[MAX];
int ans = 0;
fill(dp, dp + MAX, INF);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX 100005
static const int INF = 1 << 19;
int main() {
int N, W;
int dp[MAX];
int ans = 0;
fill(dp, dp + MAX, -INF);
... | [["+", 0, 1, 0, 2, 3, 4, 0, 91, 17, 33]] | 1 | 248 | 27 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#define EPS 1e-10
using namespace std;
double add(double a, double b) {
if (fabs(a + b) < EPS * (fabs(a) + fabs(b)))
return 0.0;
return a + b;
}
class P {
public:
double x, y;
P(double xx = 0.0, double yy = 0.0) {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#define EPS 1e-10
using namespace std;
double add(double a, double b) {
if (fabs(a + b) < EPS * (fabs(a) + fabs(b)))
return 0.0;
return a + b;
}
class P {
public:
double x, y;
P(double xx = 0.0, double yy = 0.0) {... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["+", 51, 16, 31, 16, 12, 16, 12, 118, 28, 22], ["+", 51, 16, 31, 16, 12, 16, 12, 118, 17, 131], ["+", 51, 16, 31, 16, 12, 16, 12, 118, 119, 120]] | 1 | 604 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
typedef vector<P> vec;
double eps = 1e-8;
double PI = acos(-1);
bool eq(double a, double b) { return (b - a < eps && a - b < eps); }
double dot(P a, P b) { return real(b * conj(a)); }
double cross(P a, P b) { return imag(b * conj(a)); }
P projec... | #include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
typedef vector<P> vec;
double eps = 1e-8;
double PI = acos(-1);
bool eq(double a, double b) { return (b - a < eps && a - b < eps); }
double dot(P a, P b) { return real(b * conj(a)); }
double cross(P a, P b) { return imag(b * conj(a)); }
P projec... | [["-", 0, 41, 75, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 41, 75, 69, 341, 342, 0, 16, 17, 33]] | 1 | 877 | 2 |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define f first
#define s second
#define mp make_pair
#define eps (1e-11)
#define equals(a, b) (fabs((a) - (b)) < eps)
using namespace std;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define f first
#define s second
#define mp make_pair
#define eps (1e-11)
#define equals(a, b) (fabs((a) - (b)) < eps)
using namespace std;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator... | [["-", 64, 1, 0, 2, 3, 4, 0, 118, 17, 131], ["-", 64, 1, 0, 2, 3, 4, 0, 118, 119, 120]] | 1 | 1,665 | 4 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static con... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static con... | [["-", 15, 339, 51, 16, 12, 16, 12, 91, 17, 33], ["-", 51, 16, 31, 16, 31, 16, 12, 91, 17, 33]] | 1 | 1,866 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
// using ll=long long;
const double EPS = 1e-10;
inline bool equals(double a, double b) { return fabs(a - b) < EPS; }
const double PI = 3.141592653589793238;
class Point {
public:
double x, y;
Point(double x, double y) : x(x), y(y) {}
P... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
// using ll=long long;
const double EPS = 1e-10;
inline bool equals(double a, double b) { return fabs(a - b) < EPS; }
const double PI = 3.141592653589793238;
class Point {
public:
double x, y;
Point(double x, double y) : x(x), y(y) {}
P... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 1,545 | 4 |
#include <cassert>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const pair<int, int> INF{329083291, 23409802};
pair<int, int> operator-(const pair<int, int> &a, const pair<int, int> &b) {
return {a.first - b.first, a.second - b.second};
}
long long operator*(const pair<int, int> &... | #include <cassert>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const pair<int, int> INF{12345, 54321};
pair<int, int> operator-(const pair<int, int> &a, const pair<int, int> &b) {
return {a.first - b.first, a.second - b.second};
}
long long operator*(const pair<int, int> &a, cons... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18]] | 1 | 648 | 6 |
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
const double eps = 1e-17;
bool IsEq(double d1, double d2) {
if (d1 - d2 > -eps && d1 - d2 < eps) {
return true;
} else {
return false;
}
}
class Point2D {
public:
double x, y;
Point2D() : x(0), y(0) {}
... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
const double eps = 1e-17;
bool IsEq(double d1, double d2) {
if (d1 - d2 > -eps && d1 - d2 < eps) {
return true;
} else {
return false;
}
}
class Point2D {
public:
double x, y;
Point2D() : x(0), y(0) {}
... | [["-", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 2, 63, 22]] | 1 | 1,665 | 2 |
from sys import stdin
readline = stdin.readline
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def eq(a, b):
return abs(a - b) < 1e-10
def on_line(p, s, e):
d = dot(p - s, e - s)
c = cross(p - s, e - s)
if c == 0 and 0 <=... | from sys import stdin
readline = stdin.readline
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def eq(a, b):
return abs(a - b) < 1e-10
def on_line(p, s, e):
d = dot(p - s, e - s)
c = cross(p - s, e - s)
if c == 0 and 0 <=... | [["-", 0, 1, 0, 662, 12, 657, 31, 206, 206, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 206, 206, 22], ["-", 0, 1, 0, 677, 12, 41, 0, 666, 667, 18], ["+", 0, 1, 0, 677, 12, 41, 0, 666, 667, 19], ["-", 0, 1, 0, 677, 12, 41, 0, 666, 667, 19], ["+", 0, 1, 0, 677, 12, 41, 0, 666, 667, 18], ["-", 0, 677, 12, 41, 0, 41, 0, 666, 66... | 5 | 428 | 10 |
# -*- coding: utf-8 -*-
import collections
import math
class Vector2(collections.namedtuple("Vector2", ["x", "y"])):
def __add__(self, other):
return Vector2(self.x + other.x, self.y + other.y)
def __sub__(self, other):
return Vector2(self.x - other.x, self.y - other.y)
def __mul__(se... | # -*- coding: utf-8 -*-
import collections
import math
class Vector2(collections.namedtuple("Vector2", ["x", "y"])):
def __add__(self, other):
return Vector2(self.x + other.x, self.y + other.y)
def __sub__(self, other):
return Vector2(self.x - other.x, self.y - other.y)
def __mul__(se... | [["-", 8, 196, 0, 57, 15, 679, 12, 666, 667, 18], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 667, 19]] | 5 | 1,054 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.