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 |
|---|---|---|---|---|---|
from functools import reduce
w = []; k = [];
for i in range(10):
w += [eval(input())]
for i in range(10):
k += [eval(input())]
print(reduce(lambda a,x:a+x, sorted(w)[7:]))
print(reduce(lambda a,x:a+x, sorted(k)[7:])) | from functools import reduce
w = []; k = [];
for i in range(10):
w += [eval(input())]
for i in range(10):
k += [eval(input())]
print(reduce(lambda a,x:a+x, sorted(w)[7:]), reduce(lambda a,x:a+x, sorted(k)[7:])) | [["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 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, 21]] | 5 | 96 | 4 |
def func():
lst = []
for i in range(10):
lst.append(int(input()))
lst.sort()
print(sum(lst[-3:]))
func()
func()
| def func():
lst = []
for i in range(10):
lst.append(int(input()))
lst.sort()
return sum(lst[-3:])
print(func(),func())
| [["-", 0, 14, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 38], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25], ["+", 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, 21], ["+", 0, 652, 3, 4... | 5 | 51 | 8 |
import sys
l = [int(s) for s in sys.stdin]
w = sorted(l[0:10])[:-4:-1]
k = sorted(l[10:20])[:-4:-1]
print(w, k) | import sys
l = [int(s) for s in sys.stdin]
w = sum(sorted(l[0:10])[:-4:-1])
k = sum(sorted(l[10:20])[:-4:-1])
print(w, k) | [["+", 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 | 60 | 6 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 411 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define INF 700000000
using namespace std;
vector<pair<int, int>> adj[110];
int solve(int x, int d) {
int dst[110];
bool done[110];
priority_queue<pair<int, int>> que;
for (int i = 0; i < 110; i+... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define INF 700000000
using namespace std;
vector<pair<int, int>> adj[110];
int solve(int x, int d) {
int dst[110];
bool done[110];
priority_queue<pair<int, int>> que;
for (int i = 0; i < 110; i+... | [["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 531 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef vector<vector<int>> VVI;
struct edge {
int to, cost;
edge(int t, int c) : to(t), cost(c) {}
};
typedef pair<int, int> P; // firstは最短距離, secondは頂点の番号
const int INF = (1e9);
void wFloyd(VVI &v) {
int len = ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef vector<vector<int>> VVI;
struct edge {
int to, cost;
edge(int t, int c) : to(t), cost(c) {}
};
typedef pair<int, int> P; // firstは最短距離, secondは頂点の番号
const int INF = (1e9);
void wFloyd(VVI &v) {
int len = ... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 147], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 755 | 4 |
#include <iostream>
using namespace std;
const int INF = 1e9 + 1;
int main(void) {
int n, k;
while (cin >> n >> k, n || k) {
int g[101][101];
for (int i = 0; i <= 100; ++i) {
for (int j = 0; j <= 100; ++j) {
g[i][j] = INF;
}
}
for (int i = 0; i < k; ++i) {
int t, a, b, ... | #include <iostream>
using namespace std;
const int INF = 1e9;
int main(void) {
int n, k;
while (cin >> n >> k, n || k) {
int g[101][101];
for (int i = 0; i <= 100; ++i) {
for (int j = 0; j <= 100; ++j) {
g[i][j] = INF;
}
}
for (int i = 0; i < k; ++i) {
int t, a, b, c, d... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 64, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["-", 0, 57, 64, 9, 0, 57, 64, 1, 0, 35]] | 1 | 336 | 4 |
def main():
from heapq import*
import sys
r=sys.stdin.readline
def g(n,E,S,G):
F=[1e7]*-~n;F[S],H=0,[(0,S)]
while H:
c,u=heappop(H)
if u==G:return c
for f,v in E[u]:
t=c+f
if t<F[v]:F[v]=t;heappush(H,(t,v))
return-1
def s(n,k):
E=[[]for _ in[0]*-~n]
for _ in[0]*k:
f=r();p=map(int,f[2:... | def main():
from heapq import heappush, heappop
import sys
r=sys.stdin.readline
def g(n,E,S,G):
F=[1e7]*-~n;F[S],H=0,[(0,S)]
while H:
c,u=heappop(H)
if u==G:return c
for f,v in E[u]:
t=c+f
if t<F[v]:F[v]=t;heappush(H,(t,v))
return-1
def s(n,k):
E=[[]for _ in[0]*-~n]
for _ in[0]*k:
f=r... | [["-", 0, 14, 8, 196, 0, 686, 0, 690, 0, 48], ["+", 0, 14, 8, 196, 0, 686, 141, 673, 0, 22], ["+", 0, 656, 0, 14, 8, 196, 0, 686, 0, 21]] | 5 | 266 | 4 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
LinkedList<Integer> gos;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0)
break;
int s = sc.nextInt();
... |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.util.*;
public class Main {
int INF = 1 << 28;
LinkedList<Integer> gos;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0)
break;
int s = sc.nextInt();
... | [["+", 64, 196, 0, 57, 75, 196, 0, 57, 0, 95], ["+", 75, 196, 0, 57, 75, 1, 0, 11, 31, 22], ["+", 75, 196, 0, 57, 75, 1, 0, 11, 17, 32], ["+", 75, 196, 0, 57, 75, 1, 0, 11, 12, 22], ["+", 0, 57, 75, 196, 0, 57, 75, 1, 0, 35], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 332 | 7 |
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define val first
#define num second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<P> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0)
mp.push_b... | #include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define val first
#define num second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<P> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0)
mp.push_b... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 25]] | 1 | 295 | 6 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, c;
while (true) {
scanf("%d", &n);
if (n == 0) {
break;
}
vector<pair<int, int>> r; // (color, number)
for (int i = 0; i < n; i++) {
scanf("%d", &c);
if (i == 0) {
r.push_back(make_pai... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, c;
while (true) {
scanf("%d", &n);
if (n == 0) {
break;
}
vector<pair<int, int>> r; // (color, number)
for (int i = 0; i < n; i++) {
scanf("%d", &c);
if (i == 0) {
r.push_back(make_pai... | [["-", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 309 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
pii go[100005];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while (cin >> n, n) {
fill(go, go + 100005, pii(-1, -1));
int head =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
pii go[100005];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while (cin >> n, n) {
fill(go, go + 100005, pii(-1, -1));
int head =... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 307 | 6 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#inc... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#inc... | [["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 107]] | 1 | 983 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, *in, *table, cnt = 0;
in = new int[100000];
table = new int[100000];
cin >> n;
while (n != 0) {
for (int i = 0; i < n; i++) {
cin >> in[i];
}
for (int i = 0; i < n; i++) {
table[i] = in[i];
if (i % 2 == 1) {
... | #include <iostream>
using namespace std;
int main() {
int n, *in, *table, cnt = 0;
in = new int[100000];
table = new int[100000];
cin >> n;
while (n != 0) {
for (int i = 0; i < n; i++) {
cin >> in[i];
}
for (int i = 0; i < n; i++) {
table[i] = in[i];
if (i % 2 == 1) {
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 193 | 4 |
#include <cstdio>
int main(void) {
int n = 0;
scanf("%d", &n);
while (n != 0) {
int stm[100000][2] = {0};
int stp = 0;
/*int clm[100000]={0};
int clp=0;*/
int i = 0;
scanf("%d", &(stm[0][1]));
stm[0][0] = 1;
int yomi = 0;
for (i = 1; i < n; i++) {
scanf("%d", &yomi);
... | #include <cstdio>
int main(void) {
int n = 0;
scanf("%d", &n);
while (n != 0) {
int stm[100000][2] = {0};
int stp = 0;
/*int clm[100000]={0};
int clp=0;*/
int i = 0;
scanf("%d", &(stm[0][1]));
stm[0][0] = 1;
int yomi = 0;
for (i = 1; i < n; i++) {
scanf("%d", &yomi);
... | [["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22]] | 1 | 324 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define reps(i, j, n) for (int i = j; i < n; ++i)
#define rep(i, n) reps(i, 0, n)
#define fr first
#define sc second
#define SQR(x) ((x) * (x))
#define INF (1 << 28)
typedef pair<int, int> Pt;
int main() {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define reps(i, j, n) for (int i = j; i < n; ++i)
#define rep(i, n) reps(i, 0, n)
#define fr first
#define sc second
#define SQR(x) ((x) * (x))
#define INF (1 << 28)
typedef pair<int, int> Pt;
int main() {
... | [["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 271 | 3 |
(function(input) {
var inputs = input.replace(/\r/g, '').split("\n"), str = [], s, l, tmp, count,
max;
while (true) {
max = 0;
str[0] = inputs.shift();
if (str[0] === '') {
break;
}
str[1] = inputs.shift();
if (str[0].length < str[1].length) {
s = str[0];
l = str[1];
} else {
s = str[1... | (function(input) {
var inputs = input.replace(/\r/g, '').split("\n"), str = [], s, l, tmp, count,
max;
while (true) {
max = 0;
str[0] = inputs.shift();
if (str[0] === '') {
break;
}
str[1] = inputs.shift();
if (str[0].length < str[1].length) {
s = str[0];
l = str[1];
} else {
s = str[1... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 555], ["-", 0, 52, 15, 23, 0, 16, 12, 16, 17, 47], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 17, 20]] | 2 | 242 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static int max(int[] a) {
int ans = 0;
for (int i = 0; i < a.length; i++) {
if (ans < a[i]) {
ans = a[i];
}
}
return ans;
}
public static void main(String[]... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static int max(int[] a) {
int ans = 0;
for (int i = 0; i < a.length; i++) {
if (ans < a[i]) {
ans = a[i];
}
}
return ans;
}
public static void main(String[]... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22]] | 3 | 304 | 2 |
char s[4002];
u[4002], m, j, c, d;
main(n) {
for (; m = d = ~scanf("%s ", s); printf("%d\n", m))
for (n = strlen(s); d - 10; d = getchar())
for (j = n; j; m < c ? m = c : 0)
u[j--] = c = s[j] - d ? 0 : u[j] + 1;
} | char s[4001];
u[4001], m, j, c, d;
main(n) {
for (; m = d = ~scanf("%s ", s); printf("%d\n", m))
for (n = strlen(s); d - 10; d = getchar())
for (j = n; j--; m < c ? m = c : 0)
u[j + 1] = c = s[j] - d ? 0 : u[j] + 1;
} | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 0, 7, 8, 7, 8, 7, 15, 27, 17, 68], ["-", 8, 1, 0, 11, 31, 69, 71, 27, 17, 68], ["+", 8, 1, 0, 11, 31, 69, 71, 16, 17, 72], ["+", 8, 1, 0,... | 0 | 113 | 8 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define mem(x, y) (x *)malloc(sizeof(x) * (y))
int maximum(int x, int y) {
if (x > y)
return x;
else
return y;
}
int minimum(int x, int y) {
if (x < y)
return x;
else
return y;
}
int main() {
int len[2];
char **str = mem(char *, 2);... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define mem(x, y) (x *)malloc(sizeof(x) * (y))
int maximum(int x, int y) {
if (x > y)
return x;
else
return y;
}
int minimum(int x, int y) {
if (x < y)
return x;
else
return y;
}
int main() {
int len[2];
char **str = mem(char *, 2);... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 370 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string a, b;
int dp[4005][4005] = {0};
int main() {
while (cin >> a >> b) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string a, b;
int dp[4005][4005] = {0};
int main() {
while (cin >> a >> b) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 204 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 580 | 4 |
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
map<string, int> m;
int main() {
string s, t;
while (cin >> s >> t) {
int x, a = 0, b, S = s.size(), T = t.size(), i, j;
b = min(S, T) + 1;
while (true) {
x = 0;
j = (a + b) / 2;
if (b - a == 1)
break;
... | #include <cstring>
#include <iostream>
#include <map>
using namespace std;
map<string, int> m;
int main() {
string s, t;
while (cin >> s >> t) {
int x, a = 0, b, S = s.size(), T = t.size(), i, j;
b = min(S, T) + 1;
while (true) {
x = 0;
j = (a + b) / 2;
if (b - a == 1)
break;
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 197 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[2][4444];
string s, t;
int main(int argc, char *argv[]) {
while (cin >> s >> t) {
int ls = s.length();
int lt = t.length();
rep(j, lt) dp[0][j] = dp[1][j] = 0;
int res = 0;
rep(i, ls) rep(j, lt) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int dp[2][4444];
string s, t;
int main(int argc, char *argv[]) {
while (cin >> s >> t) {
int ls = s.length();
int lt = t.length();
rep(j, lt) dp[0][j] = dp[1][j] = 0;
int res = 0;
rep(i, ls) rep(j, lt) {... | [["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 72], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 221 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4010][4010], maxn;
string S, T;
int main() {
while (cin >> S >> T) {
memset(dp, 0, sizeof(dp));
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < T.size(); j++) {
if (S[i] == T[j]) ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4010][4010], maxn;
string S, T;
int main() {
while (cin >> S >> T) {
memset(dp, 0, sizeof(dp));
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < T.size(); j++) {
if (S[i] == T[j]) ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 212 | 4 |
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
string s, t;
int dp[4001][4001];
int main() {
while (cin >> s >> t) {
rep(i, s.size() + 1) { dp[i][0] = 0; }
rep(i, t.size() + 1) { dp[0][i] = 0; }
for (int i = 1; i <= s.size(); ++i) {
... | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
string s, t;
int dp[4001][4001];
int main() {
while (cin >> s >> t) {
rep(i, s.size() + 1) { dp[i][0] = 0; }
rep(i, t.size() + 1) { dp[0][i] = 0; }
for (int i = 1; i <= s.size(); ++i) {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 230 | 2 |
#include <algorithm>
#include <cstdio>
#include <string>
using namespace std;
string s, t;
char a[4001];
char b[4001];
int dp[4001][4001];
int main() {
while (scanf("%s%s", a, b) != EOF) {
s = a;
t = b;
for (int i = 0; i < 4001; i++)
for (int j = 0; j < 4001; j++)
dp[i][j] = 0;
int ... | #include <algorithm>
#include <cstdio>
#include <string>
using namespace std;
string s, t;
char a[4001];
char b[4001];
int dp[4001][4001];
int main() {
while (scanf("%s%s", a, b) != EOF) {
s = a;
t = b;
for (int i = 0; i < 4001; i++)
for (int j = 0; j < 4001; j++)
dp[i][j] = 0;
int ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 231 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, p... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, p... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 1,221 | 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, 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, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 275 | 6 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
const int MAX_N = 4005;
int dp[MAX_N + 1][MAX_N + 1];
st... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
const int MAX_N = 4005;
int dp[MAX_N + 1][MAX_N + 1];
st... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 226 | 6 |
#include <iostream>
using namespace std;
int solve(const string &s1, const string &s2, int sp1, int sp2) {
int tmp = 0;
int res = 0;
int len = min(s2.length() - sp2, s1.length() - sp1);
for (int i = 0; i < len; i++) {
if (s1[sp1 + i] != s2[sp2 + i]) {
res = max(res, tmp);
tmp = 0;
} else... | #include <iostream>
using namespace std;
int solve(const string &s1, const string &s2, int sp1, int sp2) {
int tmp = 0;
int res = 0;
int len = min(s2.length() - sp2, s1.length() - sp1);
for (int i = 0; i < len; i++) {
if (s1[sp1 + i] != s2[sp2 + i]) {
res = max(res, tmp);
tmp = 0;
} else... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106]] | 1 | 227 | 2 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 268 | 4 |
#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, 7, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 328 | 2 |
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
memset(dp, 0, sizeof(dp));
int mx = 0;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = 0; j < b.size() - 1; j++) {
if (a[i] == b[... | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
memset(dp, 0, sizeof(dp));
int mx = 0;
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j]) {
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 198 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#define MAX 4000
using namespace std;
int dp[MAX + 2][MAX + 2];
int main(void) {
string s, t;
while (getline(cin, s)) {
getline(cin, t);
fill(dp[0], dp[MAX + 1] + MAX + 2, 0);
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j <... | #include <algorithm>
#include <iostream>
#include <string>
#define MAX 4000
using namespace std;
int dp[MAX + 2][MAX + 2];
int main(void) {
string s, t;
while (getline(cin, s)) {
getline(cin, t);
fill(dp[0], dp[MAX + 1] + MAX + 2, 0);
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j <... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 235 | 8 |
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int lli;
using namespace std;
/*
int main(){
int n,k;
while(cin>>n>>k&&n!=0&&k!=0){
v... | #include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int lli;
using namespace std;
/*
int main(){
int n,k;
while(cin>>n>>k&&n!=0&&k!=0){
v... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22]] | 1 | 393 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
int ans = 0;
for (int i = 0; i < a.length(); i++) {
for (int j = 0; j < b.length(); j++) {
if (a[i + 1] == b[j + 1])
... |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int dp[4001][4001];
int main() {
string a, b;
while (cin >> a >> b) {
int ans = 0;
for (int i = 0; i < a.length(); i++) {
for (int j = 0; j < b.length(); j++) {
if (a[i] == b[j])
ans... | [["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 153 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <ut... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <ut... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 75, 76, 0, 1, 0, 35]] | 1 | 219 | 7 |
loop do
s, t = gets.chomp, gets.chomp rescue break
s, t = t, s if s.length > t.length
max_l = (s.chars & t.chars).map do |a|
[s.count(a), t.count(a)].min
end.inject(:+).to_i
answer = 0
0.upto(t.length).each do |i|
break if t.length - i <= answer
max = [max_l+1, t.length - i + 1].min
(answer... | loop do
s, t = gets.chomp, gets.chomp rescue break
s, t = t, s if s.length > t.length
max_l = (s.chars & t.chars).map do |a|
[s.count(a), t.count(a)].min
end.inject(:+).to_i
answer = 0
0.upto(t.length).each do |i|
break if t.length - i <= answer
max = [max_l+1, t.length - i + 1].min - 1
(an... | [["+", 196, 737, 8, 736, 0, 662, 12, 738, 17, 33], ["+", 196, 737, 8, 736, 0, 662, 12, 738, 12, 612]] | 4 | 154 | 2 |
while True:
try:
s,t = input(),input()
if len(s) < len(t): s,t = t,s
ans = 0
for sp in range(len(t)):
if len(t) - sp <= ans:
break
for L in range(ans,len(t)-sp):
if t[sp:sp+L] in s:
ans = L
else:
break
print(ans)
except:
break | while True:
try:
s,t = input(),input()
if len(s) < len(t): s,t = t,s
ans = 0
for sp in range(len(t)):
if len(t) - sp <= ans:
break
for L in range(ans+1,len(t)-sp+1):
if t[sp:sp+L] in s:
ans = L
else:
break
print(ans)
except:
break | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 99 | 4 |
#include <cstdio>
int n;
int ans;
int a[1010];
void solve() {
ans = n;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
int s = i, e = i, cnt = 1, tmp = n, color = j;
if (a[i] == j)
continue;
while (true) {
whi... | #include <cstdio>
int n;
int ans;
int a[10010];
void solve() {
ans = n;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
int s = i, e = i, cnt = 1, tmp = n, color = j;
if (a[i] == j)
continue;
while (true) {
wh... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 31,... | 1 | 295 | 10 |
#include <algorithm>
#include <iostream>
using namespace std;
int N;
int ary[10010];
// a???c???????????¨
int puyo(int a, int c) {
int motoc = ary[a];
int C = c;
ary[a] = C;
int l, r, ml, mr, tmp, cnt;
ml = mr = l = r = a;
cnt = 0;
while (ary[l] == C) {
l--;
if (l < 0)
break;
}
while (a... | #include <algorithm>
#include <iostream>
using namespace std;
int N;
int ary[10010];
// a???c???????????¨
int puyo(int a, int c) {
int motoc = ary[a];
int C = c;
ary[a] = C;
int l, r, ml, mr, tmp, cnt;
ml = mr = l = r = a;
cnt = 0;
while (ary[l] == C) {
l--;
if (l < 0)
break;
}
while (a... | [["-", 0, 57, 64, 9, 0, 37, 0, 16, 17, 72], ["-", 0, 57, 64, 9, 0, 37, 0, 16, 12, 13]] | 1 | 511 | 4 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 64, 9, 0, 37, 0, 16, 31, 16, 17, 72], ["-", 64, 9, 0, 37, 0, 16, 31, 16, 12, 13]] | 1 | 617 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i, n) ... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 476 | 4 |
#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... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 307 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using ... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 379 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int color[10010];
int N;
int ans;
int solve(int x, int cc) {
if (color[x] == cc)
return N;
int cnt = 1;
int back, forward;
for (back = x - 1; back >= 0; back--) {
if (cc == color[back]... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int color[10010];
int N;
int solve(int x, int cc) {
if (color[x] == cc)
return N;
int cnt = 1;
int back, forward;
for (back = x - 1; back >= 0; back--) {
if (cc == color[back])
c... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 388 | 5 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
while (cin >> n, n) {
v.resize(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
if (v[i] == ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
while (cin >> n, n) {
v.resize(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
if (v[i] == ... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 275 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int n, a[10000];
int main() {
for (;;) {
int x = 0;
cin >> n;
if (n == 0)
return 0;
int pro = n;
for (int i = 0; i < n; i++)
cin >> a[i];
f... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int n, a[10000];
int main() {
for (;;) {
int x = 0;
cin >> n;
if (n == 0)
return 0;
int pro = n;
for (int i = 0; i < n; i++)
cin >> a[i];
f... | [["-", 51, 16, 31, 69, 341, 342, 0, 27, 28, 22], ["+", 51, 16, 31, 69, 341, 342, 0, 27, 28, 22], ["-", 51, 16, 12, 69, 341, 342, 0, 27, 28, 22], ["+", 51, 16, 12, 69, 341, 342, 0, 27, 28, 22]] | 1 | 294 | 4 |
#include <stdio.h>
#include <string.h>
#define N 90
#define MAX(D, S) \
{ \
int __temp = (S); \
(D) = ((D) > __temp ... | #include <stdio.h>
#include <string.h>
#define N 90
#define MAX(D, S) \
{ \
int __temp = (S); \
(D) = ((D) > __temp ... | [["+", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22]] | 0 | 406 | 1 |
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
bool maps[100][100];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int search(int y, int x) {
int maxim = 0;
maps[y][x] = false;
REP(i, 4)
if (y + dy... | #include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
bool maps[100][100];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int search(int y, int x) {
int maxim = 0;
maps[y][x] = false;
REP(i, 4)
if (y + dy... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 20], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 20], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 13]] | 1 | 272 | 4 |
#include <iostream>
using namespace std;
struct Data {
bool s[100][100];
};
int w, h;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ans = 0;
void dfs(int x, int y, int t, Data D) {
D.s[y][x] = false;
bool flg = true;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
i... | #include <iostream>
using namespace std;
struct Data {
bool s[100][100];
};
int w, h;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ans = 0;
void dfs(int x, int y, int t, Data D) {
D.s[y][x] = false;
bool flg = true;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
i... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 331 | 4 |
#include <iostream>
using namespace std;
int m, n;
bool a[100][100] = {{0}};
bool b[100][100] = {{0}};
bool f[100][100] = {{0}};
int cnt = 0, ans = 0;
int p = 0, q = 0;
void check(int x, int y);
int main(void) {
for (;;) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
b[i][j] = 0;
... | #include <iostream>
using namespace std;
int m, n;
bool a[100][100] = {{0}};
bool b[100][100] = {{0}};
bool f[100][100] = {{0}};
int cnt = 0, ans = 0;
int p = 0, q = 0;
void check(int x, int y);
int main(void) {
for (;;) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
b[i][j] = 0;
... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["-", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 579 | 3 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
bool kaku[90][90], kouri[90][90];
int dfs(int a, int b) {
int re = 0, me;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
bool kaku[90][90], kouri[90][90];
int dfs(int a, int b) {
int re = 0, me;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 381 | 2 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define FOR(i, a) for (int i = 0; i < a; i++)
int ans;
int n, m;
int icedate[100][100];
int mapdate[100][100]; // shokika!
int search(int x, int y, int poyo) {
if (icedate[x][y] != 0 and mapdate[x][y] == 0) {
mapdate[x][y]++;
if (ans < poyo) {
... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define FOR(i, a) for (int i = 0; i < a; i++)
int ans;
int n, m;
int icedate[100][100];
int mapdate[100][100]; // shokika!
int search(int x, int y, int poyo) {
if (icedate[x][y] != 0 and mapdate[x][y] == 0) {
mapdate[x][y]++;
if (ans < poyo) {
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 346 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 22], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 371 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> p1, p2;
int main() {
while (true) {
scanf("%d%d", &n, &m);
if (!n && !m)
break;
p1.clear();
p2.clear();
// chap1
p1.push_back(0);
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> p1, p2;
int main() {
while (true) {
scanf("%d%d", &n, &m);
if (!n && !m)
break;
p1.clear();
p2.clear();
// chap1
p1.push_back(0);
for (int i = 0; i < n; i++) {
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 278 | 1 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define R... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define R... | [["-", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 7, 8, 9, 0, 52, 0, 89]] | 1 | 303 | 2 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, m;
vector<int> p;
int t;
vector<int> q;
vector<int> o;
int ans;
int b(int x) {
int l = 0;
int r = q.size();
while (r - l > 1) {
int i = (l + r) / 2;
// printf("l=%d, r=%d, i=%d, q[i]=%d, x=%d\n", l, r, i, q[i], x);
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, m;
vector<int> p;
int t;
vector<int> q;
vector<int> o;
int ans;
int b(int x) {
int l = 0;
int r = q.size();
while (r - l > 1) {
int i = (l + r) / 2;
// printf("l=%d, r=%d, i=%d, q[i]=%d, x=%d\n", l, r, i, q[i], x);
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 336 | 4 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m, in, MAX;
vector<int> P;
vector<int>::iterator it;
while (scanf("%d%d", &n, &m) && (n != 0 || m != 0)) {
P.clear();
for (int i = 0; i < n; i++) {
scanf("%d", &in);
P.pu... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m, in, MAX;
vector<int> P;
vector<int>::iterator it;
while (scanf("%d%d", &n, &m) && (n != 0 || m != 0)) {
P.clear();
for (int i = 0; i < n; i++) {
scanf("%d", &in);
P.pu... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 269 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
#define fi "darts.inp"
#define fo "darts.out"
using namespace std;
long long n, m, a[100011], ans;
vector<long long> vt;
int main() {
// freopen (fi , "r" ,stdin);
// freopen (fo , "w" ,stdout);
whil... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
#define fi "darts.inp"
#define fo "darts.out"
using namespace std;
long long n, m, a[100011], ans;
vector<long long> vt;
int main() {
// freopen (fi , "r" ,stdin);
// freopen (fo , "w" ,stdout);
whil... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 281 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define MAX_R (3000000)
#define min(x, y) ((x < y) ? x : y)
typedef struct stone {
int x, r;
} Stone;
Stone p[155][15];
int xn[155], dp[155][15][80];
int main() {
int i, j, k, h, n, m, x, y, z, ans;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0)
break;
for ... | #include <stdio.h>
#include <stdlib.h>
#define MAX_R (300000000)
#define min(x, y) ((x < y) ? x : y)
typedef struct stone {
int x, r;
} Stone;
Stone p[155][15];
int xn[155], dp[155][15][80];
int main() {
int i, j, k, h, n, m, x, y, z, ans;
while (1) {
scanf("%d%d", &n, &m);
if (n == 0)
break;
fo... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 12, 2, 3, 4, 0, 69, 71, 16, 17, 72], ["+", 12, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 663 | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 50000000000;
int n, m;
int K[152], x[152][10], d[152][10];
long long dp[152][10];
void init() {
dp[0][0] = 0;
for (int i = 1; i <= 151; i++) {
for (int j = 0; j < 10; j++) {
dp[i][j] = INF;
}
}
memset(K, 0, sizeof(K));
K[0] = ... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 50000000000;
int n, m;
int K[152], x[152][10], d[152][10];
long long dp[152][10];
void init() {
dp[0][0] = 0;
for (int i = 1; i <= 151; i++) {
for (int j = 0; j < 10; j++) {
dp[i][j] = INF;
}
}
memset(K, 0, sizeof(K));
K[0] = ... | [["-", 0, 52, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 806 | 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)... | [["-", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 0, 52, 8, 9, 0, 57, 15, 339, 0, 25]] | 1 | 614 | 6 |
// y09-6 ビンゴ(2回目)
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespac... |
// y09-6 ビンゴ(2回目)
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespac... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22]] | 1 | 257 | 2 |
#include <stdio.h>
#define WIDTH 3001
#define HEIGHT 51
char dp[HEIGHT * WIDTH];
int main(void) {
int i, j, k;
int n, m, s;
while (scanf("%d%d%d", &n, &m, &s), n) {
n *= n;
dp[0] = 1;
for (i = 1; i < WIDTH * HEIGHT; ++i)
dp[i] = 0;
for (i = 1; i <= m; ++i) {
for (j = n; j >= 0; --j... | #include <stdio.h>
#define WIDTH 3001
#define HEIGHT 51
int dp[HEIGHT * WIDTH];
int main(void) {
int i, j, k;
int n, m, s;
while (scanf("%d%d%d", &n, &m, &s), n) {
n *= n;
dp[0] = 1;
for (i = 1; i < WIDTH * HEIGHT; ++i)
dp[i] = 0;
for (i = 1; i <= m; ++i) {
for (j = n; j >= 0; --j)... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40]] | 1 | 204 | 2 |
#include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int n, m, s;
while (scanf("%d %d %d", &n, &m, &s), n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = n * n; j >= 1; j--)
for (int k = 1; k <= s; k++) {
dp[j][k] += dp[j - 1][... | #include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int n, m, s;
while (scanf("%d %d %d", &n, &m, &s), n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = n * n; j >= 1; j--)
for (int k = i; k <= s; k++) {
dp[j][k] += dp[j - 1][... | [["-", 8, 7, 8, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 7, 8, 7, 10, 43, 49, 50, 51, 22]] | 1 | 176 | 2 |
#include <stdio.h>
int main(void) {
int i, n, m, count[1000001], res;
char s[1000001];
while (scanf("%d", &n) && n) {
scanf("%d%s", &m, s);
for (i = 0; i < n; count[i] = 0, i++)
;
for (i = m - 1; i > 1; i--)
if (s[i] == 'I' && s[i - 1] == 'O' && s[i - 2] == 'I')
count[i - 2] = ... | #include <stdio.h>
int main(void) {
int i, n, m, count[1000001], res;
char s[1000001];
while (scanf("%d", &n), n) {
scanf("%d %s", &m, s);
for (i = 0; i < 1000001; count[i] = 0, i++)
;
for (i = m - 1; i > 1; i--)
if (s[i] == 'I' && s[i - 1] == 'O' && s[i - 2] == 'I')
count[i - ... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 23, 0, 34, 0, 21], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 0 | 182 | 6 |
main(n, s, c, d) {
for (; scanf("%d%d ", &n) * n; printf("%d\n", s))
for (s = c = 0; d = getchar() - 10; s += c % 2 & c / 2 >= n)
c = d - 63 ? c % 2 ? c + 1 : 0 : c % 2 ?: c + 1;
} | main(n, s, c, d) {
for (; scanf("%d%*d ", &n) * n; printf("%d\n", s))
for (s = c = 0; d = getchar() - 10; s += c % 2 & c / 2 >= n)
c = d - 63 ? c % 2 ? c + 1 : 0 : c % 2 ?: c + 1;
} | [["-", 15, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 15, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 0 | 91 | 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)... | [["+", 8, 9, 0, 1, 0, 11, 31, 23, 0, 24], ["+", 8, 9, 0, 1, 0, 11, 31, 23, 0, 25]] | 1 | 356 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
long n, m;
string s;
scanf(" %ld", &n);
if (n == 0)
break;
scanf(" %ld", &m);
cin >> s;
long a = 0;
long ans = 0;
long lim = m - 2 * n - 1;
while (a < m) {
long ct = 0;
if (s... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
long n, m;
string s;
scanf(" %ld", &n);
if (n == 0)
break;
scanf(" %ld", &m);
cin >> s;
long a = 0;
long ans = 0;
long lim = m - 2 * n - 1;
while (a < m) {
long ct = 0;
if (s... | [["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25]] | 1 | 170 | 6 |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, m, ans;
string str;
vector<int> v;
while (1) {
cin >> n;
if (n == 0)
break;
cin >> m;
cin >> str;
v.push_back(0);
v.push_back(0);
for (i = 2; i < m; i++) {... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, m, ans;
string str;
vector<int> v;
while (1) {
cin >> n;
if (n == 0)
break;
cin >> m;
cin >> str;
v.push_back(0);
v.push_back(0);
for (i = 2; i < m; i++) {... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 188 | 6 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
while (true) {
int n, m;
static char str[1200000];
vector<int> c;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d", &m);
scanf("%s", str);
c.reserve(m);
for (int i = 0; i < m; ++i) {
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
while (true) {
int n, m;
static char str[1200000];
vector<int> c;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d", &m);
scanf("%s", str);
c.reserve(m);
for (int i = 0; i < m; ++i) {
... | [["-", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 31, 69, 341, 342, 0, 22], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 31, 22]] | 1 | 239 | 4 |
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
ll d;
while (scanf("%lld", &d)) {
if (!d)
break;
int n, m;
scanf("%d%d", &n, &m);
ll store[n + 1], k;
store[0] = 0;
for (int i = 1; i < n; i++)
scanf("%lld", &store[i]);
sort(store,... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
ll d;
while (scanf("%lld", &d)) {
if (!d)
break;
int n, m;
scanf("%d%d", &n, &m);
ll store[n + 1], k;
store[0] = 0;
for (int i = 1; i < n; i++)
scanf("%lld", &store[i]);
sort(store,... | [["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22]] | 1 | 199 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [["+", 0, 11, 12, 2, 3, 4, 0, 2, 63, 22], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25], ["+", 3, 4, 0, 16, 12, 66, 28, 23, 0, 25]] | 1 | 290 | 6 |
from bisect import bisect_left
while True:
d = int(input())
if not d:
break
n = int(input())
m = int(input())
stores = {0, d}
for i in range(2, n + 1):
stores.add(int(input()))
sorted_stores = sorted(stores)
total_dist = 0
while m:
k = int(input())
i... | from bisect import bisect_left
while True:
d = int(input())
if not d:
break
n = int(input())
m = int(input())
stores = {0, d}
for i in range(2, n + 1):
stores.add(int(input()))
sorted_stores = sorted(stores)
total_dist = 0
while m:
k = int(input())
i... | [["+", 8, 196, 0, 52, 8, 196, 0, 57, 0, 121], ["+", 8, 196, 0, 52, 8, 196, 0, 57, 15, 22], ["+", 8, 196, 0, 52, 8, 196, 0, 57, 0, 102]] | 5 | 127 | 3 |
# AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import bisect
while True:
d = int(input())
if d == 0: break
n, m = int(input()), int(input())
p = [0] + [int(input()) for i in range(n-1)] + [d]
p.sort()
ans = 0
for i in range(m):
k = int(input())
t = bisect.bisect_left(p, k)
ans += min(k-p[t-1], p[t]-k)
print... | # AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import bisect
while True:
d = int(input())
if d == 0: break
n, m = int(input()), int(input())
p = [0] + [int(input()) for i in range(n-1)] + [d]
p.sort()
ans = 0
for i in range(m):
k = int(input())
if k > 0:
t = bisect.bisect_left(p, k)
ans += min(k-p[t-1], ... | [["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 102]] | 5 | 123 | 16 |
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
struct Line {
int h, s, ur, ul, lr, ll;
Line() {}
Line(int h, int s, int ur = 0, int ul = 0, int lr = 0, int ll = 0)
: h(h), s(s), ur(ur), ul(ul), lr(lr), ll(ll) {}
bool operator<(const Line &r) const { return h < r.h; }
};
... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
struct Line {
int h, s, ur, ul, lr, ll;
Line() {}
Line(int h, int s, int ur = 0, int ul = 0, int lr = 0, int ll = 0)
: h(h), s(s), ur(ur), ul(ul), lr(lr), ll(ll) {}
bool operator<(const Line &r) const { return h < r.h; }
};
... | [["-", 51, 16, 31, 16, 31, 16, 12, 16, 17, 19], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16,... | 1 | 595 | 10 |
#include <stdio.h>
#define SIZE 1000
int main(void) {
int n, m, x, way, goal;
int i;
int grid[SIZE], dice[SIZE];
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
way = 0;
for (i = 0; i < SIZE; i++) {
grid[i] = 0;
dice[i] = 0;
}
for (i = 0; i < n; i++)
... | #include <stdio.h>
#define SIZE 1000
int main(void) {
int n, m, x, way, goal;
int i;
int grid[SIZE], dice[SIZE];
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
way = 0;
for (i = 0; i < SIZE; i++) {
grid[i] = 0;
dice[i] = 0;
}
for (i = 0; i < n; i++)... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 213 | 2 |
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
;
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
} | int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
} | [["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 0, 30, 0, 9, 0, 52, 8, 1, 0, 35]] | 0 | 117 | 1 |
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
;
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
} | main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
} | [["-", 0, 30, 0, 9, 0, 52, 8, 1, 0, 35]] | 0 | 117 | 1 |
t[9999];
n, p, a;
main(x) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n -= x + t[n - x], a = a | n> 1 ? a : p)
scanf("%d", &x);
}
} | t[9999];
n, p, a;
main(x) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n> 1 ? n -= x + t[n - x] : 0, a = a | n > 1 ? a : p)
scanf("%d", &x);
}
} | [["+", 0, 7, 26, 34, 31, 41, 15, 16, 17, 47], ["+", 0, 7, 26, 34, 31, 41, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 26, 34, 31, 41, 0, 101], ["+", 0, 7, 26, 34, 31, 41, 64, 11, 31, 22], ["+", 8, 9, 0, 7, 26, 34, 31, 41, 0, 102], ["+", 8, 9, 0, 7, 26, 34, 31, 41, 75, 13]] | 0 | 111 | 6 |
t[];
main(x, n, p, a) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n> 1 ? n -= x + t[n - x] : 0, a = a | n > 1 ? a : p)
scanf("%d", &x);
}
} | t[999];
main(x, n, p, a) {
for (; scanf("%d%d", &n, t) * n; printf("%d\n", a)) {
for (p = n; a = p;)
scanf("%d", t + p--);
for (; p++<*t; n> 1 ? n -= x + t[n - x] : 0, a = a | n > 1 ? a : p)
scanf("%d", &x);
}
} | [["-", 0, 30, 0, 1, 0, 69, 0, 70, 0, 22], ["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13]] | 0 | 118 | 2 |
#include <stdio.h>
int main() {
while (1) {
int n, m, i;
scanf("%d &d", &n, &m);
if (n == 0 && m == 0) {
break;
}
int masu[1001], me[1001];
for (i = 0; i < n; i++) {
scanf("%d", &masu[i + 1]);
}
for (i = 0; i < m; i++) {
scanf("%d", &me[i + 1]);
}
int masux = ... | #include <stdio.h>
int main() {
while (1) {
int n, m, i;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
int masu[1001], me[1001];
for (i = 0; i < n; i++) {
scanf("%d", &masu[i + 1]);
}
for (i = 0; i < m; i++) {
scanf("%d", &me[i + 1]);
}
int masux = ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 0 | 183 | 4 |
#include <stdio.h>
int main(void) {
int sum;
int n;
int map[1000];
int i;
int m;
int ans;
int dice[1000];
int num;
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
sum = 1;
for (i = 0; i < m; i++)... | #include <stdio.h>
int main(void) {
int sum;
int n;
int map[1000];
int i;
int m;
int ans;
int dice[1000];
int num;
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
sum = 1;
for (i = 0; i < m; i++)... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 206 | 2 |
#include <stdio.h>
int main(void) {
int sum;
int n, m;
int map[1000];
int i;
int dice[1000];
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &dice[i]);
}
... | #include <stdio.h>
int main(void) {
int sum;
int n, m;
int map[1000];
int i;
int dice[1000];
while (1) {
scanf("%d %d", &n, &m);
if (!n && !m) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d", &map[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &dice[i]);
}
... | [["+", 0, 52, 8, 9, 0, 7, 10, 34, 0, 21], ["+", 8, 9, 0, 7, 10, 34, 12, 11, 31, 22], ["+", 8, 9, 0, 7, 10, 34, 12, 11, 17, 32], ["+", 8, 9, 0, 7, 10, 34, 12, 11, 12, 13]] | 0 | 199 | 4 |
#include <stdio.h>
int main(void) {
int N, M;
int i, j;
int now;
int count;
int map[1000];
int X[1000];
while (1) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0) {
break;
}
for (i = 0; i < N; i++) {
scanf("%d", &map[i]);
}
for (j = 0; j < M; j++) {
scanf("%d"... | #include <stdio.h>
int main(void) {
int N, M;
int i, j;
int now;
int count;
int map[1000];
int X[1000];
while (1) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0) {
break;
}
for (i = 0; i < N; i++) {
scanf("%d", &map[i]);
}
for (j = 0; j < M; j++) {
scanf("%d"... | [["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 183 | 2 |
#include <stdio.h>
int main() {
int n, m, i, c, count, a[1000], b[1000], start;
while (1) {
start = 1;
count = 0;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
... | #include <stdio.h>
int main() {
int n, m, i, c, count, a[1000], b[1000], start;
while (1) {
start = 1;
count = 0;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 20], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 2... | 0 | 188 | 8 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int M, N;
int board[1001];
int dice[1001];
int pos;
int times;
while (cin >> N >> M, N || M) {
pos... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int M, N;
int board[1001];
int dice[1001];
int pos;
int times;
while (cin >> N >> M, N || M) {
pos... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 153 | 2 |
#include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m) & n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1)
printf("%d\n", i, f = 0);
}
}
} | #include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1) {
printf("%d\n", i - n, f = 0);
;
}
}
}
} | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 67], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]] | 1 | 119 | 10 |
#include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m) & n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1)
printf("%d\n", i, f = 0);
}
}
} | #include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n) {
t += s[t += s[i]];
if (t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
}
} | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 67], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 119 | 10 |
#include <stdio.h>
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), i = t = f = 1, n) {
while (i <= n + m) {
if (scanf("%d", &s[i]), i > n & (t += s[t += s[i]], t >= n & f == 1))
printf("%d\n", i - n, f = 0);
i++;
}
}
} | #include <stdio.h>
main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), i = t = f = 1, n) {
while (i <= n + m) {
if (scanf("%d", &s[i]), i > n && (t += s[t += s[i]], t >= n & f == 1))
printf("%d\n", i - n, f = 0);
i++;
}
}
} | [["-", 0, 57, 15, 339, 51, 34, 12, 16, 17, 67], ["+", 0, 57, 15, 339, 51, 34, 12, 16, 17, 98]] | 1 | 120 | 10 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int d[1111];
int in[1111];
int main(int argc, char *argv[]) {
while (cin >> N >> M, N) {
rep(i, N) cin >> d[i];
rep(i, M) cin >> in[i];
int cur = 0;
rep(i, M) {
cur += in[i] + d[cur];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int d[1111];
int in[1111];
int main(int argc, char *argv[]) {
while (cin >> N >> M, N) {
rep(i, N) cin >> d[i];
rep(i, M) cin >> in[i];
int cur = 0;
rep(i, M) {
cur += in[i] + d[cur + in[i]]... | [["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["+", 12, 69, 341, 342, 0, 16, 12, 69, 28, 22], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 70], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 73]] | 1 | 131 | 5 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int turn;
int stepn = 0;
int sain = 0;
vector<int> outp;
for (turn = 0;; turn++) {
cin >> stepn;
cin >> sain;
if (stepn == 0 && sain == 0) {
break;
}
int pos = 0;
int g = 0;
vector<int> step(stepn, 0);
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int turn;
int stepn = 0;
int sain = 0;
vector<int> outp;
for (turn = 0;; turn++) {
cin >> stepn;
cin >> sain;
if (stepn == 0 && sain == 0) {
break;
}
int pos = 0;
int g = 0;
vector<int> step(stepn + 6, 0... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 235 | 6 |
#include <cstdio>
using namespace std;
int main() {
int n, m;
while (1) {
int ban[1000] = {0};
int sai[1000] = {0};
int sum = 1;
int pt;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
scanf("%d", &ban[i]);
}
for (int ... | #include <cstdio>
using namespace std;
int main() {
int n, m;
while (1) {
int ban[1000] = {0};
int sai[1000] = {0};
int sum = 1;
int pt;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (int i = 0; i < n; i++) {
scanf("%d", &ban[i]);
}
for (int ... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 198 | 4 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define INF 100000000
using namespace std;
typedef pair<int, int> P;
int S[1001];
int main() {
int n, m, ans;
whi... | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define INF 100000000
using namespace std;
typedef pair<int, int> P;
int S[1001];
int main() {
int n, m, ans;
whi... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 179 | 4 |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
static const LL INF = 1LL << 60LL;
typedef pair<int, int> pii;
int n, m;
int C[2016], D[2016];
int res;
int place = 1;
int main() {
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
memset(C, 0, sizeof(C));
memset(D, 0, s... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
static const LL INF = 1LL << 60LL;
typedef pair<int, int> pii;
int n, m;
int C[2016], D[2016];
int res;
int place = 1;
int main() {
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
memset(C, 0, sizeof(C));
memset(D, 0, s... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 206 | 2 |
#include <iostream>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
int n, m;
int order[1002];
int dice[1002];
int solve() {
int pos = 1;
loop(i, n) cin >> order[i];
loop(j, m) cin >> dice[j];
for (int t = 1; t <= m; t++) {
pos += dice[t];
if (pos >= n)
return t;
pos += ... | #include <iostream>
using namespace std;
#define loop(i, n) for (int i = 1; i <= n; i++)
int n, m;
int order[1002];
int dice[1002];
int solve() {
int pos = 1;
loop(i, n) cin >> order[i];
loop(j, m) cin >> dice[j];
for (int t = 1; t <= m; t++) {
pos += dice[t];
if (pos >= n)
return t;
pos += ... | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 151 | 4 |
#include <stdio.h>
int main(void) {
int i, mas, book;
while (scanf("%d", &mas) != EOF) {
for (i = 0; i < 9; i++) {
scanf("%d", &book);
mas -= book;
}
printf("%d\n", mas);
}
return (0);
} | #include <stdio.h>
int main(void) {
int i, mas, book;
while (scanf("%d", &mas) && mas != 0) {
for (i = 0; i < 9; i++) {
scanf("%d", &book);
mas -= book;
}
printf("%d\n", mas);
}
return (0);
} | [["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 52, 15, 23, 0, 16, 12, 22], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 76 | 4 |
#include <stdio.h>
int main(void) {
int i;
int sum;
int price;
int amount;
while (1) {
scanf("%d", &amount);
if (amount == 0) {
break;
}
sum = 0;
for (i = 0; i < 9; i++) {
scanf("%d", &price);
sum += price;
}
}
printf("%d\n", amount - sum);
return (0);
} | #include <stdio.h>
int main(void) {
int i;
int sum;
int price;
int amount;
while (1) {
scanf("%d", &amount);
if (amount == 0) {
break;
}
sum = 0;
for (i = 0; i < 9; i++) {
scanf("%d", &price);
sum += price;
}
printf("%d\n", amount - sum);
}
return (0);
... | [["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 97 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.