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>
using namespace std;
int main() {
int a, b;
string op;
cin >> a;
while (1) {
cin >> op;
if (op == "=")
break;
cin >> b;
if (op == "+")
a = a + b;
if (op == "-")
a = a - b;
if (op == "*")
a = a * b;
if (op == "/")
a = a / b;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string op;
cin >> a;
while (1) {
cin >> op;
if (op == "=")
break;
cin >> b;
if (op == "+")
a = a + b;
if (op == "-")
a = a - b;
if (op == "*")
a = a * b;
if (op == "/")
a = a / b;
... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 113 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int in;
char TDN;
int YJSNPI;
cin >> in;
cin >> TDN;
YJSNPI = in;
while (1) {
if (TDN == '=') {
cout << YJSNPI << endl;
break;
}
cin >> in;
if (TDN == '*')
YJSNPI += in;
if (TDN == '+')
YJSNPI += i... | #include <iostream>
using namespace std;
int main(void) {
int in;
char TDN;
int YJSNPI;
cin >> in;
cin >> TDN;
YJSNPI = in;
while (1) {
if (TDN == '=') {
cout << YJSNPI << endl;
break;
}
cin >> in;
if (TDN == '*')
YJSNPI *= in;
if (TDN == '+')
YJSNPI += i... | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 108]] | 1 | 117 | 2 |
#include <cstdio>
using namespace std;
int in(void) {
int x;
scanf("%d", &x);
return (x);
}
int main() {
char symbol = '+';
int ans = 0;
do {
if (symbol == '+')
ans += in();
if (symbol == '-')
ans -= in();
if (symbol == '*')
ans *= in();
if (symbol == '/')
ans /= ... | #include <cstdio>
using namespace std;
int in(void) {
int x;
scanf("%d", &x);
return (x);
}
int main() {
char symbol = '+';
int ans = 0;
do {
if (symbol == '+')
ans += in();
if (symbol == '-')
ans -= in();
if (symbol == '*')
ans *= in();
if (symbol == '/')
ans /= ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 142 | 2 |
nums = []
oprs = []
loop do
t = gets.strip
if t == "="
break
elsif t.match /^\d+$/
nums.push t.to_i
else
oprs.push t.to_sym
end
end
p nums.inject do |a, b|
a.method(oprs.shift).call(b)
end | nums = []
oprs = []
loop do
t = gets.strip
if t == "="
break
elsif t.match /^\d+$/
nums.push t.to_i
else
oprs.push t.to_sym
end
end
p nums.inject{|a, b| a.method(oprs.shift).call(b) } | [["-", 36, 36, 0, 493, 0, 652, 196, 737, 0, 170], ["+", 0, 652, 3, 4, 0, 652, 196, 196, 0, 45], ["-", 36, 36, 0, 493, 0, 652, 196, 737, 0, 444], ["+", 0, 652, 3, 4, 0, 652, 196, 196, 0, 46]] | 4 | 70 | 4 |
a=$<.map(&:strip)
r=a[0]
c=1
while 2*c<a.size
r=eval(r+a[2*c-1]+a[2*c]).to_s
c+=1
end
p r | a=$<.map(&:strip)
r=a[0]
c=1
while 2*c<a.size
r=eval(r+a[2*c-1]+a[2*c]).to_s
c+=1
end
puts r | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 56 | 2 |
a = int(input())
while True:
b = input();
if b == '=':
break
c = int(input())
if b == '+':
a += c
elif b == '-':
a -= c
elif b == '*':
a *= c
elif b == '/':
a /= c
print(a) | a = int(input())
while True:
b = input();
if b == '=':
break
c = int(input())
if b == '+':
a += c
elif b == '-':
a -= c
elif b == '*':
a *= c
elif b == '/':
a //= c
print(a) | [["-", 75, 665, 64, 196, 0, 1, 0, 677, 17, 90], ["+", 75, 665, 64, 196, 0, 1, 0, 677, 17, 691]] | 5 | 77 | 2 |
# AOJ 0588: Simple Calculator
# Python3 2018.6.30 bal4u
a = int(input())
while True:
op = input().strip()
if op == '=': break
b = int(input())
if op == '+': a += b
elif s == '-': a -= b
elif s == '*': a *= b
else: a //= b
print(a)
| # AOJ 0588: Simple Calculator
# Python3 2018.6.30 bal4u
a = int(input())
while True:
op = input().strip()
if op == '=': break
b = int(input())
if op == '+': a += b
elif op == '-': a -= b
elif op == '*': a *= b
else: a //= b
print(a)
| [["-", 8, 196, 0, 57, 75, 665, 15, 666, 0, 22], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 0, 22]] | 5 | 77 | 4 |
#include <stdio.h>
#include <string.h>
#define SWAP(type, a, b) \
do { \
type temp = a; \
a = b; ... | #include <stdio.h>
#include <string.h>
#define SWAP(type, a, b) \
do { \
type temp = a; \
a = b; ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47]] | 0 | 416 | 2 |
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int k[16000000];
int n, a, z, cnt;
string S;
int main() {
memset(k, 0, sizeof(k));
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S;
z = 0;
for (int j = 0; j < S.size(); j++) {
z += (int)(S[j] - 'A' ... | #include <cmath>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int k[16000000];
int n, a, z, cnt;
string S;
int main() {
memset(k, 0, sizeof(k));
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S;
z = 0;
for (int j = 0; j < S.size(); j++) {
z += (int)(S[j] - 'A' ... | [["-", 0, 57, 64, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 245 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
bool cmp(const string &a, const string &b) {
if (a.size() != b.size())
return a.size() < b.size();
for (int i = 0; i < a.size(); i++) {
if (a[i] == b[i])
continue;
return a[i] < b[i];
}
return fa... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
bool cmp(const string &a, const string &b) {
if (a.size() != b.size())
return a.size() < b.size();
for (int i = 0; i < a.size(); i++) {
if (a[i] == b[i])
continue;
return a[i] < b[i];
}
return fa... | [["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 7, 8, 1, 0, 16, 31, 16, 17, 151]] | 1 | 267 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
bool cmp(const pair<string, int> &x, const pair<string, int> &y) {
if (x.first.size() != y.first.size()) {
return x.first < y.first;
}
return x.first.size() < y.first.size();
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
bool cmp(const pair<string, int> &x, const pair<string, int> &y) {
if (x.first.size() == y.first.size()) {
return x.first < y.first;
}
return x.first.size() < y.first.size();
}
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 292 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int memo[201][201];
int d, n;
int t[200];
int a[200], b[200], c[200];
int rec(int k, int prev) {
if (memo[k][prev] != -1)
return memo[k][prev];
if (k == d)
return 0;
int best = 0;
for (int next = 0; next < n; next++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int memo[201][201];
int d, n;
int t[200];
int a[200], b[200], c[200];
int rec(int k, int prev) {
if (memo[k][prev] != -1)
return memo[k][prev];
if (k == d)
return 0;
int best = 0;
for (int next = 0; next < n; next++) {
... | [["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13]] | 1 | 338 | 2 |
#include <bits/stdc++.h>
using namespace std;
int dp[250][150], T[250], x[250][3], D, N, MAX;
main() {
memset(dp, -99999, sizeof(dp));
cin >> D >> N;
for (int i = 1; i <= D; i++) {
cin >> T[i];
}
for (int i = 1; i <= N; i++) {
cin >> x[i][0] >> x[i][1] >> x[i][2];
if (T[1] >= x[i][0] && T[1] <= x[... | #include <bits/stdc++.h>
using namespace std;
int dp[250][150], T[250], x[250][3], D, N, MAX;
main() {
memset(dp, -999999, sizeof(dp));
cin >> D >> N;
for (int i = 1; i <= D; i++) {
cin >> T[i];
}
for (int i = 1; i <= N; i++) {
cin >> x[i][0] >> x[i][1] >> x[i][2];
if (T[1] >= x[i][0] && T[1] <= x... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 340 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int dp[300][110], l[300], r[300], p[300], n, m, a[300];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i] >> p[i];
for (int i = 0; i < 33000; i++)
dp[i / 110][i % 110] = -... | #include <algorithm>
#include <iostream>
using namespace std;
int dp[300][110], l[300], r[300], p[300], n, m, a[300];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> l[i] >> r[i] >> p[i];
for (int i = 0; i < 33000; i++)
dp[i / 110][i % 110] = -... | [["-", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 13], ["-", 51, 16, 12, 16, 12, 69, 341, 342, 0, 13], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 22]] | 1 | 362 | 4 |
#include <bits/stdc++.h>
using namespace std;
int t[200];
int a[200], b[200], c[200];
int dp[200][200];
int main() {
int d, n;
cin >> d >> n;
for (int i = 0; i < d; ++i) {
cin >> t[i];
}
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i] >> c[i];
}
for (int i = 1; i < d; ++i) {
for (int ... | #include <bits/stdc++.h>
using namespace std;
int t[200];
int a[200], b[200], c[200];
int dp[200][200];
int main() {
int d, n;
cin >> d >> n;
for (int i = 0; i < d; ++i) {
cin >> t[i];
}
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i] >> c[i];
}
for (int i = 1; i < d; ++i) {
for (int ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19]] | 1 | 301 | 44 |
#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... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 593 | 2 |
#include <algorithm>
#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 namespace std;
#defin... | #include <algorithm>
#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 namespace std;
#defin... | [["-", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 13]] | 1 | 480 | 2 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100000001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using nam... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100000001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using nam... | [["-", 0, 16, 31, 118, 28, 69, 341, 342, 0, 13], ["+", 0, 16, 31, 118, 28, 69, 341, 342, 0, 13]] | 1 | 558 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int d, n;
cin >> d >> n;
int dp[205][105];
for (int i = 0; i < 205; i++)
for (int j = 0; j < 205; j++)
dp[i][j] = 1e7;
int temp[205];
int a[205], b[205], c[205];
for (int i = 1; i <= d... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int d, n;
cin >> d >> n;
int dp[205][105];
for (int i = 0; i < 205; i++)
for (int j = 0; j < 105; j++)
dp[i][j] = -1e7;
int temp[205];
int a[205], b[205], c[205];
for (int i = 1; i <= ... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 7, 8, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 7, 8, 1, 0, 11, 12, 13], ["-", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 7, 8, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 7, 8, 1, 0, 11, 12, 2, ... | 1 | 360 | 12 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int d, n, t, a, b, c, dp[202][202];
vector<int> T, A, B, C;
cin >> d >> n;
T.clear();
A.clear();
B.clear();
C.clear();
for (int i = 0; i < d; i++) {
cin >> t;
T.push_back(t);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int d, n, t, a, b, c, dp[202][202];
vector<int> T, A, B, C;
cin >> d >> n;
T.clear();
A.clear();
B.clear();
C.clear();
for (int i = 0; i < d; i++) {
cin >> t;
T.push_back(t);
... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 469 | 6 |
#include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
int T[200], A[200], B[200], C[200], D, N;
int Cs[200][200], CsNumber[200], valueCs[200][200];
inline void readinput() {
// ifstream fin("input_2012_4.dat");
cin >> D >> N;
for (int i = 0; i < D; i++)
cin >> T[i];
for (int i = 0;... | #include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
int T[200], A[200], B[200], C[200], D, N;
int Cs[200][200], CsNumber[200], valueCs[200][200];
inline void readinput() {
// ifstream fin("input_2012_4.dat");
cin >> D >> N;
for (int i = 0; i < D; i++)
cin >> T[i];
for (int i = 0;... | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 549 | 4 |
///
// File: 0579.go
// Author: ymiyamoto
//
// Created on Mon Mar 19 18:46:50 2018
//
package main
import (
"fmt"
)
var D, N int
type cloth struct {
A, B, C int
}
func abs(a int) int {
if a > 0 {
return a
}
return -a
}
func max(a, b int) int {
if a < b {
return b
}
return a
}
func main() {
fmt.Scan... | ///
// File: 0579.go
// Author: ymiyamoto
//
// Created on Mon Mar 19 18:46:50 2018
//
package main
import (
"fmt"
)
var D, N int
type cloth struct {
A, B, C int
}
func abs(a int) int {
if a > 0 {
return a
}
return -a
}
func max(a, b int) int {
if a < b {
return b
}
return a
}
func main() {
fmt.Scan... | [["-", 0, 7, 0, 430, 10, 431, 12, 432, 0, 433], ["+", 0, 7, 0, 430, 10, 431, 12, 432, 0, 433]] | 7 | 410 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
typedef unsigned long long ull;
const int MAX_N = 50;
int N, K;
int x1[MAX_N], y1[MAX_N], d1[MAX_N], x2[MAX_N], y2[MAX_N], d2[MAX_N];
int countKind(int x, int y, int d) {
int ans = 0;
x++;
y++;
d++;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
typedef unsigned long long ull;
const int MAX_N = 50;
int N, K;
int x1[MAX_N], y1[MAX_N], d1[MAX_N], x2[MAX_N], y2[MAX_N], d2[MAX_N];
int countKind(int x, int y, int d) {
int ans = 0;
x++;
y++;
d++;
for (int i = 0; i < N; i++) {
... | [["+", 64, 16, 31, 16, 31, 2, 63, 23, 0, 22], ["+", 64, 16, 31, 16, 31, 2, 63, 23, 0, 25], ["+", 64, 16, 31, 16, 31, 2, 3, 4, 0, 24]] | 1 | 496 | 3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> X1(N);
vector<int> Y1(N);
vector<int> D1(N);
vector<int> X2(N);
vector<int> Y2(N);
vector<int> D2(N);
for (int i = 0; i < N; i++) {
cin >> X1[i] >> Y1[i] >> D1[i] >>... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> X1(N);
vector<int> Y1(N);
vector<int> D1(N);
vector<int> X2(N);
vector<int> Y2(N);
vector<int> D2(N);
for (int i = 0; i < N; i++) {
cin >> X1[i] >> Y1[i] >> D1[i] >>... | [["+", 31, 16, 31, 74, 39, 77, 39, 86, 0, 96], ["+", 31, 16, 31, 74, 39, 77, 39, 86, 39, 40], ["+", 0, 11, 12, 16, 31, 16, 31, 74, 0, 25], ["+", 12, 16, 31, 16, 31, 74, 51, 23, 0, 24]] | 1 | 534 | 23 |
/**
* @brief 最近点対の発見について扱います
* @date 2016/03/22
*/
//****************************************
// 必要なヘッダファイルのインクルード
//****************************************
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
//****************************************
// オブジェクト形式マクロの... | /**
* @brief 最近点対の発見について扱います
* @date 2016/03/22
*/
//****************************************
// 必要なヘッダファイルのインクルード
//****************************************
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
//****************************************
// オブジェクト形式マクロの... | [["-", 0, 11, 12, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 2, 63, 22]] | 1 | 961 | 2 |
/**
* @brief 最近点対の発見について扱います
* @note 関連URL:
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0585
* @date 2016/03/22
*/
//****************************************
// 必要なヘッダファイルのインクルード
//****************************************
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iost... | /**
* @brief 最近点対の発見について扱います
* @note 関連URL:
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0585
* @date 2016/03/22
*/
//****************************************
// 必要なヘッダファイルのインクルード
//****************************************
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iost... | [["-", 0, 11, 12, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 2, 63, 22]] | 1 | 1,284 | 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 long long ll;
typ... | #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 long long ll;
typ... | [["-", 0, 134, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 133], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 446 | 6 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX 500000
typedef pair<int, int> P;
int N;
P A[MAX];
bool compare_y(P a, P b) { return a.second < b.second; }
int clos... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX 500000
typedef pair<int, int> P;
int N;
P A[MAX];
bool compare_y(P a, P b) { return a.second < b.second; }
int clos... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 369 | 1 |
#include <stdio.h>
int main(void) {
int n, m, k, s;
scanf("%d %d", &n, &m);
s = m;
int max = s;
int i[10000][2] = {};
for (k = 0; k < n; k++) {
scanf("%d %d", &i[k][0], &i[k][1]);
s += i[k][0];
s -= i[k][1];
if (s < 0) {
printf("0\n");
break;
}
if (max < s)
max... | #include <stdio.h>
int main(void) {
int n, m, k, s;
scanf("%d %d", &n, &m);
s = m;
int max = s;
int i[10000][2] = {};
for (k = 0; k < n; k++) {
scanf("%d %d", &i[k][0], &i[k][1]);
s += i[k][0];
s -= i[k][1];
if (s < 0) {
max = 0;
break;
}
if (max < s)
max = s;... | [["-", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 25]] | 0 | 153 | 8 |
/*AOJ No.5687 Tunnel*/
#include <stdio.h>
int main() {
int n; /*time*/
int tunnel;
int i;
int max;
int incar;
int outcar;
char check = 1;
scanf("%d", &n);
scanf("%d", &tunnel);
max = tunnel;
for (i = 0; i < n; i++) {
scanf("%d %d", &incar, &outcar);
tunnel += incar;
tunnel -= out... | #include <stdio.h>
int main() {
int n;
int tunnel;
int i;
int max;
int incar;
int outcar;
char check = 1;
scanf("%d", &n);
scanf("%d", &tunnel);
max = tunnel;
for (i = 0; i < n; i++) {
scanf("%d %d", &incar, &outcar);
tunnel += incar;
tunnel -= outcar;
if (tunnel < 0) {
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22]] | 0 | 150 | 2 |
#include <stdio.h>
int main(void) {
int n, m, i, j, count[10001], carin, carout, in, out, box, zero;
scanf("%d", &n);
scanf("%d", &m);
for (i = 1; i <= n; i++) {
scanf("%d %d", &in, &out);
if (i == 1) {
count[i] = m + in - out;
} else
count[i] = count[i - 1] + in - out;
if (cou... | #include <stdio.h>
int main(void) {
int n, m, i, j, count[10001], carin, carout, in, out, box, zero = 1;
scanf("%d", &n);
scanf("%d", &m);
for (i = 1; i <= n; i++) {
scanf("%d %d", &in, &out);
if (i == 1) {
count[i] = m + in - out;
} else
count[i] = count[i - 1] + in - out;
if ... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 224 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m, sum, in, out, max;
bool FLG = true;
scanf("%d", &n);
scanf("%d", &m);
sum = m;
max = m;
for (int i = 0; i < n; i++) {
scanf("%d %d", &in, &o... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m, sum, in, out, max;
bool FLG = true;
scanf("%d", &n);
scanf("%d", &m);
sum = m;
max = m;
for (int i = 0; i < n; i++) {
scanf("%d %d", &in, &o... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 1, 0, 11, 12, 23, 0, 24], ["+", 8, 9, 0, 1, 0, 11, 12, 23, 0, 25]] | 1 | 156 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans, inc, outc;
cin >> n >> m;
ans = m;
while (n--) {
cin >> inc >> outc;
m = ans;
m += inc - outc;
if (m < 0) {
cout << 0 << endl;
return 0;
}
ans = max(m, ans);
}
cout << ans << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans, inc, outc;
cin >> n >> m;
ans = m;
while (n--) {
cin >> inc >> outc;
m += inc - outc;
if (m < 0) {
cout << 0 << endl;
return 0;
}
ans = max(m, ans);
}
cout << ans << endl;
return 0;
} | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22]] | 1 | 91 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int maxn = 0;
cin >> n;
cin >> m;
int *in = new int[n];
int *out = new int[n];
int *S = new int[n + 1];
for (int i = 0; i < n; ++i)
cin >> in[i] >> out[i];
S[0] = m;
for (int i = 0; i < n; ++i) {
S[i + 1] = m + in[i] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int maxn = 0;
cin >> n;
cin >> m;
int *in = new int[n];
int *out = new int[n];
int *S = new int[n + 1];
for (int i = 0; i < n; ++i)
cin >> in[i] >> out[i];
S[0] = m;
for (int i = 0; i < n; ++i) {
S[i + 1] = m + in[i] -... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 210 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, cnt, in, out, mx;
cin >> n >> cnt;
mx = cnt;
while (n--) {
cin >> in >> out;
cnt += in - out;
mx = max(mx, cnt);
if (cnt < 0) {
cout << 0 << endl;
return 0;
}
}
cout << cnt << endl;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, cnt, in, out, mx;
cin >> n >> cnt;
mx = cnt;
while (n--) {
cin >> in >> out;
cnt += in - out;
mx = max(mx, cnt);
if (cnt < 0) {
cout << 0 << endl;
return 0;
}
}
cout << mx << endl;
r... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 90 | 2 |
#include <cstdio>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
int ans = m;
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
m += (a - b);
if (m < 0)
return (!printf("0\n"));
else
ans = m > ans ? m : ans;
}
return (!printf("%d\n", m)... | #include <cstdio>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
int ans = m;
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
m += (a - b);
if (m < 0)
return (!printf("0\n"));
else
ans = m > ans ? m : ans;
}
return (!printf("%d\n", an... | [["-", 0, 23, 0, 91, 28, 2, 3, 4, 0, 22], ["+", 0, 23, 0, 91, 28, 2, 3, 4, 0, 22]] | 1 | 120 | 2 |
n=int(input())
ans=c=m=int(input())
for i in[0]*n:
a,b=map(int,input().split())
if c<0:ans=0;break
c+=a-b
ans=max(ans,c) | n=int(input())
ans=c=m=int(input())
for i in[0]*n:
a,b=map(int,input().split())
if c<0:ans=0;break
c+=a-b
ans=max(ans,c)
print(ans) | [["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 68 | 4 |
n = int(input())
m = int(input())
maxd = m
for i in range(n):
inn, out = map(int, input().split())
m += inn - out
if m > maxd:
maxd = m
elif m < 0:
m = 0
break
print(maxd)
| n = int(input())
m = int(input())
maxd = m
for i in range(n):
inn, out = map(int, input().split())
m += inn - out
if m > maxd:
maxd = m
elif m < 0:
maxd = 0
break
print(maxd)
| [["-", 75, 665, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 75, 665, 64, 196, 0, 1, 0, 662, 31, 22]] | 5 | 69 | 2 |
#include <stdio.h>
int main(void) {
int scr[5];
int sum = 0;
int i;
for (i = 0; i < 5; i++)
;
scanf("%d", &scr[i]);
for (i = 0; i < 5; i++) {
if (scr[i] < 40)
scr[i] = 40;
}
for (i = 0; i < 5; i++)
sum += scr[i];
printf("%d\n", sum / 5);
return 0;
} | #include <stdio.h>
int main(void) {
int scr[5];
int sum = 0;
int i;
for (i = 0; i < 5; i++)
scanf("%d", &scr[i]);
for (i = 0; i < 5; i++) {
if (scr[i] < 40)
scr[i] = 40;
}
for (i = 0; i < 5; i++)
sum += scr[i];
printf("%d\n", sum / 5);
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 8, 1, 0, 35]] | 0 | 116 | 1 |
#include <stdio.h>
int main(void) {
int a;
int b;
int c;
int d;
int x;
int y;
int z;
scanf("%d\n%d\n%d\n%d\n%d\n", &a, &b, &c, &d, &z);
if (a < 40) {
a = 40;
} else if (b < 40) {
b = 40;
} else if (c < 40) {
c = 40;
} else if (d < 40) {
d = 40;
} else if (z < 40) {
z = 40;
... | #include <stdio.h>
int main(void) {
int a;
int b;
int c;
int d;
int x;
int y;
int z;
scanf("%d\n%d\n%d\n%d\n%d\n", &a, &b, &c, &d, &z);
if (a < 40) {
a = 40;
}
if (b < 40) {
b = 40;
}
if (c < 40) {
c = 40;
}
if (d < 40) {
d = 40;
}
if (z < 40) {
z = 40;
}
y = a ... | [["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 0 | 156 | 4 |
#include <stdio.h>
int i, j, k;
int main() {
for (; i < 5; i++) {
scanf("%d", &j);
k += j;
}
printf("%d\n", k / 5);
return 0;
} | #include <stdio.h>
int i, j, k;
int main() {
for (; i < 5; i++) {
scanf("%d", &j);
k += j < 40 ? 40 : j;
}
printf("%d\n", k / 5);
return 0;
} | [["+", 0, 1, 0, 11, 12, 41, 15, 16, 17, 18], ["+", 0, 1, 0, 11, 12, 41, 15, 16, 12, 13], ["+", 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], ["+", 8, 9, 0, 1, 0, 11, 12, 41, 75, 22]] | 0 | 56 | 6 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a[10];
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] < 40)
a[i] = 40;
sum += a[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a[10];
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] < 40)
a[i] = 40;
sum += a[i];
}
cout << sum / 5 << endl;
}
| [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 80 | 2 |
#include <stdio.h>
int a, i, sum = 0;
int main(void) {
for (i = 0; i < 5; i++) {
scanf("%d", &a);
if (a < 40) {
a = 40;
}
sum += a;
}
printf("%d\n", sum);
} | #include <stdio.h>
int a, i, sum = 0;
int main(void) {
for (i = 0; i < 5; i++) {
scanf("%d", &a);
if (a < 40) {
a = 40;
}
sum += a;
}
sum /= 5;
printf("%d\n", sum);
} | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 90], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 69 | 4 |
#include <iostream>
using namespace std;
int main() {
int a;
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a;
if (a < 40)
sum += 40;
else
sum += a;
}
sum = sum / 5;
cout << a << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a;
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a;
if (a < 40)
sum += 40;
else
sum += a;
}
sum = sum / 5;
cout << sum << endl;
return 0;
} | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 70 | 2 |
#include <stdio.h>
int main() {
int s = 0, x;
for (int i = 0; i < 5; i++) {
scanf("%d", &x);
if (x < 40)
x = 40;
s += x;
}
printf("%d\n", x / 5);
return 0;
} | #include <stdio.h>
int main() {
int s = 0, x;
for (int i = 0; i < 5; i++) {
scanf("%d", &x);
if (x < 40)
x = 40;
s += x;
}
printf("%d\n", s / 5);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22]] | 1 | 70 | 2 |
#include <stdio.h>
int main(void) {
int t, j, sa, shi, h;
int ans;
scanf("%d %d %d %d %d", &t, &j, &sa, &shi, &h);
if (t < 40) {
t = 40;
}
if (j < 40) {
j = 40;
}
if (sa < 40) {
sa = 40;
}
if (shi < 40) {
shi = 40;
}
if (h < 40) {
j = 40;
}
ans = (t + j + sa + shi + h)... | #include <stdio.h>
int main(void) {
int t, j, sa, shi, h;
int ans;
scanf("%d %d %d %d %d", &t, &j, &sa, &shi, &h);
if (t < 40) {
t = 40;
}
if (j < 40) {
j = 40;
}
if (sa < 40) {
sa = 40;
}
if (shi < 40) {
shi = 40;
}
if (h < 40) {
h = 40;
}
ans = (t + j + sa + shi + h)... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22]] | 1 | 134 | 2 |
#include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int ave = 0;
for (int i = 0; i < 6; i++) {
int a;
scanf("%d", &a);
ave += max(40, a);
}
printf("%d\n", ave / 6);
} | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int ave = 0;
for (int i = 0; i < 5; i++) {
int a;
scanf("%d", &a);
ave += max(40, a);
}
printf("%d\n", ave / 5);
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 73 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, x;
for (int i = 0; i < 5; i++) {
cin >> x;
sum += x;
}
cout << sum / 5 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, x;
for (int i = 0; i < 5; i++) {
cin >> x;
sum += max(40, x);
}
cout << sum / 5 << endl;
return 0;
} | [["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 54 | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
int b;
for (int c = 0; c < 5; c++) {
scanf("%d", &b);
if (b < 40)
b = 40;
a += b;
}
printf("%d\n", a);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
int b;
for (int c = 0; c < 5; c++) {
scanf("%d", &b);
if (b < 40)
b = 40;
a += b;
}
printf("%d\n", a / 5);
} | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 85], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 70 | 2 |
#include <stdio.h>
int average(int a[]) {
int i, sum = 0;
for (i = 0; i < 5; i++) {
if (a[i] < 40) {
a[i] = 40;
}
sum = sum + a[i];
}
return (sum / 5);
}
int main(void) {
int a[5];
int s;
int i;
for (i = 0; i < 5; i++) {
scanf("5d", &a[i]);
}
s = average(a);
printf("%d\n", ... | #include <stdio.h>
int average(int a[]) {
int i, sum = 0;
for (i = 0; i < 5; i++) {
if (a[i] < 40) {
a[i] = 40;
}
sum = sum + a[i];
}
return (sum / 5);
}
int main(void) {
int a[5];
int s;
int i;
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
s = average(a);
printf("%d\n",... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 137 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int data;
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> data;
if (data < 40)
data = 40;
sum += data;
}
cout << data / 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int data;
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> data;
if (data < 40)
data = 40;
sum += data;
}
cout << sum / 5 << endl;
return 0;
}
| [["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22]] | 1 | 65 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (in... | [["+", 0, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 99 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int d, ret = 0;
for (int i = 0; i < 5; i++) {
cin >> d;
ret += max(ret, 40);
}
cout << ret / 5 << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int d, ret = 0;
for (int i = 0; i < 5; i++) {
cin >> d;
ret += max(d, 40);
}
cout << ret / 5 << endl;
} | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 58 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int ans = 0, a;
for (int i = 0; i < 5; i++) {
cin >> a;
ans += a;
}
cout << ans / 5 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int ans = 0, a;
for (int i = 0; i < 5; i++) {
cin >> a;
ans += max(40, a);
}
cout << ans / 5 << endl;
return 0;
} | [["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 59 | 5 |
#include <iostream>
using namespace std;
int main() {
int sum = 0;
// your code goes here
for (int i = 0; i < 5; i++) {
int r;
cin >> r;
sum += max(r, 40);
}
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int sum = 0;
// your code goes here
for (int i = 0; i < 5; i++) {
int r;
cin >> r;
sum += max(r, 40);
}
cout << sum / 5 << endl;
return 0;
} | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 59 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int sum = 0, x;
while (cin >> x)
sum += min(40, x);
cout << sum / 5 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int sum = 0, x;
while (cin >> x)
sum += max(40, x);
cout << sum / 5 << endl;
return 0;
} | [["-", 0, 52, 8, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 52, 8, 1, 0, 11, 12, 2, 63, 22]] | 1 | 47 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
for (int i = 0; i < 5; i++) {
int p;
scanf("%d", &p);
a += min(8, p / 5);
}
printf("%d\n", a);
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
for (int i = 0; i < 5; i++) {
int p;
scanf("%d", &p);
a += max(8, p / 5);
}
printf("%d\n", a);
return (0);
} | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 72 | 2 |
#include <stdio.h>
int main() {
int i, j, N, M, A[1000], B[1000], score[1000], max;
scanf("%d %d", &N, &M);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
score[i] = 0;
}
for (j = 0; j < M; j++) {
scanf("%d", &B[j]);
i = 0;
while (A[i] > B[j]) {
i++;
}
score[i]++;
}
max =... | #include <stdio.h>
int main() {
int i, j, N, M, A[1000], B[1000], score[1000], max;
scanf("%d %d", &N, &M);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
score[i] = 0;
}
for (j = 0; j < M; j++) {
scanf("%d", &B[j]);
i = 0;
while (A[i] > B[j]) {
i++;
}
score[i]++;
}
max =... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 185 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define Rep(i, N) for (int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define F first
#define S second
int main() {
int N, M;
int cost[1005];
int cnt[1005] = {0};
cin >> N >> M;
Rep(i, N) cin >> cost[i];
int data;
while (M--) {
cin >> data;
Rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, N) for (int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define F first
#define S second
int main() {
int N, M;
int cost[1005];
int cnt[1005] = {0};
cin >> N >> M;
Rep(i, N) cin >> cost[i];
int data;
while (M--) {
cin >> data;
Rep(i, ... | [["-", 0, 1, 0, 16, 31, 16, 12, 66, 17, 48], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 17, 33], ["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 134 | 5 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <string>
#define FOR(i, a) for (int i = 0; i < a; i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n];
int b[m];
int ans[n];
int maxcount = 0;
FOR(i, n) {
cin >> a[i];
ans... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <string>
#define FOR(i, a) for (int i = 0; i < a; i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n];
int b[m];
int ans[n];
int maxcount = 0;
FOR(i, n) {
cin >> a[i];
ans... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 175 | 2 |
#include <stdio.h>
typedef struct Competition {
int cost, vote;
} Competition;
int main() {
int i, j, n, m, cost, max_vote = 0, max_index;
Competition sports[1000];
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++) {
sports[i].vote = 0;
scanf("%d", &sports[i].cost);
}
for (i = 0; i < m; i++) {
... | #include <stdio.h>
typedef struct Competition {
int cost, vote;
} Competition;
int main() {
int i, j, n, m, cost, max_vote = 0, max_index;
Competition sports[1000];
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++) {
sports[i].vote = 0;
scanf("%d", &sports[i].cost);
}
for (i = 0; i < m; i++) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22]] | 1 | 199 | 2 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
typedef long long LL;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
typedef long long LL;
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 421 | 2 |
# coding: utf-8
N, M = list(map(int, input().split(' ')))
A = [int(input()) for _ in range(N)]
B = [int(input()) for _ in range(M)]
scores = [0 for _ in range(N)]
for j in range(M):
for i in range(N):
if A[i] <= B[j]:
scores[i] += 1
break
max_i, max_val = 0, 0
for i in range(1, N)... | # coding: utf-8
N, M = list(map(int, input().split(' ')))
A = [int(input()) for _ in range(N)]
B = [int(input()) for _ in range(M)]
scores = [0 for _ in range(N)]
for j in range(M):
for i in range(N):
if A[i] <= B[j]:
scores[i] += 1
break
max_i, max_val = 0, 0
for i in range(N):
... | [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 143 | 2 |
def main():
n,m = map(int,input().split())
A = [int(input()) for _ in range(n)]
V = [0 for _ in range(n)]
m = 0
ans = 0
for i in range(m):
b = int(input())
for j in range(n):
if A[j] <= b:
V[j] += 1
if m < V[j]:
m += 1
ans = j
break
print(ans + 1)
... | def main():
n,m = map(int,input().split())
A = [int(input()) for _ in range(n)]
V = [0 for _ in range(n)]
M = 0
ans = 0
for i in range(m):
b = int(input())
for j in range(n):
if A[j] <= b:
V[j] += 1
if M < V[j]:
M += 1
ans = j
break
print(ans + 1)
... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["-", 0, 57, 64, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 57, 64, 196, 0, 57, 15, 666, 0, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 677, 31, 22]] | 5 | 118 | 6 |
import java.io.*;
import java.util.StringTokenizer;
class Main {
static final PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLi... | import java.io.*;
import java.util.StringTokenizer;
class Main {
static final PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLi... | [["+", 0, 52, 8, 196, 0, 1, 0, 492, 500, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 492, 0, 131], ["+", 0, 52, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 196, 0, 52, 8, 196, 0, 1, 0, 35]] | 3 | 412 | 6 |
#include <stdio.h>
int main(void) {
int w, h, n;
int X[1000], Y[1000];
int i, j, k;
int ans, min, difx, dify;
scanf("%d%d%d", &w, &h, &n);
scanf("%d%d", &X[0], &Y[0]);
ans = 0;
for (i = 1; i < n; i++) {
scanf("%d%d", &X[i], &Y[i]);
if (X[i] - X[i - 1] > 0 && Y[i] - Y[i - 1] > 0) {
difx =... | #include <stdio.h>
int main(void) {
int w, h, n;
int X[1000], Y[1000];
int i, j, k;
int ans, min, difx, dify;
scanf("%d%d%d", &w, &h, &n);
scanf("%d%d", &X[0], &Y[0]);
ans = 0;
for (i = 1; i < n; i++) {
scanf("%d%d", &X[i], &Y[i]);
if (X[i] - X[i - 1] > 0 && Y[i] - Y[i - 1] > 0) {
difx =... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 369 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | [["-", 51, 16, 31, 23, 0, 16, 12, 16, 12, 22], ["+", 51, 16, 31, 23, 0, 16, 12, 16, 12, 22], ["-", 51, 16, 12, 23, 0, 16, 12, 16, 12, 22], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 12, 22]] | 1 | 340 | 4 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int W = 0;
int H = 0;
int N = 0;
int nowx, nowy; //現在位置
int x = 0, y = 0; //次の目的地
int ans = 0;
scanf("%d %d %d", &W, &H, &N); // W,Hは使わない
scanf("%d %d", &nowx, &nowy); //入力の最初は現座標に
for (W = 1; W < N; W++) {
scanf("%d %d", &x, &y); //次の座標
... | #include <stdio.h>
#include <stdlib.h>
int main() {
int W = 0;
int H = 0;
int N = 0;
int nowx, nowy; //現在位置
int x = 0, y = 0; //次の目的地
int ans = 0;
scanf("%d %d %d", &W, &H, &N); // W,Hは使わない
scanf("%d %d", &nowx, &nowy); //入力の最初は現座標に
for (W = 1; W < N; W++) {
scanf("%d %d", &x, &y); //次の座標
... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 211 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int w, h, n, x[20000], y[20000];
int sum = 0, dis;
int i, j;
scanf("%d %d %d", &w, &h, &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d %d", &x[i], &y[i]);
}
for (i = 0; i <= n - 2; i++) {
j ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int w, h, n, x[20000], y[20000];
int sum = 0, dis;
int i, j;
scanf("%d %d %d", &w, &h, &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d %d", &x[i], &y[i]);
}
for (i = 0; i <= n - 2; i++) {
j ... | [["-", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 395 | 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;... | [["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22]] | 1 | 274 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s[n];
sort(s, s + n);
for (int i = 0; i < s[0]; i++)
cin >> s[i];
for (int i = 1; i <= s[0]; i++) {
if (n == 2 && s[0] % i == 0 && s[1] % i == 0)
cout << i << endl;
else if (n == 3 && s[0] % i =... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s[n];
sort(s, s + n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 1; i <= s[0]; i++) {
if (n == 2 && s[0] % i == 0 && s[1] % i == 0)
cout << i << endl;
else if (n == 3 && s[0] % i == 0... | [["-", 8, 9, 0, 7, 15, 16, 12, 69, 28, 22], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 70], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 13], ["-", 0, 7, 15, 16, 12, 69, 341, 342, 0, 73], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 152 | 16 |
n = int(input())
values = list(map(int, input().split()))
minv = min(vs)+1
print(1)
i = 2
ng_value = [1]*minv
while i < minv:
if not 0 in [1 if values[k] % i == 0 else 0 for k in range(n)]:
print(i)
else:
for j in range(i, minv, i):
ng_value[j] = 0
b = True
for j in range(i+1... | n = int(input())
values = list(map(int, input().split()))
minv = min(values)+1
print(1)
i = 2
ng_value = [1]*minv
while i < minv:
if not 0 in [1 if values[k] % i == 0 else 0 for k in range(n)]:
print(i)
else:
for j in range(i, minv, i):
ng_value[j] = 0
b = True
for j in range... | [["-", 0, 662, 12, 657, 31, 652, 3, 4, 0, 22], ["+", 0, 662, 12, 657, 31, 652, 3, 4, 0, 22]] | 5 | 134 | 2 |
input()
n=sorted(list(map(int,input().split())))
m=n[0]
a={}
for x in range(1,int(m**.5)+1):
if m%x==0:a|={x,m//x}
for c in sorted(list(a)):
for k in n[1:]:
if k%c:break
else:print(c)
| input()
n=sorted(list(map(int,input().split())))
m=n[0]
a=set()
for x in range(1,int(m**.5)+1):
if m%x==0:a|={x,m//x}
for c in sorted(list(a)):
for k in n[1:]:
if k%c:break
else:print(c)
| [["-", 0, 656, 0, 1, 0, 662, 12, 680, 0, 45], ["-", 0, 656, 0, 1, 0, 662, 12, 680, 0, 46], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 98 | 5 |
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
private void run() throws IOException {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Pair[... |
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
private void run() throws IOException {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Pair[... | [["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 57, 15, 15, 0, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 12, 22]] | 3 | 329 | 4 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
// long INF = 1L << 62;
double EPS = 1e-10;
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m... |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
// long INF = 1L << 62;
double EPS = 1e-10;
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m... | [["-", 64, 196, 0, 1, 0, 27, 0, 504, 71, 22], ["+", 64, 196, 0, 1, 0, 27, 0, 504, 71, 22]] | 3 | 299 | 2 |
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int a[] = new int[n]; //??¶???????????¨
int b[] = new int[m]; //????????????
int cnt[] = new int[n]; //????????????
int max ... | import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int a[] = new int[n]; //??¶???????????¨
int b[] = new int[m]; //????????????
int cnt[] = new int[n]; //????????????
in... | [["-", 36, 36, 0, 493, 0, 454, 0, 525, 0, 48], ["+", 36, 36, 0, 493, 0, 454, 0, 522, 141, 22], ["-", 0, 57, 15, 15, 0, 16, 12, 504, 516, 22], ["+", 0, 57, 15, 15, 0, 16, 12, 504, 516, 22], ["-", 64, 196, 0, 1, 0, 11, 12, 504, 516, 22], ["+", 64, 196, 0, 1, 0, 11, 12, 504, 516, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, ... | 3 | 262 | 8 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N, M, max = 0;
N = sc.nextInt();
M = sc.nextInt();
int n[] = new int[N];
int m[] = new int[M];
int vote[] = new int[N];
for (int i = 0; i < N; i++) {
n[... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N, M, max = 0;
N = sc.nextInt();
M = sc.nextInt();
int n[] = new int[N];
int m[] = new int[M];
int vote[] = new int[N];
for (int i = 0; i < N; i++) {
n[... | [["+", 0, 57, 15, 15, 0, 16, 31, 504, 516, 22], ["+", 0, 57, 15, 15, 0, 16, 31, 504, 0, 70], ["+", 0, 57, 15, 15, 0, 16, 31, 504, 0, 73]] | 3 | 249 | 3 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int member = in.nextInt();
int cAve = in.nextInt();
int[] a = new int[member];
int[] b = new int[cAve];
int[] c = new int[member];
for (int i = 0; i < member; i++) {... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int member = in.nextInt();
int cAve = in.nextInt();
int[] a = new int[member];
int[] b = new int[cAve];
int[] c = new int[member];
for (int i = 0; i < member; i++) {... | [["-", 15, 15, 0, 16, 12, 504, 71, 16, 17, 72], ["-", 15, 15, 0, 16, 12, 504, 71, 16, 12, 499], ["-", 64, 196, 0, 1, 0, 11, 12, 16, 12, 499], ["+", 64, 196, 0, 1, 0, 11, 12, 16, 12, 499]] | 3 | 255 | 4 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int vote[1000];
int list[1000];
int i, f;
memset(vote, NULL, sizeof(vote));
int a = 0, b = 0, c = 0;
scanf("%d %d", &i, &f);
for (a = 0; a < i; a++) {
scanf("%d", &list[a]);
}
for (a = 0; a < f; a++) {
scanf("%d", &c);
for (b = 0; b ... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int vote[1000];
int list[1000];
int i, f;
memset(vote, NULL, sizeof(vote));
int a = 0, b = 0, c = 0;
scanf("%d %d", &i, &f);
for (a = 0; a < i; a++) {
scanf("%d", &list[a]);
}
for (a = 0; a < f; a++) {
scanf("%d", &c);
for (b = 0; b <... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 211 | 2 |
#include <stdio.h>
int main() {
int i, j, n, m, max = 0;
int game[1000], judge[1000], ticket[1000] = {0};
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++)
scanf("%d", &game[i]);
for (i = 0; i < m; i++)
scanf("%d", &judge[i]);
for (i = 0; i < m; i++) {
for (j = 0; j < n; i++) {
if (game[j] ... | #include <stdio.h>
int main() {
int i, j, n, m, max = 0;
int game[1000], judge[1000], ticket[1000] = {0};
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++)
scanf("%d", &game[i]);
for (i = 0; i < m; i++)
scanf("%d", &judge[i]);
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
if (game[j] ... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 0 | 204 | 2 |
#include <stdio.h>
int main(void) {
int n, m, max, cs[1024], b[1024], cnt[1024];
int i, j;
scanf("%d %d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &cs[i]);
}
for (i = 1; i <= m; i++) {
scanf("%d", &b[i]);
}
for (i = 1; i <= m; i++) {
for (j = 1; b[i] < cs[j]; j++) {
}
cnt... | #include <stdio.h>
int main(void) {
int n, m, max, cs[1024], b[1024], cnt[1024] = {0};
int i, j;
scanf("%d %d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &cs[i]);
}
for (i = 1; i <= m; i++) {
scanf("%d", &b[i]);
}
for (i = 1; i <= m; i++) {
for (j = 1; b[i] < cs[j]; j++) {
}
... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 0 | 202 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 309 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int a[1000], b[1000], cnt[1000], mx;
int main() {
int n, m, ans;
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; +... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int a[1000], b[1000], cnt[1000], mx;
int main() {
int n, m, ans;
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; +... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 192 | 4 |
#include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
int count[1001] = {};
int a[1001];
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < m; i++) {
int b;
scanf("%d", &b);
... | #include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m;
int count[1001] = {};
int a[1001];
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < m; i++) {
int b;
scanf("%d", &b);
... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 207 | 4 |
#include <stdio.h>
int main() {
// initializing phase
int N, M;
int i, j;
int A[1000], B[1000];
int votes[1000];
int max;
for (i = 0; i < 1000; i++)
votes[i] = 0;
// data reading phase
scanf("%d%d", &N, &M);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < M; i++)
scanf("%d... | #include <stdio.h>
int main() {
// initializing phase
int N, M;
int i, j;
int A[1000], B[1000];
int votes[1000];
int max;
for (i = 0; i < 1000; i++)
votes[i] = 0;
// data reading phase
scanf("%d%d", &N, &M);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < M; i++)
scanf("%d... | [["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 19]] | 1 | 224 | 2 |
#include <iostream>
#define MAX 1000
using namespace std;
class Contest {
public:
Contest() {}
Contest(int _id, int _cost, int _vote) {
id = _id;
cost = _cost;
vote = _vote;
}
bool compare_cost(int _cost) { return cost < _cost; }
bool compare_vote(int _vote) { return vote < _vote; }
void o... | #include <iostream>
#define MAX 1000
using namespace std;
class Contest {
public:
Contest() {}
Contest(int _id, int _cost, int _vote) {
id = _id;
cost = _cost;
vote = _vote;
}
bool compare_cost(int _cost) { return cost <= _cost; }
bool compare_vote(int _vote) { return vote < _vote; }
void ... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 19]] | 1 | 309 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int in;
vector<int> a, b, sum;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> in;
a.push_back(in);
sum.push_back(0);
}
for (int i = 0; i < m; i++) {
cin >> in;
b.push_back(in);
}
for (int i =... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int in;
vector<int> a, b, sum;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> in;
a.push_back(in);
sum.push_back(0);
}
for (int i = 0; i < m; i++) {
cin >> in;
b.push_back(in);
}
for (int i =... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 209 | 2 |
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug " << x << endl;
using... | #include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define debug(x) cout << "debug " << x << endl;
using... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 173 | 4 |
#include <iostream>
using namespace std;
int main(void) {
int act, ctt;
int activi[1000] = {0};
int judge[1000] = {0};
int res[1000] = {0};
int buff, idxbf = 1;
cin >> act >> ctt;
for (int i = 0; i < act; i++)
cin >> activi[i];
for (int i = 0; i < ctt; i++)
cin >> judge[i];
for (int i = 0;... | #include <iostream>
using namespace std;
int main(void) {
int act, ctt;
int activi[1000] = {0};
int judge[1000] = {0};
int res[1000] = {0};
int buff, idxbf = 0;
cin >> act >> ctt;
for (int i = 0; i < act; i++)
cin >> activi[i];
for (int i = 0; i < ctt; i++)
cin >> judge[i];
for (int i = 0;... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 213 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int act, ctt;
int activi[1000] = {0};
int res[1000] = {0};
int buff, idxbf = 1;
cin >> act >> ctt;
for (int i = 0; i < act; i++)
cin >> activi[i];
for (int i = 0; i < ctt; i++) {
cin >> buff;
for (int j = 0; j < act; j++) {
if... | #include <iostream>
using namespace std;
int main(void) {
int act, ctt;
int activi[1000] = {0};
int res[1000] = {0};
int buff, idxbf = 0;
cin >> act >> ctt;
for (int i = 0; i < act; i++)
cin >> activi[i];
for (int i = 0; i < ctt; i++) {
cin >> buff;
for (int j = 0; j < act; j++) {
if... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 183 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 1050
#define MAX_M 1050
int N, M, A[MAX_N + 1], B[MAX_M + 1], V[MAX_N + 1];
int main() {
memset(V, 0, sizeof(V));
cin >> N >> M;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= M; i++)
ci... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 1050
#define MAX_M 1050
int N, M, A[MAX_N + 1], B[MAX_M + 1], V[MAX_N + 1];
int main() {
memset(V, 0, sizeof(V));
cin >> N >> M;
for (int i = 1; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= M; i++)
ci... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 185 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
long long dp[101][21];
int main() {
int n;
cin >> n;
rep(i, 101) rep(j... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); i++)
#define rep(i, n) reps(i, 0, n)
long long dp[101][21];
int main() {
int n;
cin >> n;
rep(i, 101) rep(j... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 231 | 2 |
#include <stdio.h>
long long dp[21][100];
int main() {
int m, n;
int i, j;
scanf("%d", &n);
for (i = 0; i < 21; i++)
for (j = 0; j < n; j++)
dp[i][j] = 0;
for (i = 0; i < n - 1; i++) {
scanf("%d", &m);
if (i == 0) {
dp[m][1] = 1;
continue;
}
for (j = 0; j <= 20; j++) {
... | #include <stdio.h>
long long dp[21][100];
int main() {
int m, n;
int i, j;
scanf("%d", &n);
for (i = 0; i < 21; i++)
for (j = 0; j < n; j++)
dp[i][j] = 0;
for (i = 0; i < n - 1; i++) {
scanf("%d", &m);
if (i == 0) {
dp[m][1] = 1;
continue;
}
for (j = 0; j <= 20; j++) {
... | [["-", 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 | 240 | 3 |
#include <iostream>
using namespace std;
int dp[101][21];
int main(void) {
int n;
cin >> n;
int num[101];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0][num[0]] = 1;
for (int j = 1; j < n; j++) {
for (int i = 0; i < 21; i++) {
if (i + num[j] <= 20)
dp[j][i + num[j]] += dp... | #include <iostream>
using namespace std;
long long dp[101][21];
int main(void) {
int n;
cin >> n;
int num[101];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0][num[0]] = 1;
for (int j = 1; j < n; j++) {
for (int i = 0; i < 21; i++) {
if (i + num[j] <= 20)
dp[j][i + num[j]]... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 189 | 7 |
#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>
#in... | #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>
#in... | [["-", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 329 | 2 |
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int i;
int n;
int target;
long long unsigned int num[21];
long long unsigned int tmp[21];
vector<int> l;
scanf("%d", &n);
for (i = 0; i < 21; i++) {
num[i] = 0;
tmp[i] = 0;
}
num[0] = 1;
l.push_back(0);
for (i = 0;... | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int i;
int n;
int target;
long long unsigned int num[21];
long long unsigned int tmp[21];
vector<int> l;
scanf("%d", &n);
for (i = 0; i < 21; i++) {
num[i] = 0;
tmp[i] = 0;
}
num[0] = 1;
l.push_back(0);
for (i = 0;... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 321 | 4 |
#include <iostream>
#include <string.h>
const int SIZE = 20 + 1;
int main() {
int n, i, ii, m, r;
int gp[SIZE], gp_[SIZE], *gpp, *gpp_, *tmpp;
memset(gp, 0, sizeof(gp));
gpp = gp;
gpp_ = gp_;
std::cin >> n;
std::cin >> m;
gpp[m] = 1;
for (i = 2; i < n; i++) {
memset(gpp_, 0, sizeof(gp_));
... | #include <iostream>
#include <string.h>
const int SIZE = 20 + 1;
int main() {
long int n, i, ii, m, r;
long int gp[SIZE], gp_[SIZE], *gpp, *gpp_, *tmpp;
memset(gp, 0, sizeof(gp));
gpp = gp;
gpp_ = gp_;
std::cin >> n;
std::cin >> m;
gpp[m] = 1;
for (i = 2; i < n; i++) {
memset(gpp_, 0, sizeof(g... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 215 | 2 |
#include <iostream>
#include <vector>
int main() {
const int max = 20, min = 0;
int N;
std::cin >> N;
std::vector<std::vector<u_int>> dp(N - 1, std::vector<u_int>(max + 1, 0));
std::vector<int> num(N);
for (int i = 0; i < N; ++i) {
std::cin >> num[i];
}
//１項目を反映
++dp[0][num[0]];
for (int i = ... | #include <iostream>
#include <vector>
int main() {
const int max = 20, min = 0;
int N;
std::cin >> N;
std::vector<std::vector<unsigned long int>> dp(
N - 1, std::vector<unsigned long int>(max + 1, 0));
std::vector<int> num(N);
for (int i = 0; i < N; ++i) {
std::cin >> num[i];
}
//１項目を反映
++... | [["-", 39, 343, 141, 344, 3, 347, 0, 77, 39, 78], ["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 87], ["+", 141, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["+", 141, 344, 3, 347, 0, 77, 39, 86, 39, 40], ["-", 63, 343, 141, 346, 3, 347, 0, 77, 39, 78], ["+", 141, 346, 3, 347, 0, 77, 39, 86, 0, 87], ["+", 141, 346, 3, 347, 0, 77, 3... | 1 | 254 | 8 |
#dp[i][j]...i番で作れるjの通り数
#出力はdp[n][m]
n = int(input())
A = list(map(int,input().split()))
m = A.pop()
maxN = sum(A)
dp = [[0 for i in range(maxN + 1)] for _ in A]
for i in range(len(A)):
for j in range(maxN + 1):
if i == 0:
dp[0][A[i]] = 1
else:
if j - A[i] >= 0:
dp[i][j] += dp[i - 1][j - ... | #dp[i][j]...i番で作れるjの通り数
#出力はdp[n][m]
n = int(input())
A = list(map(int,input().split()))
m = A.pop()
maxN = min(sum(A), 20)
dp = [[0 for i in range(maxN + 1)] for _ in A]
for i in range(len(A)):
for j in range(maxN + 1):
if i == 0:
dp[0][A[i]] = 1
else:
if j - A[i] >= 0:
dp[i][j] += dp[i ... | [["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 25], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 21], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612]] | 5 | 179 | 5 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define MAX 1005
char JOI[MAX][MAX];
int h, w, n;
int dx[] = {0, -1, 0, 1};
int dy[] = {1, 0, -1, 0};
pair<int, int> goal[10];
bool check(int a, int b) { return (a >= 1 && a <= h && b >= 1 && b <= w); }
int step[MAX][MA... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define MAX 1005
char JOI[MAX][MAX];
int h, w, n;
int dx[] = {0, -1, 0, 1};
int dy[] = {1, 0, -1, 0};
pair<int, int> goal[10];
bool check(int a, int b) { return (a >= 1 && a <= h && b >= 1 && b <= w); }
int step[MAX][MA... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35], ["-", 64, 9, 0, 43, 49, 50, 51, 11, 17, 32], ["+", 64, 9, 0, 43, 49, 50, 51, 16, 17, 33]] | 1 | 541 | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.