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 <iostream>
using namespace std;
#define NMAX 100
int calc_max(int c[], int n, int k) {
int sc = 1;
int max = -1;
for (int i = 0; i < n; i++) {
sc *= c[i];
if (i >= k - 1) {
if (sc > max) {
max = sc;
}
sc /= c[i - k + 1];
}
}
return max;
}
int main() {
int ... | #include <iostream>
using namespace std;
#define NMAX 100
int calc_max(int c[], int n, int k) {
int sc = 1;
int max = -1;
for (int i = 0; i < n; i++) {
sc *= c[i];
if (i >= k - 1) {
if (sc > max) {
max = sc;
}
sc /= c[i - k + 1];
}
}
return max;
}
int main() {
int ... | [["-", 8, 9, 0, 43, 49, 50, 51, 11, 31, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 11, 17, 32]] | 1 | 334 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int data[101], i, j, k, result;
int N, K;
cin >> N >> K;
if (N == 0 && K == 0)
break;
for (i = 0; i < N; i++)
cin >> data[i];
int maxv = -1;
for (i = 0; i <= N - K; i++) {
result = 1... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
while (1) {
int data[101], i, j, k, result;
int N, K;
cin >> N >> K;
if (N == 0 && K == 0)
break;
for (i = 0; i < N; i++)
cin >> data[i];
int maxv = -1;
for (i = 0; i <= N - K; i++) {
result = 1... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 290 | 14 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
int a[101] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = -1;
for (int i = 0; i <= n - k; i++) {
int t = 1;
for (... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
int a[101] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = -1;
for (int i = 0; i <= n - k; i++) {
int t = 1;
for (... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 288 | 15 |
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int MAX = 101;
int n, k, t;
vector<int> c;
int judge() {
int max_ = -1 << 28;
for (int i = 0; i <= n - k; i++) {
t = 1;
for (int j = i; j < i + k; j++) {
t *= c[j];
}
max_ = max(max_, t);... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
const int MAX = 101;
int n, k, t;
vector<int> c;
int judge() {
int max_ = -1 << 28;
for (int i = 0; i <= n - k; i++) {
t = 1;
for (int j = i; j < i + k; j++) {
t *= c[j];
}
max_ = max(max_, t);... | [["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 262 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int a[100];
while (cin >> n >> k && (n || k)) {
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = 1;
for (int i = 0; i < k; i++)
ck *= a[i];
int m = ck;
for (int i = k; i < n; i++) {
ck /=... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
int a[100];
while (cin >> n >> k && (n || k)) {
for (int i = 0; i < n; i++)
cin >> a[i];
int ck = 1;
for (int i = 0; i < k; i++)
ck *= a[i];
int m = ck;
for (int i = k; i < n; i++) {
ck /=... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 253 | 2 |
#include <iostream>
using namespace std;
int n, k;
int in[101];
int calc() {
int ans = 0;
for (int i = 0; i + k <= n; ++i) {
int tmp = 1;
for (int j = 0; j < k; ++j)
tmp *= in[i + j];
ans = max(ans, tmp);
}
return ans;
}
int main() {
while (cin >> n >> k, n | k) {
for (int i = 0; i < ... | #include <iostream>
using namespace std;
int n, k;
int in[101];
int calc() {
int ans = 0;
for (int i = 0; i + k <= n; ++i) {
int tmp = 1;
for (int j = 0; j < k; ++j)
tmp *= in[i + j];
ans = max(ans, tmp);
}
return ans;
}
int main() {
while (cin >> n >> k, n | k) {
for (int i = 0; i < ... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 22]] | 1 | 237 | 2 |
#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 <stack>
#include <string>
#include <utility>
#include <v... | #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 <stack>
#include <string>
#include <utility>
#include <v... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 578 | 4 |
// 32
#include <iostream>
using namespace std;
int pt(int *c, int n, int k) {
int p = 0;
for (int i = 0; i < n - k + 1; i++) {
int cp = 1;
for (int j = 0; j < k; j++) {
cp *= c[i + j];
}
p = max(p, cp);
}
}
int main() {
for (int n, k; cin >> n >> k, n | k;) {
int c[100];
for (in... | // 32
#include <iostream>
using namespace std;
int pt(int *c, int n, int k) {
int p = 0;
for (int i = 0; i < n - k + 1; i++) {
int cp = 1;
for (int j = 0; j < k; j++) {
cp *= c[i + j];
}
p = max(p, cp);
}
return p;
}
int main() {
for (int n, k; cin >> n >> k, n | k;) {
int c[100];... | [["+", 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]] | 1 | 264 | 3 |
#include <iostream>
using namespace std;
int calc(int *, int, int);
int main() {
while (true) {
int n, k;
cin >> n >> k;
if (n == 0)
return 0;
int c[100];
for (int i = 0; i < n; i++)
cin >> c[i];
int nowc = calc(c, k, n);
int cmax = 0;
for (int i = 0; i < n; i++) {
f... | #include <iostream>
using namespace std;
int calc(int *, int, int);
int main() {
while (true) {
int n, k;
cin >> n >> k;
if (n == 0)
return 0;
int c[100];
for (int i = 0; i < n; i++)
cin >> c[i];
int nowc = calc(c, k, n);
int cmax = 0;
for (int i = 0; i < n; i++) {
fo... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 286 | 2 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
var I = 0;
while (true) {
var nS = Arr[I].split(" ").map(Number);
I++;
var n = nS[0];
var S = nS[1];
if (n == 0 && S == 0)
break;
var arr = [];
for (var i = 0; i < n; i++) {
var r = Arr[I] - 0;
... | var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr = (input.trim()).split("\n");
var I = 0;
while (true) {
var nS = Arr[I].split(" ").map(Number);
I++;
var n = nS[0];
var S = nS[1];
if (n == 0 && S == 0)
break;
var arr = [];
for (var i = 0; i < n; i++) {
var r = Arr[I] - 0;
... | [["-", 8, 556, 0, 57, 64, 556, 0, 116, 0, 117], ["+", 8, 556, 0, 57, 64, 556, 0, 93, 0, 94]] | 2 | 232 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
final int S = sc.nextInt();
if (n == 0 && S == 0) {
break;
}
int[] array = ... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
final int n = sc.nextInt();
final int S = sc.nextInt();
if (n == 0 && S == 0) {
break;
}
int[] array = ... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]] | 3 | 201 | 2 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int n, S, ans;
static int[] a;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (true) {
n = cin.nextInt();
S = cin.nextInt();
if (n + S == 0)
break;
a = new ... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int n, S, ans;
static int[] a;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (true) {
n = cin.nextInt();
S = cin.nextInt();
if (n + S == 0)
break;
a = new ... | [["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 12, 499]] | 3 | 206 | 2 |
#include <stdio.h>
int main() {
int n, s, i, j;
while (scanf("%d %d", &n, &s), n || s) {
int c = 0, d[20001];
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
for (j = i; j; j--) {
if (d[i] * d[j - 1] > s)
c++;
}
}
printf("%d\n", c);
}
return 0;
} | #include <stdio.h>
int main() {
int n, s, i, j;
while (scanf("%d %d", &n, &s), n || s) {
int c = 0, d[20001];
for (i = 0; i < n; i++) {
scanf("%d", &d[i]);
for (j = i; j; j--) {
if (d[i] + d[j - 1] > s)
c++;
}
}
printf("%d\n", c);
}
return 0;
} | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 48], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 72]] | 0 | 121 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int r[20000];
int main() {
int n, s;
while (cin >> n >> s && n) {
int ans = 0;
for (int i = 0; i < n; i++)
cin >> r[i];
sort(r, r + n);
for (int i = 0; i < n; i++) {
int *p = lower_bound(r, r + n, s - r[i]);
ans += r ... | #include <algorithm>
#include <iostream>
using namespace std;
int r[20000];
int main() {
int n, s;
while (cin >> n >> s && n) {
int ans = 0;
for (int i = 0; i < n; i++)
cin >> r[i];
sort(r, r + n);
for (int i = 0; i < n; i++) {
int *p = upper_bound(r, r + n, s - r[i]);
ans += r ... | [["-", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22]] | 1 | 138 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, s;
while (cin >> n >> s, n || s) {
vector<int> V(n);
for (int i = 0; i < n; i++)
cin >> V[i];
sort(V.begin(), V.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
int t = s - V[i];
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, s;
while (cin >> n >> s, n || s) {
vector<int> V(n);
for (int i = 0; i < n; i++)
cin >> V[i];
sort(V.begin(), V.end());
int cnt = 0;
for (int i = 0; i < n; i++) {
int t = s - V[i];
... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 177 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 219 | 2 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
signed main() {
int n, s;
while (1) {
cin >> n >> s;
... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
signed main() {
int n, s;
while (1) {
cin >> n >> s;
... | [["-", 0, 74, 51, 23, 0, 16, 31, 2, 63, 22], ["+", 0, 74, 51, 23, 0, 16, 31, 2, 63, 22]] | 1 | 189 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 171 | 2 |
#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:... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 279 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | [["-", 0, 42, 0, 11, 12, 16, 31, 2, 63, 22], ["+", 0, 42, 0, 11, 12, 16, 31, 2, 63, 22]] | 1 | 257 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - lower_bound(c + e, c + a, b - c[e]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - lower_bound(c + e + 1, c + a, b - c[e] + ... | [["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 137 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - lower_bound(c + e, c + a, b - c[e]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c[25000];
while (scanf("%d%d", &a, &b), a | b) {
int s = 0;
for (int d = 0; d < a; d++)
scanf("%d", &c[d]);
sort(c, c + a);
for (int e = 0; e < a - 1; e++) {
s += c + a - upper_bound(c + e + 1, c + a, b - c[e]);
... | [["-", 0, 1, 0, 11, 12, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 2, 63, 22], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 137 | 4 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespac... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 209 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, S, r[20001];
while (cin >> n >> S && (n | S)) {
for (int i = 0; i < n; ++i)
cin >> r[i];
sort(r, r + n);
int res = 0;
for (int i = 0; i < n; ++i) {
int begin = distance(r, lower_bound(r, r + n, S - r[i]));... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, S, r[20001];
while (cin >> n >> S && (n | S)) {
for (int i = 0; i < n; ++i)
cin >> r[i];
sort(r, r + n);
int res = 0;
for (int i = 0; i < n; ++i) {
int begin = distance(r, upper_bound(r, r + n, S - r[i]));... | [["-", 49, 50, 51, 2, 3, 4, 0, 2, 63, 22], ["+", 49, 50, 51, 2, 3, 4, 0, 2, 63, 22]] | 1 | 138 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, S, r;
while (cin >> n >> S, n | S) {
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end(), greater<int>());
int ans = 0;
for (int i = 0; i < n - 1; i++)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, S, r;
while (cin >> n >> S, n | S) {
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end(), greater<int>());
int ans = 0;
for (int i = 0; i < n - 1; i++)... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 196 | 6 |
#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, 52, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 198 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, s, a;
while (cin >> n >> s, n || s) {
int r[n];
a = 0;
for (int i = 0; i < n; ++i) {
cin >> r[i];
}
sort(r, r + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (r[i] > s)
a += (n - (i ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, s, a;
while (cin >> n >> s, n || s) {
int r[n];
a = 0;
for (int i = 0; i < n; ++i) {
cin >> r[i];
}
sort(r, r + n, greater<int>());
for (int i = 0; i < n; ++i) {
if (r[i] > s)
a += (n - (i ... | [["-", 0, 57, 75, 76, 0, 7, 26, 27, 28, 22], ["+", 0, 57, 75, 76, 0, 7, 26, 27, 28, 22]] | 1 | 169 | 2 |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | [["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3,... | 1 | 447 | 8 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int I, S;
cin >> I >> S;
if (I == 0 && S == 0) {
break;
}
int *r = new int[I];
int count = 0;
int low, hi, mid;
for (int i = 0; i < I; i++) {
cin >> r[i];
}
/* for(int i = 0; i < I; i++){
... | #include <iostream>
using namespace std;
int main() {
while (true) {
int I, S;
cin >> I >> S;
if (I == 0 && S == 0) {
break;
}
int *r = new int[I];
int count = 0;
int low, hi, mid;
for (int i = 0; i < I; i++) {
cin >> r[i];
}
/* for(int i = 0; i < I; i++){
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 150 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 304 | 2 |
R = 101
while True:
n,S = list(map(int,input().split()))
if n == 0: break
r = [0]*R
for i in range(n):
r[int(input())] += 1
ans = 0
for i in range(R):
if 2*i > S:
ans += r[i]*(r[i]-1)/2
ans += r[i]*sum([r[j] for j in range(max(i+1,S-j+1),R)])
print(ans) | R = 101
while True:
n,S = list(map(int,input().split()))
if n == 0: break
r = [0]*R
for i in range(n):
r[int(input())] += 1
ans = 0
for i in range(R):
if 2*i > S:
ans += r[i]*(r[i]-1)/2
ans += r[i]*sum([r[j] for j in range(max(i+1,S-i+1),R)])
print(ans) | [["-", 0, 652, 3, 4, 0, 657, 31, 657, 12, 22], ["+", 0, 652, 3, 4, 0, 657, 31, 657, 12, 22]] | 5 | 132 | 2 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 814 | 2 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | [["-", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 7, 8, 9, 0, 57, 64, 93, 0, 94]] | 1 | 919 | 4 |
#include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | [["-", 0, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 16, 31, 2, 3, 4, 0, 16, 17, 72]] | 1 | 639 | 2 |
import java.util.ArrayList;
import java.util.Scanner;
/**
* Created by kosuke abe on 2014/10/29.
*/
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N, Q;
int[] date_info = new int[101];
while (true) {
int result = 0;
Fill(dat... | import java.util.ArrayList;
import java.util.Scanner;
/**
* Created by kosuke abe on 2014/10/29.
*/
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N, Q;
int[] date_info = new int[101];
while (true) {
int result = 0;
Fill(dat... | [["+", 15, 15, 0, 16, 12, 16, 12, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 16, 12, 504, 0, 73]] | 3 | 292 | 3 |
public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int n, q, m, c, i, max;
int[] d;
d = new int[101];
for (;;) {
n = sc.nextInt();
q = sc.nextInt();
if (n == 0 && q == 0)
break;
f... | public class Main {
public void run(java.io.InputStream in, java.io.PrintStream out) {
java.util.Scanner sc = new java.util.Scanner(in);
int n, q, m, c, i, max;
int[] d;
d = new int[101];
for (;;) {
n = sc.nextInt();
q = sc.nextInt();
if (n == 0 && q == 0)
break;
f... | [["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 45], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 73], ["+", 0, 7, 8, 196, 0, 7, 8, 196, 0, 46]] | 3 | 244 | 5 |
import java.util.*;
public class Main {
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args) {
while (kbd.hasNext()) {
int n = kbd.nextInt();
int m = kbd.nextInt();
if (n != 0 && m != 0) {
int[] date = new int[101];
while (n != 0) {
int... | import java.util.*;
public class Main {
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args) {
while (kbd.hasNext()) {
int n = kbd.nextInt();
int m = kbd.nextInt();
if (n != 0 && m != 0) {
int[] date = new int[101];
while (n != 0) {
int... | [["+", 15, 15, 0, 16, 12, 16, 31, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 16, 31, 504, 0, 73]] | 3 | 185 | 11 |
#include <stdio.h>
#include <string.h>
int N, M, Q, i, j, D[101], t;
int main() {
for (; scanf("%d%d", &N, &Q), N;) {
memset(D, 0, sizeof(D));
for (i = 0; i < N; i++)
for (scanf("%d", &M); M--;) {
scanf("%d", &t);
D[t]++;
}
for (i = 0, t = -1; i <= 100; i++)
if ((t == -1... | #include <stdio.h>
#include <string.h>
int N, M, Q, i, j, D[101], t;
int main() {
for (; scanf("%d%d", &N, &Q), N;) {
memset(D, 0, sizeof(D));
for (i = 0; i < N; i++)
for (scanf("%d", &M); M--;) {
scanf("%d", &t);
D[t]++;
}
for (i = 0, t = -1; i <= 100; i++)
if ((t == -1... | [["+", 0, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 17, 79], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 23, 0, 16, 17, 98]] | 0 | 175 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, b) loop(i, 0, b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n, q;
while (cin >> n... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, b) loop(i, 0, b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int n, q;
while (cin >> n... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 181 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < n; i++)
#define Forini(i, s, n) for (int i = s; i < n; i++)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define For(i, n) for (int i = 0; i < n; i++)
#define Forini(i, s, n) for (int i = s; i < n; i++)
#de... | [["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 3, 4, 0, 105, 51, 74, 39, 77, 39, 40], ["+", 3, 4, 0, 105, 51, 74, 39, 77, 39, 40], ["-", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13], ["+", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52... | 1 | 233 | 8 |
#include <iostream>
using namespace std;
int main() {
int n, q, m, i, j, memo;
while (1) {
int x[1000] = {0};
int day[150] = {0};
cin >> n >> q;
if (n == 0 && q == 0)
break;
for (i = 0; i < n; i++) {
cin >> m;
for (j = 0; j < m; j++) {
cin >> x[j];
day[x[j]]++;... | #include <iostream>
using namespace std;
int main() {
int n, q, m, i, j, memo;
while (1) {
int x[1000] = {0};
int day[150] = {0};
cin >> n >> q;
if (n == 0 && q == 0)
break;
for (i = 0; i < n; i++) {
cin >> m;
for (j = 0; j < m; j++) {
cin >> x[j];
day[x[j]]++;... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 204 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q, m, date, ans, max;
while (true) {
cin >> n >> q;
int N[50] = {0};
if (n == 0 && q == 0) {
break;
}
for (int i = 0; i < n; ++i) {
cin >> m;
for (int j = 0; j < m; ++j) {
cin >> date;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q, m, date, ans, max;
while (true) {
cin >> n >> q;
int N[100] = {0};
if (n == 0 && q == 0) {
break;
}
for (int i = 0; i < n; ++i) {
cin >> m;
for (int j = 0; j < m; ++j) {
cin >> date;
... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 175 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | [["-", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 35], ["-", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 343 | 4 |
#include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int main() {
while (1) {
int N, P;
cin >> N >> P;
if (!N)
break;
vector<int> aa(100);
for (int i = 0; i <... | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
const int My_Inf = 2147483647;
const long long int My_LInf = 9223372036854775807;
int main() {
while (1) {
int N, P;
cin >> N >> P;
if (!N)
break;
vector<int> aa(100);
for (int i = 0; i <... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 175 | 4 |
// 2016-12-01
#include <iostream>
using namespace std;
int main() {
int n, q, m, d;
while (cin >> n >> q, n) {
int c[100] = {};
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
cin >> d;
c[d]++;
}
}
int x;
x = 0;
for (int i = 1; i < 100... | // 2016-12-01
#include <iostream>
using namespace std;
int main() {
int n, q, m, d;
while (cin >> n >> q, n) {
int c[100] = {};
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j++) {
cin >> d;
c[d]++;
}
}
int x = 0;
for (int i = 1; i < 100; i++) ... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 70], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 73]] | 1 | 143 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, q;
while (cin >> n >> q, n, q) {
int mem[110] = {};
int maxv = -1;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int d;
cin >> d;
mem[d]++;
m... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, q;
while (cin >> n >> q, n, q) {
int mem[110] = {};
int maxv = -1;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int d;
cin >> d;
mem[d]++;
m... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 192 | 2 |
#include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const ... | #include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const ... | [["+", 15, 339, 51, 16, 12, 16, 12, 69, 28, 22], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 70], ["+", 51, 16, 12, 16, 12, 69, 341, 342, 0, 73]] | 1 | 236 | 3 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
while (1) {
cin >> n >> q;
if (!n && !q)
break;
vector<int> date(3000, 0);
int cou = 0, m;
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; j+... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, q;
while (1) {
cin >> n >> q;
if (!n && !q)
break;
vector<int> date(100000, 0);
int cou = 0, m;
for (int i = 0; i < n; i++) {
cin >> m;
for (int j = 0; j < m; ... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 226 | 4 |
#include <cstdio>
using namespace std;
int main() {
for (int n, q; scanf("%d%d", &n, &q), n;) {
int buc[101] = {};
for (int i = 0; i < n; i++) {
int m;
scanf("%d", &m);
for (int j = 0; j < m; j++) {
int d;
scanf("%d", &d);
buc[d]++;
}
}
int ans = 1;
... | #include <cstdio>
using namespace std;
int main() {
for (int n, q; scanf("%d%d", &n, &q), n;) {
int buc[101] = {};
for (int i = 0; i < n; i++) {
int m;
scanf("%d", &m);
for (int j = 0; j < m; j++) {
int d;
scanf("%d", &d);
buc[d]++;
}
}
int ans = 1;
... | [["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73]] | 1 | 166 | 3 |
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, q;
for (; cin >> n >> q, n;) {
int day[1000];
memset(day, 0, sizeof(day));
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (; m--;) {
int t;
cin >> t;
day[t]++;
}
}
... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, q;
for (; cin >> n >> q, n;) {
int day[100];
memset(day, 0, sizeof(day));
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (; m--;) {
int t;
cin >> t;
day[t]++;
}
}
... | [["-", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 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, 73]] | 1 | 141 | 7 |
#include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, Q;
//各テストケースについて
while (cin >> N >> Q) {... | #include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, Q;
//各テストケースについて
while (cin >> N >> Q) {... | [["+", 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 | 307 | 3 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 309 | 2 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
(N, Q) = list(map(int, input().split()))
while N!=0 and Q!=0:
H=[0]*101
for i in range(N):
q = list(map(int, input().split()))
for j in range(len(q)):
H[q[j]] += 1
if Q <= max(H):
print(H.index(max(H)))
else:
pri... | #! /usr/bin/env python
# -*- coding: utf-8 -*-
(N, Q) = list(map(int, input().split()))
while N!=0 and Q!=0:
H=[0]*101
for i in range(N):
q = list(map(int, input().split()))
for j in range(1, len(q)):
H[q[j]] += 1
if Q <= max(H):
print(H.index(max(H)))
else:
... | [["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 131 | 2 |
while True:
N, Q = list(map(int, input().split()))
if N == 0 and Q == 0:
break
t = [list(map(int, input().split()))[1:] for _ in range(N)]
table = [[i, 0] for i in range(10)]
for i in t:
for j in i:
table[j][1] += 1
table.sort(reverse=True, key=lambda x: x[1])
... | while True:
N, Q = list(map(int, input().split()))
if N == 0 and Q == 0:
break
t = [list(map(int, input().split()))[1:] for _ in range(N)]
table = [[i, 0] for i in range(101)]
for i in t:
for j in i:
table[j][1] += 1
table.sort(reverse=True, key=lambda x: x[1])
... | [["-", 12, 658, 0, 659, 12, 652, 3, 4, 0, 612], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 612]] | 5 | 137 | 2 |
#include <memory.h>
#include <stdio.h>
int main(void) {
int N, W, H, i, x, y, map[100][100], S, T, o, sum, sum1, max, j;
for (; sum = 0, max = 0, memset(map, 0, sizeof(map)), scanf("%d", &N), N;) {
int W, H;
scanf("%d %d", &W, &H);
for (i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
map[y][x] ... | #include <memory.h>
#include <stdio.h>
int main(void) {
int N, W, H, i, x, y, map[100][100], S, T, o, sum, sum1, max, j;
for (; sum = 0, max = 0, memset(map, 0, sizeof(map)), scanf("%d", &N), N;) {
int W, H;
scanf("%d %d", &W, &H);
for (i = 0; i < N; i++) {
scanf("%d %d", &x, &y);
map[y][x] ... | [["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 373 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define W 100
#define H 100
#define MAX(A, B) ((B) > (A) ? (B) : (A))
int main(int argc, char *argv[]) {
int i, j, k;
for (;;) {
int d[W + 1][H + 1] = {};
int w, h, s, t;
int res = 0;
int n;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d%d"... | #include <stdio.h>
#include <stdlib.h>
#define W 100
#define H 100
#define MAX(A, B) ((B) > (A) ? (B) : (A))
int main(int argc, char *argv[]) {
int i, j, k;
for (;;) {
int d[W + 1][H + 1] = {};
int w, h, s, t;
int res = 0;
int n;
scanf("%d", &n);
if (n == 0)
break;
scanf("%d%d"... | [["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 298 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int W, H, maze[110][110], sum[110][110] = {0}, S, T, x, y, ans = 0;
cin >> W >> H;
for (int i = 0; i < n; ++i) {
scanf("%d%d", &x, &y);
x--;
y--;
maze[y][x] = 1;
}
cin >> S >> T;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int W, H, maze[110][110] = {0}, sum[110][110] = {0}, S, T, x, y, ans = 0;
cin >> W >> H;
for (int i = 0; i < n; ++i) {
scanf("%d%d", &x, &y);
x--;
y--;
maze[y][x] = 1;
}
cin >> S >>... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 295 | 4 |
#include <algorithm>
#include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0) {
break;
} else {
int W, H, S, T;
cin >> W >> H;
int map[100][100];
REP(i, N) {
int x, y;
... | #include <algorithm>
#include <iostream>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
while (1) {
int N;
cin >> N;
if (N == 0) {
break;
} else {
int W, H, S, T;
cin >> W >> H;
int map[100][100] = {};
REP(i, N) {
int x, y;... | [["+", 75, 76, 0, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 0, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 227 | 3 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
int P[150][150] = {};
while (1) {
for (int i = 1; i <= 140; i++)
for (int j = 1; j <= 140; j++) {
P[j][i] = 0;
}
cin >> n;
if (n == 0)
break;
int A, ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
int P[150][150] = {};
while (1) {
for (int i = 1; i <= 140; i++)
for (int j = 1; j <= 140; j++) {
P[j][i] = 0;
}
cin >> n;
if (n == 0)
break;
int A, ... | [["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 332 | 2 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
int grid[101][101] = {0};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
grid[x][y] = 1;
}
int s, t;
cin >> s >> t;
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int grid[101][101] = {0};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
grid[x][y] = 1;
}
int s, t;
cin >> s >> t;
... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 213 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int w, h;
cin >> w;
cin >> h;
int area[100][100];
fill(area[0], area[99], 0);
int x, y;
for (int i = 0; i < n; i++) {
cin >> x;
cin >> y;
area[x - 1][y - 1] = 1;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int w, h;
cin >> w;
cin >> h;
int area[100][100];
fill(area[0], area[99], 0);
int x, y;
for (int i = 0; i < n; i++) {
cin >> x;
cin >> y;
area[x - 1][y - 1] = 1;
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 31, 22], ["-", 51, 16, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 51,... | 1 | 246 | 10 |
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n && n;) {
int w, h, w0, h0, xy[500][500], r = 0;
cin >> w >> h;
for (int i = 0, a, b; i < n && cin >> a >> b; i++)
xy[b - 1][a - 1] = 1;
cin >> w0 >> h0;
for (int i = 0; i < h - h0 + 1; i++)
for (int j = 0; j < w... | #include <iostream>
using namespace std;
int main() {
for (int n; cin >> n && n;) {
int w, h, w0, h0, xy[200][200] = {}, r = 0;
cin >> w >> h;
for (int i = 0, a, b; i < n && cin >> a >> b; i++)
xy[b - 1][a - 1] = 1;
cin >> w0 >> h0;
for (int i = 0; i < h - h0 + 1; i++)
for (int j = 0; ... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 0, 7, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 201 | 7 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define LOOP(i, x, n) for (int i = x; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
signed main() {
int n;
while (cin >>... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define LOOP(i, x, n) for (int i = x; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
signed main() {
int n;
while (cin >>... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 248 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
while (1) {
int n;
int a[100][100];
cin >> n;
if (n == 0)
break;
lp(i, 100) {
lp(k, 100) { a[i][k] = 0; }
}
int w, h;
cin >> w >> h;
lp(i, n) {
int x, y;
... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
while (1) {
int n;
int a[100][100];
cin >> n;
if (n == 0)
break;
lp(i, 100) {
lp(k, 100) { a[i][k] = 0; }
}
int w, h;
cin >> w >> h;
lp(i, n) {
int x, y;
... | [["+", 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], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 22], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 22]] | 1 | 218 | 8 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int MAXW = 110, MAXH = 110;
int main() {
int n, w, h, x, y, s, t;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int MAXW = 110, MAXH = 110;
int main() {
int n, w, h, x, y, s, t;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 379 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
int field[105][105] = {{0}};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
field[y][x] = 1;
}
int s, t;
c... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
int field[105][105] = {{0}};
int w, h;
cin >> w >> h;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
field[y][x] = 1;
}
int s, t;
c... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 226 | 8 |
import java.util.Scanner;
class Bot {
int x = 1, y = 1, dir = 0;
private int width, height;
private int[][] xy = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
public Bot(int w, int h) {
width = w;
height = h;
}
public void forward(int step) {
x += xy[dir][0] * step;
y += xy[dir][1] * step;
beP... | import java.util.Scanner;
class Bot {
int x = 1, y = 1, dir = 0;
private int width, height;
private int[][] xy = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
public Bot(int w, int h) {
width = w;
height = h;
}
public void forward(int step) {
x += xy[dir][0] * step;
y += xy[dir][1] * step;
beP... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 489 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
int main() {
int m, n;
string q;
while (cin >> m >> n, m) {
int x = 1, y = 1, dir = 0,... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
int main() {
int m, n;
string q;
while (cin >> m >> n, m) {
int x = 1, y = 1, dir = 0,... | [["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 41, 64, 91, 17, 33]] | 1 | 347 | 9 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
int dx[] = {0, 1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = a; i < n; i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
int dx[] = {0, 1... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 334 | 4 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [["-", 0, 57, 15, 339, 51, 16, 12, 5, 0, 6], ["+", 0, 57, 15, 339, 51, 16, 12, 5, 0, 6]] | 1 | 321 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;... | [["-", 0, 52, 8, 9, 0, 57, 15, 339, 51, 22], ["-", 0, 52, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 52, 8, 9, 0, 57, 64, 116, 0, 117], ["-", 0, 52, 8, 9, 0, 57, 64, 116, 0, 35], ["-", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["-", 0, 52, 8, 9, 0, 57, 15, 339, 0, 24]] | 1 | 427 | 6 |
#include <iostream>
using namespace std;
int main(void) {
int c, r;
while (cin >> c >> r) {
if (c == 0 && r == 0)
break;
int x = 1, y = 1, n;
int angle = 0;
const int POSX[] = {0, 1, 0, -1};
const int POSY[] = {1, 0, -1, 0};
string s;
while (cin >> s) {
if (s == "FORWARD") {
... | #include <iostream>
using namespace std;
int main(void) {
int c, r;
while (cin >> c >> r) {
if (c == 0 && r == 0)
break;
int x = 1, y = 1, n;
int angle = 0;
const int POSX[] = {0, 1, 0, -1};
const int POSY[] = {1, 0, -1, 0};
string s;
while (cin >> s) {
if (s == "FORWARD") {
... | [["-", 0, 57, 75, 76, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 22]] | 1 | 362 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n + m) {
int mx = 1, my = 1;
int direction = 1;
while (1) {
string command;
int step;
cin >> command;
if (command == "FORWARD") {
cin >> step;
if (direction ==... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n + m) {
int mx = 1, my = 1;
int direction = 1;
while (1) {
string command;
int step;
cin >> command;
if (command == "FORWARD") {
cin >> step;
if (direction ==... | [["-", 75, 76, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 12, 22]] | 1 | 291 | 2 |
while gets
n, m = $_.split.map(&:to_i)
break if n == 0 && m == 0
x = y = 1
rotate = [0,1]
loop do
str = gets.split
case str[0]
when "FORWARD"
x += rotate[0]*str[1].to_i
y += rotate[1]*str[1].to_i
x = n if x > n; x = 1 if x < 1
y = n if y > n; y = 1 if y < 1
when "BACKWA... | while gets
n, m = $_.split.map(&:to_i)
break if n == 0 && m == 0
x = y = 1
rotate = [0,1]
loop do
str = gets.split
case str[0]
when "FORWARD"
x += rotate[0]*str[1].to_i
y += rotate[1]*str[1].to_i
x = n if x > n; x = 1 if x < 1
y = m if y > m; y = 1 if y < 1
when "BACKWA... | [["-", 0, 763, 8, 749, 0, 751, 8, 662, 12, 22], ["+", 0, 763, 8, 749, 0, 751, 8, 662, 12, 22], ["-", 0, 763, 8, 749, 0, 751, 15, 738, 12, 22], ["+", 0, 763, 8, 749, 0, 751, 15, 738, 12, 22]] | 4 | 222 | 8 |
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer st;
public static void main(String[] args) throws IOException {
new Main().cal();
}
priva... | import java.io.*;
import java.lang.reflect.*;
import java.util.*;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer st;
public static void main(String[] args) throws IOException {
new Main().cal();
}
priva... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 64, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 336 | 4 |
#include <stdio.h>
int main() {
int n, a, b, i, c;
while (scanf("%d %d %d", &n, &a, &b), n || a || b) {
char d[2000000] = {1};
for (i = c = 0; i < n; i++) {
if (d[i])
d[i + a] = d[i + b] = 1;
else
c++;
}
printf("%d\n", c);
}
return 0;
} | #include <stdio.h>
int main() {
int n, a, b, i, c;
while (scanf("%d %d %d", &n, &a, &b), n || a || b) {
char d[2000000] = {1};
for (i = c = 0; i <= n; i++) {
if (d[i])
d[i + a] = d[i + b] = 1;
else
c++;
}
printf("%d\n", c);
}
return 0;
} | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 112 | 2 |
#include <algorithm>
#include <queue>
#include <stdio.h>
using namespace std;
int ijk[1010000];
int v[1010000];
int main() {
int a, b, c;
while (scanf("%d%d%d", &a, &b, &c), a) {
if (b < c)
swap(c, b);
for (int i = 0; i < b; i++)
ijk[i] = 999999999;
for (int i = 0; i < b; i++)
v[i] = 0... | #include <algorithm>
#include <queue>
#include <stdio.h>
using namespace std;
int ijk[1010000];
int v[1010000];
int main() {
int a, b, c;
while (scanf("%d%d%d", &a, &b, &c), a) {
if (b < c)
swap(c, b);
for (int i = 0; i < b; i++)
ijk[i] = 999999999;
for (int i = 0; i < b; i++)
v[i] = 0... | [["-", 0, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 17, 33]] | 1 | 322 | 2 |
// AOJ 1105
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef vector<int> Seq;
const int NMAX = 1e7;
int solve(int a, int b, int n) {
bool countable[NMAX];
REP(i, n + 1) { countable[i] = false; }
countable[0] = true;
int unables = 0;
RE... | // AOJ 1105
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef vector<int> Seq;
const int NMAX = 2000100;
int solve(int a, int b, int n) {
bool countable[NMAX];
REP(i, n + 1) { countable[i] = false; }
countable[0] = true;
int unables = 0;
... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 171 | 2 |
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool f[1000001];
int main() {
int n, a, b, s, t;
while (cin >> n >> a >> b, n) {
rep(i, n) f[i] = 1;
rep(j, a) for (t = b * j; t <= n; t += a) f[t] = 0;
s = 0;
rep(i, n) s += f[i + 1];
cout << s << endl;
}
... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool f[1000001];
int main() {
int n, a, b, s, t;
while (cin >> n >> a >> b, n) {
rep(i, n + 1) f[i] = 1;
rep(j, a) for (t = b * j; t <= n; t += a) f[t] = 0;
s = 0;
rep(i, n) s += f[i + 1];
cout << s << endl;
... | [["+", 31, 69, 28, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 122 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int f[101];
int n, a, b, c;
int i, j;
while (cin >> n >> a >> b, n || a || b) {
memset(f, 1, sizeof(int) * 101);
for (i = 0; i <= n; i += a)
if (f[i])
for (j = i; j <= n; j += b)
f[j] = 0;
c = 0;
f... |
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int f[1000001];
int n, a, b, c;
int i, j;
while (cin >> n >> a >> b, n || a || b) {
memset(f, 1, sizeof(int) * 1000001);
for (i = 0; i <= n; i += a)
if (f[i])
for (j = i; j <= n; j += b)
f[j] = 0;
c = ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13], ["+", 3, 4, 0, 105, 51, 74, 51, 66, 28, 13]] | 1 | 141 | 4 |
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int n, a, b;
while (cin >> n >> a >> b && n != 0) {
bool ok[1000001];
memset(ok, false, sizeof(ok));
int ans = 0;
ok[0] = true;
for (int i = 0; i < n; i++) {
if (ok[i]) {
if (i + a <= n)
ok[i + a] ... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int n, a, b;
while (cin >> n >> a >> b && n != 0) {
bool ok[1000001];
memset(ok, false, sizeof(ok));
int ans = 0;
ok[0] = true;
for (int i = 0; i <= n; i++) {
if (ok[i]) {
if (i + a <= n)
ok[i + a]... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 139 | 2 |
#include <iostream>
using namespace std;
int main() {
int map[1500000];
long n, a, b, ans;
while (1) {
cin >> n >> a >> b;
if (n == 0 && a == 0 && b == 0)
break;
for (long i = 1; i < n + 1; i++) {
map[i] = 1;
}
map[0] = 0;
for (long i = 0; i < n + 1; i++) {
if (map[i] ==... | #include <iostream>
using namespace std;
int main() {
int map[1500000];
long n, a, b, ans;
while (1) {
cin >> n >> a >> b;
if (n == 0 && a == 0 && b == 0)
break;
for (long i = 1; i < n + 1; i++) {
map[i] = 1;
}
map[0] = 0;
for (long i = 0; i < n + 1; i++) {
if (map[i] ==... | [["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 176 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 263 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, a, b;
bool nr[1000003];
int main() {
cin >> n >> a >> b;
while (n + a + b > 0) {
fill(nr + 1, nr + n, 1);
for (int i = 0; i <= n; i++) {
if (!nr[i]) {
if (i + a <= n)
nr[i + a] = 0;
if (i + b <= n)
... | #include <algorithm>
#include <iostream>
using namespace std;
int n, a, b;
bool nr[1000003];
int main() {
cin >> n >> a >> b;
while (n + a + b > 0) {
fill(nr + 1, nr + n + 1, 1);
for (int i = 0; i <= n; i++) {
if (!nr[i]) {
if (i + a <= n)
nr[i + a] = 0;
if (i + b <= n)
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 167 | 2 |
#include <stdio.h>
/* 最大公約数を返す */
int gcd(int a, int b) {
int r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return (a < 0) ? -a : a;
}
/* 値を入れ換える */
void swap(int *a, int *b) {
int c = *a;
*a = *b;
*b = c;
}
int main(void) {
int a, b, c; /* 与えられる値 */
int p, q, r, s;
int f; /* 解が存在するか... | #include <stdio.h>
/* 最大公約数を返す */
int gcd(int a, int b) {
int r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return (a < 0) ? -a : a;
}
/* 値を入れ換える */
void swap(int *a, int *b) {
int c = *a;
*a = *b;
*b = c;
}
int main(void) {
int a, b, c; /* 与えられる値 */
int p, q, r, s;
int f; /* 解が存在するか... | [["+", 64, 9, 0, 57, 15, 23, 0, 91, 17, 111], ["+", 0, 57, 15, 23, 0, 91, 28, 23, 0, 24], ["-", 15, 23, 0, 16, 12, 23, 0, 11, 17, 32], ["+", 0, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 0, 91, 28, 23, 0, 16, 12, 23, 0, 25]] | 0 | 394 | 5 |
#include <assert.h>
main(a, b, c, p, q, r, s, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (c == 0) {
if (a == 1 && b > 0)
printf("1 0 %d %d\n", a, b);
else
printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0) {
for (p =... | #include <assert.h>
main(a, b, c, p, q, r, s, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (c == 0) {
if (a == 1 && b < 0)
printf("1 0 %d %d\n", a, b);
else
printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0) {
for (p =... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["-", 64, 9, 0, 7, 15, 16, 31, 16, 31, 22], ["-", 64, 9, 0, 7, 15, 16, 31, 16, 17, 48]] | 0 | 250 | 11 |
main(a, b, c, p, q, r, s, S, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (!c) {
a == 1 && b < 0 ? printf("1 0 %d %d\n", a, b)
: printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0)
for (p = a / r, S = 1; s <= abs(c); s+... | main(a, b, c, p, q, r, s, i) {
for (; scanf("%d%d%d", &a, &b, &c), a;) {
if (!c) {
a == 1 && b < 0 ? printf("1 0 %d %d\n", a, b)
: printf("%d %d 1 0\n", a, b);
continue;
}
for (r = 1; r * r <= a; r++)
if (a % r == 0)
for (p = a / r, s = 1; s <= abs(c); s++)
... | [["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 57, 64, 7, 10, 34, 12, 11, 31, 22], ["+", 8, 57, 64, 7, 10, 34, 12, 11, 31, 22]] | 0 | 240 | 26 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
const double EPS = 1e-6;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define F first
#define S second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) (a).be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PI;
const double EPS = 1e-6;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define F first
#define S second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) (a).be... | [["-", 31, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["+", 31, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22]] | 1 | 660 | 4 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#define mp make_pair
#define pii pair<int, int>
#define ff first
#define ss second
#define ll lon... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#define mp make_pair
#define pii pair<int, int>
#define ff first
#define ss second
#define ll lon... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 387 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int a, b, c;
vector<int> p, q;
int main() {
while (true) {
cin >> a >> b >> c;
p.clear();
q.clear();
if (a == 0)
break;
if (c == 0) {
if (b < 0)
cout << a << " "
<< "0"
<< " "
<< "... | #include <iostream>
#include <vector>
using namespace std;
int a, b, c;
vector<int> p, q;
int main() {
while (true) {
cin >> a >> b >> c;
p.clear();
q.clear();
if (a == 0)
break;
if (c == 0) {
if (b < 0 && a == 1)
cout << a << " "
<< "0"
<< " "
... | [["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 389 | 4 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;... | [["-", 0, 1, 0, 16, 31, 16, 12, 91, 17, 33]] | 1 | 532 | 1 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
void solve(int a, int b, int c) {
if (c == 0) {
if (a == 1 && b < 0)
printf("1 0 1 %d\n", b);
else
printf("%d %d 1 0\n", a, b);
return;
}
vector<int> ps, qs;
for (int i = 1; i <= a; i++)
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
void solve(int a, int b, int c) {
if (c == 0) {
if (a == 1 && b < 0)
printf("1 0 1 %d\n", b);
else
printf("%d %d 1 0\n", a, b);
return;
}
vector<int> ps, qs;
for (int i = 1; i <= a; i++)
... | [["+", 8, 9, 0, 7, 15, 16, 12, 2, 63, 22], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 25]] | 1 | 336 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
#define equal(a, b) (fabs(a - b) < EPS)
#define MAX_N 400
#define INF 1e9
#define lt(a, b) (a - b < -EPS)
struct Point {
double x, y;
Point() {}
Point(double x, double y) : x(x), y(y) {}
Point operator+(const Point &p) const { return Point(x +... | #include <bits/stdc++.h>
using namespace std;
#define EPS 1e-10
#define equal(a, b) (fabs(a - b) < EPS)
#define MAX_N 400
#define INF 1e9
#define lt(a, b) (a - b < -EPS)
struct Point {
double x, y;
Point() {}
Point(double x, double y) : x(x), y(y) {}
Point operator+(const Point &p) const { return Point(x +... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 682 | 2 |
#include <bits/stdc++.h>
#define N 401
using namespace std;
typedef complex<double> P;
P p[N];
int n;
const double EPS = 1e-8;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
b -= a;
c -= a;
if (cross(b, c) > EPS)
return 1;
i... | #include <bits/stdc++.h>
#define N 401
using namespace std;
typedef complex<double> P;
P p[N];
int n;
const double EPS = 1e-8;
double dot(P a, P b) { return real(conj(a) * b); }
double cross(P a, P b) { return imag(conj(a) * b); }
int ccw(P a, P b, P c) {
b -= a;
c -= a;
if (cross(b, c) > EPS)
return 1;
i... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 411 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
const double PI = 4 * atan(1.0);
typedef complex<double> P;
// àÏ
double dot(P a, P b) { return (a.real() * b.real() + a... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a) - (b)) < EPS)
const double PI = 4 * atan(1.0);
typedef complex<double> P;
// àÏ
double dot(P a, P b) { return (a.real() * b.real() + a... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22]] | 1 | 474 | 2 |
def make_routes(ns,used, cur):
if all(used[cur]):
yield []
else:
for i in (d for d,s in zip(list(range(ns)), used[cur]) if not s):
used[cur][i] = used[i][cur] = True
for ret in make_routes(ns,used,i):
yield [[cur, i]] + ret
used[cur][i] = used[... | def make_routes(ns,used, cur):
if all(used[cur]):
yield []
else:
for i in (d for d,s in zip(list(range(ns+1)), used[cur]) if not s):
used[cur][i] = used[i][cur] = True
for ret in make_routes(ns,used,i):
yield [[cur, i]] + ret
used[cur][i] = use... | [["+", 3, 4, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 4, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 370 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int n;
while (cin >> n) {
if (n == 0) {
break;
}
long long int MAX = 0;
for (long long int i = n / 2; i < n; i++) {
for (long long int j = i; j < n; j++) {
if (i * i * i + j * j * j <= n * n * n) {... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int n;
while (cin >> n) {
if (n == 0) {
break;
}
long long int MAX = 0;
for (long long int i = 1; i < n; i++) {
for (long long int j = i; j < n; j++) {
if (i * i * i + j * j * j <= n * n * n) {
... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 85], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 163 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i * i * i < n * n * n; i++) {
for (int j = 0; i * i * i + j * j * j < n * n * n; j++) {
ans = max(ans, i * i * i + j * j * j);
}
}
cout << n * n *... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 0;
for (int i = 0; i * i * i < n * n * n; i++) {
for (int j = 0; i * i * i + j * j * j < n * n * n; j++) {
ans = max(ans, i * i * i + j * j * j);
}
}
cout << n * n *... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 115 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
const int dx[] = {-1, 0, 1, 1};
const int dy[] = {1, 1, 1, 0};
int dfs(int t[5][4], int cnt) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
const int dx[] = {-1, 0, 1, 1};
const int dy[] = {1, 1, 1, 0};
int dfs(int t[5][4], int cnt) {
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 0, 57, 64, 9, 0, 43, 49, 50, 49, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 378 | 7 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool match(string s, string t) {
for (int i = 0; i < 8; i++) {
if (s[i] != '?' && s[i] != t[i])
return false;
}
return true;
}
int n, m;
bool x[1111];
string r1[1111], r2[1111], a, b, c;
int main() {
while (cin >> n >> m, n |... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
bool match(string s, string t) {
for (int i = 0; i < 8; i++) {
if (s[i] != '?' && s[i] != t[i])
return false;
}
return true;
}
int n, m;
bool x[1111];
string r1[1111], r2[1111], a, b, c;
int main() {
while (cin >> n >> m, n |... | [["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68]] | 1 | 352 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.