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 <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 100000
enum Type {
A,
B,
Both,
};
struct ADD {
bool operator<(const struct ADD &arg) const { return value < arg.val... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 100000
enum Type {
A,
B,
Both,
};
struct ADD {
bool operator<(const struct ADD &arg) const { return value < arg.val... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 796 | 2 |
#include <stdio.h>
#define INF 1000000000
int a[100005], b[100005];
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, x, y;
scanf("%d", &n);
int lx = INF, ly = INF, rx = -INF, ry = -INF;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
... | #include <stdio.h>
#define INF 100000000
int a[100005], b[100005];
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, x, y;
scanf("%d", &n);
int lx = INF, ly = INF, rx = -INF, ry = -INF;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 319 | 10 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int n;
struct expo {
int x, y;
};
bool comp(const expo &a, const expo &b) { return a.x > b.y; }
int abs(int a) {
if (a < 0)
return -a;
return a;
}
expo in[100001];
expo add[100001];
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int n;
struct expo {
int x, y;
};
bool comp(const expo &a, const expo &b) { return a.x > b.x; }
int abs(int a) {
if (a < 0)
return -a;
return a;
}
expo in[100001];
expo add[100001];
... | [["-", 8, 9, 0, 37, 0, 16, 12, 118, 119, 120], ["+", 8, 9, 0, 37, 0, 16, 12, 118, 119, 120]] | 1 | 730 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <utility>
using namespace std;
typedef pair<int, int> P;
P A[100000], B[100000];
// A:(x+y) B:(x-y)
int N, a[100000], b[100000];
// a:(x+y)で分けたとき B:(x-y)で分けたとき
bool ok(int M) {
int both = 0, differ = 0;
memset(a, 0, sizeof(a));
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <utility>
using namespace std;
typedef pair<int, int> P;
P A[100000], B[100000];
int N, a[100000], b[100000];
bool ok(int M) {
int both = 0, differ = 0;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
for (int i = 0; i < N; ... | [["-", 0, 16, 12, 118, 28, 69, 341, 342, 0, 13], ["+", 0, 16, 12, 118, 28, 69, 341, 342, 0, 22]] | 1 | 589 | 2 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | [["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46]] | 1 | 471 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int m;
int n;
int map[10][10] = {0};
int cnt = 0;
int churchx;
int churchy;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int saiki(int xinput, int yinput, int nokori) {
for... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int m;
int n;
int map[10][10] = {0};
int cnt = 0;
int churchx;
int churchy;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int saiki(int xinput, int yinput, int nokori) {
for... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 480 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* A Traveler
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = ... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* A Traveler
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = ... | [["-", 0, 52, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 52, 8, 196, 0, 503, 39, 506, 0, 96], ["+", 0, 7, 502, 503, 49, 200, 51, 16, 17, 33], ["+", 0, 7, 502, 503, 49, 200, 51, 16, 12, 499], ["-", 0, 57, 75, 196, 0, 7, 15, 16, 17, 47], ["+", 0, 57, 75, 196, 0, 7, 15, 16, 17, 20]] | 3 | 290 | 6 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, n, m, a, r, l, ans = 0;
static int s[100001] = {0};
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &a);
s[i] = s[i - 1] + a;
}
r = 0;
for (i ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, n, m, a, r, l, ans = 0;
static int s[100001] = {0};
scanf("%d%d", &n, &m);
for (i = 1; i < n; i++) {
scanf("%d", &a);
s[i] = s[i - 1] + a;
}
r = 0;
for (i =... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72]] | 1 | 173 | 6 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0549
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
//宿場町はn個 m日間
int n, m, pos = 0, a;
long long ans = 0;
long long t[100000];
int main() {
cin >> n >> m;
t[0] = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
t[i] +=... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0549
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
//宿場町はn個 m日間
int n, m, pos = 0, a;
long long ans = 0;
long long t[100000];
int main() {
cin >> n >> m;
t[0] = 0;
//累積和
for (int i = 1; i < n; i++) {
cin >> t[i];
t... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 16, 31, 69, 341, 342, 0, 16, 12, 22], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 22]] | 1 | 148 | 6 |
#include <iostream>
using namespace std;
int main() {
int n;
int m;
cin >> n;
cin >> m;
int a[n];
a[0] = 0;
int b;
int c;
b = 0;
while (b < n) {
cin >> c;
a[b + 1] = a[b] + c;
b = b + 1;
}
int e;
e = 0;
int d;
d = 0;
b = 0;
while (b < m) {
cin >> c;
if (c > 0) {
... | #include <iostream>
using namespace std;
int main() {
int n;
int m;
cin >> n;
cin >> m;
int a[n];
a[0] = 0;
int b;
int c;
b = 0;
while (b < n - 1) {
cin >> c;
a[b + 1] = a[b] + c;
b = b + 1;
}
int e;
e = 0;
int d;
d = 0;
b = 0;
while (b < m) {
cin >> c;
if (c > 0) {... | [["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 180 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 254 | 2 |
#include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
long long n, k;
long long rui[100000];
long long ans = 0;
int main() {
int i;
cin >> n >> k;
rep(i, n - 1) {
cin >> rui[i + 1];
rui[i + 1] += rui[i];
}
int bef = 0, now;
rep(i, k) {
cin >> now;
now += bef;
... | #include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
long long n, k;
long long rui[100000];
long long ans = 0;
int main() {
int i;
cin >> n >> k;
rep(i, n - 1) {
cin >> rui[i + 1];
rui[i + 1] += rui[i];
}
int bef = 0, now;
rep(i, k) {
cin >> now;
now += bef;
... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 136 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int n, m;
int a[111111];
int k, ans, p;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> k;
a[i] = a[i - 1] + k;
}
while (m--) {
cin >> k;
ans += abs(a[p + k] - a[p]);
ans %= 100000;
p += k;
}
cout << ans... | #include <cmath>
#include <iostream>
using namespace std;
int n, m;
int a[111111];
int k, ans, p;
int main() {
cin >> n >> m;
for (int i = 1; i < n; i++)
cin >> k, a[i] = a[i - 1] + k;
while (m--) {
cin >> k;
ans += abs(a[p + k] - a[p]);
ans %= 100000;
p += k;
}
cout << ans << endl;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 7, 8, 1, 0, 34, 0, 21], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 114 | 6 |
# -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 木 11/ 9 19:01:14 2017
# Usage
#
"""
from itertools import accumulate
def data_req():
n_yado, m_ryotei = [int(i) for i in input().spl... | # -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :
"""
#
# Author: Noname
# URL: https://github.com/pettan0818
# License: MIT License
# Created: 木 11/ 9 19:01:14 2017
# Usage
#
"""
from itertools import accumulate
def data_req():
n_yado, m_ryotei = [int(i) for i in input().spl... | [["+", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 3, 4, 0, 657, 31, 652, 3, 4, 0, 25], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 17, 109], ["+", 0, 1, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 236 | 5 |
#include <stdio.h>
int memo[2][5001][10000];
int N;
int map[10000 - 1];
int tansaku(int pos, int rest, int status) {
int result = 0x3fffffff;
int now_result;
if (pos >= N - 1)
return (rest == 0) ? 0 : 0x3fffffff;
if (rest < 0)
return 0x3fffffff;
if (memo[status][rest][pos] > 0)
return memo[stat... | #include <stdio.h>
int memo[2][5001][10000];
int N;
int map[10000 - 1];
int tansaku(int pos, int rest, int status) {
int result = 0x3fffffff;
int now_result;
if (pos >= N - 1)
return (rest - status == 0) ? 0 : 0x3fffffff;
if (rest < 0)
return 0x3fffffff;
if (memo[status][rest][pos] > 0)
return ... | [["+", 0, 41, 15, 23, 0, 16, 31, 16, 17, 33], ["+", 0, 41, 15, 23, 0, 16, 31, 16, 12, 22]] | 0 | 314 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int dp[2][5001][2]; /* 今いる位置、切った長さ、ここで切ったか */
int N;
int t[10010];
int ans = 1 << 30;
int main() {
cin >> N;
for (int i = 1; i < N; i++) {
cin >> t[i];
}
for (int i = 0; i <= 1; i++) {
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; ... | #include <algorithm>
#include <iostream>
using namespace std;
int dp[2][5001][2]; /* 今いる位置、切った長さ、ここで切ったか */
int N;
int t[10010];
int ans = 1 << 30;
int main() {
cin >> N;
for (int i = 1; i < N; i++) {
cin >> t[i];
}
for (int i = 0; i <= 1; i++) {
for (int j = 1; j <= N / 2; j++) {
for (int k = 0; ... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 474 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
int dp[2][5001];
int main() {
int n, in;
scanf("%d", &n);
for (int i = 0; i <= n / 2; i++)
dp[0][i] = dp[1][i] = 2000000000;
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &in);
for (int j = n / 2 - 1; j >= 0; j--) {
... | #include <algorithm>
#include <cstdio>
using namespace std;
int dp[2][5001];
int main() {
int n, in;
scanf("%d", &n);
for (int i = 0; i <= n / 2; i++)
dp[0][i] = dp[1][i] = 2000000000;
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &in);
for (int j = n / 2 - 1; j >= 0; j--) {
... | [["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13]] | 1 | 266 | 2 |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 93, 0, 94]] | 1 | 393 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, cost[10000];
int dp[5010][2];
const int INF = 1e9;
int main() {
scanf("%d", &N);
for (int i = 0; i < N - 1; i++)
scanf("%d", &cost[i]);
fill_n(*dp, 2 * 5010, INF);
dp[1][0] = dp[0][1] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = N / 2; j >... | #include <bits/stdc++.h>
using namespace std;
int N, cost[10000];
int dp[5010][2];
const int INF = 1e9;
int main() {
scanf("%d", &N);
for (int i = 0; i < N - 1; i++)
scanf("%d", &cost[i]);
fill_n(*dp, 2 * 5010, INF);
dp[1][0] = dp[0][1] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = N / 2; j >... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 240 | 13 |
#include <bits/stdc++.h>
using namespace std;
int N, C, D[5010][2], i, j;
main() {
cin >> N;
fill_n(*D + 3, 1e4, 1e9);
D[0][0] = 1e9;
for (; cin >> C, i < N - 1; i++)
for (j = N / 2; ~j;)
D[j + 1][0] = min(D[j][0], D[j][1] + C),
D[j][1] = min(D[j][0] + C, D[j--][1]);
cout << min(D[N / 2]... | #include <bits/stdc++.h>
using namespace std;
int N, C, D[5010][2], i, j;
main() {
cin >> N;
fill_n(*D + 3, 1e4, 1e9);
D[0][0] = 1e9;
for (; cin >> C, i < N - 1; i++)
for (j = N / 2; ~j;)
D[j + 1][0] = min(D[j][0], D[j][1] + C),
D[j--][1] = min(D[j][0] + C, D[j][1]);
cout << min(D[N / 2]... | [["+", 31, 69, 28, 69, 341, 342, 0, 27, 17, 68], ["-", 0, 69, 28, 69, 341, 342, 0, 27, 17, 68]] | 1 | 170 | 2 |
#include <bits/stdc++.h>
using namespace std;
int N, C, D[2][5001], i, j, *A, *B;
main() {
A = *D, B = *D + 1;
cin >> N;
fill_n(*D, 1e4 + 2, 1e9);
A[1] = B[0] = 0;
for (; i++ < N - 1 && cin >> C;)
for (j = N / 2; ~j;)
A[j + 1] = min(A[j], B[j] + C), B[j--] = min(A[j] + C, B[j]);
cout << min(A[N / ... | #include <bits/stdc++.h>
using namespace std;
int N, C, D[2][5001], i, j, *A, *B;
main() {
A = *D, B = D[1];
cin >> N;
fill_n(*D, 1e4 + 2, 1e9);
A[1] = B[0] = 0;
for (; i++ < N - 1 && cin >> C;)
for (j = N / 2; ~j;)
A[j + 1] = min(A[j], B[j] + C), B[j--] = min(A[j] + C, B[j]);
cout << min(A[N / 2]... | [["-", 0, 34, 12, 11, 12, 16, 31, 66, 17, 48], ["-", 0, 1, 0, 34, 12, 11, 12, 16, 17, 72], ["+", 0, 34, 12, 11, 12, 69, 341, 342, 0, 70], ["+", 0, 34, 12, 11, 12, 69, 341, 342, 0, 73]] | 1 | 165 | 17 |
#include <iostream>
using namespace std;
const int INF = (int)2e9;
int n, cut[10000];
int dp[2][2][5001]; // not use 0
int main() {
// chap1
cin >> n;
for (int i = 1; i < n; i++)
cin >> cut[i];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 1; k <= n / 2; k++)
dp[i]... | #include <cstring>
#include <iostream>
using namespace std;
const int INF = (int)2e9;
int n, cut[10000];
int dp[2][2][5001]; // not use 0
int main() {
// chap1
cin >> n;
for (int i = 1; i < n; i++)
cin >> cut[i];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 1; k <= n / 2;... | [["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 13]] | 1 | 505 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
const int INF = 1000000000;
int N;
int DP1[10001];
int DP2[10001];
int DP3[10001];
int DP4[10001];
int T[10000];
int main() {
scanf("%d", &N);
N = N >> 1;
for (int i = 1; i < 2 * N; i++)
scanf("%d", &T[i]);
for (int i = 0; i <= 2 * N; i++) {
DP1... | #include <cstdio>
#include <iostream>
using namespace std;
const int INF = 1000000000;
int N;
int DP1[10001];
int DP2[10001];
int DP3[10001];
int DP4[10001];
int T[10000];
int main() {
scanf("%d", &N);
N = N >> 1;
for (int i = 1; i < 2 * N; i++)
scanf("%d", &T[i]);
for (int i = 0; i <= 2 * N; i++) {
DP1... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 336 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [["+", 28, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 28, 69, 28, 69, 341, 342, 0, 16, 17, 67]] | 1 | 735 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; ++i)
#define a a
const int inf = 1e9;
int dp[2][2][5050];
signed main() {
int n;
cin >> n;
vector<int> t(n - 1);
rep(i, n - 1) cin >> t[i + 1];
rep(i, 2) rep(j, 2) rep(k, n / 2 + 1) dp[i][j][k] = inf;
dp[0][1][0]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; ++i)
#define a a
const int inf = 1e9;
int dp[2][2][5050];
signed main() {
int n;
cin >> n;
vector<int> t(n - 1);
rep(i, n - 1) cin >> t[i + 1];
rep(i, 2) rep(j, 2) rep(k, n / 2 + 1) dp[i][j][k] = inf;
dp[0][1][0]... | [["-", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 69, 28, 69, 28, 69, 341, 342, 0, 13]] | 1 | 311 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 9;
int n;
int t[10101];
int dp[2][2][5050];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t[i];
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 5050; k++)
dp[i][j][k] = inf;... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 9;
int n;
int t[10101];
int dp[2][2][5050];
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> t[i];
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 5050; k++)
dp[i][j][k] = inf;... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 325 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x) ce... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x) ce... | [["-", 31, 23, 0, 16, 12, 69, 341, 342, 0, 13], ["+", 31, 23, 0, 16, 12, 69, 341, 342, 0, 13], ["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 16, 12, 69, 341, 342, 0, 13]] | 1 | 661 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, x) for (int i = 0; i < x; ++i)
#define all(a) begin(a), end(a)
const int inf = 3e17;
int dp[155][15][100];
int stone[155][15];
int X[155][15];
signed main() {
int n, m;
while (cin >> n >> m, n) {
rep(i, n + 5) rep(j, 15) s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, x) for (int i = 0; i < x; ++i)
#define all(a) begin(a), end(a)
const int inf = 3e17;
int dp[155][15][100];
int stone[155][15];
int X[155][15];
signed main() {
int n, m;
while (cin >> n >> m, n) {
rep(i, n + 5) rep(j, 15) s... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22]] | 1 | 646 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for (int i =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for (int i =... | [["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 106], ["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 25]] | 1 | 654 | 4 |
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
while (cin >> n >> m, n) {
int pos[151][10] = {0};
int rate[151][10] = {0};
int cnt[151] = {0};
for (int i = 1; i <= n; i++) {
int k;
cin >... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
while (cin >> n >> m, n) {
int pos[151][10] = {0};
int rate[151][10] = {0};
int cnt[151] = {0};
for (int i = 1; i <= n; i++) {
int k;
cin >... | [["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 35]] | 1 | 646 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define INF 1000000000
int n, m;
int d[80][150][10];
int r[150][1000];
int f[150][10];
int c[150];
int i, j, k, l;
int t;
int a, b;
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int main() {
// while(1){
scanf("%d %d", &n, &m);
if (n == 0 && m ... | #include <stdio.h>
#include <stdlib.h>
#define INF 1000000000
int n, m;
int d[80][150][10];
int r[150][1000];
int f[150][10];
int c[150];
int i, j, k, l;
int t;
int a, b;
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int main() {
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 &&... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 791 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 593 | 2 |
// Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25]] | 1 | 971 | 4 |
#include "stdio.h"
#include "stdlib.h"
#include <iostream>
#include <vector>
using namespace std;
#define INF (int)(1e9)
int mb[10];
int ms[10];
int m[10][100];
int mk;
int mmb[10];
int mms[10];
int mm[10][100];
int mmk;
int n[10][100];
vector<pair<int, int>> isi[150];
int main() {
while (1) {
int nn, mn;
... | #include "stdio.h"
#include "stdlib.h"
#include <iostream>
#include <vector>
using namespace std;
#define INF (int)(1e9)
int mb[10];
int ms[10];
int m[10][100];
int mk;
int mmb[10];
int mms[10];
int mm[10][100];
int mmk;
int n[10][100];
vector<pair<int, int>> isi[150];
int main() {
while (1) {
int nn, mn;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 1,097 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int W, H, N;
int X1[1000], X2[1000], Y1[1000], Y2[1000];
bool fld[1000 * 6][100... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int W, H, N;
int X1[1000], X2[1000], Y1[1000], Y2[1000];
bool fld[1000 * 6][100... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 748 | 6 |
#include <bits/stdc++.h>
#define PB push_back
#define MP make pair
#define FI first
#define SE second
using namespace std;
static const int INF = 1ll << 60;
typedef pair<int, int> pii;
int W, H, N;
int X1[1001], Y1[1001], X2[1001], Y2[1001];
int fld[6000][6000];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ... | #include <bits/stdc++.h>
#define PB push_back
#define MP make pair
#define FI first
#define SE second
using namespace std;
static const int INF = 1ll << 60;
typedef pair<int, int> pii;
int W, H, N;
int X1[1001], Y1[1001], X2[1001], Y2[1001];
int fld[2000][2000];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int ... | [["-", 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, 37, 0, 16, 17, 33], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 12, 13]] | 1 | 904 | 6 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
struct Compress {
map<int, int> mp;
map<int, int> revmp;
Compress(vector<int> vs) { setmp(vs); }
Compress(const set<int> &vs) { setmp(vs)... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
struct Compress {
map<int, int> mp;
map<int, int> revmp;
Compress(vector<int> vs) { setmp(vs); }
Compress(const set<int> &vs) { setmp(vs)... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 1,162 | 4 |
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int... | #include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int... | [["+", 0, 16, 31, 16, 31, 16, 31, 23, 0, 25], ["-", 3, 4, 0, 16, 31, 16, 31, 23, 0, 25]] | 1 | 851 | 2 |
#include <algorithm>
#include <bitset>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MSG(a) cout << #a << " " << a << en... | #include <algorithm>
#include <bitset>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MSG(a) cout << #a << " " << a << en... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18]] | 1 | 719 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N;
int X1[1111], X2[1111], Y1[1111], Y2[1111];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int compress(int z1[], int z2[], int w) {
vector<int> xs;
// co... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N;
int X1[1111], X2[1111], Y1[1111], Y2[1111];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int compress(int z1[], int z2[], int w) {
vector<int> xs;
for (... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 704 | 6 |
import sys
def find_color(n, ai, bi):
color = (3, 1, 2)
if n % 2 != 0:
if ai > int((n+1)/2):
ai = int((n+1)/2) - (ai - int((n+1)/2))
if bi > int((n+1)/2):
bi = int((n+1)/2) - (bi - int((n+1)/2))
else:
if ai > int(n/2):
ai = int(n/2) - (ai - int(n... | import sys
def find_color(n, ai, bi):
color = (3, 1, 2)
if n % 2 != 0:
if ai > int((n+1)/2):
ai = int((n+1)/2) - (ai - int((n+1)/2))
if bi > int((n+1)/2):
bi = int((n+1)/2) - (bi - int((n+1)/2))
else:
if ai > int(n/2):
ai = int(n/2) - (ai - int(n... | [["-", 0, 14, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 276 | 6 |
// First Grader
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] number = new int[n];
for (int i = 0; i < n; i++)
number[i] = sc.nextInt();
long[][] dp ... | // First Grader
import java.util.Scanner;
public class Main {
public static void main(String[] args) { new Main().run(); }
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] number = new int[n];
for (int i = 0; i < n; i++)
number[i] = sc.nextInt();
long[][] dp ... | [["+", 0, 57, 15, 15, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 12, 499], ["+", 15, 15, 0, 16, 31, 23, 0, 16, 17, 106], ["+", 0, 57, 15, 15, 0, 16, 31, 23, 0, 25]] | 3 | 273 | 6 |
#include <stdio.h>
int main(void) {
int i, j, n, a[100], dp[21][100];
scanf("%d", &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i <= 20; i++) {
for (j = 0; j <= n - 1; j++) {
dp[i][j] = 0;
}
}
dp[a[0]][0] = 1;
for (i = 1; i <= n - 2; i++) {
for (j = 0; j <... | #include <stdio.h>
int main(void) {
int i, j, n, a[100];
long long int dp[21][100];
scanf("%d", &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i <= 20; i++) {
for (j = 0; j <= n - 1; j++) {
dp[i][j] = 0;
}
}
dp[a[0]][0] = 1;
for (i = 1; i <= n - 2; i++) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 266 | 7 |
D[], j;
double *d = D;
main(i, v) {
for (; j || ~scanf("%d", &v, i++); j = -~j % 30)
30 [d++] = j < 21 && i > 3 ? d[-v] + d[v] : j == v;
d = !printf("%.f\n", *d);
} | D[9999], j;
double *d = D;
main(i, v) {
for (; j || ~scanf("%d", &v, i++); j = -~j % 30)
30 [d++] = j<21 & i> 3 ? d[-v] + d[v] : j == v;
d = !printf("%.f\n", *d);
} | [["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["-", 0, 30, 0, 1, 0, 69, 71, 22, 0, 73], ["-", 8, 1, 0, 11, 12, 41, 15, 16, 17, 98], ["+", 8, 1, 0, 11, 12, 41, 15, 16, 17, 67]] | 0 | 92 | 4 |
t[21][2], a, d;
int main(b) {
for (scanf("%d%d", &a, &b); d < 21; d++)
t[d][a & 1] = !(b - d);
for (; --a - 1 && scanf("%d", &b);)
for (d = 0; d < 21;
t[d++][a & 1] = ((b > d ? 0 : t[d - b][!(a & 1)]) +
((b < (21 - d)) ? t[b + d][!(a & 1)] : 0)))
;
scanf("%d", &b),... | long long t[21][2], a, d;
int main(b) {
for (scanf("%d%d", &a, &b); d < 21; d++)
t[d][a & 1] = !(b - d);
for (; --a - 1 && scanf("%d", &b);)
for (d = 0; d < 21;
t[d++][a & 1] = ((b > d ? 0 : t[d - b][!(a & 1)]) +
((b < (21 - d)) ? t[b + d][!(a & 1)] : 0)))
;
scanf(... | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 1, 0, 34, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 34, 12, 11, 17, 32], ["+", 0, 1, 0, 34, 12, 11, 12, 91, 17, 111], ["+", 12, 91, 28, 2, 3, 4, 0, 5, 0, 44]] | 0 | 178 | 6 |
#include <stdio.h>
unsigned long long kazu[100][21];
unsigned long long kazoe(int *, int, int, int);
int main(int argc, char *argv[]) {
/*declare values*/
int suuzi[100];
int kosuu;
unsigned long long count;
int i, j;
/*do work*/
scanf("%d", &kosuu);
for (i = 0; i < kosuu; i++) {
scanf("%d", &suuz... | #include <stdio.h>
unsigned long long kazu[100][21];
unsigned long long kazoe(int *, int, int, int);
int main(int argc, char *argv[]) {
/*declare values*/
int suuzi[100];
int kosuu;
unsigned long long count;
int i, j;
/*do work*/
scanf("%d", &kosuu);
for (i = 0; i < kosuu; i++) {
scanf("%d", &suuz... | [["-", 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, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 424 | 5 |
#include <iostream>
using namespace std;
int main() {
int N, num[101];
cin >> N;
for (int i = 0; i < N; i++)
cin >> num[i];
int dp[101][21] = {{0}};
dp[0][num[0]] = 1;
for (int i = 1; i < N - 1; i++) {
for (int j = 0; j <= 20; j++) {
if (j - num[i] >= 0)
dp[i][j - num[i]] += dp[i - ... | #include <iostream>
using namespace std;
int main() {
int N, num[101];
cin >> N;
for (int i = 0; i < N; i++)
cin >> num[i];
long long dp[101][21] = {{0}};
dp[0][num[0]] = 1;
for (int i = 1; i < N - 1; i++) {
for (int j = 0; j <= 20; j++) {
if (j - num[i] >= 0)
dp[i][j - num[i]] += d... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 1 | 197 | 6 |
#include <iostream>
int main() {
int a;
int dp[101][101] = {0};
int x[101];
std::cin >> a;
for (int i = 1; i <= a; i++)
std::cin >> x[i];
dp[1][x[1]] = 1;
for (int j = 2; j < a; j++) {
for (int s = 0; s <= 20; s++) {
if (s + x[j] <= 20 && s - x[j] >= 0) {
dp[j][s] = dp[j - 1][s - x[... | #include <iostream>
int main() {
int a;
long long int dp[101][101] = {0};
int x[101];
std::cin >> a;
for (int i = 1; i <= a; i++)
std::cin >> x[i];
dp[1][x[1]] = 1;
for (int j = 2; j < a; j++) {
for (int s = 0; s <= 20; s++) {
if (s + x[j] <= 20 && s - x[j] >= 0) {
dp[j][s] = dp[j -... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 280 | 2 |
#include <stdio.h>
long long int dp[105][25] = {};
int n;
int dat[105];
int main(void) {
scanf("%d", &n);
int i, t1, t2, s;
for (i = 1; i <= n; i++) {
scanf("%d", &dat[i]);
}
for (i = 0; i <= 20; i++) {
dp[1][i] = 0;
}
dp[1][dat[1]] = 1;
for (i = 2; i <= n - 1; i++) {
for (s = 0; s <=... | #include <stdio.h>
long long int dp[105][25] = {};
int n;
int dat[105];
int main(void) {
scanf("%d", &n);
int i, t1, t2, s;
for (i = 1; i <= n; i++) {
scanf("%d", &dat[i]);
}
for (i = 0; i <= 20; i++) {
dp[1][i] = 0;
}
dp[1][dat[1]] = 1;
for (i = 2; i <= n - 1; i++) {
for (s = 0; s <=... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 268 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int count_num;
std::cin >> count_num;
std::vector<int> fig;
fig.resize(count_num);
for (int i = 0; i < count_num; ++i) {
std::cin >> fig[i];
}
std::vector<int> ans_number;
ans_number.resize(21);
ans_number[fig[0]] = 1;
fo... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int count_num;
std::cin >> count_num;
std::vector<int> fig;
fig.resize(count_num);
for (int i = 0; i < count_num; ++i) {
std::cin >> fig[i];
}
std::vector<long int> ans_number;
ans_number.resize(21);
ans_number[fig[0]] = 1;... | [["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 241 | 2 |
#include <iostream>
#include <vector>
const int Max_N = 101; // 3 <= N <= 100
const int Max_ans = 21; // 0 <= answer <= 20
bool memo[Max_N][Max_ans]; // memo for dp
int dp[Max_N][Max_ans] = {0};
std::vector<int> seq;
// memo[0][seq[0]] = true;
// memo[i][j] : caliculated up to i+1 and the num of result is j
vo... | #include <iostream>
#include <vector>
const int Max_N = 101; // 3 <= N <= 100
const int Max_ans = 21; // 0 <= answer <= 20
bool memo[Max_N][Max_ans]; // memo for dp
long long int dp[Max_N][Max_ans] = {0};
std::vector<int> seq;
// memo[0][seq[0]] = true;
// memo[i][j] : caliculated up to i+1 and the num of resu... | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]] | 1 | 418 | 4 |
#include <iostream>
#define MAX_N 100
int n;
unsigned long long dp[MAX_N][21];
int a[MAX_N];
int main() {
std::cin >> n;
for (int i = 0; i < n; ++i)
std::cin >> a[i];
dp[0][a[0]] = 1;
for (int i = 1; i < n - 1; ++i) {
for (int j = 0; j <= 20; ++j) {
if (j + a[i] <= 20)
dp[i][j] += dp[i... | #include <iostream>
#define MAX_N 100
int n;
unsigned long long dp[MAX_N][21];
int a[MAX_N];
int main() {
std::cin >> n;
for (int i = 0; i < n; ++i)
std::cin >> a[i];
dp[0][a[0]] = 1;
for (int i = 1; i < n - 1; ++i) {
for (int j = 0; j <= 20; ++j) {
if (j + a[i] <= 20)
dp[i][j] += dp[i... | [["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 197 | 4 |
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int num[21];
for (int i = 1; i <= n; i++)
cin >> num[i];
ll dp[101][21];
memset(dp, 0, sizeof(dp));
dp[1][num[1]] = 1;
for (int i = 2; i < n; i++) {
for (int j = 0; j <= 20; j++)... | #include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int num[101];
for (int i = 1; i <= n; i++)
cin >> num[i];
ll dp[101][21];
memset(dp, 0, sizeof(dp));
dp[1][num[1]] = 1;
for (int i = 2; i < n; i++) {
for (int j = 0; j <= 20; j++... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 207 | 2 |
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#define MAX_N 25
using namespace std;
long long int dp[110][MAX_N];
int n, num[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num[i];
}
dp[0][num[0]] = 1;
for (int i = 1; i < n; ++i) {
for (int j = 0; j <= n... | #include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#define MAX_N 25
using namespace std;
long long int dp[110][MAX_N];
int n, num[110];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num[i];
}
dp[0][num[0]] = 1;
for (int i = 1; i < n; ++i) {
for (int j = 0; j <= 2... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 206 | 2 |
#include <iostream>
using namespace std;
int main() {
long long int a[100][21];
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 20; j++) {
a[i][j] = 0;
}
}
int n;
cin >> n;
int y;
cin >> y;
a[0][y] = 1;
for (int i = 1; i < n - 1; i++) {
int p;
cin >> p;
for (int j = 0; j... | #include <iostream>
using namespace std;
int main() {
long long int a[100][21];
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 21; j++) {
a[i][j] = 0;
}
}
int n;
cin >> n;
int y;
cin >> y;
a[0][y] = 1;
for (int i = 1; i < n - 1; i++) {
int p;
cin >> p;
for (int j = 0; j... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 214 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repp(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repp(i... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 87], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 1,005 | 4 |
#include <bits/stdc++.h>
#define LLI long long int
LLI n, num[110], a, memo[1000][20], ans;
using namespace std;
LLI po(int low, int sum) {
LLI a = 0, b = 0;
if (memo[low][sum] != 0)
return memo[low][sum];
if (low == n - 2) {
if (sum == num[low + 1])
return 1;
return 0;
} else {
if (... | #include <bits/stdc++.h>
#define LLI long long int
LLI n, num[110], a, memo[1000][30], ans;
using namespace std;
LLI po(int low, int sum) {
LLI a = 0, b = 0;
if (memo[low][sum] != 0)
return memo[low][sum];
if (low == n - 2) {
if (sum == num[low + 1])
return 1;
return 0;
} else {
if (... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]] | 1 | 235 | 2 |
#include <iostream>
#define max 100
using namespace std;
int main() {
int cal[max]; //?¨???????
int num[21][max]; // 0???21?????°???
int n; //????????\???????????????
int i = 0; //?????????????????????
int y = 0; // 20?????§??????????¢??????????
int sum = 0;
cin >> n;
whi... | #include <iostream>
#define max 100
using namespace std;
int main() {
int cal[max]; //?¨???????
long long int num[21][max]; // 0???21?????°???
int n; //????????\???????????????
int i = 0; //?????????????????????
int y = 0; // 20?????§??????... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 292 | 2 |
#include <cmath>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (int a = b; a < (c); a++)
#define repe(a, b, c) for (int a = b; a <= (c); a++)
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<long long unsigned>> dp(N, vector<long long unsigned>(21, 0));
int num;
cin >> num... | #include <cmath>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (int a = b; a < (c); a++)
#define repe(a, b, c) for (int a = b; a <= (c); a++)
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<long long unsigned>> dp(N, vector<long long unsigned>(21, 0));
int num;
cin >> num... | [["-", 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, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 191 | 4 |
#include <deque>
#include <iostream>
#include <sstream>
#include <vector>
std::vector<std::vector<long int>> table;
void outtable(std::vector<std::vector<long int>> t) {
for (int i = 0; i < t.size(); ++i) {
for (int j = 0; j < t[i].size(); ++j) {
std::cout << t[i][j] << " ";
}
std::cout << std::en... | #include <deque>
#include <iostream>
#include <sstream>
#include <vector>
std::vector<std::vector<long int>> table;
void outtable(std::vector<std::vector<long int>> t) {
for (int i = 0; i < t.size(); ++i) {
for (int j = 0; j < t[i].size(); ++j) {
std::cout << t[i][j] << " ";
}
std::cout << std::en... | [["-", 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, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 428 | 5 |
#include <iostream>
using namespace std;
int n, a[105] = {0}, dp[105][105] = {0};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][a[0]] = 1;
for (int i = 1; i <= n - 2; i++) {
for (int j = 0; j <= 20; j++) {
if (j + a[i] <= 20 && j - a[i] >= 0)
dp[i][j] = dp[i -... | #include <iostream>
using namespace std;
long long n, a[105] = {0}, dp[105][105] = {0};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][a[0]] = 1;
for (int i = 1; i <= n - 2; i++) {
for (int j = 0; j <= 20; j++) {
if (j + a[i] <= 20 && j - a[i] >= 0)
dp[i][j] = ... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 249 | 3 |
#include <iostream>
using namespace std;
int sum[100 + 10][21 + 10] = {0};
int main() {
int n;
int a;
// int suu[100 + 10];
int i, j;
cin >> n;
cin >> a;
sum[0][a] = 1;
for (i = 0; i < n - 2; i++) {
cin >> a;
for (j = 0; j <= 20; j++) {
if (sum[i][j] > 0) {
if (j + a <= 20) {... | #include <iostream>
using namespace std;
unsigned long long int sum[100 + 10][21 + 10] = {
0}; // unsigned???+??????????????\????????????
int main() {
int n;
int a;
// int suu[100 + 10];
int i, j;
cin >> n;
cin >> a;
sum[0][a] = 1;
for (i = 0; i < n - 2; i++) {
cin >> a;
for (j = 0; j ... | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 87], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]] | 1 | 190 | 3 |
#include <iostream>
int main() {
int input_num, finger_num, max_data;
finger_num = 21, max_data = 100;
std::cin >> input_num;
int data[max_data];
int fingers[max_data][finger_num];
for (int i = 0; i < input_num - 1; i++) {
std::cin >> data[i];
}
//初期化
for (int j = 0; j < finger_num; j++) {
... | #include <iostream>
int main() {
int input_num, finger_num, max_data;
finger_num = 21, max_data = 100;
std::cin >> input_num;
int data[max_data];
long long fingers[max_data][finger_num];
for (int i = 0; i < input_num - 1; i++) {
std::cin >> data[i];
for (int j = 0; j < finger_num; j++) {
fin... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 247 | 7 |
#include <iostream>
#include <vector>
int main() {
int n, answer, a;
std::cin >> n;
std::vector<int> number(n - 1);
std::vector<int> move(21, 0), moving(21, 0);
for (int i = 0; i < n - 1; ++i) {
std::cin >> number[i];
}
std::cin >> answer;
move[number[0]] = 1;
for (int i = 1; i < n - 1; i++) ... | #include <iostream>
#include <vector>
int main() {
int n, answer, a;
std::cin >> n;
std::vector<int> number(n - 1); //足し算に使う数を入れる
std::vector<long int> move(21, 0), moving(21, 0); //０から２０までの箱
for (int i = 0; i < n - 1; ++i) {
std::cin >> number[i];
}
std::cin >> answer;
move[number[0]] = 1;
/... | [["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 254 | 1 |
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
int x, ans;
long int i = 0;
std::vector<std::vector<int>> num(N, std::vector<int>(21, 0));
while (N > 0 && std::cin >> x) {
if (N == 1) {
ans = x;
break;
}
if (i == 0) {
++num[i][x];
++i;
--... | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
int x, ans;
int i = 0;
std::vector<std::vector<long int>> num(N, std::vector<long int>(21, 0));
while (N > 0 && std::cin >> x) {
if (N == 1) {
ans = x;
break;
}
if (i == 0) {
++num[i][x];
++i;
... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["+", 141, 346, 3, 347, 0, 77, 39, 86, 0, 96]] | 1 | 248 | 3 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | [["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 13]] | 1 | 260 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long Int;
Int dp[105][25], n, ans, num[105];
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++)
cin >> num[i];
cin >> ans;
dp[0][num[0]] = 1;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < 20; j++) {
if (j -... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long Int;
Int dp[105][25], n, ans, num[105];
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++)
cin >> num[i];
cin >> ans;
dp[0][num[0]] = 1;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j <= 20; j++) {
if (j ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 200 | 2 |
#include <iostream>
#define ll long long int
using namespace std;
int n;
ll t[1000], dp[1000][1000];
ll func(int now, ll sum) {
if (dp[now][sum] != -1)
return dp[now][sum];
if (sum < 0 || sum > 20)
return 0;
if (now == n - 1) {
if (sum == t[n - 1])
return dp[now][sum] = 1;
return dp[now][sum... | #include <iostream>
#define ll long long int
using namespace std;
int n;
ll t[1000], dp[1000][1000];
ll func(int now, ll sum) {
if (dp[now][sum] != -1)
return dp[now][sum];
if (sum < 0 || sum > 20)
return 0;
if (now == n - 1) {
if (sum == t[n - 1])
return dp[now][sum] = 1;
return dp[now][sum... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 247 | 2 |
#include <iostream>
int n, a[100];
int b, i, j;
unsigned long long int dp[102][22];
int main(void) {
scanf("%d", &n);
for (b = 0; b < n; b++) {
scanf("%d", &a[b]);
}
dp[1][a[0]] = 1;
for (i = 1; i < n - 1; i++) {
for (j = 0; j <= 20; j++) {
if (dp[i][j] > 0) {
int plus = j + a[i];
... | #include <iostream>
int n, a[100];
int b, i, j;
unsigned long long int dp[102][22];
int main(void) {
scanf("%d", &n);
for (b = 0; b < n; b++) {
scanf("%d", &a[b]);
}
dp[1][a[0]] = 1;
for (i = 1; i < n - 1; i++) {
for (j = 0; j <= 20; j++) {
if (dp[i][j] > 0) {
int plus = j + a[i];
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 239 | 2 |
a[], i;
main() {
for (; ~scanf("%d", a + i++);)
;
*a = !printf("%.f\n", fmin(fmin(*a, a[1]), a[2]) + fmin(a[3], a[4]) - 50);
} | a[5], i;
main() {
for (; ~scanf("%d", a + i++);)
;
*a = !printf("%.f\n", fmin(fmin(*a, a[1]), a[2]) + fmin(a[3], a[4]) - 50);
} | [["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 0 | 75 | 2 |
#include <stdio.h>
int main(void) {
int p1, p2, p3, j1, j2;
int pst, jic;
scanf("%d %d %d %d %d", &p1, &p2, &p3, &j1, &j2);
pst = p1;
if (pst > p2) {
pst = p2;
} else if (pst > p3) {
pst = p3;
}
jic = (j1 > j2) ? j2 : j1;
printf("%d\n", pst + jic - 50);
return (0);
} | #include <stdio.h>
int main(void) {
int p1, p2, p3, j1, j2;
int pst, jic;
scanf("%d %d %d %d %d", &p1, &p2, &p3, &j1, &j2);
pst = p1;
if (pst > p2) {
pst = p2;
}
if (pst > p3) {
pst = p3;
}
jic = (j1 > j2) ? j2 : j1;
printf("%d\n", pst + jic - 50);
return (0);
} | [["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]] | 0 | 107 | 1 |
#include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int pa[3];
int ju[2];
rep(i, 3) cin >> pa[i];
rep(i, 2) cin >> ju[i];
sort(pa, pa + 2);
sort(ju, ju + 1);
cout << pa[0] + ju[0] - 50 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int pa[3];
int ju[2];
rep(i, 3) cin >> pa[i];
rep(i, 2) cin >> ju[i];
sort(pa, pa + 3);
sort(ju, ju + 2);
cout << pa[0] + ju[0] - 50 << endl;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 97 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define... | [["+", 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 | 246 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
typedef vector<int> vint;
typedef pair<int, int> pint;
int get(int n) {
int ret = 114514;
rep(i, n) {
int a;
cin >> a;
ret = min(ret, a);
}
return ret;
}
int main() {
int x = get(3... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
typedef vector<int> vint;
typedef pair<int, int> pint;
int get(int n) {
int ret = 114514;
rep(i, n) {
int a;
cin >> a;
ret = min(ret, a);
}
return ret;
}
int main() {
int x = get(3... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 106 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
//#define PI 3.141592653589
using namespace std;
int main() {
int pasta[3];
int juice[2];
for (int i = 0; i < 3; i++)
cin >> pasta[i];
for (int i = 0; i < 2; i++)
cin >> juice[i];
sort(pasta, pasta + 3);
sort(juice, jui... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
//#define PI 3.141592653589
using namespace std;
int main() {
int pasta[3];
int juice[2];
for (int i = 0; i < 3; i++)
cin >> pasta[i];
for (int i = 0; i < 2; i++)
cin >> juice[i];
sort(pasta, pasta + 3);
sort(juice, jui... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 111 | 2 |
#include <stdio.h>
int main() {
int x, y;
int t1 = 2000, t2 = 2000;
for (int i = 0; i < 3; i++) {
scanf("%d", &x);
if (t1 > x)
t1 = x;
}
for (int i = 0; i < 2; i++) {
scanf("%d", &y);
if (t2 > y)
t2 = y;
}
t1 = t2 + t1;
printf("%d\n", t1);
return 0;
} | #include <stdio.h>
int main() {
int x, y;
int t1 = 2000, t2 = 2000;
for (int i = 0; i < 3; i++) {
scanf("%d", &x);
if (t1 > x)
t1 = x;
}
for (int i = 0; i < 2; i++) {
scanf("%d", &y);
if (t2 > y)
t2 = y;
}
t1 = t2 + t1 - 50;
printf("%d\n", t1);
return 0;
} | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 113 | 2 |
#include <iostream>
using namespace std;
int main() {
int p1, p2, p3, j1, j2;
cin >> p1 >> p2 >> p3 >> j1 >> j2;
int t = 0;
t += (p1 < p2 ? (p1 < p3 ? p1 : p3) : (p2 < p3 ? p2 : p3));
t += (p1 < p2 ? p1 : p2);
t -= 50;
cout << t << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int p1, p2, p3, j1, j2;
cin >> p1 >> p2 >> p3 >> j1 >> j2;
int t = 0;
t += (p1 < p2 ? (p1 < p3 ? p1 : p3) : (p2 < p3 ? p2 : p3));
t += (j1 < j2 ? j1 : j2);
t -= 50;
cout << t << endl;
return 0;
} | [["-", 0, 11, 12, 23, 0, 41, 15, 16, 31, 22], ["+", 0, 11, 12, 23, 0, 41, 15, 16, 31, 22], ["-", 0, 11, 12, 23, 0, 41, 15, 16, 12, 22], ["+", 0, 11, 12, 23, 0, 41, 15, 16, 12, 22], ["-", 0, 1, 0, 11, 12, 23, 0, 41, 64, 22], ["+", 0, 1, 0, 11, 12, 23, 0, 41, 64, 22], ["-", 0, 1, 0, 11, 12, 23, 0, 41, 75, 22], ["+", 0, 1... | 1 | 93 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[5];
for (int i = 0; i < 5; i++) {
cin >> price[i];
}
sort(price, price + 3);
cout << price[0] - min(price[3], price[4]) << endl;
return (0);
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[5];
for (int i = 0; i < 5; i++) {
cin >> price[i];
}
sort(price, price + 3);
cout << price[0] + min(price[3], price[4]) - 50 << endl;
return (0);
} | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 79 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i, a, b) fo... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i, a, b) fo... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 220 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min(a, min(b, c)) + min(b, c) - 50 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min(a, min(b, c)) + min(d, e) - 50 << endl;
} | [["-", 12, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["+", 12, 16, 31, 16, 12, 2, 3, 4, 0, 22]] | 1 | 62 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
int b = INT_MAX;
int c;
for (int d = 0; d < 3; d++) {
scanf("%d", &c);
b = min(b, c);
}
a += b;
b = INT_MAX;
for (int d = 0; d < 2; d++) {
scanf("%d", &c);
b = min(b, c);
}
printf("%d\n", a + b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
int b = INT_MAX;
int c;
for (int d = 0; d < 3; d++) {
scanf("%d", &c);
b = min(b, c);
}
a += b;
b = INT_MAX;
for (int d = 0; d < 2; d++) {
scanf("%d", &c);
b = min(b, c);
}
printf("%d\n", a + b - 50);
} | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 115 | 2 |
#include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, d, e;
scanf("%d\n%d\n%d\n%d\n%d", &a, &b, &c, &d, &e);
printf("%d\n", min(a, min(b, c)) + min(c, d) - 50);
return 0;
} | #include <math.h>
#include <stack>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, d, e;
scanf("%d\n%d\n%d\n%d\n%d", &a, &b, &c, &d, &e);
printf("%d\n", min(a, min(b, c)) + min(d, e) - 50);
return 0;
} | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22]] | 1 | 89 | 4 |
#include <iostream>
int main() {
int p[3], j[2];
int pmin = 2000, jmin = 2000;
for (int i = 0; i < 3; i++) {
std::cin >> p[i];
if (p[i] < 2000) {
pmin = p[i];
}
}
for (int i = 0; i < 2; i++) {
std::cin >> j[i];
if (j[i] < 2000) {
jmin = j[i];
}
}
std::cout << jmin + pmi... | #include <iostream>
int main() {
int p[3], j[2];
int pmin = 2000, jmin = 2000;
for (int i = 0; i < 3; i++) {
std::cin >> p[i];
if (p[i] < pmin) {
pmin = p[i];
}
}
for (int i = 0; i < 2; i++) {
std::cin >> j[i];
if (j[i] < jmin) {
jmin = j[i];
}
}
std::cout << jmin + pmi... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 131 | 4 |
#include <stdio.h>
int main() {
int i, j, A, B, a, b;
a = 999999;
b = 999999;
for (i = 0; i < 3; i++) {
scanf("%d", &A);
if (a > A) {
a = A;
}
}
for (i = 0; i < 2; i++) {
scanf("%d", &B);
if (b > B) {
b = B;
}
A = A + B - 50;
}
printf("%d\n", A);
return 0;
} | #include <stdio.h>
int main() {
int i, j, A, B, a, b;
a = 999999;
b = 999999;
for (i = 0; i < 3; i++) {
scanf("%d", &A);
if (a > A) {
a = A;
}
}
for (i = 0; i < 2; i++) {
scanf("%d", &B);
if (b > B) {
b = B;
}
}
a = a + b - 50;
printf("%d\n", a);
return 0;
} | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7... | 1 | 124 | 10 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int p[3], j[2], i, t, a;
for (i = 0; i != 3; i++)
cin >> p[i];
for (i = 0; i != 2; i++) {
for (a = i; a != 3; a++) {
if (p[i] > p[i + 1]) {
t = p[i];
p[i] = p[a];
p[a] = t;
}
}
}
t = p[... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int p[3], j[2], i, t, a;
for (i = 0; i != 3; i++)
cin >> p[i];
for (i = 0; i != 2; i++) {
for (a = i; a != 3; a++) {
if (p[i] > p[a]) {
t = p[i];
p[i] = p[a];
p[a] = t;
}
}
}
t = p[0];
... | [["-", 51, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22]] | 1 | 176 | 4 |
//
// main.cpp
#include <iostream>
using namespace std;
int main() {
int pastamin = 0;
int juicemin = 0;
int input;
for (int i = 0; i < 3; i++) {
cin >> input;
pastamin = min(input, pastamin);
}
for (int i = 0; i < 2; i++) {
cin >> input;
juicemin = min(input, juicemin);
}
cout << pa... | //
// main.cpp
#include <iostream>
using namespace std;
int main() {
int pastamin = 1000000;
int juicemin = 1000000;
int input;
for (int i = 0; i < 3; i++) {
cin >> input;
pastamin = min(input, pastamin);
}
for (int i = 0; i < 2; i++) {
cin >> input;
juicemin = min(input, juicemin);
}
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 98 | 4 |
#include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e, f, g;
cin >> c;
for (a = 0; a < 2; a++) {
cin >> b;
if (c > b) {
c = b;
}
}
cin >> d >> e;
if (d < e) {
f = d + c - 50;
cout << f << endl;
} else if (d > e) {
f = e + c - 50;
cout << f << endl;
... | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e, f, g;
cin >> c;
for (a = 0; a < 2; a++) {
cin >> b;
if (c > b) {
c = b;
}
}
cin >> d >> e;
if (d <= e) {
f = d + c - 50;
cout << f << endl;
} else if (d >= e) {
f = e + c - 50;
cout << f << endl;... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 117 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
/*
int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int x;
if(a > 0){
x = e*(b-a);
}
if(a == 0){
x = e*b + d;
}
if(a < 0){
x = -c*a + e*b + d;
}
cout << x <<endl;
*/
/*
int a,b,c,d,e,f;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
/*
int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int x;
if(a > 0){
x = e*(b-a);
}
if(a == 0){
x = e*b + d;
}
if(a < 0){
x = -c*a + e*b + d;
}
cout << x <<endl;
*/
/*
int a,b,c,d,e,f;
... | [["-", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22]] | 1 | 93 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, pasta, juice;
cin >> a >> b >> c >> d >> e;
pasta = a;
if (a >= b) {
pasta = b;
if (b >= c) {
pasta = c;
}
}
juice = d;
if (d >= e)
juice = e;
int sum = pasta + juice - 50;
cout << sum << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, pasta, juice;
cin >> a >> b >> c >> d >> e;
pasta = a;
if (a >= b)
pasta = b;
if (pasta >= c)
pasta = c;
juice = d;
if (d >= e)
juice = e;
int sum = pasta + juice - 50;
cout << sum << endl;
return 0... | [["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 99 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[3];
int price_j[2];
for (int i = 0; i < 3; i++) {
cin >> price[i];
}
for (int i = 0; i < 2; i++) {
cin >> price_j[i];
}
int min, min_j;
min = min_j = 3000;
for (int i = 0; i < 3; i++) {
if (min > price[... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int price[3];
int price_j[2];
for (int i = 0; i < 3; i++) {
cin >> price[i];
}
for (int i = 0; i < 2; i++) {
cin >> price_j[i];
}
int min, min_j;
min = min_j = 3000;
for (int i = 0; i < 3; i++) {
if (min > price[... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]] | 1 | 164 | 4 |
#include <stdio.h>
main() {
int a, b, c, d, e;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
int m, n;
if (a < b)
if (a > c)
m = c;
else
m = a;
else if (b > c)
m = c;
else
m = b;
if (d < e)
n = d;
else
n = e;
int S;
... | #include <stdio.h>
main() {
int a, b, c, d, e;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
int m, n;
if (a < b)
if (a > c)
m = c;
else
m = a;
else if (b > c)
m = c;
else
m = b;
if (d < e)
n = d;
else
n = e;
int S;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 148 | 4 |
#include <iostream>
using namespace std;
int main() {
int pa, ju, most = 10000, ans;
for (int i = 0; i < 3; i++) {
cin >> pa;
if (pa < ans) {
most = pa;
}
}
ans = most;
most = 10000;
for (int i = 0; i < 2; i++) {
cin >> ju;
if (ju < most) {
most = ju;
}
}
ans += most ... | #include <iostream>
using namespace std;
int main() {
int pa, ju, most = 10000, ans;
for (int i = 0; i < 3; i++) {
cin >> pa;
if (pa < most) {
most = pa;
}
}
ans = most;
most = 10000;
for (int i = 0; i < 2; i++) {
cin >> ju;
if (ju < most) {
most = ju;
}
}
ans += most... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 110]] | 1 | 112 | 6 |
#include <iostream>
using namespace std;
int main() {
int p[3], j[2], t, p2, j2;
for (int i = 0; i < 3; i++)
cin >> p[i];
for (int i = 0; i < 2; i++)
cin >> j[i];
for (int i = 0; i < 3; i++) {
for (int k = 0; k < 2; k++)
if (p[k] > p[k + 1]) {
t = p[k];
p[k] = p[k + 1];
... | #include <iostream>
using namespace std;
int main() {
int p[3], j[2], t, p2, j2;
for (int i = 0; i < 3; i++)
cin >> p[i];
for (int i = 0; i < 2; i++)
cin >> j[i];
for (int i = 0; i < 3; i++) {
for (int k = 0; k < 2; k++)
if (p[k] > p[k + 1]) {
t = p[k];
p[k] = p[k + 1];
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 203 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min(a, b) + min({c, d, e}) - 50 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << min({a, b, c}) + min({d, e}) - 50 << endl;
} | [["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 45], ["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 21], ["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 22], ["+", 31, 16, 31, 2, 3, 4, 0, 83, 0, 46], ["-", 31, 16, 12, 2, 3, 4, 0, 83, 0, 22], ["-", 31, 16, 12, 2, 3, 4, 0, 83, 0, 21]] | 1 | 61 | 6 |
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
@SuppressWarnings("unchecked")
private void... |
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
@SuppressWarnings("unchecked")
private void... | [["-", 0, 503, 49, 200, 51, 227, 497, 505, 0, 22], ["+", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499]] | 3 | 371 | 2 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final int N = sc.nextInt();
final int K = sc.nextInt();
int[] g_count = new int[10];
Arr... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final int N = sc.nextInt();
final int K = sc.nextInt();
int[] g_count = new int[10];
Arr... | [["-", 0, 1, 0, 492, 3, 4, 0, 504, 71, 499], ["+", 0, 1, 0, 492, 3, 4, 0, 504, 71, 499]] | 3 | 666 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> pr(10, vector<int>(n + 1, 0));
vector<int> ko(10, 0);
for (int i = 0; i < n; i++) {
int c, g;
cin >> c >> g;
g--;
pr[g][ko[g]] = c;
ko... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> pr(10, vector<int>(n + 1, 0));
vector<int> ko(10, 0);
for (int i = 0; i < n; i++) {
int c, g;
cin >> c >> g;
g--;
pr[g][ko[g]] = c;
ko... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 401 | 2 |
/*
* 低知能マン
*/
#include <stdio.h>
#include <stdlib.h>
int dp[11][2001];
int books[10][2001];
int book_nums[10];
int sell_prices[10][2001];
int greater_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int a, b, c, d;
int n, k;
int max;
scanf("%d %d", &n, &k);
for (a = 0; ... | /*
* 低知能マン
*/
#include <stdio.h>
#include <stdlib.h>
int dp[11][2001];
int books[10][2001];
int book_nums[10];
int sell_prices[10][2001];
int greater_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int a, b, c, d;
int n, k;
int max;
scanf("%d %d", &n, &k);
for (a = 0; ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 443 | 6 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, latte[2001] = {0};
for (int i = 1; i <= 2000; i++)
latte[i] = (i - 1) * i;
cin >> N >> K;
vector<vector<int>> books(10);
for (int i = 0; i < N; i++) {
int v, j;
cin >> v >> j;
j--;
books... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, latte[2001] = {0};
for (int i = 1; i <= 2000; i++)
latte[i] = (i - 1) * i;
cin >> N >> K;
vector<vector<int>> books(10);
for (int i = 0; i < N; i++) {
int v, j;
cin >> v >> j;
j--;
books... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 31, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 31, 16, 12, 69, 28, 69, 341, 342, 0, 13]] | 1 | 475 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int memo[11][2001];
int N, K, sum[11][2010];
vector<int> B[11];
int rec(int g, int k) {
if (memo[g][k] != -1)
return memo[g][k];
if (g > 10)
return 0;
int res = 0;
int s = B[g].size();... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int memo[12][2010];
int N, K, sum[12][2010];
vector<int> B[11];
int rec(int g, int k) {
if (memo[g][k] != -1)
return memo[g][k];
if (g > 10)
return 0;
int res = 0;
int s = B[g].size();... | [["-", 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], ["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120]] | 1 | 347 | 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.