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 <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int min = n + 1;
int count = 0;
for (int i = min; i < 2 * n; i++) {
if (i == 2 || i == 3)
count++;
else if (i % 2 != 0) {
for (int j = 3; j <= (int)(sqrt(i)); j++) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
int min = n + 1;
int count = 0;
for (int i = min; i <= 2 * n; i++) {
if (i == 2 || i == 3)
count++;
else if (i % 2 != 0) {
for (int j = 2; j <= (int)(sqrt(i)); j++) {
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 64, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 145 | 4 |
#include <cstdio>
using namespace std;
#define MAX_N 123500
int prime[MAX_N * 2];
void eratos() {
for (int i = 0; i < MAX_N * 2; i++)
prime[i] = 1;
prime[0] = prime[1] = 0;
for (int i = 2; i * i <= MAX_N * 2; i++)
if (prime[i]) {
for (int j = i * 2; j <= MAX_N * 2; j += i)
prime[j] = 0;
... | #include <cstdio>
using namespace std;
#define MAX_N 123500
int prime[MAX_N * 2];
void eratos() {
for (int i = 0; i < MAX_N * 2; i++)
prime[i] = 1;
prime[0] = prime[1] = 0;
for (int i = 2; i * i <= MAX_N * 2; i++)
if (prime[i]) {
for (int j = i * 2; j <= MAX_N * 2; j += i)
prime[j] = 0;
... | [["-", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 203 | 2 |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int func(int m, int l);
int main() {
int n, ans;
while (1) {
cin >> n;
if (n == 0)
break;
if (n == 1)
ans = 1;
if (n % 2 == 0)
ans = func(n + 1, n);
else
ans = func(n + 2, n)... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int func(int m, int l);
int main() {
int n, ans;
while (1) {
cin >> n;
if (n == 0)
break;
if (n == 1)
ans = 1;
else {
if (n % 2 == 0)
ans = func(n + 1, n);
else
a... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 199 | 3 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
bool prime[200000];
for (int i = 0; i < 200000 + 1; i++) {
prime[i] = true;
}
prime[0] = prime[1] = false;
for (int i = 2; i < 200000 + 1; i++) {
if (prime[i]) {
for (int j... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
bool prime[300000];
for (int i = 0; i < 300000 + 1; i++) {
prime[i] = true;
}
prime[0] = prime[1] = false;
for (int i = 2; i < 300000 + 1; i++) {
if (prime[i]) {
for (int j... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13]] | 1 | 204 | 8 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | [["-", 0, 16, 31, 16, 12, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 16, 12, 2, 63, 22], ["-", 12, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 461 | 4 |
// AOJ 1172
// Chebyshev's Theorem
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int prime[300001] = {0};
int MAX = 300000;
void make_prime() {
int i, j;
for (i = 2; i < MAX; i++) {
prime[i] = 1;
}
for (i = 2; i * i < MAX; i++) {
if (prime[i]) {
for (j = i *... | // AOJ 1172
// Chebyshev's Theorem
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int prime[300001] = {0};
int MAX = 300000;
void make_prime() {
int i, j;
for (i = 2; i < MAX; i++) {
prime[i] = 1;
}
for (i = 2; i * i < MAX; i++) {
if (prime[i]) {
for (j = i *... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 195 | 2 |
#include <iostream>
using namespace std;
int main() {
int n,
ans = 0,
primes[94] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,
41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89,
97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
... | #include <iostream>
using namespace std;
int main() {
int n,
ans = 0,
primes[95] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,
41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89,
97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 21], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 307 | 6 |
#include <cstdio>
#include <iostream>
using namespace std;
main() {
int a[400000] = {0};
for (int i = 3; i <= 300000; i += 2) {
if (a[i] == 0) {
for (int j = i + i; j <= 40000; j += i) {
a[j] = 1;
}
}
}
int n;
while (cin >> n) {
if (n == 0)
break;
int ans = 0;
... | #include <cstdio>
#include <iostream>
using namespace std;
main() {
int a[400000] = {0};
for (int i = 3; i <= 300000; i += 2) {
if (a[i] == 0) {
for (int j = i + i; j <= 400000; j += i) {
a[j] = 1;
}
}
}
int n;
while (cin >> n) {
if (n == 0)
break;
int ans = 0;
... | [["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13]] | 1 | 158 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int dp[300000] = {0}; // 0:未定 1:素数である 2:素数でない
bool isSosu(int n) {
bool res = true;
if (dp[n] == 1) {
res = true;
} else if (dp[n] == 2) {
res = false;
} else {
if (n % 2 == 0 && n != 2) {
res = false;
} else {
for (int i =... | #include <cmath>
#include <iostream>
using namespace std;
int dp[300000] = {0}; // 0:未定 1:素数である 2:素数でない
bool isSosu(int n) {
bool res = true;
if (dp[n] == 1) {
res = true;
} else if (dp[n] == 2) {
res = false;
} else {
if (n % 2 == 0 && n != 2) {
res = false;
} else {
for (int i =... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 17, 19]] | 1 | 220 | 2 |
#include <iostream>
using namespace std;
int num[300000];
int main(void) {
for (int i = 0; i < 300000; i++) {
num[i] = 1;
}
num[0] = 0;
num[1] = 0;
for (int i = 2; i < 300000; i++) {
for (int j = 2; i * j < 300000; j++) {
num[i * j] = 0;
}
}
int n;
while (cin >> n, n) {
int cnt... | #include <iostream>
using namespace std;
int num[300000];
int main(void) {
for (int i = 0; i < 300000; i++) {
num[i] = 1;
}
num[0] = 0;
num[1] = 0;
for (int i = 2; i < 300000; i++) {
for (int j = 2; i * j < 300000; j++) {
num[i * j] = 0;
}
}
int n;
while (cin >> n, n) {
int cnt... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 151 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIS... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIS... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 266 | 5 |
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define N 300000
using namespace std;
int main() {
int array[N] = {0};
rep(i, N) { array[i] = 1; }
array[0] = 0;
array[1] = 0;
int end;
end = (int)sqrt((double)N);
for (int i = 2; i < end; i++) {
if (array[i] == 1) ... | #include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define N 300000
using namespace std;
int main() {
int array[N] = {0};
rep(i, N) { array[i] = 1; }
array[0] = 0;
array[1] = 0;
int end;
end = (int)sqrt((double)N);
for (int i = 2; i < end; i++) {
if (array[i] == 1) ... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 199 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
bool isprime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main() {
int n;
while (cin >> n && n) {
int sum = 0;
rep(i, n) {
int x = n + i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
bool isprime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main() {
int n;
while (cin >> n && n) {
int sum = 0;
rep(i, n) {
int x = n + i + ... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 106 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
bool is_prime[300000];
int sieve(int a) {
int p = 0, p1 = 0;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= a * 2; i++) {
if (i == a)
p1 = p;
if (is_prime[i]) {
p++;
for (int j = i * 2; j <= a * 2; j += i)
is_... | #include <cstring>
#include <iostream>
using namespace std;
bool is_prime[300000];
int sieve(int a) {
int p = 0, p1 = 0;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= a * 2; i++) {
if (i == a + 1)
p1 = p;
if (is_prime[i]) {
p++;
for (int j = i * 2; j <= a * 2; j += i)
... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 151 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int count = 0;
for (int i = n + 1; i <= 2 * n; ++i) {
int tmp_c = 0;
for (int j = 1; j * j <= 2 * n; ++j) {
if (i % j == 0) {
++tmp_c;
}
}
if (tmp_c == 2) {... | #include <iostream>
#include <vector>
//#include<math>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int count = 0;
for (int i = n + 1; i <= 2 * n; ++i) {
int tmp_c = 0;
for (int j = 1; j * j <= 2 * n; ++j) {
if (i % j == 0) {
++tmp_c;
}
}
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 110 | 2 |
#include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, i, j, pin = 0, p = 0;
while (1) {
cin >> n;
if (n == 0) {
break;
}
for (i = n + 1; i < 2 * n + 1; i++) {
for (j = 2; j < sqrt((double)i) + 1; j++) {
if (i % j == 0) {
pin ... | #include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, i, j, pin = 0, p = 0;
while (1) {
cin >> n;
if (n == 0) {
break;
}
for (i = n + 1; i < 2 * n + 1; i++) {
for (j = 2; j < sqrt((double)i) + 1; j++) {
if (i % j == 0) {
pin ... | [["+", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22]] | 1 | 160 | 2 |
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define MAX_PRIME 300000
using namespace std;
bool isPrime[MAX_PRIME + 1]; // true:?´???°??§?????????false:?´???°??§??????
int sumOfPrime[MAX_PRIME + 1]; //?´???????
int main() {
//?????????
for (int i = 0; i <= MAX_PRIME; i++) {
isPrime[i] =... | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define MAX_PRIME 300000
using namespace std;
bool isPrime[MAX_PRIME + 1]; // true:?´???°??§?????????false:?´???°??§??????
int sumOfPrime[MAX_PRIME + 1]; //?´???????
int main() {
//?????????
for (int i = 0; i <= MAX_PRIME; i++) {
isPrime[i] =... | [["-", 12, 16, 12, 69, 341, 342, 0, 16, 17, 72], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 203 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<int> isprime(2 * n + 1, 1);
isprime[0] = 0;
isprime[1] = 0;
for (int i = 1; i <= 2 * n; i++)
if (isprime[i]) {
for (int j = i * 2; j <= 2 * n; j += i)
isprime[j] = 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<int> isprime(2 * n + 1, 1);
isprime[0] = 0;
isprime[1] = 0;
for (int i = 1; i <= 2 * n; i++)
if (isprime[i]) {
for (int j = i * 2; j <= 2 * n; j += i)
isprime[j] = 0;
}
... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 139 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 252 | 2 |
#include <bits/stdc++.h>
#define REP(i, n, N) for (int i = n; i < N; i++)
#define p(S) cout << S << endl
using namespace std;
bool prime[123457] = {false};
void isPrime() {
prime[1] = true;
for (int i = 2; i * i < 300000; i++) {
if (!prime[i]) {
for (int j = 2 * i; j < 300000; j += i) {
prime[j] ... | #include <bits/stdc++.h>
#define REP(i, n, N) for (int i = n; i < N; i++)
#define p(S) cout << S << endl
using namespace std;
bool prime[300001] = {false};
void isPrime() {
prime[1] = true;
for (int i = 2; i * i < 300000; i++) {
if (!prime[i]) {
for (int j = 2 * i; j < 300000; j += i) {
prime[j] ... | [["-", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 165 | 2 |
#include <cmath>
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
bool is_prime(int n) {
if (n < 2) {
return false;
}
if (n == 2 || n == 3) {
return true;
}
for (int i = 3; i < n; i = i + 2) {
if (n % i == 0) {
return false;
}
}
return true;
}... | #include <cmath>
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
bool is_prime(int n) {
if (n < 2) {
return false;
}
if (n == 2 || n == 3) {
return true;
}
for (int i = 3; i < n; i = i + 2) {
if (n % i == 0) {
return false;
}
}
return true;
}... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 278 | 2 |
#include <bits/stdc++.h>
using namespace std;
int p[200000];
int main() {
p[0] = p[1] = 1;
for (int i = 2; i * i < 200000; ++i) {
if (!p[i]) {
for (int j = i + i; j < 200000; j += i)
p[j] = 1;
}
}
int n;
while (cin >> n, n) {
int cnt = 0;
for (int i = n + 1; i <= 2 * n; ++i)
... | #include <bits/stdc++.h>
using namespace std;
int p[300000];
int main() {
p[0] = p[1] = 1;
for (int i = 2; i * i < 300000; ++i) {
if (!p[i]) {
for (int j = i + i; j < 300000; j += i)
p[j] = 1;
}
}
int n;
while (cin >> n, n) {
int cnt = 0;
for (int i = n + 1; i <= 2 * n; ++i)
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 13]] | 1 | 138 | 6 |
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
for (;;) {
int n;
cin >> n;
if (n == 0)
break;
int n22 = n * 2 + 2;
bool prime[n * 2 + 2];
for (int i = 0; i < n22; i++) {
prime[i] = true;
}
prime[0] = false;
prime[1] = fal... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
for (;;) {
int n;
cin >> n;
if (n == 0)
break;
int n22 = n * 2 + 2;
bool prime[n * 2 + 2];
for (int i = 0; i < n22; i++) {
prime[i] = true;
}
prime[0] = false;
prime[1] = fal... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 193 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 1 | 299 | 8 |
#include <iostream>
using namespace std;
int p[300000];
int main() {
int n;
p[0] = p[1] = -1;
for (int i = 2; i < 300000; i++) {
if (!p[i]) {
p[i] = 1;
for (int j = i + i; j < 300000; j += i)
p[j] = -1;
}
}
while (1) {
int ans = 0;
cin >> n;
if (n == 0)
break;... | #include <iostream>
using namespace std;
int p[300000];
int main() {
int n;
p[0] = p[1] = -1;
for (int i = 2; i < 300000; i++) {
if (!p[i]) {
p[i] = 1;
for (int j = i + i; j < 300000; j += i)
p[j] = -1;
}
}
while (1) {
int ans = 0;
cin >> n;
if (n == 0)
break;... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 149 | 2 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | [["-", 8, 9, 0, 37, 0, 16, 12, 2, 63, 22], ["+", 8, 9, 0, 37, 0, 16, 12, 2, 63, 22]] | 1 | 534 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD ... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 207 | 2 |
#include <algorithm>
#include <iostream>
#define N 123456
using namespace std;
int main() {
int n, cnt;
bool a[2 * N + 1];
fill(a, a + (2 * N + 1), true);
a[0] = a[1] = false;
for (int i = 2; i <= 2 * N; i++)
if (a[i])
for (int j = i + i; j <= 2 * N; j += i)
a[j] = false;
while (cin >... | #include <algorithm>
#include <iostream>
#define N 123456
using namespace std;
int main() {
int n, cnt;
bool a[2 * N + 1];
fill(a, a + (2 * N + 1), true);
a[0] = a[1] = false;
for (int i = 2; i <= 2 * N; i++)
if (a[i])
for (int j = i + i; j <= 2 * N; j += i)
a[j] = false;
while (cin >... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 159 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define EPS (1e-10)
#define EQ(a, b) (abs((a... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 258 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#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 <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 219 | 2 |
// AOJ 1172
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define MAX (123456 * 2)
vector<int> prime;
bool p[MAX];
void make_prime(void) {
fill(p, p + MAX, true);
p[0] = p[1] = false;
for (int i = 4; i < MAX; i += 2) {
p[i] = false;
}
prime.push_back(... | // AOJ 1172
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define MAX (123456 * 2)
vector<int> prime;
bool p[MAX];
void make_prime(void) {
fill(p, p + MAX, true);
p[0] = p[1] = false;
for (int i = 4; i < MAX; i += 2) {
p[i] = false;
}
prime.push_back(... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 225 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (int)n; ++i)
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (int)n; ++i)
#define ... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 153 | 4 |
#include <iostream>
using namespace std;
const int MAX = 246913;
const int SIZE = 123457;
int main() {
int n;
bool prime[SIZE];
for (int i = 0; i < SIZE; i++)
prime[i] = true;
for (int i = 3; i < MAX; i += 2) {
if (prime[((i - 1) >> 1)]) {
for (int j = i + i + i; j < MAX; j += i) {
if (... | #include <iostream>
using namespace std;
const int MAX = 246913;
const int SIZE = 123457;
int main() {
int n;
bool prime[SIZE];
for (int i = 0; i < SIZE; i++)
prime[i] = true;
for (int i = 3; i < MAX; i += 2) {
if (prime[((i - 1) >> 1)]) {
for (int j = i + i + i; j < MAX; j += i) {
if (... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 216 | 4 |
//============================================================================
// Name : TopCoderCompetition.cpp
// Author : taguchi
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//=====================================================================... | //============================================================================
// Name : TopCoderCompetition.cpp
// Author : taguchi
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//=====================================================================... | [["-", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 520 | 2 |
#include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int dp[1000001];
int main() {
fill((int *)dp, (int *)dp + 1000000, 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i * i <= 1000000; i++) {
if... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int dp[1000001];
int main() {
fill((int *)dp, (int *)dp + 1000000, 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i * i <= 1000000; i++) {
if... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 185 | 2 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 281 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
bool flag = false;
while (true) {
cin >> n;
if (n == 0)
break;
count = 2 * n - n + 1;
for (int i = 2 * n; i >= n; i--) {
for (int j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
c... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
bool flag = false;
while (true) {
cin >> n;
if (n == 0)
break;
count = 2 * n - n;
for (int i = 2 * n; i > n; i--) {
for (int j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
count-... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 47]] | 1 | 116 | 4 |
#include <iostream>
using namespace std;
#define MAX_N 30000
bool prime[MAX_N];
int main(int argc, char const *argv[]) {
for (int i = 0; i < MAX_N; i++) {
prime[i] = true;
}
prime[0] = false;
prime[1] = false;
for (int i = 0; i < MAX_N; i++) {
if (prime[i]) {
for (int j = i + i; j < MAX_N; j ... | #include <iostream>
using namespace std;
#define MAX_N 300000
bool prime[MAX_N];
int main(int argc, char const *argv[]) {
for (int i = 0; i < MAX_N; i++) {
prime[i] = true;
}
prime[0] = false;
prime[1] = false;
for (int i = 0; i < MAX_N; i++) {
if (prime[i]) {
for (int j = i + i; j < MAX_N; j... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 172 | 2 |
#include <stdio.h>
#define MAX_N 123456
int prime[MAX_N];
bool is_prime[MAX_N + 1];
int sieve(int n);
int main(void) {
int n = 1;
int a;
for (;;) {
scanf("%d", &n);
if (n == 0)
break;
a = sieve(2 * n) - sieve(n);
printf("%d\n", a);
}
return 0;
}
int sieve(int n) {
int p = 0;
for ... | #include <stdio.h>
#define MAX_N 246912
int prime[MAX_N];
bool is_prime[MAX_N + 1];
int sieve(int n);
int main(void) {
int n = 1;
int a;
for (;;) {
scanf("%d", &n);
if (n == 0)
break;
a = sieve(2 * n) - sieve(n);
printf("%d\n", a);
}
return 0;
}
int sieve(int n) {
int p = 0;
for ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 199 | 2 |
#include <stdio.h>
#include <string.h>
#define MAX (5000000)
char prime[MAX];
int main(void) {
memset(prime, 1, sizeof(prime));
prime[0] = prime[1] = 0;
for (int i = 2; i < MAX; i++) {
if (prime[i] == 1) {
for (int j = i * 2; j < MAX; j += i) {
prime[j] = 0;
}
}
}
while (1) {
... | #include <stdio.h>
#include <string.h>
#define MAX (5000000)
char prime[MAX];
int main(void) {
memset(prime, 1, sizeof(prime));
prime[0] = prime[1] = 0;
for (int i = 2; i < MAX; i++) {
if (prime[i] == 1) {
for (int j = i * 2; j < MAX; j += i) {
prime[j] = 0;
}
}
}
while (1) {
... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 173 | 2 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 147], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 146]] | 1 | 982 | 2 |
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, M, S, G;
struct state {
int node, velocity;
double ti;
int pre_node;
bool operator<(const state &right) const { return ti > right.ti; }
};
struct edge {
int to, dist, upp;
};
double dp[31][31][31];
double... | #include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N, M, S, G;
struct state {
int node, velocity;
double ti;
int pre_node;
bool operator<(const state &right) const { return ti > right.ti; }
};
struct edge {
int to, dist, upp;
};
double dp[31][31][31];
double... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 566 | 2 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using names... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using names... | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 678 | 2 |
#include <cfloat>
#include <iostream>
#include <queue>
using namespace std;
int n, m;
struct edge {
int dist, lim;
};
struct P {
int from, pos, v;
double time;
bool operator>(const P &p) const { return time > p.time; }
};
edge elist[31][31];
double G[31][31][31];
int main() {
int s, g;
while (cin >> ... | #include <cfloat>
#include <iostream>
#include <queue>
using namespace std;
int n, m;
struct edge {
int dist, lim;
};
struct P {
int from, pos, v;
double time;
bool operator>(const P &p) const { return time > p.time; }
};
edge elist[31][31];
double G[31][31][31];
int main() {
int s, g;
while (cin >> ... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 743 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 762 | 2 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 0, 57, 15, 339, 51, 16, 12, 118, 119, 120], ["+", 0, 57, 15, 339, 51, 16, 12, 118, 119, 120]] | 1 | 806 | 2 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
class state {
public:
double cost; // 所要時間
int pp; // 前の位置
int np; // 今の位置
int v; // 速度
state(double _cost, int _pp, int _np, int _v) {
cost = _cost;
pp =... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
class state {
public:
double cost; // 所要時間
int pp; // 前の位置
int np; // 今の位置
int v; // 速度
state(double _cost, int _pp, int _np, int _v) {
cost = _cost;
pp =... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 85], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 788 | 4 |
#include <cstdio>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define EPS (double)1e-9
#define INF (double)1e9
#define MAX_SPEED 30
vector<vector<vector<double>>>
dijk(int s_point, int s_speed,
vector<vector<vector<pair<double, pair<int, int>>>>> &adj) {
int v... | #include <cstdio>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define EPS (double)1e-9
#define INF (double)1e9
#define MAX_SPEED 33
vector<vector<vector<double>>>
dijk(int s_point, int s_speed,
vector<vector<vector<pair<double, pair<int, int>>>>> &adj) {
int v... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 904 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
typedef pair<double, int> Pd;
typedef pair<Pd, Pi> PP;
struct edge {
int to, lim;
double dist;
edge() {}
edge(int to, int lim, double dist) : to(to), lim(lim), dist(dist) {}
};
vector<vector<edge>> G;
double mint[33][33][33];
int n, m,... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
typedef pair<double, int> Pd;
typedef pair<Pd, Pi> PP;
struct edge {
int to, lim;
double dist;
edge() {}
edge(int to, int lim, double dist) : to(to), lim(lim), dist(dist) {}
};
vector<vector<edge>> G;
double mint[33][33][33];
int n, m,... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 674 | 6 |
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
struct P {
int to, c, d;
};
vector<P> E[30];
double d[30][31][30];
struct st {
int p, h, pr;
double c;
};
bool operator<(st a, st b) { return a.c > b.c; }
int main() {
int n, m;
while (scanf(... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
struct P {
int to, c, d;
};
vector<P> E[30];
double d[30][31][30];
struct st {
int p, h, pr;
double c;
};
bool operator<(st a, st b) { return a.c > b.c; }
int main() {
int n, m;
while (scanf(... | [["-", 0, 1, 0, 2, 3, 4, 0, 83, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 83, 0, 22]] | 1 | 598 | 2 |
#include <bits/stdc++.h>
#define S second
#define F first
#define EPS (1e-7)
#define INF (1e9)
#define N 31
using namespace std;
typedef pair<int, int> P1;
typedef pair<int, P1> P2;
typedef pair<int, P1> P3;
typedef pair<P3, int> P4;
vector<P2> G[N];
int n, m, s, g;
double dijkstra() {
double d[N][N][N];
for (int... | #include <bits/stdc++.h>
#define S second
#define F first
#define EPS (1e-7)
#define INF (1e9)
#define N 31
using namespace std;
typedef pair<int, int> P1;
typedef pair<int, P1> P2;
typedef pair<double, P1> P3;
typedef pair<P3, int> P4;
vector<P2> G[N];
int n, m, s, g;
double dijkstra() {
double d[N][N][N];
for (... | [["-", 0, 134, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 134, 39, 344, 3, 347, 0, 77, 39, 40]] | 1 | 702 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (... | [["-", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 75, 76, 0, 9, 0, 1, 0, 2, 63, 22], ["+", ... | 1 | 683 | 9 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
class Node {
public:
int pre;
int now;
int vel;
double time;
Node(int p, int n, int v, double t) {
pre = p;
now = n;
vel = v;
time = t;
}
bool operator<(const Node &n) const { return time > n.time; }
};
int mai... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
class Node {
public:
int pre;
int now;
int vel;
double time;
Node(int p, int n, int v, double t) {
pre = p;
now = n;
vel = v;
time = t;
}
bool operator<(const Node &n) const { return time > n.time; }
};
int mai... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 22], ["-", 15, 339, 51, 16, 31, 16, 12, 118, 119, 120], ["+", 15, 339, 51, 16, 31, 16, 12, 118, 119, 120]] | 1 | 648 | 4 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int S_MAX = 30;
const double inf = 1e9;
struct info {
int curr;
int prev;
int v;
double t;
info(int c, int p, int v, double t) : curr(c), prev(p), v(v), t(t) {}
};
namespace std {
bool op... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int S_MAX = 30;
const double inf = 1e9;
struct info {
int curr;
int prev;
int v;
double t;
info(int c, int p, int v, double t) : curr(c), prev(p), v(v), t(t) {}
};
namespace std {
bool op... | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 16, 12, 2, 3, 4, 0, 13]] | 1 | 716 | 4 |
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
const double INF = 1e10;
struct Edge {
int cost, to, c;
Edge(int to, int cost, int c) : to(to), cost(cost), c(c) {}
};
double dijkstra(int s, int g, vector<vector<Edge>> &G) {
int n = G.size();
vector<vector<vector<d... | #include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
const double INF = 1e10;
struct Edge {
int cost, to, c;
Edge(int to, int cost, int c) : to(to), cost(cost), c(c) {}
};
double dijkstra(int s, int g, vector<vector<Edge>> &G) {
int n = G.size();
vector<vector<vector<d... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 723 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000007
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pi;
typedef pair<double, int> pd;
typedef pair<pd, pi> PP;
struct edge {
int to, dist, limit;
};
int n, m, s, g;
double dp[31][31][31]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000007
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pi;
typedef pair<double, int> pd;
typedef pair<pd, pi> PP;
struct edge {
int to, dist, limit;
};
int n, m, s, g;
double dp[31][31][31]... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 575 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
typedef pair<pair<double, int>, pair<int, int>> P;
class road {
public:
int to, d, c;
road(int x, int y, int z) {
to = x;
d = y;
c = z;
};
};
vector<road> G[31];
int main() {
int n, m,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
typedef pair<pair<double, int>, pair<int, int>> P;
class road {
public:
int to, d, c;
road(int x, int y, int z) {
to = x;
d = y;
c = z;
};
};
vector<road> G[31];
int main() {
int n, m,... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 765 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX = 123456;
int Sosuu[MAX] = {0};
void make_Sosuu() {
for (int i = 2; i < MAX; i++)
Sosuu[i] = 1;
for (int i = 2; i < MAX; i++) {
if (Sosuu[i]) {
for (int j = i * 2; j < MAX; j += i) {
Sosuu[j] = 0;
}
}
}
}
in... | #include <cstdio>
#include <iostream>
using namespace std;
const int MAX = 123456 * 2;
int Sosuu[MAX] = {0};
void make_Sosuu() {
for (int i = 2; i < MAX; i++)
Sosuu[i] = 1;
for (int i = 2; i < MAX; i++) {
if (Sosuu[i]) {
for (int j = i * 2; j < MAX; j += i) {
Sosuu[j] = 0;
}
}
}
}... | [["+", 0, 30, 0, 43, 49, 50, 51, 16, 17, 48], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 176 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
bool table[123457 * 2];
for (int i = 0; i < 123457 * 2; i++)
table[i] = true;
table[0] = table[1] = false;
for (int i = 2; i < 123457; i++) {
if (table[i])
for (int j = 2 * i; j < 123457 * 2; j += i)
table[j] = false;
}
w... | #include <iostream>
using namespace std;
int main() {
int n;
bool table[123457 * 2];
for (int i = 0; i < 123457 * 2; i++)
table[i] = true;
table[0] = table[1] = false;
for (int i = 2; i < 123457; i++) {
if (table[i])
for (int j = 2 * i; j < 123457 * 2; j += i)
table[j] = false;
}
w... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 161 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF (INT_MAX / 3 - 10)
long n;
/*
in... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF (INT_MAX / 3 - 10)
long n;
/*
in... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 320 | 2 |
from math import sqrt
size = 123456
primes = [x for x in range(2, 2*size+1) if x == 2 or x % 2 == 1]
for i in range(2, int(sqrt(2*size))):
primes = [x for x in primes if x % i != 0 or x == i]
while True:
n = int(input())
if n == 0: break
nums = [x for x in primes if x >= n and x <= 2*n]
print(len(... | from math import sqrt
size = 123456
primes = [x for x in range(2, 2*size+1) if x == 2 or x % 2 == 1]
for i in range(2, int(sqrt(2*size))):
primes = [x for x in primes if x % i != 0 or x == i]
while True:
n = int(input())
if n == 0: break
nums = [x for x in primes if x > n and x <= 2*n]
print(len(n... | [["-", 12, 658, 0, 678, 0, 679, 31, 666, 667, 20], ["+", 12, 658, 0, 678, 0, 679, 31, 666, 667, 47]] | 5 | 115 | 2 |
primes = [0, 0] + [1]*246911
for i in range(2, 497):
if primes[i]:
for j in range(i*i, 246913, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
print(sum(1 for i in range(n, 2*n+1) if primes[i])) | primes = [0, 0] + [1]*246911
for i in range(2, 497):
if primes[i]:
for j in range(i*i, 246913, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
print(sum(1 for i in range(n+1, 2*n+1) if primes[i])) | [["+", 0, 659, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 91 | 2 |
input_list = []
while True:
N = int(input())
if N == 0:
break
input_list.append(N)
n = 123456*2
isPrime = [True for i in range(n)]
for i in range(int(n)):
if i % 2 != 0:
for j in range(2, int(i ** 0.5) + 1):
if i % j == 0:
isPrime[i] = False
... | input_list = []
while True:
N = int(input())
if N == 0:
break
input_list.append(N)
n = 123456*2
isPrime = [True for i in range(n)]
for i in range(int(n)):
if i % 2 != 0:
for j in range(2, int(i ** 0.5) + 1):
if i % j == 0:
isPrime[i] = False
... | [["+", 0, 662, 12, 206, 206, 663, 0, 657, 17, 72], ["+", 0, 662, 12, 206, 206, 663, 0, 657, 12, 612]] | 5 | 139 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;
public class Main {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader br = ne... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;
public class Main {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader br = ne... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 215], ["+", 8, 196, 0, 57, 15, 15, 0, 492, 0, 131], ["+", 8, 196, 0, 57, 15, 15, 0, 492, 141, 22], ["+", 0, 57, 15, 15, 0, 492, 3, 4, 0, 24], ["+", 15, 15, 0, 492, 3, 4, 0, 5, 0, 62], ["+", 15, 15, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0... | 3 | 295 | 9 |
#include <cstring>
#include <iostream>
#include <queue>
#define INF 1e9
using namespace std;
class DP {
public:
double cost;
unsigned char cur, sp, prev;
DP() {}
DP(double c, int cu, int s, int pr) {
cost = c;
cur = cu;
sp = s;
prev = pr;
}
bool operator<(const DP &opp) const { return co... | #include <cstring>
#include <iostream>
#include <queue>
#define INF 1e9
using namespace std;
class DP {
public:
double cost;
unsigned char cur, sp, prev;
DP() {}
DP(double c, int cu, int s, int pr) {
cost = c;
cur = cu;
sp = s;
prev = pr;
}
bool operator<(const DP &opp) const { return co... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 532 | 4 |
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int n, m;
int s, g;
struct edge {
int to, d, c;
edge() {}
edge(int to, int d, int c) : to(to), d(d), c(c) {}
};
vector<vector<edge>> E;
struct node {
double cost;
... | #include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
int n, m;
int s, g;
struct edge {
int to, d, c;
edge() {}
edge(int to, int d, int c) : to(to), d(d), c(c) {}
};
vector<vector<edge>> E;
struct node {
double cost;
... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 579 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_V 1010
const int INF = 1e9;
struct edge {
int to, cap, rev;
};
vector<edge> G[MAX_V];
bool used[MAX_V];
void add_edge(int from, int to, int cap) {
G[from].push_back((edge){to, cap, G[to].size()});
G[to].push_back((edge){from, 0, G[from].size() - 1});
}... | #include <bits/stdc++.h>
using namespace std;
#define MAX_V 1010
const int INF = 1e9;
struct edge {
int to, cap, rev;
};
vector<edge> G[MAX_V];
bool used[MAX_V];
void add_edge(int from, int to, int cap) {
G[from].push_back((edge){to, cap, G[to].size()});
G[to].push_back((edge){from, 0, G[from].size() - 1});
}... | [["-", 64, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 8, 1, 0, 2, 3, 4, 0, 16, 31, 22]] | 1 | 594 | 8 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i... | [["+", 8, 9, 0, 1, 0, 11, 31, 118, 119, 120], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 11, 31, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 31, 118, 17, 131]] | 1 | 701 | 6 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int b[500], r[500];
vector<int> E[500];
bool used[1000];
int match[1000];
bool dfs(int u) {
used[u] = true;
for (int v : E[u]) {
int w = match... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int b[500], r[500];
vector<int> E[500];
bool used[1000];
int match[1000];
bool dfs(int u) {
used[u] = true;
for (int v : E[u]) {
int w = match... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 349 | 6 |
#include <bits/stdc++.h>
using namespace std;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> dist, match;
vector<bool> used, vv;
Bipartite_Matching(int n, int m) {
graph.resize(n);
match.assign(m, -1);
used.assign(n, false);
}
void add_edge(int u, int v) { graph[u].push_b... | #include <bits/stdc++.h>
using namespace std;
struct Bipartite_Matching {
vector<vector<int>> graph;
vector<int> dist, match;
vector<bool> used, vv;
Bipartite_Matching(int n, int m) {
graph.resize(n);
match.assign(m, -1);
used.assign(n, false);
}
void add_edge(int u, int v) { graph[u].push_b... | [["-", 51, 16, 31, 2, 3, 4, 0, 2, 63, 22], ["+", 51, 16, 31, 2, 3, 4, 0, 2, 63, 22]] | 1 | 744 | 4 |
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debug(v) \
{ \
printf("L%d %s > ", __LINE_... | #pragma GCC optimize("O3")
#pragma GCC target("avx")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debug(v) \
{ \
printf("L%d %s > ", __LINE_... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 2,496 | 2 |
#include <iostream>
#include <vector>
using namespace std;
#define vec vector
#define pb push_back
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
// typedef long lo... | #include <iostream>
#include <vector>
using namespace std;
#define vec vector
#define pb push_back
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
// typedef long lo... | [["+", 0, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 0, 2, 3, 4, 0, 16, 31, 23, 0, 25], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 48], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 583 | 4 |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int MAXV = 2005;
const int MAXE = MAXV * MAXV;
const int INF = 1 << 29;
struct BiparateMatching {
int N, M, E, match[MAXV + 1], dist[MAXV + 1];
int last[MAXE], prev[MAXE], to[MAXE];
BiparateMatching(int n, int m) : N(n), M(m), E(0)... | #include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int MAXV = 2005;
const int MAXE = 505 * 505;
const int INF = 1 << 29;
struct BiparateMatching {
int N, M, E, match[MAXV + 1], dist[MAXV + 1];
int last[MAXE], prev[MAXE], to[MAXE];
BiparateMatching(int n, int m) : N(n), M(m), E(0) {... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 31, 22], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 31, 13], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 22], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 758 | 4 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#incl... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22]] | 1 | 1,000 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
#define MAX_V 1111
struct edge {
int to, cap, rev;
};
const int inf = 1 << 21;
vector<edge> G[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(int f, int t, int cap) {
G[f].push_back((edge){t... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
#define MAX_V 1111
struct edge {
int to, cap, rev;
};
const int inf = 1 << 21;
vector<edge> G[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(int f, int t, int cap) {
G[f].push_back((edge){t... | [["-", 0, 2, 3, 4, 0, 16, 31, 16, 31, 22], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 31, 22]] | 1 | 778 | 4 |
while True:
s = input()
if s[0] == '.': break
r = []
f = False
for c in s:
if c == '(' or c == '[':
r.append(c)
elif c == ')':
if not r or r.pop() != '(':
print("no")
break
elif c == ']':
if not r or r.pop() ... | while True:
s = input()
if s[0] == '.': break
r = []
f = False
for c in s:
if c == '(' or c == '[':
r.append(c)
elif c == ')':
if not r or r.pop() != '(':
print("no")
break
elif c == ']':
if not r or r.pop() ... | [["+", 0, 1, 0, 652, 3, 4, 0, 41, 0, 121], ["+", 0, 652, 3, 4, 0, 41, 0, 681, 0, 372], ["+", 0, 652, 3, 4, 0, 41, 0, 681, 28, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 41, 0, 95], ["+", 0, 652, 3, 4, 0, 41, 0, 557, 0, 654], ["+", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 41, 0, 557, 0, 655]] | 5 | 114 | 7 |
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { Main p = new Main(); }
public Main() {
Scanner sc = new Scanner(System.in);
while (true) {
h = sc.nextInt();
w = sc.nextInt();
... |
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) { Main p = new Main(); }
public Main() {
Scanner sc = new Scanner(System.in);
while (true) {
h = sc.nextInt();
w = sc.nextInt();
... | [["+", 0, 492, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 0, 492, 3, 4, 0, 16, 31, 23, 0, 25], ["+", 0, 57, 64, 1, 0, 492, 3, 4, 0, 24]] | 3 | 849 | 4 |
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.StringTokenizer;
/**
* Identically Colored Panels Connection
*/
public class Main {
... | import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.StringTokenizer;
/**
* Identically Colored Panels Connection
*/
public class Main {
... | [["-", 0, 57, 64, 196, 0, 57, 64, 93, 0, 94], ["+", 0, 57, 64, 196, 0, 57, 64, 116, 0, 117]] | 3 | 881 | 2 |
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define L(a, d) ((a) << ((d)*3))
#define R(a, d) (((a) >> ((d)*3)) & 7)
int h, w, c, f[16][16], ofs[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
void P(int d) {
int m = ~L(7, d + 1);
rep(i, h) rep(j, w) {
f[i][j] &= m;
... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define L(a, d) ((a) << ((d)*3))
#define R(a, d) (((a) >> ((d)*3)) & 7)
int h, w, c, f[16][16], ofs[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
void P(int d) {
int m = ~L(7, d + 1);
rep(i, h) rep(j, w) {
f[i][j] &= m;
... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 491 | 2 |
#include <cstdio>
#include <iostream>
#include <queue>
#define xx first
#define yy second
#define mp make_pair
#define pb push
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int anss = 0;
void play(int h, int w, int c, int mas[10][10], int cnt) {
// cout << "x" << endl;
// cout << endl;... | #include <cstdio>
#include <iostream>
#include <queue>
#define xx first
#define yy second
#define mp make_pair
#define pb push
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int anss = 0;
void play(int h, int w, int c, int mas[10][10], int cnt) {
// cout << "x" << endl;
// cout << endl;... | [["-", 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, 22], ["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 770 | 5 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
const int MAX = 1000000;
int dp[MAX + 1];
int dp2[MAX + 1];
void solve() {
fill(dp, dp + MAX + 1, MAX);
fill(dp2, dp2 + MAX + 1, MAX);
dp[0] = dp[2] = 0;
vector<int> v;
for ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
const int MAX = 1000000;
int dp[MAX + 1];
int dp2[MAX + 1];
void solve() {
fill(dp, dp + MAX + 1, MAX);
fill(dp2, dp2 + MAX + 1, MAX);
dp[0] = dp2[0] = 0;
vector<int> v;
for... | [["-", 0, 1, 0, 11, 12, 11, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 12, 11, 31, 69, 28, 22], ["-", 0, 11, 12, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 11, 31, 69, 341, 342, 0, 13]] | 1 | 305 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
#define rrep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define erep(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) <... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 559 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> c;
vector<int> a, b;
int main() {
c.push_back(0);
for (int i = 1; c[i - 1] <= 1000010; i++)
c.push_back(i * (i + 1) * (i + 2) / 6);
for (int i = 0; i <= 1000000; i++) {
a.push_back(i);
b.push_back(i);
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> c;
vector<int> a, b;
int main() {
c.push_back(0);
for (int i = 1; c[i - 1] <= 1000010; i++)
c.push_back(i * (i + 1) * (i + 2) / 6);
for (int i = 0; i <= 1000001; i++) {
a.push_back(i);
b.push_back(i);
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20]] | 1 | 287 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#define pi 3.14159
#define Inf (int)pow(2., 12.)
using namespace std;
typedef std::pair<int, int> mypair;
queue<mypair> qu;
#define M 1000000
int odd[M], all[M];
void ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#define pi 3.14159
#define Inf (int)pow(2., 12.)
using namespace std;
typedef std::pair<int, int> mypair;
queue<mypair> qu;
#define M 1000000
int odd[M + 1], all[M + 1]... | [["+", 0, 30, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13]] | 1 | 254 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int i, j, n, three[1000000], four[1000000], four_2[1000000], c[1000000],
c_2[1000000];
int main() {
three[0] = 1;
four[0] = 1;
for (i = 1; i < 1000000; i++)
three[i] = i + 1 + three[i - 1];
for (i = 1; i < 1000000; i++)
four[i] = three... | #include <algorithm>
#include <iostream>
using namespace std;
int i, j, n, three[1000000], four[1000000], four_2[1000000], c[1000000],
c_2[1000000];
int main() {
three[0] = 1;
four[0] = 1;
for (i = 1; i < 1000000; i++)
three[i] = i + 1 + three[i - 1];
for (i = 1; i < 1000000; i++)
four[i] = three... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 366 | 8 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167&lang=jp
#include <fstream>
#include <iostream>
#define Max_Len 1000000
using namespace std;
int triCalc(int num) {
static short int count[Max_Len];
static short int triangle[Max_Len];
static bool f = true;
if (f) { //?????????
for (int i =... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167&lang=jp
#include <fstream>
#include <iostream>
#define Max_Len 1000000
using namespace std;
int triCalc(int num) {
static int count[Max_Len];
static int triangle[Max_Len];
static bool f = true;
if (f) { //初期化
for (int i = 0; i < Max_Len; i... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 133]] | 1 | 602 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int x[8000000][2], a[999], b[999], s, n;
int main() {
a[0] = 1;
b[0] = 1;
for (int i = 1; i < 300; i++) {
a[i] = a[i - 1] + (i + 1) * (i + 2) / 2;
if (a[i] % 2 == 1) {
s++;
b[s] = a[i];
}
}
n = 1200000;
... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int x[8000000][2], a[999], b[999], s, n;
int main() {
a[0] = 1;
b[0] = 1;
for (int i = 1; i < 300; i++) {
a[i] = a[i - 1] + (i + 1) * (i + 2) / 2;
if (a[i] % 2 == 1) {
s++;
b[s] = a[i];
}
}
n = 1200000;
... | [["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 338 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 355 | 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, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 260 | 2 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 678 | 8 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using LL ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using LL ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 377 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define... | [["-", 0, 11, 31, 69, 341, 342, 0, 69, 28, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 69, 28, 22], ["-", 341, 342, 0, 16, 31, 2, 63, 118, 28, 22], ["+", 341, 342, 0, 16, 31, 2, 63, 118, 28, 22]] | 1 | 496 | 4 |
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const int inf = 1000000009;
int main() {
vector<int> memo(1000000, inf);
memo[0] = 0;
vector<int> odd_memo(1000000, inf);
odd_memo[0] = 0;
for (int i = 0; i < 1000000; i++) {
memo[i] = i;
odd_memo[i] = i;
}
for (int ... | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const int inf = 1000000009;
int main() {
vector<int> memo(1000000, inf);
memo[0] = 0;
vector<int> odd_memo(1000000, inf);
odd_memo[0] = 0;
for (int i = 0; i < 1000000; i++) {
memo[i] = i;
odd_memo[i] = i;
}
for (int ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22]] | 1 | 239 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define lpin(a, i, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; ... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define lpin(a, i, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; ... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 321 | 4 |
#include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
... | [["-", 0, 7, 8, 9, 0, 7, 26, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 26, 11, 12, 13]] | 1 | 351 | 2 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, j, k) for (int i = (int)j; i < (int)k; i++)
#define itrep(i, x) for (auto i = (x).begin(); i != (x).end(); i++... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, j, k) for (int i = (int)j; i < (int)k; i++)
#define itrep(i, x) for (auto i = (x).begin(); i != (x).end(); i++... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 393 | 2 |
#include <iostream>
#define MAX 1000000
#define INF 1000000000
using namespace std;
int dp1[MAX + 1], dp2[MAX + 1];
int main() {
// INFで初期化
for (int i = 0; i <= MAX; i++) {
dp1[i] = INF;
dp2[i] = INF;
}
for (int n = 1; n * (n + 1) * (n * 2) / 6 <= MAX; n++) {
int a = n * (n + 1) * (n + 2) / 6; //... | #include <iostream>
#define MAX 1000000
#define INF 1000000000
using namespace std;
int dp1[MAX + 1], dp2[MAX + 1];
int main() {
// INFで初期化
for (int i = 1; i <= MAX; i++) {
dp1[i] = INF;
dp2[i] = INF;
}
for (int n = 1; n * (n + 1) * (n + 2) / 6 <= MAX; n++) {
int a = n * (n + 1) * (n + 2) / 6; //... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 31, 16, 31, 16, 12, 23, 0, 16, 17, 48], ["+", 31, 16, 31, 16, 12, 23, 0, 16, 17, 72], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 244 | 8 |
#include <iostream>
using namespace std;
#define MAX 1000000
#define INF 1000000000
int dp1[MAX + 1], dp2[MAX + 2];
int main() {
for (int i = 1; i <= MAX; i++) {
dp1[i] = INF;
dp2[i] = INF;
}
for (int n = 1; n * (n + 1) * (n + 2) / 6 <= MAX; n++) {
int a = n * (n + 1) * (n + 2) / 6;
for (int i... | #include <iostream>
using namespace std;
#define MAX 1000000
#define INF 1000000000
int dp1[MAX + 1], dp2[MAX + 2];
int main() {
for (int i = 1; i <= MAX; i++) {
dp1[i] = INF;
dp2[i] = INF;
}
for (int n = 1; n * (n + 1) * (n + 2) / 6 <= MAX; n++) {
int a = n * (n + 1) * (n + 2) / 6;
for (int i... | [["-", 12, 2, 3, 4, 0, 16, 31, 69, 28, 22], ["+", 12, 2, 3, 4, 0, 16, 31, 69, 28, 22]] | 1 | 240 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int dp[2][1000001];
int f(int n) { return n * (n + 1) * (n + 2) / 6; }
int main() {
int n;
for (int k = 0; k < 2; k++)
fill(dp[k], dp[k] + 1000001, 1000000);
dp[0][0] = dp[1][0] = 0;
for (int i = 1; i <= n; i++) {
for (int k = 1;; k++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int dp[2][1000001];
int f(int n) { return n * (n + 1) * (n + 2) / 6; }
int main() {
int n;
for (int k = 0; k < 2; k++)
fill(dp[k], dp[k] + 1000001, 1000000);
dp[0][0] = dp[1][0] = 0;
for (int i = 1; i <= 1000000; i++) {
for (int k = 1;; k... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 260 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int sum[222];
// int dp[1111111][222];
int dp[2][1111111];
/*
int solve(int s,int i,int f){
//if(!s) return 0;
if(i >= m) return s;
if(dp[s][i])return dp[s][i];
int ret = 1 << 28;
if(!((sum[i] + 1) % f)){
for(int j = ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int sum[222];
// int dp[1111111][222];
int dp[2][1111111];
/*
int solve(int s,int i,int f){
//if(!s) return 0;
if(i >= m) return s;
if(dp[s][i])return dp[s][i];
int ret = 1 << 28;
if(!((sum[i] + 1) % f)){
for(int j = ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 289 | 7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.