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 argc, char *argv[]) {
string s;
cin >> s;
int ansj = 0, ansi = 0;
;
for (int i = 0; i < s.length() - 2; i++) {
if (s.substr(i, 3) == "JOI")
ansj++;
if (s.substr(i, 3) == "IOI")
ansi++;
}
std::cout << ansj << std::endl;
std::... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
string s;
while (cin >> s) {
int ansj = 0, ansi = 0;
for (int i = 0; i < s.length() - 2; i++) {
if (s.substr(i, 3) == "JOI")
ansj++;
if (s.substr(i, 3) == "IOI")
ansi++;
}
std::cout << ansj ... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 118 | 7 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
string joi = "JOI", ioi = "IOI";
int num_joi = 0, num_ioi = 0;
for (int i = 0; i < s.size() - 2; i++) {
string sub = s.substr(i, 3);
if (sub == joi)
num_joi++;
if (sub == ioi)
num_ioi++;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
while (cin >> s) {
string joi = "JOI", ioi = "IOI";
int num_joi = 0, num_ioi = 0;
for (int i = 0; i < s.size() - 2; i++) {
string sub = s.substr(i, 3);
if (sub == joi)
num_joi++;
if (sub == io... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 109 | 6 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using nam... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using nam... | [["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 736 | 4 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAX 100010
int main() {
int n, k;
int v[MAX], dp[MAX];
int tmp;
while (cin >> n >> k) {
if (n == 0 && k == 0)
break;
memset(v, 0, sizeof(v));
memset(dp, 0, sizeof(dp))... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAX 100010
int main() {
int n, k;
int v[MAX], dp[MAX];
int tmp;
while (cin >> n >> k) {
if (n == 0 && k == 0)
break;
memset(v, 0, sizeof(v));
memset(dp, 0, sizeof(dp))... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 70], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22]... | 1 | 340 | 7 |
# AOJ 0517: Longest Steps
# Python3 2018.6.30 bal4u
while True:
n, k = map(int, input().split())
if n == 0: break
c = [0]*(n+1)
f = 0;
for i in range(k):
a = int(input())
if a == 0: f = 1
else: c[a] = 1
ans = w0 = w = 0
for i in range(1, n+1):
if c[i]: w += 1
elif w > 0:
if w0 + w + f > ans: ans = ... | # AOJ 0517: Longest Steps
# Python3 2018.6.30 bal4u
while True:
n, k = map(int, input().split())
if n == 0: break
c = [0]*(n+2)
f = 0;
for i in range(k):
a = int(input())
if a == 0: f = 1
else: c[a] = 1
ans = w0 = w = 0
for i in range(1, n+1):
if c[i]: w += 1
elif w > 0:
if w0 + w + f > ans: ans = ... | [["-", 0, 662, 12, 657, 12, 23, 0, 657, 12, 612], ["+", 0, 662, 12, 657, 12, 23, 0, 657, 12, 612]] | 5 | 160 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n;
int x[5000], y[5000], maxn;
bool p[7000][7000];
int Ax, Ay, Bx, By, Cx, Cy, Dx, Dy;
int main() {
while (true) {
memset(p, false, sizeof(p));
cin >> n;
maxn = 0;
if (n == 0) {
break;
}
for (int i = 0... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n;
int x[5000], y[5000], maxn;
bool p[7000][7000];
int Ax, Ay, Bx, By, Cx, Cy, Dx, Dy;
int main() {
while (true) {
memset(p, false, sizeof(p));
cin >> n;
maxn = 0;
if (n == 0) {
break;
}
for (int i = 0... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72]] | 1 | 340 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
P h[3000];
int main() {
int n;
while (scanf("%d", &n), n) {
rep(i, n) scanf("%d%d", &h[i].first, &h[i].second);
sort(h, h + n, [](P a, P b) { return a.second < b.second; });
stable_sort... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
P h[3000];
int main() {
int n;
while (scanf("%d", &n), n) {
rep(i, n) scanf("%d%d", &h[i].first, &h[i].second);
sort(h, h + n, [](P a, P b) { return a.second < b.second; });
stable_sort... | [["-", 0, 9, 0, 1, 0, 11, 31, 118, 119, 120], ["+", 0, 9, 0, 1, 0, 11, 31, 118, 119, 120]] | 1 | 344 | 32 |
#include <algorithm>
#include <iostream>
#define A first
#define B second
using namespace std;
pair<int, int> z[3000];
int n, x, y, ans;
bool IT(int x, int y) {
int left = 0, right = n, mid;
while (true) {
if (left >= right - 1)
break;
mid = (left + right) / 2;
if (z[mid].A == x && z[mid].B == y)
... | #include <algorithm>
#include <iostream>
#define A first
#define B second
using namespace std;
pair<int, int> z[3000];
int n, x, y, ans;
bool IT(int x, int y) {
int left = 0, right = n, mid;
while (true) {
if (left >= right - 1)
break;
mid = (left + right) / 2;
if (z[mid].A == x && z[mid].B == y)
... | [["-", 51, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 51, 16, 12, 2, 3, 4, 0, 16, 17, 72]] | 1 | 409 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
vector<P> p;
bool ex(int x, int y) { return binary_search(p.begin(), p.end(), P(x, y)); }
int main() {
int n, x, y;
while (cin >> n, n) {
loop(_, n) {
cin >> x >> y;
p.push_back(... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
vector<P> p;
bool ex(int x, int y) { return binary_search(p.begin(), p.end(), P(x, y)); }
int main() {
int n, x, y;
while (cin >> n, n) {
p.clear();
loop(_, n) {
cin >> x >> y;
... | [["+", 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 | 296 | 6 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
while (cin >> n && n != 0) {
int ans = 0;
P p;
map<P, bool> mp;
cin >> n;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
while (cin >> n && n != 0) {
int ans = 0;
P p;
map<P, bool> mp;
for (int i = 0... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 285 | 4 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<double, double> P;
int n, x[3001], y[3001];
set<P> st;
int main() {
while (cin >> n, n) {
st.clear();
r(i, n) {
cin >> x[i] >> y[i];
st.insert(P(x[i], y[i]));
}
int ans = 0;
r(i, n) r... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<double, double> P;
int n, x[3001], y[3001];
set<P> st;
int main() {
while (cin >> n, n) {
st.clear();
r(i, n) {
cin >> x[i] >> y[i];
st.insert(P(x[i], y[i]));
}
int ans = 0;
r(i, n) r... | [["-", 64, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 64, 9, 0, 43, 49, 50, 51, 16, 17, 33]] | 1 | 303 | 2 |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 592 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make_pair
#define REP(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make_pair
#define REP(... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22]] | 1 | 368 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define f first
#define s second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define f first
#define s second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
... | [["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 52, 8, 9, 0, 93, 0, 35]] | 1 | 326 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <valarray>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <valarray>
#include <... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 318 | 2 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 33], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 22], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 22]] | 1 | 306 | 6 |
#include <stdio.h>
int main() {
int n, k;
int i, j, u[5], v = 0;
int a[100000], sum = 0, w = 0;
while (scanf("%d%d", &n, &k), n != 0 && k != 0) {
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n - k + 1; i++) {
for (j = 0; j < k; j++)
sum += a[j];
if (sum > w)
... | #include <stdio.h>
int main() {
int n, k;
int i, j, u[5], v = 0;
int a[100000], sum = 0, w = 0;
while (scanf("%d%d", &n, &k), n != 0 && k != 0) {
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n - k + 1; i++) {
for (j = i; j < k + i; j++)
sum += a[j];
if (sum > w)
... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 0 | 184 | 4 |
#include <stdio.h>
#include <string.h>
typedef long LONG;
LONG a[1000002];
int main(void) {
int n, k;
int i;
LONG max;
while (1) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0) {
break;
}
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (... | #include <stdio.h>
#include <string.h>
typedef int LONG;
LONG a[100010];
int main(void) {
int n, k;
int i;
LONG max;
while (1) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0) {
break;
}
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i ... | [["-", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 39, 40], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2,... | 0 | 219 | 8 |
#include <stdio.h>
long plus(int *a, long s, long e) {
long sum, c;
c = s;
sum = 0;
while (c <= e) {
sum += (long)a[c];
c++;
}
}
int main() {
int a[100000];
long sum, max, n, k, i;
scanf("%ld %ld", &n, &k);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
ma... | #include <stdio.h>
long plus(int *a, long s, long e) {
long sum, c;
c = s;
sum = 0;
while (c <= e) {
sum += (long)a[c];
c++;
}
return sum;
}
int main() {
int a[100000];
long sum, max, n, k, i;
scanf("%ld %ld", &n, &k);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d", &a[i])... | [["+", 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]] | 0 | 221 | 3 |
#include <stdio.h>
#include <string.h>
int main(void) {
int n, k, i, a[100000], max, sum;
scanf("%d %d", &n, &k);
while (1) {
max = sum = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i >= k) {
sum = sum - a[i - 4] + a[i];
if (sum > max) {
max = sum;
}
... | #include <stdio.h>
#include <string.h>
int main(void) {
int n, k, i, a[100000], max, sum;
scanf("%d %d", &n, &k);
while (1) {
max = sum = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i >= k) {
sum = sum - a[i - k] + a[i];
if (sum > max) {
max = sum;
}
... | [["-", 12, 16, 31, 16, 12, 69, 71, 16, 12, 13], ["+", 12, 16, 31, 16, 12, 69, 71, 16, 12, 22]] | 0 | 177 | 2 |
a[' '];
n, s, i, m;
main(k) {
for (; scanf("%d%d", &n, &k) * n; s = i = !printf("%d\n", m))
for (; i < n; s += a[i], m = i++ < k ? s : fmax(m, s -= a[i - k]))
scanf("%d", a + i);
} | a[' '];
n, s, i, m;
main(k) {
for (; scanf("%d%d", &n, &k) * n; s = i = !printf("%d\n", m))
for (; i < n; s += a[i], m = i++ < k ? s : fmax(m, s -= a[i + ~k]))
scanf("%d", a + i);
} | [["-", 3, 4, 0, 11, 12, 69, 71, 16, 17, 33], ["+", 3, 4, 0, 11, 12, 69, 71, 16, 17, 72], ["+", 0, 11, 12, 69, 71, 16, 12, 91, 17, 92]] | 0 | 102 | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
while (n != 0 || k != 0) {
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> S(n + 1);
S.at(0) = 0;
for (int i = 0; i < n + 1; i++) {
S.at(i + 1) = S.at(i) + a.at(i);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
while (n != 0 || k != 0) {
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> S(n + 1);
S.at(0) = 0;
for (int i = 0; i < n; i++) {
S.at(i + 1) = S.at(i) + a.at(i);
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 205 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
while (n != 0 || k != 0) {
int i = 0, a[n], S[n - 1];
S[0] = 0;
while (i < n) {
cin >> a[i];
if (i >= 1)
S[i] = S[i - 1] + a[i - 1];
i++;
}
i = 0;
int m = S[k - 1] - S[0];
while (k... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
while (n != 0 || k != 0) {
int i = 0, a[n], S[n - 1];
S[0] = 0;
while (i < n) {
cin >> a[i];
if (i >= 1)
S[i] = S[i - 1] + a[i - 1];
i++;
}
i = 0;
int m = S[k] - S[0];
while (k + i... | [["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18]] | 1 | 176 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
int N, K;
while (cin >> N >> K) {
if (N == 0)
break;
vector<ll> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
int N, K;
while (cin >> N >> K) {
if (N == 0)
break;
vector<ll> a(N);
for (int i = 0; i < N; ++i)
cin >> a[i];
... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 43, 49, 50, 51, 16, 12, 69, 28, 22], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 73]] | 1 | 179 | 5 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, max, temp, num, total;
while (true) { //ベクターに格納
cin >> n >> k;
if (n == k == 0)
break;
vector<double> v;
total = 0;
v.push_back(total);
for (int i = 0; i < n; i++) {
cin >> num; //入力をnumに代入
t... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, max, temp, num, total;
while (true) { //ベクターに格納
cin >> n >> k;
if (n == k != 0) {
break;
}
vector<double> v;
total = 0;
v.push_back(total);
for (int i = 0; i < n; i++) {
cin >> num; //入力をnumに代入... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 162 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, k;
cin >> n >> k;
if (n == 0 && k == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int s = 0;
int m = 0;
while (s + 2 < n) {
int cm = 0;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, k;
cin >> n >> k;
if (n == 0 && k == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int s = 0;
int m = 0;
while (s + k - 1 < n) {
int cm =... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 33], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 148 | 4 |
#include <bits/stdc++.h>
using namespace std;
template <class T> struct treap {
#define treapInf INT_MAX
public:
struct node {
T val;
node *lch, *rch;
int pri, sz;
T sum, mini;
node(T val, int pri) : val(val), pri(pri), sz(1), sum(val), mini(val) {
lch = rch = NULL;
}
};
node *ro... | #include <bits/stdc++.h>
using namespace std;
template <class T> struct treap {
#define treapInf INT_MAX
public:
struct node {
T val;
node *lch, *rch;
int pri, sz;
T sum, mini;
node(T val, int pri) : val(val), pri(pri), sz(1), sum(val), mini(val) {
lch = rch = NULL;
}
};
node *ro... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 22]] | 1 | 1,306 | 4 |
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int n, k;
while (cin >> n >> k, n + k) {
vector<int> a(n);
rep(i, n) cin >> a[i];
int ret = -100000;
// cout<<k-1<<" "<<n-k+1<<endl;
int sum = 0;
rep(i, k) sum += a[i... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int main(void) {
int n, k;
while (cin >> n >> k, n + k) {
vector<int> a(n);
rep(i, n) cin >> a[i];
int ret = -100000;
int sum = 0;
rep(i, k) sum += a[i];
for (int i = k; i < n; i++) {... | [["-", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 12, 22]] | 1 | 137 | 2 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, k;
cin >> n >> k;
if (n == 0 && k == 0) {
break;
} else {
int i, inp;
int *a;
a = new int[n];
for (i = 0; i < n; i++) {
cin >> inp;
a[i] = inp;
}
int sum1 = 0, sum2 = ... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n, k;
cin >> n >> k;
if (n == 0 && k == 0) {
break;
} else {
int i, inp;
int *a;
a = new int[n];
for (i = 0; i < n; i++) {
cin >> inp;
a[i] = inp;
}
int sum1 = 0, sum2 = ... | [["-", 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, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 189 | 4 |
#include <cstdio>
using namespace std;
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int main() {
const int MAX_N = 100000;
int n, a[MAX_N], k, S, S1, S2;
int p;
while (true) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++)
... | #include <cstdio>
using namespace std;
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int main() {
const int MAX_N = 100000;
int n, a[MAX_N], k, S, S1, S2;
int p;
while (true) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++)
... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33]] | 1 | 202 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | [["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 478 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#pragma warning(disable : 4996)
long long n, k, a[200000], s, ret;
int main() {
while (true) {
cin >> n >> k;
if (n == 0)
break;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i <= k)
s += a[i];
}
ret =... | #include <algorithm>
#include <iostream>
using namespace std;
#pragma warning(disable : 4996)
long long n, k, a[200000], s, ret;
int main() {
while (true) {
cin >> n >> k;
s = 0;
if (n == 0)
break;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (i <= k)
s += a[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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 149 | 6 |
#include <bits/stdc++.h>
#define LL long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
using namespace std;
static const LL INF = 1LL << 61LL;
static const int MAX_N = 1 << 18;
typedef pair<int, int> PII;
LL S[MAX_N + 1], n, m;
LL ans;
class BIT {
public:
int N... | #include <bits/stdc++.h>
#define LL long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
using namespace std;
static const LL INF = 1LL << 61LL;
static const int MAX_N = 1 << 18;
typedef pair<int, int> PII;
LL S[MAX_N + 1], n, m;
LL ans;
class BIT {
public:
int N... | [["-", 0, 2, 3, 4, 0, 16, 31, 16, 17, 33], ["-", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["-", 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 | 304 | 5 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define For(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
void solve16(int a, int b) {
vector<int> v;
REP(i, a) {
int j;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define For(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
void solve16(int a, int b) {
vector<int> v;
REP(i, a) {
int j;
... | [["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 73]] | 1 | 203 | 3 |
#include <iostream>
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
using namespace std;
int main(void) {
int n, k;
while (cin >> n >> k, n || k) {
int a[100000];
int sum = 0;
int m = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < k; i++)
sum += a[i];
m = sum;
f... | #include <iostream>
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
using namespace std;
int main(void) {
int n, k;
while (cin >> n >> k, n || k) {
int a[100000];
int sum = 0;
int m = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < k; i++)
sum += a[i];
m = sum;
f... | [["-", 0, 11, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 154 | 4 |
#include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c[100000] = {0}, d = 0, e = 0, max = 0;
cin >> a >> b;
if (a == 0 && b == 0)
break;
for (int A = 0; A < a; A++) {
cin >> c[A];
if (A >= b) {
for (int B = 0; B < b; B++) {
d = d + c[A + e]... | #include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c[100000] = {0}, d = 0, e = 0, max = 0;
cin >> a >> b;
if (a == 0 && b == 0)
break;
for (int A = 0; A < a; A++) {
cin >> c[A];
if (A >= b) {
for (int B = 0; B < b; B++) {
d = d + c[A + e]... | [["+", 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, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 148 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
int N[n], sum[n - k + 1];
if (n == 0 && k == 0)
break;
for (int i = 0; i < n - k + 1; i++) {
sum[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> N[i];
}
for (int i = 0; i <=... | #include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
int N[n], sum[n - k + 1];
if (n == 0 && k == 0)
break;
for (int i = 0; i < n - k + 1; i++) {
sum[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> N[i];
}
for (int i = 0; i <=... | [["-", 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, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 197 | 4 |
#include <iostream>
using namespace std;
int seq[100000];
int n, k;
int req(int rem, int i) {
rem -= seq[i];
rem += seq[i + k];
return rem;
}
int main() {
while (cin >> n >> k) {
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
cin >> seq[i];
}
int rem = 0;
for (int i... | #include <iostream>
using namespace std;
int seq[100000];
int n, k;
int req(int rem, int i) {
rem -= seq[i];
rem += seq[i + k];
return rem;
}
int main() {
while (cin >> n >> k) {
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
cin >> seq[i];
}
int rem = 0;
for (int i... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 176 | 2 |
#include <iostream>
main() {
for (int n, k, a[100000], s, M, i; std::cin >> n >> k, n; printf("%d\n", M))
for (M = 1 << 31, i = s = 0; i < n;
s += a[i++], k < i && (s -= a[i - k - 1]), M < s && (M = s))
std::cin >> a[i];
} | #include <iostream>
main() {
for (int n, k, a[100000], s, M, i; std::cin >> n >> k, n; printf("%d\n", M))
for (M = 1 << 31, i = s = 0; i < n;
s += a[i], k < ++i && (s -= a[i - k - 1]) && M < s && (M = s))
std::cin >> a[i];
} | [["-", 31, 11, 12, 69, 341, 342, 0, 27, 17, 29], ["+", 3, 347, 0, 16, 31, 16, 31, 27, 17, 29], ["-", 12, 69, 28, 343, 345, 344, 3, 347, 0, 21], ["+", 28, 343, 345, 344, 3, 347, 0, 16, 17, 98]] | 1 | 109 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
while (cin >> n >> k, n != 0 || k != 0) {
vector<int> data;
int sum = 0;
for (int i = 1; i <= n; i++) {
int tmp;
cin >> tmp;
data.push_back(tmp);
}
for (int i = 0; i < k; i++) {
sum ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
while (cin >> n >> k, n != 0 || k != 0) {
vector<int> data;
int sum = 0;
for (int i = 1; i <= n; i++) {
int tmp;
cin >> tmp;
data.push_back(tmp);
}
for (int i = 0; i < k; i++) {
sum ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 22]] | 1 | 162 | 4 |
#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... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 0, 7, 15, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["-", 0, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 31, 2... | 1 | 317 | 8 |
// Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 272 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, k;
int a[100100];
int b[100100];
for (;;) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[0] = 0;
for (int i = 0; i < n; i++) {
b[i + 1] = b[i] + a[i];
}
... | #include <iostream>
using namespace std;
int main() {
int n, k;
int a[100100];
int b[100100];
for (;;) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[0] = 0;
for (int i = 0; i < n; i++) {
b[i + 1] = b[i] + a[i];
}
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 176 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, m;
int x, s;
int a[100000];
int main(void) {
while (cin >> n >> m, n || m) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
x = 0;
for (int i = 0; i < n; i++) {
x += a[i];
}
s = x;
for (int i = 0; i < n - m... | #include <algorithm>
#include <iostream>
using namespace std;
int n, m;
int x, s;
int a[100000];
int main(void) {
while (cin >> n >> m, n || m) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
x = 0;
for (int i = 0; i < m; i++) {
x += a[i];
}
s = x;
for (int i = 0; i < n - m... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 152 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string label;
int joiCount = 0;
int ioiCount = 0;
int joiIndex = 0;
int ioiIndex = 0;
while (true) {
cin >> label;
if (cin.eof()) {
break;
}
joiCount = 0;
ioiCount = 0;
joiIndex = 0;
ioiIndex = 0;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string label;
int joiCount = 0;
int ioiCount = 0;
int joiIndex = 0;
int ioiIndex = 0;
while (true) {
cin >> label;
if (cin.eof()) {
break;
}
joiCount = 0;
ioiCount = 0;
joiIndex = 0;
ioiIndex = 0;
... | [["-", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["-", 12, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 12, 16, 31, 2, 3, 4, 0, 5, 0, 6]] | 1 | 166 | 8 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int joi = 0, ioi = 0, i = 0;
bool check = true;
while (cin >> str) {
joi = 0;
ioi = 0;
if (str[0] == '0')
break;
i = 0;
while (check) {
if (str.find("JOI", i) >= 0 && str.find("JOI", i) ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int joi = 0, ioi = 0, i = 0;
bool check = true;
while (cin >> str) {
joi = 0;
ioi = 0;
i = 0;
if (str[0] == '0')
break;
check = true;
while (check) {
if (str.find("JOI", i) >= 0 && ... | [["+", 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], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 146]] | 1 | 223 | 8 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>... | [["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 24], ["+", 0, 30, 0, 14, 8, 9, 0, 7, 0, 25], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 174 | 5 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int a, b, c, d, e, f;
while (cin >> s) {
a = 0;
b = 0;
c = 0;
d = 0;
e = 0;
f = 0;
while (a >= 0 || d >= 0) {
a = s.find("JOI", b);
d = s.find("IOI", e);
if (a >= 0) {
c++;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int a, b, c, d, e, f;
while (cin >> s) {
a = 0;
b = 0;
c = 0;
d = 0;
e = 0;
f = 0;
while (a >= 0 || d >= 0) {
a = s.find("JOI", b);
d = s.find("IOI", e);
if (a >= 0) {
c++;
... | [["-", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["-", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22]] | 1 | 149 | 4 |
#include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0522
int main() {
string str;
cin >> str;
int c1 = 0, c2 = 0;
for (int i = 0; i < str.size() - 2; i++) {
if (str[i] != 'J' && str[i] != 'I')
continue;
if (str[i + 1] != 'O')
continue;
i... | #include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0522
int main() {
string str;
while (cin >> str) {
int c1 = 0, c2 = 0;
for (int i = 0; i < str.size() - 2; i++) {
if (str[i] != 'J' && str[i] != 'I')
continue;
if (str[i + 1] != 'O')
... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 134 | 6 |
#include <stdio.h>
#include <string.h>
char S[112345];
int ans[2] = {0};
int main(void) {
while (true) {
memset(S, '\0', sizeof(S));
ans[0] = 0, ans[1] = 0;
scanf("%s", &S);
if (S[0] == '\0') {
break;
}
for (int i = 0; i < strlen(S) - 2; ++i) {
if (S[i] == 'J' && S[i + 1] == 'O'... | #include <stdio.h>
#include <string.h>
char S[112345];
int ans[2] = {0};
int main(void) {
while (true) {
memset(S, '\0', sizeof(S));
ans[0] = 0, ans[1] = 0;
scanf("%s", &S);
if (S[0] == '\0') {
break;
}
for (int i = 0; i < strlen(S) - 2; ++i) {
if (S[i] == 'J' && S[i + 1] == 'O'... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 211 | 1 |
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string j;
int joi = 0, ioi = 0;
for (int i = 0; i < s.size() - 2; i++) {
j = s.substr(i, 3);
if (j == "JOI") {
joi++;
}
if ... | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
while (cin >> s) {
string j;
int joi = 0, ioi = 0;
for (int i = 0; i < s.size() - 2; i++) {
j = s.substr(i, 3);
if (j == "JOI") {
... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 110 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string s;
cin >> s;
int joi = 0, ioi = 0;
for (int i = 0; i < (int)s.size() - 2; i++) {
if (s.substr(i, 3) == "JOI")
joi++;
if (s.substr(i, 3) == "IOI")
ioi++;
}
cout << joi << endl << ioi << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
string s;
while (cin >> s) {
int joi = 0, ioi = 0;
for (int i = 0; i < (int)s.size() - 2; i++) {
if (s.substr(i, 3) == "JOI")
joi++;
if (s.substr(i, 3) == "IOI")
ioi++;
}
cout << joi << en... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 105 | 6 |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(x, y, z) for (int x = y; x < z; x++)
#define INF 9999999;
#define VEC vector<int>
#define in push_back
#define ans(x) cout << x << endl
#define ll long long int
usin... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(x, y, z) for (int x = y; x < z; x++)
#define INF 9999999;
#define VEC vector<int>
#define in push_back
#define ans(x) cout << x << endl
#define ll long long int
usin... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 185 | 5 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 275 | 6 |
#include <cstring>
#include <iostream>
using namespace std;
int main() {
char str[10001];
int r[2], i;
while (cin >> str) {
if (cin.eof())
break;
r[0] = r[1] = 0;
for (i = 0; i < signed(strlen(str)) - 2;) {
if (str[i] == 'I' || str[i] == 'J') {
if (str[i + 1] == 'O' && str[i + 2] =... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
char str[10001];
int r[2], i;
while (cin >> str) {
if (cin.eof())
break;
r[0] = r[1] = 0;
for (i = 0; i < signed(strlen(str)) - 2;) {
if (str[i] == 'I' || str[i] == 'J') {
if (str[i + 1] == 'O' && str[i + 2] =... | [["+", 28, 69, 341, 342, 0, 16, 31, 103, 0, 104], ["+", 28, 69, 341, 342, 0, 16, 31, 103, 0, 125], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 28, 69, 341, 342, 0, 16, 12, 103, 0, 104], ["-", 28, 69, 341, 342, 0, 16, 12, 103, 0, 125]] | 1 | 168 | 8 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
for (int i = 0; i < s.size() - 2; i++) {
string t = "";
t += s[i];
t += s[i + 1];
t += s[i + 2];
if (t == "JOI")
ans1++;
if (t == "IOI")
ans2++;
}
cout << ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
while (cin >> s) {
int ans1 = 0, ans2 = 0;
for (int i = 0; i < s.size() - 2; i++) {
string t = "";
t += s[i];
t += s[i + 1];
t += s[i + 2];
if (t == "JOI")
ans1++;
if (t == "IOI")
... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 115 | 6 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ut... | [["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 303 | 4 |
#include <iostream>
using namespace std;
int main() {
char s[10000 + 4];
int i = 0;
while (scanf("%s", &s) != EOF) {
int Jc = 0, Ic = 0;
while (s[i + 2] != '\0') {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2] == 'I')
Jc++;
if (s[i] == 'I' && s[i + 1] == 'O' && s[i + 2] == 'I')
... | #include <iostream>
using namespace std;
int main() {
char s[10000 + 4];
int i = 0;
while (scanf("%s", &s) != EOF) {
i = 0;
int Jc = 0, Ic = 0;
while (s[i + 2] != '\0') {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2] == 'I')
Jc++;
if (s[i] == 'I' && s[i + 1] == 'O' && s[i + 2] ==... | [["+", 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 | 154 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int joi = 0, ioi = 0;
string str;
while (cin >> str) {
for (int i = 0; i < str.size() - 2; i++) {
if (str[i] == 'J' && str[i + 1] == 'O' && str[i + 2] == 'I')
joi++;
else if (str[i] == 'I' && str[i + 1] == 'O' && str... | #include <iostream>
#include <string>
using namespace std;
int main() {
int joi = 0, ioi = 0;
string str;
while (cin >> str) {
joi = ioi = 0;
for (int i = 0; i < str.size() - 2; i++) {
if (str[i] == 'J' && str[i + 1] == 'O' && str[i + 2] == 'I')
joi++;
else if (str[i] == 'I' && str[i... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 141 | 6 |
#include <iostream>
using namespace std;
int main() {
string inp;
int cnt_j, cnt_i;
cin >> inp;
cnt_j = cnt_i = 0;
for (int i = 0; i < inp.size() - 2; i++) {
if (inp.substr(i, 3) == "JOI")
cnt_j++;
else if (inp.substr(i, 3) == "IOI")
cnt_i++;
}
cout << cnt_j << '\n' << cnt_i << end... | #include <iostream>
using namespace std;
int main() {
string inp;
int cnt_j, cnt_i;
while (cin >> inp) {
cnt_j = cnt_i = 0;
for (int i = 0; i < inp.size() - 2; i++) {
if (inp.substr(i, 3) == "JOI")
cnt_j++;
else if (inp.substr(i, 3) == "IOI")
cnt_i++;
}
cout << cnt_... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 104 | 6 |
#include <iostream>
using namespace std;
int main() {
string line;
int len, joi, ioi;
while (cin >> line) {
joi = 0;
ioi = 0;
len = line.length() - 1;
for (int i = 1; i < len; ++i) {
if (line.at(i) == 'O') {
if (line.at(i + 1) == 'I') {
if (line.at(i - 1) == 'J') {
... | #include <iostream>
using namespace std;
int main() {
string line;
int len, joi, ioi;
while (cin >> line) {
joi = 0;
ioi = 0;
len = line.length() - 1;
for (int i = 1; i < len; ++i) {
if (line.at(i) == 'O') {
if (line.at(i + 1) == 'I') {
if (line.at(i - 1) == 'J') {
... | [["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125]] | 1 | 152 | 2 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string a;
cin >> a;
int joi_ans = 0, ioi_ans = 0;
for (int i = 0; i < a.size(); i++) {
if ("JOI" == a.substr(i, 3)) {
joi_ans++;
} else if ("IOI" == a.substr(i, 3)) {
ioi_ans++;
}
}
printf(... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string a;
while (cin >> a) {
int joi_ans = 0, ioi_ans = 0;
for (int i = 0; i < a.size(); i++) {
if ("JOI" == a.substr(i, 3)) {
joi_ans++;
} else if ("IOI" == a.substr(i, 3)) {
ioi_ans++;... | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 111 | 6 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
while (cin >> s) {
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s.substr(i, 3) == "JOI")
a++;
else if (s.substr(i, 3) == "IOI")
b++;
}
cout << a << " " << b << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
while (cin >> s) {
int a = 0, b = 0;
for (int i = 0; i < s.size(); i++) {
if (s.substr(i, 3) == "JOI")
a++;
else if (s.substr(i, 3) == "IOI")
b++;
}
cout << a << endl << b << endl;
}
} | [["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22]] | 1 | 103 | 4 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 29;
typedef pair<int, int> P;
string n;
int main(void) {
while (cin... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 29;
typedef pair<int, int> P;
string n;
int main(void) {
while (cin... | [["-", 26, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 26, 11, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 176 | 4 |
while True:
try:
s = input().strip()
except:
break
i = 0
cnt_joi, cnt_ioi = 0, 0
while i < len(s) - 2:
t = s[i:i + 3]
if t == 'JOI':
cnt_joi += 1
i += 2
elif t == 'IOI':
cnt_ioi += 1
i += 2
elif t[2] == '... | while True:
try:
s = input().strip()
except:
break
i = 0
cnt_joi, cnt_ioi = 0, 0
while i < len(s) - 2:
t = s[i:i + 3]
if t == 'JOI':
cnt_joi += 1
i += 2
elif t == 'IOI':
cnt_ioi += 1
i += 2
elif t[2] == '... | [["-", 8, 196, 0, 57, 75, 665, 15, 666, 667, 60], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 667, 267], ["-", 0, 57, 75, 665, 15, 666, 0, 557, 0, 6], ["+", 0, 57, 75, 665, 15, 666, 0, 557, 0, 6]] | 5 | 112 | 4 |
#include <algorithm>
#include <cstdio>
using namespace std;
int n;
pair<int, int> p[3005];
int P[3005];
int main() {
while (1) {
scanf("%d", &n);
if (!n)
break;
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
P[i] = a;
p[i] = make_pair(a, b);
}
sort(p,... | #include <algorithm>
#include <cstdio>
using namespace std;
int n;
pair<int, int> p[3005];
int P[3005];
int main() {
while (1) {
scanf("%d", &n);
if (!n)
break;
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
P[i] = a;
p[i] = make_pair(a, b);
}
sort(p,... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 637 | 2 |
#include <iostream>
using namespace std;
static int n, x[3000], y[3000], ans = 0;
static bool a[5000][5000];
int z(int x) {
if (x < 0)
x = -x;
return x;
}
bool f(int p, int q) {
bool c = false;
if (0 <= (x[p] - y[p] + y[q]) && 0 <= (y[p] - x[q] + x[p]) &&
0 <= (x[q] + y[q] - y[p]) && 0 <= (y[q] - x[... | #include <iostream>
using namespace std;
static int n, x[3000], y[3000], ans = 0;
static bool a[5000][5000];
int z(int x) {
if (x < 0)
x = -x;
return x;
}
bool f(int p, int q) {
bool c = false;
if (0 <= (x[p] - y[p] + y[q]) && 0 <= (y[p] - x[q] + x[p]) &&
0 <= (x[q] + y[q] - y[p]) && 0 <= (y[q] - 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 | 821 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct Point {
int x, y;
Point() {}
Point(int x, int y) : x(x), y(y) {}
Point operator+(const Point &a) { return Point(x - a.x, y - a.y); }
Point operator-(const Point &a) { return Point(x - a.x, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct Point {
int x, y;
Point() {}
Point(int x, int y) : x(x), y(y) {}
Point operator+(const Point &a) { return Point(x - a.x, y - a.y); }
Point operator-(const Point &a) { return Point(x - a.x, ... | [["-", 0, 37, 0, 41, 15, 16, 12, 118, 119, 120], ["+", 0, 37, 0, 41, 15, 16, 12, 118, 119, 120]] | 1 | 505 | 2 |
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 100000000
typedef long long int lli;
typedef pair<int, int> P;
int ... | #include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 100000000
typedef long long int lli;
typedef pair<int, int> P;
int ... | [["-", 31, 16, 31, 16, 31, 16, 31, 16, 17, 47], ["+", 31, 16, 31, 16, 31, 16, 31, 16, 17, 20], ["-", 31, 16, 31, 16, 31, 16, 12, 16, 17, 47], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 17, 20]] | 1 | 400 | 4 |
while True:
n = eval(input())
if n == 0: break
xy = [list(map(int,input().split())) for i in range(n)]
S = set(map(tuple,xy))
ans = 0
for i in range(n):
x1,y1 = xy[i]
for j in range(n-1,i,-1):
x2,y2 = xy[j]
a = (x2-y2+y1,y2+x2-x1)
b = (x1-y2+y1,y1+x2-x1)
if a in S and b in S:
ans = max((x1-x2)... | while True:
n = eval(input())
if n == 0: break
xy = [list(map(int,input().split())) for i in range(n)]
S = set(map(tuple,xy))
ans = 0
for i in range(n):
x1,y1 = xy[i]
for j in range(n-1,i,-1):
x2,y2 = xy[j]
a = (x2-y2+y1,y2+x2-x1)
b = (x1-y2+y1,y1+x2-x1)
if a in S and b in S:
ans = max(ans,(x1... | [["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 21]] | 5 | 159 | 13 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> G[5006];
int cnt[5006] = {};
int main() {
queue<int> que;
int flag = 0;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
G[a - 1].push_back(b - 1);
cnt[b - 1]++;
}
for (int i = 0; i < N; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> G[5006];
int cnt[5006] = {};
int main() {
queue<int> que;
int flag = 0;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
G[a - 1].push_back(b - 1);
cnt[b - 1]++;
}
for (int i = 0; i < N; i++) {
if (... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 246 | 2 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
static const int MAX = 5000;
vector<int> G[MAX + 1];
vector<int> ans;
bool V[MAX + 1];
int W[MAX + 1];
int N, M;
void dfs(int u) {
V[u] = true;
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
if (!... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
static const int MAX = 5000;
vector<int> G[MAX + 1];
vector<int> ans;
bool V[MAX + 1];
int W[MAX + 1];
int N, M;
void dfs(int u) {
V[u] = true;
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
if (!... | [["-", 75, 76, 0, 1, 0, 16, 31, 16, 12, 13], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 12, 13]] | 1 | 338 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define all(c) c.begin(), c.end()
const int MAX_N = 5000;
// win[i]にjが含まれるならiはjに勝った
// win[i]にjが含まれるならiはjに負けた
vector<int> win[MAX_N + 1];
vector<int> lose[MAX_N + 1];
vector<int> ord;
int used[MAX_N + 1] = {0};
// v... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define all(c) c.begin(), c.end()
const int MAX_N = 5000;
// win[i]にjが含まれるならiはjに勝った
// win[i]にjが含まれるならiはjに負けた
vector<int> win[MAX_N + 1];
vector<int> lose[MAX_N + 1];
vector<int> ord;
int used[MAX_N + 1] = {0};
// v... | [["-", 0, 2, 3, 4, 0, 69, 28, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 28, 22]] | 1 | 330 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define all(c) c.begin(), c.end()
const int MAX_N = 5000;
// win[i]にjが含まれるならiはjに勝った
// win[i]にjが含まれるならiはjに負けた
vector<int> win[MAX_N + 1];
vector<int> lose[MAX_N + 1];
vector<int> ord;
int used[MAX_N + 1] = {0};
// v... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define all(c) c.begin(), c.end()
const int MAX_N = 5000;
// win[i]にjが含まれるならiはjに勝った
// win[i]にjが含まれるならiはjに負けた
vector<int> win[MAX_N + 1];
vector<int> lose[MAX_N + 1];
// 順位表
vector<int> ord;
// "順位は決定している"フラグ
int us... | [["-", 0, 2, 3, 4, 0, 69, 28, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 28, 22]] | 1 | 330 | 2 |
from collections import deque
def Topologicalsort(v):
start=deque()
for i in range(v):
if indeg[i]==0 :
start.append(i)
if len(start)>1:
flag=True
else:
flag=False
while len(start)>0:
i=start.popleft()
ans.append(i)
tmp=[]
for j i... | from collections import deque
def Topologicalsort(v):
start=deque()
for i in range(v):
if indeg[i]==0 :
start.append(i)
if len(start)>1:
flag=True
else:
flag=False
while len(start)>0:
i=start.popleft()
ans.append(i)
tmp=[]
for j i... | [["-", 0, 57, 64, 196, 0, 57, 15, 666, 667, 20], ["+", 0, 57, 64, 196, 0, 57, 15, 666, 667, 47], ["-", 0, 57, 64, 196, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 64, 196, 0, 57, 75, 76, 0, 102], ["-", 75, 76, 8, 196, 0, 1, 0, 662, 31, 22], ["-", 75, 76, 8, 196, 0, 1, 0, 662, 0, 32], ["-", 75, 76, 8, 196, 0, 1, 0, 662, 12, 147... | 5 | 309 | 7 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter ... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter ... | [["-", 31, 16, 12, 492, 3, 4, 0, 504, 516, 22], ["+", 31, 16, 12, 492, 3, 4, 0, 504, 516, 22], ["-", 51, 492, 3, 4, 0, 16, 12, 504, 516, 22], ["+", 51, 492, 3, 4, 0, 16, 12, 504, 516, 22]] | 3 | 1,287 | 8 |
#include <iostream>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int m, long long int n) {
if (m == 0 || n == 0)
return 0;
return ((m / gcd(m, n)) * n);
}
int main() {
while (true) {
long long... | #include <iostream>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int m, long long int n) {
if (m == 0 || n == 0)
return 0;
return ((m / gcd(m, n)) * n);
}
int main() {
while (true) {
long long... | [["-", 0, 43, 49, 50, 51, 16, 12, 69, 28, 22], ["+", 0, 43, 49, 50, 51, 16, 12, 69, 28, 22]] | 1 | 477 | 4 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <... | [["-", 51, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 51, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["-", 31, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["+", 31, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["-", 12, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["+", 12, 16, 31, 16, 31, 16, 12, 69, 28, 22]] | 1 | 353 | 8 |
#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... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22]] | 1 | 537 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
long long depth[500];
long long w[500][2];
long long x[500][2];
long long n, root, v[500], a, A, B, C;
pair<long long, long long> DEPTH[500];
long long mobile[500][2];
long long gcd(long long p, long long q) {
long long P = p, Q = q;
... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
long long depth[500];
long long w[500][2];
long long x[500][2];
long long n, root, v[500], a, A, B, C;
pair<long long, long long> DEPTH[500];
long long mobile[500][2];
long long gcd(long long p, long long q) {
long long P = p, Q = q;
... | [["-", 0, 11, 12, 16, 12, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 16, 12, 69, 341, 342, 0, 13]] | 1 | 1,225 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, r[200], s[200], t[200], u[200], dp[200];
long long gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long dfs(int p) {
if (dp[p] >= 0)
return dp[p];
if (p == 0)
return 1;
long long J1 = dfs(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, r[200], s[200], t[200], u[200], dp[200];
long long gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
long long dfs(int p) {
if (dp[p] >= 0)
return dp[p];
if (p == 0)
return 1;
long long J1 = dfs(... | [["-", 0, 43, 49, 50, 51, 16, 31, 69, 28, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 69, 28, 22]] | 1 | 355 | 4 |
//???????????¢????????§?????°????????¢?????????????§????
//??????????????¨?????¢????????????????????????????°??????¢?????????????§???????????????????????????¨???????????????
//???2 3??§?????£??????????????????????????????4
//6??§?????£?????????????????????????????????????????´?????????
//???????????????????????¨???????... | //???????????¢????????§?????°????????¢?????????????§????
//??????????????¨?????¢????????????????????????????°??????¢?????????????§???????????????????????????¨???????????????
//???2 3??§?????£??????????????????????????????4
//6??§?????£?????????????????????????????????????????´?????????
//???????????????????????¨???????... | [["-", 51, 2, 3, 4, 0, 16, 12, 118, 119, 120], ["+", 51, 2, 3, 4, 0, 16, 12, 118, 119, 120]] | 1 | 378 | 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;
long long int gcd(long long int l, long long int r) {
assert(l > 0 && r > 0);
if (l > r)
... | #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:\... | [["-", 0, 43, 49, 50, 51, 16, 12, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 16, 12, 118, 119, 120]] | 1 | 513 | 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) ... | [["-", 49, 50, 51, 2, 3, 4, 0, 16, 12, 22], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 22]] | 1 | 648 | 4 |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
struct Mobile {
int l, r, left, right, parent;
};
int n;
Mobile m[100];
int solve(int x) {
int Left, Right;
if (m[x].left == 0)
L... | #include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
struct Mobile {
int l, r, left, right, parent;
};
int n;
Mobile m[100];
int solve(int x) {
int Left, Right;
if (m[x].left == 0)
... | [["-", 31, 2, 3, 4, 0, 16, 12, 118, 119, 120], ["+", 31, 2, 3, 4, 0, 16, 12, 118, 119, 120]] | 1 | 503 | 8 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <vector>
using namespace std;
long long gcd(long long x, long long y) {
while (y) {
long long t = x % y;
x = y;
y = t;
}
return x;
}
int rs[100], bs[100];
long long ps[100], qs[100], memo[100];
bool changed;
long long calc(int i) {
... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <vector>
using namespace std;
long long gcd(long long x, long long y) {
while (y) {
long long t = x % y;
x = y;
y = t;
}
return x;
}
int rs[100], bs[100];
long long ps[100], qs[100], memo[100];
bool changed;
long long calc(int i) {
... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 368 | 4 |
#include <cstdio>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef unsigned long long ull;
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
struct Node {
int p, q, l, r;
Node() {}
Node(int P, int Q, int L, int R) : p(P), q(Q), l(L), r(R) {}
} node[100];
ull dfs(int u) {
if... | #include <cstdio>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef unsigned long long ull;
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
struct Node {
int p, q, l, r;
Node() {}
Node(int P, int Q, int L, int R) : p(P), q(Q), l(L), r(R) {}
} node[100];
ull dfs(int u) {
if... | [["-", 49, 50, 51, 2, 3, 4, 0, 16, 31, 22], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22]] | 1 | 412 | 8 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long gc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long gc... | [["-", 49, 50, 51, 2, 3, 4, 0, 16, 31, 22], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 426 | 8 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | [["-", 51, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 51, 2, 3, 4, 0, 16, 12, 69, 28, 22]] | 1 | 430 | 4 |
#include <cstdio>
int n, tn, hn, turn, card;
bool t[201], h[201];
int main() {
while (scanf("%d", &n)) {
if (n == 0)
break;
tn = n;
hn = n;
turn = 1;
card = 0;
for (int i = 1; i <= 200; i++) {
t[i] = false;
h[i] = false;
}
for (int i = 1; i <= n; i++) {
int tm... | #include <cstdio>
int n, tn, hn, turn, card;
bool t[201], h[201];
int main() {
while (scanf("%d", &n)) {
if (n == 0)
break;
tn = n;
hn = n;
turn = 1;
card = 0;
for (int i = 1; i <= 200; i++) {
t[i] = false;
h[i] = false;
}
for (int i = 1; i <= n; i++) {
int tm... | [["+", 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 | 345 | 4 |
#include <stdio.h>
int main(void) {
int n;
int t[10000], h[10000];
int jun, ba, tc, hc;
int flg[10000];
int ban[10000];
int i, j, temp;
scanf("%d", &n);
while (n != 0) {
for (i = 1; i <= 2 * n; i++) {
flg[i] == 0;
ban[i] = i;
}
for (i = 1; i <= n; i++) {
scanf("%d", &t[i])... | #include <stdio.h>
int main(void) {
int n;
int t[10000], h[10000];
int jun, ba, tc, hc;
int flg[10000];
int ban[10000];
int i, j, temp;
scanf("%d", &n);
while (n != 0) {
for (i = 1; i <= 2 * n; i++) {
flg[i] = 0;
ban[i] = i;
}
for (i = 1; i <= n; i++) {
scanf("%d", &t[i]);... | [["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 60], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 503 | 7 |
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
int taro[200];
while (true) {
set<int> cards[2];
int top = 0;
cin >> n;
if (n == 0) {
return 0;
}
for (int i = 0; i < n; ++i) {
cin >> taro[i];
}
cards[0].clear();
car... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
int taro[200];
while (true) {
set<int> cards[2];
int top = 0;
cin >> n;
if (n == 0) {
return 0;
}
for (int i = 0; i < n; ++i) {
cin >> taro[i];
}
cards[0].clear();
car... | [["-", 12, 2, 63, 118, 28, 69, 341, 342, 0, 13], ["+", 12, 2, 63, 118, 28, 69, 341, 342, 0, 13]] | 1 | 306 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int i;
int n;
int tcard[100];
int hcard[100];
int ncard = 0, turn = 0;
int tscore[100];
int hscore[100];
for (i = 0;; i++) {
cin >> n;
if (n == 0) {
break;
}
ncard = 0;
turn = 0;
for (int a = 0; a ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int i;
int n;
int tcard[100];
int hcard[100];
int ncard = 0, turn = 0;
int tscore[100];
int hscore[100];
for (i = 0;; i++) {
cin >> n;
if (n == 0) {
break;
}
ncard = 0;
turn = 0;
for (int a = 0; a ... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 458 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, C;
vector<int> Card[2];
vector<bool> A;
int main() {
while (true) {
cin >> N;
if (N == 0) {
break;
}
A.clear();
A = vector<bool>(2 * N + 1, false);
for (int i = 0; i < N; i++) {
cin >> C;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, C;
vector<int> Card[2];
vector<bool> A;
int main() {
while (true) {
cin >> N;
if (N == 0) {
break;
}
A.clear();
A = vector<bool>(2 * N + 1, false);
for (int i = 0; i < N; i++) {
cin >> C;... | [["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 13], ["+", 0, 2, 63, 118, 28, 69, 341, 342, 0, 13]] | 1 | 350 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, h;
while (cin >> n, n) {
t = h = n;
bool taro[2 * n] = {false}, hana[2 * n] = {false};
for (int i = 0; i < n; i++) {
int num;
cin >> num;
taro[num] = true;
}
for (int i = 1; i <= 2 * n; i++)
if (!taro[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, h;
while (cin >> n, n) {
t = h = n;
bool taro[2 * n + 5] = {false}, hana[2 * n + 5] = {false};
for (int i = 0; i < n; i++) {
int num;
cin >> num;
taro[num] = true;
}
for (int i = 1; i <= 2 * n; i++)
if ... | [["+", 0, 43, 49, 50, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 50, 49, 80, 81, 16, 12, 13]] | 1 | 319 | 4 |
#include <bits/stdc++.h>
using namespace std;
//{{{
/********************************************************************/
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vi... | #include <bits/stdc++.h>
using namespace std;
//{{{
/********************************************************************/
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vi... | [["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 13], ["+", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22]] | 1 | 732 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n, n) {
set<int> s;
s.insert(0);
vector<int> a, b;
int c = 0, t;
r(i, n) cin >> t, a.push_back(t), s.insert(t);
r(i, n * 2 + 1) if (!s.count(i)) b.push_back(i);
sor... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
while (cin >> n, n) {
set<int> s;
s.insert(0);
vector<int> a, b;
int c = 0, t;
r(i, n) cin >> t, a.push_back(t), s.insert(t);
r(i, n * 2 + 1) if (!s.count(i)) b.push_back(i);
sor... | [["-", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["-", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22]] | 1 | 313 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = ... | [["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 16, 31, 16, 31, 16, 31, 16, 17, 151]] | 1 | 477 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
int H[101];
int T[101];
while (1) {
cin >> n;
int C = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> T[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (T[i] ... |
// ?????? ??????????????????
#include <iostream>
using namespace std;
int main() {
int n;
int H[101];
int T[101];
while (1) {
cin >> n;
int C = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> T[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1;... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 384 | 4 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include... | [["-", 31, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["+", 31, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["-", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22]] | 1 | 448 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.