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 |
|---|---|---|---|---|---|
#define M 30100
j, T[M], t[M];
main(I, J, i, k, L, r) {
for (i = 2; i < M; i++)
if (!T[i])
for (j = i * 2; j < M; j += i)
T[j] = 1;
for (i = 2; i < M; i++)
if (!T[i])
t[j++] = i;
for (; scanf("%d", &L), L; printf("%d\n", r))
for (r = I = 0; (i = t[I]) < L; I++)
for (J = I; (j... | #define M 30100
J, T[M], t[M];
main(I, i, j, k, L, r) {
for (i = 2; i < M; i++)
if (!T[i])
for (j = i * 2; j < M; j += i)
T[j] = 1;
for (i = 2; i < M; i++)
if (!T[i])
t[J++] = i;
for (; scanf("%d", &L), L; printf("%d\n", r))
for (r = I = 0; (i = t[I]) < L; I++)
for (J = I; (j... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 64, 1, 0, 11, 31, 69, 71, 27, 28, 22], ["+", 64, 1, 0, 11, 31, 69, ... | 0 | 208 | 8 |
#include <bits/stdc++.h>
using namespace std;
int calc(int x) {
int sum = 0, max = 0;
for (int i = 2; i <= x; ++i) {
if (x % i == 0) {
sum += i;
max = i;
while (x % i == 0) {
x /= i;
}
}
}
return max - sum;
}
int main() {
int n, m;
while (cin >> n >> m && n != 0... | #include <bits/stdc++.h>
using namespace std;
int calc(int x) {
int sum = 0, max = 0;
for (int i = 2; i <= x; ++i) {
if (x % i == 0) {
sum += i;
max = i;
while (x % i == 0) {
x /= i;
}
}
}
return max - (sum - max);
}
int main() {
int n, m;
while (cin >> n >> m &... | [["+", 8, 9, 0, 37, 0, 16, 12, 23, 0, 24], ["+", 0, 37, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 37, 0, 16, 12, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 37, 0, 16, 12, 23, 0, 25]] | 1 | 130 | 4 |
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cout << #x << " = " << x << endl
#define _ << " _ " <<
typedef long long llint;
int main(void) {
int a, b;
whil... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cout << #x << " = " << x << endl
#define _ << " _ " <<
typedef long long llint;
int main(void) {
int a, b;
whil... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 31, 13], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 48], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 31, 13], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 17, 48]] | 1 | 213 | 4 |
//============================================================================
// Name : A.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bits/st... | //============================================================================
// Name : A.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bits/st... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 247 | 4 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
int adiv(int a) {
map<int, int> mp;
int num(a);
for (int i = 2; i * i <= a; ++i) {
if (num % i == 0) {
mp[i]++;
num /= i;
}
... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
int adiv(int a) {
map<int, int> mp;
int num(a);
for (int i = 2; i <= a; ++i) {
while (num % i == 0) {
mp[i]++;
num /= i;
}
... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 48], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 7, 8, 9, 0, 52, 0, 89], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22]] | 1 | 193 | 6 |
#include <cstdio>
#include <iostream>
#include <string>
#define MAX 1000000
using namespace std;
int main() {
int i, j, n1, n2, a1, a2;
bool a[MAX], f1, f2;
for (i = 2; i < MAX; i++)
a[i] = true;
for (i = 2; i < MAX; i++) {
if (a[i] == true) {
for (j = i * 2; j < MAX; j += i)
a[j] = false... | #include <cstdio>
#include <iostream>
#include <string>
#define MAX 1000000
using namespace std;
int main() {
int i, j, n1, n2, a1, a2;
bool a[MAX], f1, f2;
for (i = 2; i < MAX; i++)
a[i] = true;
for (i = 2; i < MAX; i++) {
if (a[i] == true) {
for (j = i * 2; j < MAX; j += i)
a[j] = false... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 1 | 275 | 4 |
#include <iostream>
#define MAX_N 1000010
#include <vector>
using namespace std;
int prime[MAX_N];
bool is_prime[MAX_N + 1];
void prime_make(int n) {
int p = 0;
for (int i = 0; i <= n; i++)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
pri... | #include <iostream>
#define MAX_N 1000010
#include <vector>
using namespace std;
int prime[MAX_N];
bool is_prime[MAX_N + 1];
void prime_make(int n) {
int p = 0;
for (int i = 0; i <= n; i++)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
pri... | [["+", 49, 50, 51, 69, 341, 342, 0, 16, 17, 33], ["+", 49, 50, 51, 69, 341, 342, 0, 16, 12, 13]] | 1 | 340 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int MAX = 1000001;
bool isPrime[MAX];
fill_n(isPrime, MAX, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 4; i < MAX; i += 2) {
isPrime[i] = false;
}
for (int i = 3; i * i <= MAX; i += 2) {
if (isPrime... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int MAX = 1000001;
bool isPrime[MAX];
fill_n(isPrime, MAX, true);
isPrime[0] = false;
isPrime[1] = false;
for (int i = 4; i < MAX; i += 2) {
isPrime[i] = false;
}
for (int i = 3; i * i <= MAX; i += 2) {
if (isPrime... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 48], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13]] | 1 | 380 | 4 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
using namespace std;
int f(int n) {
set<int> s;
int sum = 0, maximum = 0;
for (int i = 2; i <= n * n; i++) {
if (n % i == 0) {
s.insert(i);
while (n % i == 0) {
n /= i;
}
}
}
if (n != 1)
s.insert(... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
using namespace std;
int f(int n) {
set<int> s;
int sum = 0, maximum = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
s.insert(i);
while (n % i == 0) {
n /= i;
}
}
}
if (n != 1)
s.insert(... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 199 | 6 |
// 05
#include <iostream>
using namespace std;
int main() {
static bool cmp[1000001] = {true, true};
for (int i = 2; i < 1000001; i++) {
if (!cmp[i]) {
for (int j = 2; i * j < 1000001; j++) {
cmp[i * j] = true;
}
}
}
for (int k[2]; cin >> k[0] >> k[1], k[0] | k[1];) {
int r[2] ... | // 05
#include <iostream>
using namespace std;
int main() {
static bool cmp[1000001] = {true, true};
for (int i = 2; i < 1000001; i++) {
if (!cmp[i]) {
for (int j = 2; i * j < 1000001; j++) {
cmp[i * j] = true;
}
}
}
for (int k[2]; cin >> k[0] >> k[1], k[0] | k[1];) {
int r[2] ... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 229 | 2 |
#include <iostream>
using namespace std;
int prime[1000001];
int main() {
fill(prime, prime + 1000001, 1);
prime[0] = prime[1] = 0;
for (int i = 2; i * i < 1000001; i++) {
if (prime[i])
for (int j = i * 2; j < 1000001; j += i)
prime[j] = 0;
}
int a[2];
while (cin >> a[0] >> a[1], a[0] +... | #include <iostream>
using namespace std;
int prime[1000001];
int main() {
fill(prime, prime + 1000001, 1);
prime[0] = prime[1] = 0;
for (int i = 2; i * i < 1000001; i++) {
if (prime[i])
for (int j = i * 2; j < 1000001; j += i)
prime[j] = 0;
}
int a[2];
while (cin >> a[0] >> a[1], a[0] +... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 250 | 2 |
#!ruby -nalrprime
$F.map!(&:to_i)
exit if $F.any?{|x| 0 == x}
$F.map! do |x|
hoge = Prime.prime_division(x)
hoge.map!{|y| y[0]}
result = hoge.pop
result -= hoge.inject(:+) unless hoge.empty?
result
end
if $F[0] > $F[1]
puts 'A'
else
puts 'B'
end | #!ruby -nalrprime
$F.map!(&:to_i)
exit if $F.any?{|x| 0 == x}
$F.map! do |x|
hoge = Prime.prime_division(x)
hoge.map!{|y| y[0]}
result = hoge.pop
result -= hoge.inject(:+) unless hoge.empty?
result
end
if $F[0] > $F[1]
puts 'a'
else
puts 'b'
end | [["-", 64, 749, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 64, 749, 0, 652, 3, 4, 0, 557, 0, 6], ["-", 75, 95, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 75, 95, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 87 | 4 |
def prime(a):
prime = []
for p in range(2, a):
if a % p == 0:
prime.append(p)
while a % p == 0:
a /= p
return prime
def keynumber(prime):
sum = 0
for i in range(len(prime) - 1):
sum += prime[i]
key = prime[-1] - sum
return key
while T... | def prime(a):
prime = []
for p in range(2, a+1):
if a % p == 0:
prime.append(p)
while a % p == 0:
a /= p
return prime
def keynumber(prime):
sum = 0
for i in range(len(prime) - 1):
sum += prime[i]
key = prime[-1] - sum
return key
while... | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 167 | 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, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 275 | 2 |
#include <iostream>
using namespace std;
int main() {
int seq[1000001];
int x, y;
while (cin >> x >> y, x | y) {
fill_n((int *)seq, 1000001, -1);
int count = -1;
while (x / y == 0) {
x *= 10;
count++;
}
seq[x / 10] = count;
while (1) {
while (x / y != 0)
x -= y;... | #include <iostream>
using namespace std;
int main() {
int seq[1000001];
int x, y;
while (cin >> x >> y, x | y) {
fill_n((int *)seq, 1000001, -1);
int count = -1;
while (x / y == 0) {
x *= 10;
count++;
seq[x / 10] = count;
}
while (1) {
while (x / y != 0)
x -= ... | [["-", 0, 52, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 173 | 2 |
#include <bits/stdc++.h>
using namespace std;
int M[10000000];
int main() {
while (1) {
int n, d;
cin >> n >> d;
if (n == 0 && d == 0)
break;
memset(M, -1, sizeof(M));
int cnt = 0;
while (n) {
int s = (n / d) * d;
n -= s;
if (M[n] != -1)
break;
M[n] = c... | #include <bits/stdc++.h>
using namespace std;
int M[10000000];
int main() {
while (1) {
int n, d;
cin >> n >> d;
if (n == 0 && d == 0)
break;
memset(M, -1, sizeof(M));
int cnt = 0;
while (n) {
int s = (n / d) * d;
n -= s;
if (M[n] != -1)
break;
M[n] = c... | [["+", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 31, 22], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13]] | 1 | 146 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
while (cin >> x >> y, x) {
int s[1000000] = {};
int c = 0, gc = __gcd(x, y);
x /= gc, y /= gc;
while (!s[x]) {
s[x] = ++c;
x = (x * 10) % y;
}
if (x == 0)
c = s[x];
cout << s[x] - 1 << " " << c - s[x] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
while (cin >> x >> y, x) {
int s[1000000] = {};
int c = 0, gc = __gcd(x, y);
x /= gc, y /= gc;
while (!s[x]) {
s[x] = ++c;
x = (x * 10) % y;
}
if (x == 0)
c = s[x] - 1;
cout << s[x] - 1 << " " << c - s... | [["+", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 126 | 4 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
int adiv(int a) {
map<int, int> mp;
int num(a);
for (int i = 2; i <= a; ++i) {
while (num % i == 0) {
mp[i]++;
num /= i;
}
... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
int adiv(int a) {
map<int, int> mp;
int num(a);
for (int i = 2; i <= a; ++i) {
while (num % i == 0) {
mp[i]++;
num /= i;
}
... | [["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 85], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 17, 85], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 286 | 4 |
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
Scanner sc;
class E {
P to;
int type;
E(P tto, int ttype) {
to = tto;
type = ttype;
}
}
... | import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
Scanner sc;
class E {
P to;
int type;
E(P tto, int ttype) {
to = tto;
type = ttype;
}
}
c... | [["-", 0, 16, 12, 16, 31, 509, 500, 504, 71, 22], ["+", 0, 16, 12, 16, 31, 509, 500, 504, 71, 22]] | 3 | 1,254 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 1,396 | 2 |
#include <algorithm>
#include <cassert>
#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 < (i... | #include <algorithm>
#include <cassert>
#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 < (i... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18]] | 1 | 1,731 | 2 |
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cout << #x << " = " << x << endl
#define _ << " _ " <<
typedef long long llint;
const int MAX = 64 * 100100;
const ... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cout << #x << " = " << x << endl
#define _ << " _ " <<
typedef long long llint;
const int MAX = 64 * 100100;
const ... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 8, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 8, 1, 0, 2, 3, 4, 0, 16, 17, 33]] | 1 | 519 | 6 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000000000 + 7;
c... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000000000 + 7;
c... | [["-", 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 | 215 | 7 |
#include <iostream>
using namespace std;
int prime[1230];
bool ifnotPrime[10001];
void setPrime() {
int i = 0;
ifnotPrime[0] = ifnotPrime[1] = 1;
for (int n = 2; n <= 10000; n++) {
if (!ifnotPrime[n]) {
prime[i] = n;
i++;
int m = n * n;
while (m <= 10000) {
ifnotPrime[m] = 1;... | #include <iostream>
using namespace std;
int prime[1229];
bool ifnotPrime[10001];
void setPrime() {
int i = 0;
ifnotPrime[0] = ifnotPrime[1] = 1;
for (int n = 2; n <= 10000; n++) {
if (!ifnotPrime[n]) {
prime[i] = n;
i++;
int m = n * n;
while (m <= 10000) {
ifnotPrime[m] = 1;... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 270 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// game set
int gameset = sc.nextInt();
int[][] cardset = new int[UTRummy.CARDPAGE][UTRummy.ONECARDSET];
for (int i = 0; i < gameset; i++) {
for (int j = 0; j < ... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// game set
int gameset = sc.nextInt();
int[][] cardset = new int[UTRummy.CARDPAGE][UTRummy.ONECARDSET];
for (int i = 0; i < gameset; i++) {
for (int j = 0; j < ... | [["-", 64, 196, 0, 1, 0, 11, 31, 504, 71, 22], ["+", 64, 196, 0, 1, 0, 11, 31, 504, 71, 22], ["-", 75, 196, 0, 1, 0, 11, 31, 504, 71, 22], ["+", 75, 196, 0, 1, 0, 11, 31, 504, 71, 22]] | 3 | 1,009 | 4 |
#include <stdio.h>
int main(void) {
char mark[9];
int num[9], r_num[9], b_num[9], g_num[9], set, i, j;
scanf("%d", &set); /* ???????????°?????\??? */
int ans[set];
for (i = 0; i < 9; i++) { /* ????????????????????? */
r_num[i] = 0;
g_num[i] = 0;
b_num[i] = 0;
}
for (i = 0; i < set; i++) {... | #include <stdio.h>
int main(void) {
char mark[9];
int num[9], r_num[9], b_num[9], g_num[9], set, i, j;
scanf("%d", &set); /* ???????????°?????\??? */
int ans[set];
for (i = 0; i < 9; i++) { /* ????????????????????? */
r_num[i] = 0;
g_num[i] = 0;
b_num[i] = 0;
}
for (i = 0; i < set; i++) {... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 864 | 1 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int T, card[9];
bool is_same_number(int a, int b, int c) { return a == b && b == c; }
bool is_sequence(int a, int b, int c) { return a + 2 == b + 1 && b + 1 == c; }
bool is_set(int a, int b, int c) {
return is_same_n... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int T, card[9];
bool is_same_number(int a, int b, int c) { return a == b && b == c; }
bool is_sequence(int a, int b, int c) { return a + 2 == b + 1 && b + 1 == c; }
bool is_set(int a, int b, int c) {
return is_same_n... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 336 | 1 |
#include <algorithm>
#include <cstdio>
using namespace std;
int n[9];
char c[9];
int a[9];
bool is_consequence_number(int *p) {
if (n[*p] == n[(*p + 1)] + 1 && n[*p] == n[*(p + 2)] + 2)
return true;
else
return false;
}
bool is_same_color(int *p) {
if (c[*p] == c[*(p + 1)] && c[*p] == c[*(p + 2)])
... | #include <algorithm>
#include <cstdio>
using namespace std;
int n[9];
char c[9];
int a[9];
bool is_consequence_number(int *p) {
if (n[*p] == n[*(p + 1)] + 1 && n[*p] == n[*(p + 2)] + 2)
return true;
else
return false;
}
bool is_same_color(int *p) {
if (c[*p] == c[*(p + 1)] && c[*p] == c[*(p + 2)])
... | [["-", 12, 16, 31, 69, 341, 342, 0, 23, 0, 24], ["+", 31, 69, 341, 342, 0, 66, 28, 23, 0, 24]] | 1 | 386 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int T, card[16];
bool is_same_number(int a, int b, int c) {
if (a == b && a == c)
return true;
else
return false;
}
bool is_sequense(int a, int b, int c) {
if (a == b - 1 && a == c - 2)
return true;
else
return fa... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int T, card[16];
bool is_same_number(int a, int b, int c) {
if (a == b && a == c)
return true;
else
return false;
}
bool is_sequense(int a, int b, int c) {
if (a == b - 1 && a == c - 2)
return true;
else
return fa... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 332 | 2 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int num[9];
int cnt = 0;
int card[3][15] = {0};
for (int i = 0; i < 9; i++) {
cin >> num[i];
}
int c;
for (int i = 0; i < 9; i++) {
char color;
cin >> color;
if (color == 'R')
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int num[9];
int cnt = 0;
int card[3][15] = {0};
for (int i = 0; i < 9; i++) {
cin >> num[i];
}
int c;
for (int i = 0; i < 9; i++) {
char color;
cin >> color;
if (color == 'R')
... | [["-", 75, 76, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 57, 75, 76, 0, 1, 0, 16, 17, 151]] | 1 | 299 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int T;
pair<int, int> x[9], y[9];
vector<int> vec;
int main() {
cin >> T;
for (int i = 0; i < T; i++) {
for (int j = 0; j < 9; j++) {
cin >> y[j].second;
}
for (int j = 0; j < 9; j++) {
char c;
cin >> c;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int T;
pair<int, int> x[9], y[9];
vector<int> vec;
int main() {
cin >> T;
for (int i = 0; i < T; i++) {
for (int j = 0; j < 9; j++) {
cin >> y[j].second;
}
for (int j = 0; j < 9; j++) {
char c;
cin >> c;
... | [["-", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22]] | 1 | 517 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int T, card[16];
bool is_same_number(int a, int b, int c) { return a == c && b == c; }
bool is_sequence(int a, int b, int c) { return a + 2 == c && b + 1 == c; }
bool is_good_set(int a, int b, int c) {
return is_same_number(a, b, c) || is_sequence(a, b, c)... | #include <algorithm>
#include <iostream>
using namespace std;
int T, card[16];
bool is_same_number(int a, int b, int c) { return a == c && b == c; }
bool is_sequence(int a, int b, int c) { return a + 2 == c && b + 1 == c; }
bool is_good_set(int a, int b, int c) {
return is_same_number(a, b, c) || is_sequence(a, b, c)... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 313 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int T;
map<char, int> data;
data['R'] = 0;
data['G'] = 1;
data['B'] = 2;
cin >> T;
for (int i = 0; i < T; i++) {
int RGB[3][15] = {0}, cnt = 0;
int CARD[... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int T;
map<char, int> data;
data['R'] = 0;
data['G'] = 1;
data['B'] = 2;
cin >> T;
for (int i = 0; i < T; i++) {
int RGB[3][15] = {0}, cnt = 0;
int CARD[... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 337 | 7 |
#!usr/bin/env python3
import sys
def main():
WINNING_HANDS = [
'111', '222', '333', '444', '555', '666', '777', '888', '999',
'123', '234', '345', '456', '567', '678', '789'
]
num_of_datasets = int(sys.stdin.readline().strip('\n'))
datasets = [{'R': [], 'G': [... | #!usr/bin/env python3
import sys
def main():
WINNING_HANDS = [
'111', '222', '333', '444', '555', '666', '777', '888', '999',
'123', '234', '345', '456', '567', '678', '789'
]
num_of_datasets = int(sys.stdin.readline().strip('\n'))
datasets = [{'R': [], 'G... | [["-", 0, 57, 15, 679, 31, 666, 0, 657, 17, 33], ["-", 0, 57, 15, 679, 31, 666, 0, 657, 12, 612]] | 5 | 462 | 21 |
for _ in range(int(input())):
n, c = map(int, input().split()), input().split()
c = list(zip(c, n))
c.sort(key = lambda x:x[1])
c.sort(key = lambda x:x[0])
print(c)
while c != []:
if c[-1] == c[-2] == c[-3]:
c = c[:-3]
elif (c[-1][0], c[-1][1] -1) in c and (c[-1][0], ... | for _ in range(int(input())):
n, c = map(int, input().split()), input().split()
c = list(zip(c, n))
c.sort(key = lambda x:x[1])
c.sort(key = lambda x:x[0])
while c != []:
if c[-1] == c[-2] == c[-3]:
c = c[:-3]
elif (c[-1][0], c[-1][1] -1) in c and (c[-1][0], c[-1][1] -2) ... | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 233 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.TreeSet;
public class Main {
public static boolean check(int pos, int[] array, int mod) {
if (pos < 2) {
return true;
}
int m = 0;
i... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.TreeSet;
public class Main {
public static boolean check(int pos, int[] array, int mod) {
if (pos < 2) {
return true;
}
int m = 0;
i... | [["-", 0, 57, 15, 15, 0, 16, 12, 91, 17, 33], ["-", 0, 57, 15, 15, 0, 16, 12, 91, 439, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 775 | 3 |
import java.io.*;
import java.lang.*;
import java.util.*;
/* Name of the class has to be "Main" only if the class is public. */
class Main {
int[] ar;
boolean[] used;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
ar = new int[10];
used = new boolean[11];
for (int i = 1;... |
import java.io.*;
import java.lang.*;
import java.util.*;
/* Name of the class has to be "Main" only if the class is public. */
class Main {
int[] ar;
boolean[] used;
void run() {
Scanner sc = new Scanner(System.in);
for (;;) {
ar = new int[10];
used = new boolean[11];
for (int i = 1;... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 19]] | 3 | 545 | 2 |
#include <iostream>
using namespace std;
int a[10];
bool check() {
static int c[][3] = {
{0, 1, 2}, {3, 4, 5}, {6, 7, 8}, {0, 3, 6},
{1, 4, 7}, {2, 5, 8}, {0, 4, 8}, {2, 4, 6},
};
int r = -1;
bool f = false;
for (int j = 0; j < 8; j++) {
if (a[c[j][0]] == 0 || a[c[j][1]] == 0 || a[c[j][2]] ... | #include <iostream>
using namespace std;
int a[10];
bool check() {
static int c[][3] = {
{0, 1, 2}, {3, 4, 5}, {6, 7, 8}, {0, 3, 6},
{1, 4, 7}, {2, 5, 8}, {0, 4, 8}, {2, 4, 6},
};
int r = -1;
bool f = false;
for (int j = 0; j < 8; j++) {
if (a[c[j][0]] == 0 || a[c[j][1]] == 0 || a[c[j][2]] ... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 1 | 405 | 4 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 600 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define EPS (1e-10)
#define int long long
typedef vector<double> arr;
typedef vector<arr> mat;
double det(mat A) {
int n = A.size();
double res = 1;
for (int i = 0; i < n; i++) {
int pivot = i;
for (int j = i + 1; j < n; j++)
if (abs(A[j][i]) > abs(A[p... | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-10)
#define int long long
typedef vector<double> arr;
typedef vector<arr> mat;
double det(mat A) {
int n = A.size();
double res = 1;
for (int i = 0; i < n; i++) {
int pivot = i;
for (int j = i + 1; j < n; j++)
if (abs(A[j][i]) > abs(A[p... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 1 | 929 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | [["-", 49, 53, 54, 55, 0, 56, 49, 352, 0, 67], ["-", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 1,032 | 10 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_V 3000
#define INF 1e9
struct edge {
int to, cap, rev;
};
vector<edge> G[MAX_V];
int level[MAX_V], iter[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()... | #include <bits/stdc++.h>
using namespace std;
#define MAX_V 3000
#define INF 1e9
struct edge {
int to, cap, rev;
};
vector<edge> G[MAX_V];
int level[MAX_V], iter[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()... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 723 | 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, 7, 8, 9, 0, 9, 0, 43, 49, 22], ["+", 0, 7, 8, 9, 0, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 995 | 6 |
#include <algorithm>
#include <cassert>
#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 < (i... | #include <algorithm>
#include <cassert>
#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 < (i... | [["-", 8, 9, 0, 52, 8, 9, 0, 52, 0, 89], ["+", 0, 52, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 8, 9, 0, 14, 49, 53, 54, 55, 0, 21], ["-", 8, 9, 0, 52, 15, 339, 51, 27, 17, 68]] | 1 | 918 | 5 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
#define MAX_V 5000
#define INF (1 << 29)
using namespace std;
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[t... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
#define MAX_V 5000
#define INF (1 << 29)
using namespace std;
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[t... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 577 | 2 |
#include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered... | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered... | [["+", 0, 11, 12, 69, 341, 342, 0, 27, 17, 29]] | 1 | 7,414 | 1 |
#include <algorithm>
#include <iostream>
#define INF (1e9)
#define N c[n - 1]
using namespace std;
int main() {
int n, c[50], k = 0;
while (cin >> n && n) {
k++;
for (int i = 0; i < n; i++)
cin >> c[i];
cout << "Case #" << k << ": ";
if (c[0] == 1) {
int dp[2001] = {};
for (int i =... | #include <algorithm>
#include <iostream>
#define INF (1e9)
#define N c[n - 1] * 2 - 2
using namespace std;
int main() {
int n, c[50], k = 0;
while (cin >> n && n) {
k++;
for (int i = 0; i < n; i++)
cin >> c[i];
cout << "Case #" << k << ": ";
if (c[0] == 1) {
int dp[2001] = {};
for ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 289 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
int c[100];
int greedy(int x) {
int res = 0;
for (int i = n - 1; i >= 0; i--) {
res += x / c[i];
x %= c[i];
}
return res;
}
int dp[5000];
void solve() {
if (c[0] != 1) {
printf("Cannot pay some amount");
return;
}
fill(dp, dp + 5000,... | #include <bits/stdc++.h>
using namespace std;
int n;
int c[100];
int greedy(int x) {
int res = 0;
for (int i = n - 1; i >= 0; i--) {
res += x / c[i];
x %= c[i];
}
return res;
}
int dp[5000];
void solve() {
if (c[0] != 1) {
printf("Cannot pay some amount");
return;
}
fill(dp, dp + 5000,... | [["-", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 418 | 2 |
#include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
const int N = 2000;
int dp[N], memo[N], n, c[50];
int F(int x) {
if (memo[x] >= 0)
return memo[x];
int y = upper_bound(c, c + n, x)[-1];
return memo[x] = 1 + F(x - y);
}
int main() {
int i, j, T, m;
for (T = 1; scanf("%d", &n),... | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
const int N = 2000;
int dp[N], memo[N], n, c[50];
int F(int x) {
if (memo[x] >= 0)
return memo[x];
int y = upper_bound(c, c + n, x)[-1];
return memo[x] = 1 + F(x - y);
}
int main() {
int i, j, T, m;
for (T = 1; scanf("%d", &n),... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 336 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 110
#define MAX_V 310
#define INF 1e9
struct Edge {
int to, cap, rev;
};
vector<Edge> G[MAX_V];
int level[MAX_V], iter[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, ... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 110
#define MAX_V 310
#define INF 1e9
struct Edge {
int to, cap, rev;
};
vector<Edge> G[MAX_V];
int level[MAX_V], iter[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, ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 925 | 5 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, m, l;
int d[101][101];
int P[101];
int K[101];
const int INF = 1000000000;
const int MAX_V = 101;
int sp, gp;
struct edge {
int to, cap, rev;
};
vector<edge> G[MAX_V];
bool used[MAX_V];
void add_edge(int from, int to, int cap)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, m, l;
int d[101][101];
int P[101];
int K[101];
const int INF = 1000000000;
const int MAX_V = 301;
int sp, gp;
struct edge {
int to, cap, rev;
};
vector<edge> G[MAX_V];
bool used[MAX_V];
void add_edge(int from, int to, int cap)... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 795 | 2 |
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string str;
cin >> str;
int s = str.size();
bool f0 = 1, f1 = 1;
rep(i, s) {
if (i & 1 && str[i] == 'L')
f1 = 0;
if (i & 1 ^... | #include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string str;
cin >> str;
int s = str.size();
bool f0 = 1, f1 = 1;
rep(i, s) {
if (i & 1 && str[i] == 'L')
f1 = 0;
if (i & 1 ^... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 233 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int p = 0; p < n; p++) {
string input;
cin >> input;
bool firstIsNatural = true;
for (int i = 0; i < input.size(); i++) {
if (i % 2 == 0 && input.substr(i, 1) == "L")
firstIsNatural = false;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int p = 0; p < n; p++) {
string input;
cin >> input;
bool firstIsNatural = true;
for (int i = 0; i < input.size(); i++) {
if (i % 2 == 0 && input.substr(i, 1) == "L")
firstIsNatural = false;
else... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 265 | 4 |
for i in range(eval(input())):
step=input()
for j in range(len(step)-1):
if step[j]==step[j+1]:
print("NO")
break
else:
print("YES") | for i in range(eval(input())):
step=input()
flag=0
for j in range(len(step)-1):
if step[j]==step[j+1]:
print("No")
break
else:
print("Yes") | [["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 12, 612], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 59 | 7 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, m;
while (cin >> n >> m, n || m) {
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
bool flg = 0;
for (int i = 0; i < (1 << m); i++) {
int tmp = __builtin_popcountll(i);
if (tmp != l[0])
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, m;
while (cin >> n >> m, n || m) {
int l[n];
for (int i = 0; i < n; i++)
cin >> l[i];
bool flg = 0;
for (int i = 0; i < (1 << m); i++) {
int tmp = __builtin_popcountll(i);
if (tmp != l[0])
... | [["+", 75, 76, 0, 57, 64, 1, 0, 34, 0, 21], ["+", 0, 57, 64, 1, 0, 34, 12, 27, 28, 22], ["+", 0, 57, 64, 1, 0, 34, 12, 27, 17, 29]] | 1 | 259 | 3 |
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
#include <queue>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
int main() {
while (true) {
const int n = getInt();
const int m = getInt();
if (n + m == 0)
break;
vec... | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
#include <queue>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
int main() {
while (true) {
const int n = getInt();
const int m = getInt();
if (n + m == 0)
break;
vec... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 321 | 2 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
// Hit and Blow
public class Main {
int get(int x, int k) {
return k == 0 ? x / 1000
: k == 1 ? x / 100 % 10
: k == 2 ? x / 10 % 10
... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
// Hit and Blow
public class Main {
int get(int x, int k) {
return k == 0 ? x / 1000
: k == 1 ? x / 100 % 10
: k == 2 ? x / 10 % 10
... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 44]] | 3 | 842 | 3 |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int M = 1000000;
boolean a[] = new boolean[M + 1];
Arrays.fill(a, true);
a[0] = a[1] = fal... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int M = 1000000;
boolean a[] = new boolean[M + 1];
Arrays.fill(a, true);
a[0] = a[1] = fal... | [["+", 0, 7, 502, 503, 49, 200, 51, 16, 17, 72], ["+", 0, 7, 502, 503, 49, 200, 51, 16, 12, 499]] | 3 | 339 | 2 |
#include <stdio.h>
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
int prime[100000 + 310];
void makep(ll n) {
prime[0] = prime[1] = 1;
for (int i = 2; i * i <= n; i++)
if (!prime[i])
for (int j = i * i; j <= n; j += i)
prime[j] = 1;
}
int main() {
makep(100300);
ll ... | #include <stdio.h>
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
int prime[100000 + 510];
void makep(ll n) {
prime[0] = prime[1] = 1;
for (int i = 2; i * i <= n; i++)
if (!prime[i])
for (int j = i * i; j <= n; j += i)
prime[j] = 1;
}
int main() {
makep(100500);
ll ... | [["-", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 80, 81, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 64, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 64, 1, 0, 2, 3, 4,... | 0 | 227 | 10 |
#include <stdio.h>
#define M 200000
int main() {
int i, j, t, r, s[10000], a, b, c, d;
char p[M] = {1, 1};
for (i = 2; i * i < M; i++) {
if (p[i])
continue;
for (j = i * i; j < M; j += i)
p[j] = 1;
}
while (scanf("%d %d", &a, &b), a + 1 || b + 1) {
r = c = 0;
for (i = a; c++ < b; i... | #include <stdio.h>
#define M 200000
int main() {
int i, j, t, r, s[10000], a, b, c, d;
char p[M] = {1, 1};
for (i = 2; i * i < M; i++) {
if (p[i])
continue;
for (j = i * i; j < M; j += i)
p[j] = 1;
}
while (scanf("%d %d", &a, &b), a + 1 || b + 1) {
r = c = 0;
for (i = a + 1; c++ < ... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 289 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int Matsuzaki(N, P) {
int i, j, count, flag, prime[100], sum[10000];
count = 0;
for (i = N; count < 100; i++) {
flag = 1;
if (i == 0 || i == 1)
flag = 0;
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int Matsuzaki(N, P) {
int i, j, count, flag, prime[100], sum[10000];
count = 0;
for (i = N + 1; count < 100; i++) {
flag = 1;
if (i == 0 || i == 1)
flag = 0;
... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 295 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define max 100501
int c(const void *v1, const void *v2) { return *(int *)v1 - *(int *)v2; }
int prime[max];
void setprime(void) {
int i, j;
prime[0] = 1;
prime[1] = 1;
for (i = 4; i <= max; i += 2) {
prime[i] = 1;
}
for (i = 3; i * i <= max; i += 2) {
if (!pri... | #include <stdio.h>
#include <stdlib.h>
#define max 150000
int c(const void *v1, const void *v2) { return *(int *)v1 - *(int *)v2; }
int prime[max];
void setprime(void) {
int i, j;
prime[0] = 1;
prime[1] = 1;
for (i = 4; i <= max; i += 2) {
prime[i] = 1;
}
for (i = 3; i * i <= max; i += 2) {
if (!pri... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 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], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2,... | 0 | 307 | 8 |
#include <stdio.h>
#include <stdlib.h>
#define N 100000
#define P 100
#define PN 200000
#define INT(X) (*((const int *)(X)))
static int d[P * P];
static int p[PN] = {1, 1};
static int pn = 0;
int compare(const void *a, const void *b) { return (INT(a) - INT(b)); }
int main(int argc, char *argv[]) {
int i, j;
fo... | #include <stdio.h>
#include <stdlib.h>
#define N 100000
#define P 100
#define PN 200000
#define INT(X) (*((const int *)(X)))
static int d[P * P];
static int p[PN] = {1, 1};
static int pn = 0;
int compare(const void *a, const void *b) { return (INT(a) - INT(b)); }
int main(int argc, char *argv[]) {
int i, j;
fo... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 317 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX_N 101000
int isPrime[MAX_N + 1] = {0, 0, 1};
void quickSort(int *, int, int);
int median(int, int, int);
void insertionSort(int *, int);
int main(void) {
int i, j, N, P, cnt, p[22], sum[253];
for (i = 3; i <= MAX_N; i += 2)
isPrime[i] = 1;
for (i = 3; i... | #include <stdio.h>
#include <stdlib.h>
#define MAX_N 101000
int isPrime[MAX_N + 1] = {0, 0, 1};
void quickSort(int *, int, int);
int median(int, int, int);
void insertionSort(int *, int);
int main(void) {
int i, j, N, P, cnt, p[22], sum[253];
for (i = 3; i <= MAX_N; i += 2)
isPrime[i] = 1;
for (i = 3; i... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 0 | 620 | 2 |
/*
AizuOnline A2150
Title Matuzaki
*/
#include <stdio.h>
// Select Below
//#include <stdlib.h>
//#include <string.h>
//#include <float.h>
//#include <math.h>
//#include <limits.h>
#define PRIME_MAX 101197 // from 10^5 100th prime
// Global data section
int N, P;
//
int prime_f[PRIME_MAX + 1];
int prime_table[] = {2, ... | /*
AizuOnline A2150
Title Matuzaki
*/
#include <stdio.h>
// Select Below
//#include <stdlib.h>
//#include <string.h>
//#include <float.h>
//#include <math.h>
//#include <limits.h>
#define PRIME_MAX 101197 // from 10^5 100th prime
// Global data section
int N, P;
//
int prime_f[PRIME_MAX + 1];
int prime_table[] = {2, ... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 582 | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
#define abs(a) ((a) < (0) ? -(a) : (a))
#define rep(i, n) REP(i, 0, (n))
#define REP(i, a, n) for (int i = (a); i < (n); i++)
#define pb push_back
int N = 110000;
bool is_prime[110000];
void se... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
#define abs(a) ((a) < (0) ? -(a) : (a))
#define rep(i, n) REP(i, 0, (n))
#define REP(i, a, n) for (int i = (a); i < (n); i++)
#define pb push_back
int N = 110000;
bool is_prime[110000];
void se... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 296 | 4 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
#define fcout cout << setprecision(10)
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
template <typename T> void debug(vector<T> &vec) {
for (auto x : v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
#define fcout cout << setprecision(10)
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
template <typename T> void debug(vector<T> &vec) {
for (auto x : v... | [["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22]] | 1 | 526 | 2 |
#include <bits/stdc++.h>
using namespace std;
int p[200001];
int main() {
p[0] = 1;
p[1] = 1;
for (int i = 4; i <= 200000; i += 2)
p[i] = 1;
for (int i = 3; i * i <= 200000; i += 2) {
if (!p[i]) {
for (int j = i * 3; j <= 200000; j += 2 * i)
p[j] = 1;
}
}
int N, P;
while (s... | #include <bits/stdc++.h>
using namespace std;
int p[200001];
int main() {
p[0] = 1;
p[1] = 1;
for (int i = 4; i <= 200000; i += 2)
p[i] = 1;
for (int i = 3; i * i <= 200000; i += 2) {
if (!p[i]) {
for (int j = i * 3; j <= 200000; j += 2 * i)
p[j] = 1;
}
}
int N, P;
while (s... | [["+", 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], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8,... | 1 | 264 | 8 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include ... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29]] | 1 | 287 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX 200000
bool isP[MAX];
vector<int> primes;
void make_table() {
for (int i = 0; i < MAX; i++)
isP[i] = true;
isP[0] = isP[1] = false;
for (int i = 2; i * i < MAX; i++) {
if (!isP[i])
continue;
for (int j = ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX 200000
bool isP[MAX];
vector<int> primes;
void make_table() {
for (int i = 0; i < MAX; i++)
isP[i] = true;
isP[0] = isP[1] = false;
for (int i = 2; i * i < MAX; i++) {
if (!isP[i])
continue;
for (int j = ... | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22]] | 1 | 303 | 2 |
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
const int LIM = 3000000;
char isprime[LIM];
int primes[LIM];
int PRIME_LIM = 0;
void eratosthenes() {
fill(isprime, isprime + LIM, 1);
isprime[0] = isprime[1] = 0;
for (int x = 2; x * x < LIM; ++x) {
if (!isprim... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
const int LIM = 3000000;
char isprime[LIM];
int primes[LIM];
int PRIME_LIM = 0;
void eratosthenes() {
fill(isprime, isprime + LIM, 1);
isprime[0] = isprime[1] = 0;
for (int x = 2; x * x < LIM; ++x) {
if (!isprim... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 31, 13], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 17, 48], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 12, 22]] | 1 | 313 | 4 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> Prime(1000000), Matsuzaki(1000);
int judge(int n) {
if (n < 2)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (int i = 3; i <= n / i; i += 2) {
if (n % i == 0)
return 0;
}
retur... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> Prime(1000000), Matsuzaki(100000);
int judge(int n) {
if (n < 2)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
for (int i = 3; i <= n / i; i += 2) {
if (n % i == 0)
return 0;
}
ret... | [["-", 0, 30, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 4, 0, 13]] | 1 | 292 | 2 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define mod 100000... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define mod 100000... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 289 | 6 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// cin.sync_with_stdio(false);
// streambuf
using namespace std;
typedef long long ll;
typedef pair<... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// cin.sync_with_stdio(false);
// streambuf
using namespace std;
typedef long long ll;
typedef pair<... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 72], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 279 | 4 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 33], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 561 | 6 |
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int so[200000] = {};
int f;
so[2] = 1;
for (int i = 2; i < 200000; i++) {
f = 0;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
f = 1;
break;
}
}
if (f ==... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int so[200000] = {};
int f;
so[2] = 1;
for (int i = 2; i < 200000; i++) {
f = 0;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
f = 1;
break;
}
}
if (f ==... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 319 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#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>
#def... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#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>
#def... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 335 | 2 |
#include <bits/stdc++.h>
#define INF 200000
using namespace std;
bool sosuu[INF];
int main() {
memset(sosuu, true, sizeof(sosuu));
sosuu[0] = sosuu[1] = false;
for (int a = 2; a < INF; a++) {
if (sosuu[a]) {
for (int b = a * 2; b < INF; b += a)
sosuu[b] = false;
}
}
int x, y;
while (c... | #include <bits/stdc++.h>
#define INF 200000
using namespace std;
bool sosuu[INF];
int main() {
memset(sosuu, true, sizeof(sosuu));
sosuu[0] = sosuu[1] = false;
for (int a = 2; a < INF; a++) {
if (sosuu[a]) {
for (int b = a * 2; b < INF; b += a)
sosuu[b] = false;
}
}
int x, y;
while (c... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 262 | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
bool is_prime(int n) {
if (n == 0 || n == 1)
return false;
if (n == 2)
ret... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
bool is_prime(int n) {
if (n == 0 || n == 1)
return false;
if (n == 2)
ret... | [["-", 15, 339, 51, 16, 31, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 31, 2, 63, 118, 28, 22]] | 1 | 267 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define F(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 100000000
#define ll long long
using namespace std;
typedef pair<int, int> P;
int prime[1000010];
bool is_prime[1000010];
voi... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define F(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 100000000
#define ll long long
using namespace std;
typedef pair<int, int> P;
int prime[1000010];
bool is_prime[1000010];
voi... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 409 | 2 |
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#define N 1000000
#define all(p) p.begin(), p.end()
bool primes[N];
int main() {
vector<int> prime;
primes[0] = primes[1] = 1;
for (int i = 2; i < N; i++) {
if (!primes[i]) {
for (int j = i; j < N; j += i... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#define N 1000000
#define all(p) p.begin(), p.end()
bool primes[N];
int main() {
vector<int> prime;
primes[0] = primes[1] = 1;
for (int i = 2; i < N; i++) {
if (!primes[i]) {
for (int j = i; j < N; j += i... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 239 | 2 |
// 41
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
bool cmp[1000000] = {true, true};
vector<int> v;
for (int i = 2; i < 1000000; i++) {
if (!cmp[i]) {
v.push_back(i);
for (int j = 2; i * j < 1000000; j++) {
cmp[i * j] = true;
}
}
... | // 41
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
bool cmp[1000000] = {true, true};
vector<int> v;
for (int i = 2; i < 1000000; i++) {
if (!cmp[i]) {
v.push_back(i);
for (int j = 2; i * j < 1000000; j++) {
cmp[i * j] = true;
}
}
... | [["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 225 | 6 |
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cctype>
#include <complex>
#include <sstream>
#include <string>
usi... | #include <cstdio>
#include <iomanip>
#include <iostream>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cctype>
#include <complex>
#include <sstream>
#include <string>
usi... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13]] | 1 | 465 | 4 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXNUM 200274
int main(void) {
int n, p, i, j, count1, count2, flag[MAXNUM + 1], tmp[MAXNUM + 1];
for (i = 0; i <= MAXNUM; i++)
flag[i] = 1;
flag[0] = flag[1] = 0;
for (i = 2; i <= sqrt((double)MAXNUM); i++) {
for (j =... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXNUM 300000
int main(void) {
int n, p, i, j, count1, count2, flag[MAXNUM + 1], tmp[MAXNUM + 1];
for (i = 0; i <= MAXNUM; i++)
flag[i] = 1;
flag[0] = flag[1] = 0;
for (i = 2; i <= sqrt((double)MAXNUM); i++) {
for (j =... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 286 | 2 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import math
import itertools
def sieve_of_erastosthenes(num):
input_list = [False if i % 2 == 0 or i % 3 == 0 or i % 5 == 0 else True for i in range(num)]
input_list[0] = input_list[1] = False
input_list[2] = input_list[3] = input_list[5] = True
sqrt = mat... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import math
import itertools
def sieve_of_erastosthenes(num):
input_list = [False if i % 2 == 0 or i % 3 == 0 or i % 5 == 0 else True for i in range(num)]
input_list[0] = input_list[1] = False
input_list[2] = input_list[3] = input_list[5] = True
sqrt = mat... | [["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 72], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 239 | 2 |
import itertools
r = 110000
s = int(r*0.5)
p = [1] * r
p[0] = 0
for i in range(1,s):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
while True:
N,P = list(map(int,input().split()))
if N == -1: break
i = N + 1
prime = [0]*25
j = 0
while j < 24:
if p[i-1] == 1:
prime[j] = i
j += 1
i += 1
... | import itertools
r = 110000
s = int(r*0.5)
p = [1] * r
p[0] = 0
for i in range(1,s):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
while True:
N,P = list(map(int,input().split()))
if N == -1: break
i = N + 1
prime = [0]*24
j = 0
while j < 24:
if p[i-1] == 1:
prime[j] = i
j += 1
i += 1
... | [["-", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 188 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LO... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LO... | [["-", 0, 2, 3, 4, 0, 74, 39, 77, 39, 40], ["+", 0, 2, 3, 4, 0, 74, 39, 77, 39, 40]] | 1 | 534 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define reps(i, j, k) for (int i = j; i <= k; i++)
#define pb push_back
using namespace std;
struct edge {
int to, cost, pp;
};
typedef pair<int, int... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define reps(i, j, k) for (int i = j; i <= k; i++)
#define pb push_back
using namespace std;
struct edge {
int to, cost, pp;
};
typedef pair<int, int... | [["-", 8, 9, 0, 57, 15, 339, 51, 91, 28, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 91, 28, 22]] | 1 | 605 | 2 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF (1e9 + 1)
//#define INF (1LL<<59)
#define MAX_V 100
#define MAX_B 100
struct edge {
pii to;
int ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF (1e9 + 1)
//#define INF (1LL<<59)
#define MAX_V 100
#define MAX_B 100
struct edge {
pii to;
int ... | [["+", 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 | 628 | 6 |
#include <iostream>
#include <queue>
#include <vector>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
#define INF 1000000000
using namespace std;
typedef long long ll;
struct edge {
ll n, d, e;
};
struct state {
ll n, l, s;
bool operator<(const state &state) const { return s > state.s; }
};
int main(void)... | #include <iostream>
#include <queue>
#include <vector>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
#define INF 1000000000
using namespace std;
typedef long long ll;
struct edge {
ll n, d, e;
};
struct state {
ll n, l, s;
bool operator<(const state &state) const { return s > state.s; }
};
int main(void)... | [["-", 15, 339, 51, 34, 12, 16, 31, 16, 17, 98], ["+", 15, 339, 51, 34, 12, 16, 31, 16, 17, 106], ["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106]] | 1 | 471 | 4 |
#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, 43, 49, 50, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 50, 49, 80, 81, 16, 12, 13]] | 1 | 569 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M, L;
int a, b;
int now;
cin >> N >> M >> L;
for (; N != 0;) {
vector<vector<bool>> graph(N, vector<bool>(N, false));
vector<vector<int>> distance(N, vector<int>(N)), evect(N, vector<... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M, L;
int a, b;
int now;
cin >> N >> M >> L;
for (; N != 0;) {
vector<vector<bool>> graph(N, vector<bool>(N, false));
vector<vector<int>> distance(N, vector<int>(N)), evect(N, vector<... | [["+", 0, 7, 15, 16, 12, 16, 31, 16, 31, 22], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 17, 85], ["+", 0, 7, 15, 16, 12, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72]] | 1 | 702 | 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_... | [["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 12, 22]] | 1 | 1,906 | 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... | [["-", 12, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["+", 12, 2, 63, 118, 28, 69, 341, 342, 0, 22]] | 1 | 685 | 2 |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 1,064 | 2 |
#include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T inf = numeric_limits<T>::has_infinity
? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0,... | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T inf = numeric_limits<T>::has_infinity
? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 4;
#define REP(i, stop) FOR(i, 0,... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 437 | 4 |
#include <algorithm>
#include <assert.h>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int LIMIT = 1000000000;
struct Data {
int id;
int st;
int num;
Data(int id, int st, int num) : id(id), st(st), num(num) {}
bool operator<(const Data &rhs) const { return st < rhs.st; ... | #include <algorithm>
#include <assert.h>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int LIMIT = 1000000000;
struct Data {
int id;
int st;
int num;
Data(int id, int st, int num) : id(id), st(st), num(num) {}
bool operator<(const Data &rhs) const { return st < rhs.st; ... | [["+", 64, 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], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 681 | 5 |
#include <algorithm>
#include <iostream>
#include <list>
#include <set>
#include <vector>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
struct range {
int beg, ed;
int num;
};
int main() {
while (1) {
int n;
cin >> n;
if (!n)
break;
... | #include <algorithm>
#include <iostream>
#include <list>
#include <set>
#include <vector>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
struct range {
int beg, ed;
int num;
};
int main() {
while (1) {
int n;
cin >> n;
if (!n)
break;
... | [["-", 0, 2, 3, 4, 0, 83, 0, 118, 28, 22], ["-", 0, 2, 3, 4, 0, 83, 0, 118, 17, 131], ["-", 0, 2, 3, 4, 0, 83, 0, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 83, 0, 16, 31, 22], ["+", 0, 2, 3, 4, 0, 83, 0, 16, 17, 72], ["+", 0, 2, 3, 4, 0, 83, 0, 16, 12, 22]] | 1 | 376 | 6 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define dump(a) (cerr << #a <... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define dump(a) (cerr << #a <... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 566 | 2 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18]] | 1 | 517 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.