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 |
|---|---|---|---|---|---|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int a = scanner.nextInt();
int b = scanner.nextInt();
int c = scanner.nextInt();
int d = scanner.nextInt();
int x = 0;
int y = ... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int a = scanner.nextInt();
int b = scanner.nextInt();
int c = scanner.nextInt();
int d = scanner.nextInt();
int x = 0;
int y = ... | [["-", 64, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 64, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["-", 75, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 75, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 151 | 4 |
#include <stdio.h>
int main() {
int n, a, b, c, d;
int e, f;
int g, h;
int i, j;
scanf("%d", &n);
scanf("%d%d", &a, &b);
scanf("%d%d", &c, &d);
e = n % a;
f = n % c;
if (e <= 1) {
g = n / a + 1;
h = g * b;
} else {
g = n / a;
h = g * b;
}
if (f <= 1) {
i = n / c + 1;
... | #include <stdio.h>
int main() {
int n, a, b, c, d;
int e, f;
int g, h;
int i, j;
scanf("%d", &n);
scanf("%d%d", &a, &b);
scanf("%d%d", &c, &d);
e = n % a;
f = n % c;
if (e > 0) {
g = n / a + 1;
h = g * b;
} else {
g = n / a;
h = g * b;
}
if (f > 0) {
i = n / c + 1;
j ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]] | 0 | 209 | 8 |
#include <stdio.h>
int main(void) {
int N, A, B, C, D, price_X, price_Y, mod;
scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);
if (N % A != 0) {
mod = 1;
} else {
mod = 0;
}
price_X = (N / A + mod) * B;
if (N % A != 0) {
mod = 1;
} else {
mod = 0;
}
price_Y = (N / C + mod) * D;
if (pr... | #include <stdio.h>
int main(void) {
int N, A, B, C, D, price_X, price_Y, mod;
scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);
if (N % A != 0) {
mod = 1;
} else {
mod = 0;
}
price_X = (N / A + mod) * B;
if (N % C != 0) {
mod = 1;
} else {
mod = 0;
}
price_Y = (N / C + mod) * D;
if (pr... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22]] | 0 | 148 | 2 |
#include <stdio.h>
#include <string.h>
int main(void) {
int n, x, y, a, b, c, d;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
x = n / a * b;
y = n / c * d;
if (n / a > 0) {
x = x + b;
}
if (n / c > 0) {
y = y + d;
}
if (x < y) {
printf("%d\n"... | #include <stdio.h>
#include <string.h>
int main(void) {
int n, x, y, a, b, c, d;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
x = n / a * b;
y = n / c * d;
if (n % a > 0) {
x = x + b;
}
if (n % c > 0) {
y = y + d;
}
if (x < y) {
printf("%d\n"... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 85], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 109]] | 1 | 158 | 4 |
#include <iostream>
using namespace std;
int nedan(int a, int i, int price) {
int E;
if (a % i != 0) {
E = ((int)((a / i) + 1)) * price;
} else {
E = (int)(a / i) * price;
}
return E;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
if (nedan(N, A, B) > nedan(N, C, D)) {
cout ... | #include <iostream>
using namespace std;
int nedan(int a, int i, int price) {
int E;
if (a % i != 0) {
E = ((int)((a / i) + 1)) * price;
} else {
E = (int)(a / i) * price;
}
return E;
}
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
if (nedan(N, A, B) < nedan(N, C, D)) {
cout ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 151 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
int x = (n / a) * b + (n % a > 0 ? 1 : 0) * b;
int y = (n / c) * d + (n % c > 0 ? 1 : 0) * d;
if (x > y)
cout << x << endl;
else
cout << y << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
int x = (n / a) * b + (n % a > 0 ? 1 : 0) * b;
int y = (n / c) * d + (n % c > 0 ? 1 : 0) * d;
if (x > y)
cout << y << endl;
else
cout << x << endl;
return 0;
}
| [["-", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22], ["-", 75, 76, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 107 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
if ((N / A) * B < (N / C) * D && N % A == 0 && N % C == 0)
cout << (N / A) * B << endl;
if ((N / A + 1) * B < (N / C) * D && N % A > 0 && N % C == 0)
cout << (N / A + 1) * B << endl;
if ((N ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
if ((N / A) * B <= (N / C) * D && N % A == 0 && N % C == 0)
cout << (N / A) * B << endl;
if ((N / A + 1) * B <= (N / C) * D && N % A > 0 && N % C == 0)
cout << (N / A + 1) * B << endl;
if ((N ... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 47], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 20]] | 1 | 398 | 8 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, c, d, e, g;
cin >> n >> a >> b >> c >> d;
if (n % a == 0)
e = n / a * b;
if (n % a != 0)
e = (n / a + 1) * b;
if (n % c == 0)
g = n / c * d;
if (n % c != 0)
g = (n / c + 1) * d;
if (e > g)
cout << g << endl;
if (e < g... | #include <iostream>
using namespace std;
int main() {
int n, a, b, c, d, e, g;
cin >> n >> a >> b >> c >> d;
if (n % a == 0)
e = n / a * b;
if (n % a != 0)
e = (n / a + 1) * b;
if (n % c == 0)
g = n / c * d;
if (n % c != 0)
g = (n / c + 1) * d;
if (e >= g)
cout << g << endl;
if (e < ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20]] | 1 | 135 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR... | [["-", 3, 4, 0, 69, 341, 342, 0, 16, 17, 72], ["-", 3, 4, 0, 69, 341, 342, 0, 16, 12, 13]] | 1 | 410 | 2 |
#include <bits/stdc++.h>
using namespace std;
int N, M, Q;
int U[200000], V[200000];
vector<pair<int, int>> graph[100000];
int v[100000], in[100000];
bool live[200000];
void BFS() {
memset(v, -1, sizeof(v));
queue<int> que;
que.push(0);
v[0] = 0;
while (!que.empty()) {
int p = que.front();
que.pop()... | #include <bits/stdc++.h>
using namespace std;
int N, M, Q;
int U[200000], V[200000];
vector<pair<int, int>> graph[100000];
int v[100000], in[100000];
bool live[200000];
void BFS() {
memset(v, -1, sizeof(v));
queue<int> que;
que.push(0);
v[0] = 0;
while (!que.empty()) {
int p = que.front();
que.pop()... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 541 | 2 |
//-------------------------------------------
//- Train Fare -
//- -
//- autumn_eel niha katemasen! -
//-------------------------------------------
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include ... | #include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
inline void reader(int *x) {
int k = getchar_unlocked();
*x = k - '0';
while (true) {
k = getchar_unlocked();
if (k < '0')
break;
*x = ((*x) << 1) + ((*x) << 3... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 1,130 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mygc(c) (c) = getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
inline void reader(int &x) {
int k, m = 0;
x = 0;
for (;;) {
mygc(k);
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mygc(c) (c) = getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
inline void reader(int &x) {
int k, m = 0;
x = 0;
for (;;) {
mygc(k);
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
... | [["-", 0, 27, 28, 69, 341, 342, 0, 69, 28, 22], ["+", 0, 27, 28, 69, 341, 342, 0, 69, 28, 22]] | 1 | 743 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
struct BinaryIndexedTree {
vector<int64> data;
int curr;
BinaryIndexedTree(int sz) {
data.assign(++sz, 0);
curr = 1;
while (curr < data.size())
curr <<= 1;
}
inline int64 sum(int k) {
int64 ret = 0;
for (++k; k ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
struct BinaryIndexedTree {
vector<int64> data;
int curr;
BinaryIndexedTree(int sz) {
data.assign(++sz, 0);
curr = 1;
while (curr < data.size())
curr <<= 1;
}
inline int64 sum(int k) {
int64 ret = 0;
for (++k; k ... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 506 | 2 |
import java.util.*;
public class Main {
private static Scanner sc = new Scanner(System.in);
public static void main(String[] args) throws Exception {
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int ret = 0;
if (a < 0) {
... | import java.util.*;
public class Main {
private static Scanner sc = new Scanner(System.in);
public static void main(String[] args) throws Exception {
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int e = sc.nextInt();
int ret = 0;
if (a < 0) {
... | [["-", 75, 196, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 75, 196, 0, 1, 0, 11, 12, 16, 12, 22]] | 3 | 140 | 2 |
#include <stdio.h>
int main(void) {
int a, b, c, d, e, m, x, y, z;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
if (a < 0) {
m = a * -1;
x = c * m;
y = e * b;
z = x + y + d;
printf("%d\n", z);
} else if (0 < a) {
x = b - a;
y = x * e;
printf("%d\n", z);
} else {
x = b * e;
... | #include <stdio.h>
int main(void) {
int a, b, c, d, e, m, x, y, z;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
if (a < 0) {
m = a * -1;
x = c * m;
y = e * b;
z = x + y + d;
printf("%d\n", z);
} else if (0 < a) {
x = b - a;
y = x * e;
printf("%d\n", y);
} else {
x = b * e;
... | [["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 153 | 4 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
if (a > 0) {
cout << (b - a) * e << endl;
} else {
cout << b * e + d + a * c << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
if (a > 0) {
cout << (b - a) * e << endl;
} else {
cout << b * e + d - a * c << endl;
}
return 0;
} | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 75 | 2 |
#include <stdio.h>
int main() {
int a, b, c, d, e;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (a < 0 && b <= 0) {
printf("%d\n", c * (b - a));
} else if (a < 0 && b > 0) {
printf("%d\n", (-a) * c + d + b * e);
} else {
printf("%d\n", b * e);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, d, e;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (a < 0 && b <= 0) {
printf("%d\n", c * (b - a));
} else if (a < 0 && b > 0) {
printf("%d\n", (-a) * c + d + b * e);
} else {
printf("%d\n", (b - a) * e);
}
return 0;
} | [["+", 0, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 22], ["+", 0, 2, 3, 4, 0, 16, 31, 23, 0, 25]] | 1 | 121 | 4 |
//============================================================================
// Name : AOL.cpp
// Author : Akari Fujii
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#in... | //============================================================================
// Name : AOL.cpp
// Author : Akari Fujii
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#in... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 101 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int f = 0;
if (a < 0) {
for (;;) {
a = a + 1;
f = f + c;
if (a == b) {
cout << f << endl;
return 0;
}
if (a == 0) {
f = f + d;
break;
... | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int f = 0;
if (a < 0) {
for (;;) {
a = a + 1;
f = f + c;
if (a == b) {
cout << f << endl;
return 0;
}
if (a == 0) {
f = f + d;
break;
... | [["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 149 | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
int s = 0;
cin >> a >> b >> c >> d >> e;
if (a < 0) {
s += (a * c * -1) + d;
}
s += (b - a) * e;
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
int s = 0;
cin >> a >> b >> c >> d >> e;
if (a < 0) {
s += a * c * (-1) + d;
a = 0;
}
s += (b - a) * e;
cout << s << endl;
return 0;
} | [["-", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 11, 12, 16, 31, 16, 12, 23, 0, 24], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 79 | 6 |
#include <stdio.h>
int A, B, C, D, E, T;
int main() {
scanf("%d %d %d %d %d", &A, &B, &C, &D, &E);
if (A > 0) {
T = (B - A) * E;
} else if (A < 0) {
T = (0 - A) * C + D + (B - A) * E;
}
printf("%d\n", T);
return 0;
} | #include <stdio.h>
int A, B, C, D, E, T;
int main() {
scanf("%d %d %d %d %d", &A, &B, &C, &D, &E);
if (A > 0) {
T = (B - A) * E;
} else if (A < 0) {
T = (0 - A) * C + D + B * E;
}
printf("%d\n", T);
return 0;
} | [["-", 0, 11, 12, 16, 12, 16, 31, 23, 0, 24], ["-", 12, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["-", 12, 16, 12, 16, 31, 23, 0, 16, 12, 22], ["-", 0, 11, 12, 16, 12, 16, 31, 23, 0, 25]] | 1 | 103 | 4 |
#include <stdio.h>
int main(void) {
int a, b, c, d, e, x;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
if (a < 0) {
x = (a * -1) + c + (b * e);
}
if (a > 0) {
x = (b - a) * e;
}
printf("%d\n", x);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, d, e, x;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
if (a < 0) {
x = (a * -1 * c) + d + (b * e);
}
if (a > 0) {
x = (b - a) * e;
}
printf("%d\n", x);
return 0;
} | [["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 48], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22]] | 1 | 99 | 4 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
int main(void) {
long n, a, b, x, y, z, p, q, r;
cin >> n >> a >> x >> y >> z;
if (n < 0) {
p = 0;
p = x * (0 - n);
q = 0;
q = y;
r = 0;
r = z * a;
cout << p + q + r << endl;
} else... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
int main(void) {
long n, a, b, x, y, z, p, q, r;
cin >> n >> a >> x >> y >> z;
if (n < 0) {
p = 0;
p = x * (0 - n);
q = 0;
q = y;
r = 0;
r = z * a;
cout << p + q + r << endl;
} else... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 174 | 4 |
#include <stdio.h>
int main(void) {
int a, b, c, d, e;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (a < 0)
printf("%d\n", -a * c + d + b * e);
else
printf("%d\n", d + (b - a) * e);
return 0;
}
| #include <stdio.h>
int main(void) {
int a, b, c, d, e;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if (a < 0)
printf("%d\n", -a * c + d + b * e);
else
printf("%d\n", (b - a) * e);
return 0;
}
| [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 89 | 2 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
int ans;
cin >> a >> b >> c >> d >> e;
if (a <= 0) {
ans = (-a) * c + d + b * e;
} else {
ans = (b - a) + e;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
int ans;
cin >> a >> b >> c >> d >> e;
if (a <= 0) {
ans = (-a) * c + d + b * e;
} else {
ans = (b - a) * e;
}
cout << ans << endl;
return 0;
}
| [["-", 0, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 17, 48]] | 1 | 83 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, sum;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
if (a < 0) {
sum = -a * c + d + b * e;
} else if (a = 0) {
sum = d + b * e;
} else if (a > 0) {
sum = (b - a) * e;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, sum;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
if (a < 0) {
sum = -a * c + d + b * e;
}
if (a == 0) {
sum = d + b * e;
}
if (a > 0) {
sum = (b - a) * e;
}
cout << sum << endl;
}
| [["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 75, 76, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 1 | 108 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
if (A < 0)
cout << -A + D + E * B << endl;
if (A > 0)
cout << E * (A - B) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
if (A < 0)
cout << -A * C + D + E * B << endl;
if (A > 0)
cout << E * (B - A) << endl;
return 0;
}
| [["+", 31, 16, 12, 16, 31, 16, 31, 16, 17, 48], ["+", 31, 16, 12, 16, 31, 16, 31, 16, 12, 22], ["-", 31, 16, 12, 16, 12, 23, 0, 16, 31, 22], ["-", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 31, 16, 12, 16, 12, 23, 0, 16, 12, 22]] | 1 | 75 | 6 |
#include <iostream>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
if (B < 0) {
cout << (B - A) * C << endl;
} else if (B < 0) {
cout << (-A) * C + D + B * E << endl;
} else {
cout << (B - A) * E << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
if (B < 0) {
cout << (B - A) * C << endl;
} else if (A < 0) {
cout << (0 - A) * C + D + B * E << endl;
} else {
cout << (B - A) * E << endl;
}
return 0;
}
| [["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 31, 16, 31, 16, 31, 23, 0, 16, 31, 13]] | 1 | 99 | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
typedef pair<int, Pi> Pii;
const static int dy[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const static int dx[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
int H, W;
char S[1000][1001];
cin >> H >> W;
for (int i = 0; i < H; i++) {
cin >> S[i];... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pi;
typedef pair<int, Pi> Pii;
const static int dy[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const static int dx[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
int H, W;
char S[1000][1000];
cin >> H >> W;
for (int i = 0; i < H; i++) {
cin >> S[i];... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 12, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 51, 16, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["... | 1 | 379 | 8 |
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int h, w, map[1001][1001];
struct pos {
int x, y;
};
std::queue<pair<pos, int>> que;
int check(int _X, int _Y) {
int count = 0;
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (map[_X + i][_Y + j] == -... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int h, w, map[1001][1001];
struct pos {
int x, y;
};
std::queue<pair<pos, int>> que;
int check(int _X, int _Y) {
int count = 0;
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (map[_X + i][_Y + j] == -... | [["-", 3, 4, 0, 2, 3, 4, 0, 27, 17, 29], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 586 | 3 |
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
string S[2000];
int x[2000][2000];
int z[2000][2000];
queue<int> Q;
queue<int> R;
int main() {
int n, m;
char T[10] = {'.', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
cin >> n >> m;
for (int i = 0; i < n; i++) {
... | #include <cstring>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
string S[2000];
int x[2000][2000];
int z[2000][2000];
queue<int> Q;
queue<int> R;
int main() {
int n, m;
char T[10] = {'.', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
cin >> n >> m;
for (int i = 0; i < n; i++) {
... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 724 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
#define INF 1000000000
using namespace std;
const vector<int> dx = {0, 1, 1, 1, 0, -1, -1, -1};
const vector<int> dy = {-1, -1, 0, 1, 1, 1, 0, -1};
int H, W;
vector<string... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
#define INF 1000000000
using namespace std;
const vector<int> dx = {0, 1, 1, 1, 0, -1, -1, -1};
const vector<int> dy = {-1, -1, 0, 1, 1, 1, 0, -1};
int H, W;
vector<string... | [["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 601 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#define FLAG -1
using namespace std;
typedef pair<int, int> P;
int main() {
int h, w, dh[] = {1, 1, 1, 0, -1, -1, -1, 0},
dw[] = {1, 0, -1, -1, -1, 0, 1, 1}, ctn, i, j;
int solve = -2;
cin >> h >> w;
queue<P> que, tmp;
char d... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#define FLAG -1
using namespace std;
typedef pair<int, int> P;
int main() {
int h, w, dh[] = {1, 1, 1, 0, -1, -1, -1, 0},
dw[] = {1, 0, -1, -1, -1, 0, 1, 1}, ctn, i, j;
int solve = -1;
cin >> h >> w;
queue<P> que, tmp;
char d... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 523 | 2 |
/*************************
PCK 2012 t1
************************/
/*#include <stdio.h>
int main(){
int s;
int sum = 0;
int i;
for ( i = 0; i < 10; i++){
scanf("%d", &s);
sum += s;
}
printf("%d\n", sum);
}*/
/**********... | /*************************
PCK 2012 t1
************************/
/*#include <stdio.h>
int main(){
int s;
int sum = 0;
int i;
for ( i = 0; i < 10; i++){
scanf("%d", &s);
sum += s;
}
printf("%d\n", sum);
}*/
/**********... | [["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 13], ["-", 0, 30, 0, 43, 49, 50, 51, 83, 0, 21]] | 1 | 566 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, x, y, a, b, c;
scanf("%d%d", &n, &m);
scanf("%d", &x);
vector<int> e(n + 1);
for (int i = 1; i < m; i++) {
scanf("%d", &y);
if (x < y)
e[x]++, e[y]--;
else
e[x]--;
e[y]++;
x = y;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, x, y, a, b, c;
scanf("%d%d", &n, &m);
scanf("%d", &x);
vector<int> e(n + 1);
for (int i = 1; i < m; i++) {
scanf("%d", &y);
if (x < y)
e[x]++, e[y]--;
else
e[x]--, e[y]++;
x = y;
}
ll ... | [["-", 8, 9, 0, 57, 75, 76, 0, 1, 0, 35], ["+", 0, 57, 75, 76, 0, 1, 0, 34, 0, 21]] | 1 | 200 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define N_MAX 100000
#define M_MAX 100000
int main() {
int N, A[N_MAX], B[N_MAX], C[N_MAX], M;
int P[M_MAX];
int thcou[N_MAX + 1] = {0};
scanf("%d%d", &N, &M);
FOR(i, 0, M) { scanf("%d", &P[i]); }
FOR(i, 0, N - ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define N_MAX 100000
#define M_MAX 100000
int main() {
int N, A[N_MAX], B[N_MAX], C[N_MAX], M;
int P[M_MAX];
int thcou[N_MAX + 1] = {0};
scanf("%d%d", &N, &M);
FOR(i, 0, M) { scanf("%d", &P[i]); }
FOR(i, 0, N - ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 294 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
int n, m, a, b, c, cnt = 0, from[N], to[N], f, t, s = 1, e = 1;
int ans = 0;
signed main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
cin >> t;
for (int i = 1; i < m; ++i) {
f = t;
cin >> t;
from[i] = min(f,... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
int n, m, a, b, c, cnt = 0, from[N], to[N], f, t, s = 1, e = 1;
int ans = 0;
signed main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
cin >> t;
for (int i = 1; i < m; ++i) {
f = t;
cin >> t;
from[i] = min(f,... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 232 | 4 |
#include <bits/stdc++.h>
#define int long
using namespace std;
int i, j, k;
int x, y;
int p[100005];
int l, r;
int M, N;
int a[100010];
int b[100010];
int c[100010];
int cnt[100010];
signed main() {
ios_base::sync_with_stdio(0);
cin >> M >> N;
for (i = 1; i <= N; i++)
cin >> p[i];
for (i = 1; i < M; i++) {
... | #include <bits/stdc++.h>
#define int long
using namespace std;
int i, j, k;
int x, y;
int p[100005];
int l, r;
int M, N;
int a[100010];
int b[100010];
int c[100010];
int cnt[100010];
signed main() {
ios_base::sync_with_stdio(0);
cin >> M >> N;
for (i = 1; i <= N; i++)
cin >> p[i];
for (i = 1; i < M; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 274 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
int main(void) {
int n, m;
cin >> n >> m;
int p[100010];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int array[100010] = {};
//?????´
/*for(int i = 0; i < m-1; i++){
if(p[i] < p[i+1]){
for(int j = p[i]; j < p[i+... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
int main(void) {
int n, m;
cin >> n >> m;
int p[100010];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int array[100010] = {};
//テヲツ?堙ァツ崢エ
/*for(int i = 0; i < m-1; i++){
if(p[i] < p[i+1]){
for(int j = p[i]; j < p... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 0, 7, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 240 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const lli MAXN = 2002;
const lli INF = 1LL << 60;
lli N, A[MAXN];
lli dp[MAXN][MAXN];
int main() {
while (cin >> N) {
for (lli i = 0; i < N; ++i)
cin >> A[i];
memset(dp, -1, sizeof(dp));
for (lli i = 0; i < N; ++i) {
dp[N -... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const lli MAXN = 2002;
const lli INF = 1LL << 60;
lli N, A[MAXN];
lli dp[MAXN][MAXN];
int main() {
while (cin >> N) {
for (lli i = 0; i < N; ++i)
cin >> A[i];
memset(dp, -1, sizeof(dp));
for (lli i = 0; i < N; ++i) {
dp[N -... | [["+", 31, 69, 341, 342, 0, 16, 31, 23, 0, 24], ["+", 31, 69, 341, 342, 0, 16, 31, 23, 0, 25], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 109], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 418 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 2010
#define prev(x) ((x - 1 + N) % N)
#define next(x) ((x + 1) % N)
typedef long long ll;
ll N, A[MAX_N];
ll dp[MAX_N][MAX_N];
int solve(int L, int R, int P) {
if (L == R) {
return (P == 0 ? A[L] : 0);
}
if (dp[L][R] >= 0) {
return dp[L][R];... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 2010
#define prev(x) ((x - 1 + N) % N)
#define next(x) ((x + 1) % N)
typedef long long ll;
ll N, A[MAX_N];
ll dp[MAX_N][MAX_N];
ll solve(int L, int R, int P) {
if (L == R) {
return (P == 0 ? A[L] : 0);
}
if (dp[L][R] >= 0) {
return dp[L][R];
... | [["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 78]] | 1 | 324 | 2 |
#include <iostream>
using namespace std;
int n, a[2000];
long long int dp[2000][2000];
long long int ans = 0;
int main() {
// part1
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
// part2
for (int i = 0; i < n; i++)
dp[0][i] = a[i];
// part3
for (int i = 1; i < n; i++)
for (int j = 0; j... | #include <iostream>
using namespace std;
int n, a[2000];
long long int dp[2000][2000];
long long int ans = 0;
int main() {
// part1
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
// part2
for (int i = 0; i < n; i++)
dp[0][i] = a[i];
// part3
for (int i = 1; i < n; i++)
for (int j = 0; j... | [["+", 31, 69, 341, 342, 0, 16, 31, 23, 0, 24], ["+", 31, 69, 341, 342, 0, 16, 31, 23, 0, 25], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 109], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 319 | 4 |
#include <stdio.h>
#define INF 2001001001001001001
long long vec[100010][2];
long long P[100010];
int main(void) {
int n, q;
int i, j, k;
int in1, in2, x;
long long t, pos;
vec[0][0] = (-1) * INF;
vec[0][1] = 1;
scanf("%d%lld%d", &n, &t, &q);
for (i = 1; i <= n; i++) {
scanf("%d%d", &in1, &in2);
... | #include <stdio.h>
#define INF 2001001001001001001
long long vec[100010][2];
long long P[100010];
int main(void) {
int n, q;
int i, j, k;
long long in1;
int in2, x;
long long t, pos;
vec[0][0] = (-1) * INF;
vec[0][1] = 1;
scanf("%d%lld%d", &n, &t, &q);
for (i = 1; i <= n; i++) {
scanf("%lld%d",... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, ... | 0 | 450 | 10 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repp(i, n) rep(i, 0, n)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
signed main() {
int n, t, q;
cin >> n >> t >> q;
vector<int> a(n + 1), d(n + 1)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repp(i, n) rep(i, 0, n)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
signed main() {
int n, t, q;
cin >> n >> t >> q;
vector<int> a(n + 1), d(n + 1)... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 413 | 3 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 12, 13], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 12, 13]] | 1 | 474 | 2 |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
#define INF 1000000000
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
#define INF 1000000000000000
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 825 | 4 |
class Heap
require 'forwardable'
extend Forwardable
def initialize
@array = []
@index = {}
end
def add(obj, key)
@array << [obj, key]
@index[obj] = @array.size - 1
lift_up(@array.size - 1)
end
def swap(i, j)
u = @array[i]
v = @array[... | class Heap
require 'forwardable'
extend Forwardable
def initialize
@array = []
@index = {}
end
def add(obj, key)
@array << [obj, key]
@index[obj] = @array.size - 1
lift_up(@array.size - 1)
end
def swap(i, j)
u = @array[i]
v = @array[... | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 1,457 | 1 |
#include "bits/stdc++.h"
using namespace std;
int dp[1002][1002][16];
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
int H, W;
cin >> H >> W;
for (int i = 0; i < 1002; ++i)
for (int j = 0; j < 1002; ++j)
for (int k = 0; k < 16; ++k) {
dp[i][j][k] = 1e9;
}
... | #include "bits/stdc++.h"
using namespace std;
int dp[1002][1002][16];
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
int H, W;
cin >> H >> W;
for (int i = 0; i < 1002; ++i)
for (int j = 0; j < 1002; ++j)
for (int k = 0; k < 16; ++k) {
dp[i][j][k] = 1e9;
}
... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 51, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 51, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 1,036 | 4 |
#include <bits/stdc++.h>
using namespace std;
int N, M, K;
long long L, R, A[20001], dp[20001];
int main() {
scanf("%d %d %d", &N, &M, &K);
for (int i = 1; i <= N; i++) {
scanf("%lld", &A[i]);
dp[i] = 1e9;
L = R = A[i];
for (int j = 1; j <= M && i - j >= 0; j++) {
dp[i] = min(dp[i], dp[i - j... | #include <bits/stdc++.h>
using namespace std;
int N, M, K;
long long L, R, A[20001], dp[20001];
int main() {
scanf("%d %d %d", &N, &M, &K);
for (int i = 1; i <= N; i++) {
scanf("%lld", &A[i]);
dp[i] = (1LL << 60);
L = R = A[i];
for (int j = 1; j <= M && i - j >= 0; j++) {
dp[i] = min(dp[i], ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 31, 13], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 17, 151], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 23, 0, 25]] | 1 | 192 | 6 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 278 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int64 INF = 1LL << 58;
int main() {
int N, M, K, A[20000];
int64 dp[20001];
scanf("%d %d %d", &N, &M, &K);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
fill_n(dp, 20001, INF);
dp[0] = 0;
for (int i = 0; i < N; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int64 INF = 1LL << 58;
int main() {
int N, M, K, A[20000];
int64 dp[20001];
scanf("%d %d %d", &N, &M, &K);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
fill_n(dp, 20001, INF);
dp[0] = 0;
for (int i = 0; i < N; i++... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 239 | 2 |
#include <iostream>
#define INF 1e+18
#define int long long
using namespace std;
signed main() {
int n, m, k, a[20000];
int dp[20001][1001];
cin >> n >> m >> k;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= 1000; j++)
dp[i][j] = INF;
}
dp[0][0] = 0;
dp[0][1000] = 0;
for (int i = 0; i < ... | #include <iostream>
#define INF 1e+18
#define int long long
using namespace std;
signed main() {
int n, m, k, a[20000];
static int dp[20001][1001];
cin >> n >> m >> k;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= 1000; j++)
dp[i][j] = INF;
}
dp[0][0] = 0;
dp[0][1000] = 0;
for (int i = ... | [["+", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115]] | 1 | 304 | 1 |
//============================================================================
// Name : DPTest.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <io... | //============================================================================
// Name : DPTest.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <io... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 415 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstring>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
typedef long long ll;
#define MAX 20010
ll dp[MAX];
int N, M;
ll K, A[MAX];
void computer() {
r... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cstring>
#include <iostream>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
typedef long long ll;
#define MAX 20010
ll dp[MAX];
int N, M;
ll K, A[MAX];
void computer() {
r... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 283 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define inf 10e18
typedef long long ll;
int main(void) {
ll i, j, k, n, m;
scanf("%lld%lld%lld", &n, &m, &k);
ll a[n], **sum, dp[n];
sum = (ll **)malloc(sizeof(ll *) * (n + 10));
for (i = 0; i < n; ++i)
sum[i] = (ll *)malloc(sizeof(ll) * (m + 10));
for (i = 0; i <... | #include <stdio.h>
#include <stdlib.h>
#define inf 10e18
typedef long long ll;
int main(void) {
ll i, j, k, n, m;
scanf("%lld%lld%lld", &n, &m, &k);
ll a[n], **sum, dp[n];
sum = (ll **)malloc(sizeof(ll *) * (n + 10));
for (i = 0; i < n; ++i)
sum[i] = (ll *)malloc(sizeof(ll) * (m + 10));
for (i = 0; i <... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 453 | 2 |
#include <bits/stdc++.h>
using namespace std;
int N;
int L[50];
bool check(int x, int y) {
map<int, bool> visited;
queue<int> Q;
Q.push(0);
visited[0] = true;
while (!Q.empty()) {
int p = Q.front();
Q.pop();
if (p == N)
return true;
int sum = 0;
for (int to = p + 1; to <= N; to++) ... | #include <bits/stdc++.h>
using namespace std;
int N;
int L[50];
bool check(int x, int y) {
map<int, bool> visited;
queue<int> Q;
Q.push(0);
visited[0] = true;
while (!Q.empty()) {
int p = Q.front();
Q.pop();
if (p == N)
return true;
int sum = 0;
for (int to = p + 1; to <= N; to++) ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 262 | 2 |
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tu... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tu... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 770 | 6 |
#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;
using Point = complex<ld>;
int main() {
int N;
cin >> N;
int M;
cin >> M;
vector<int> nums(N);
for (int i = 0; i < N; ++i) {
cin >> nu... | #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;
using Point = complex<ld>;
int main() {
int N;
cin >> N;
int M;
cin >> M;
vector<int> nums(N);
for (int i = 0; i < N; ++i) {
cin >> nu... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 178 | 2 |
#include <bits/stdc++.h>
using ll = long long;
constexpr const ll INF = LLONG_MAX / 2;
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<ll, ll>> AB(N);
for (int i = 0; i < N; i++) {
cin >> AB[i].first >> AB[i].second;
}
sort(AB.begin(), AB.end());
vector<ll> S(N), D(N);
for (ll i = 0,... | #include <bits/stdc++.h>
using ll = long long;
constexpr const ll INF = LLONG_MAX / 2;
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<ll, ll>> AB(N);
for (int i = 0; i < N; i++) {
cin >> AB[i].first >> AB[i].second;
}
sort(AB.begin(), AB.end());
vector<ll> S(N), D(N);
for (ll i = 0,... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 28, 22], ["+", 0, 41, 64, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 41, 64, 69, 341, 342, 0, 16, 12, 13]] | 1 | 305 | 5 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int goal = sc.nextInt();
int day = 1;
int coin = 0;
while (coin < goal) {
coin += a;
if (day % 7 == 0)
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int goal = sc.nextInt();
int day = 1;
int coin = 0;
while (coin < goal) {
coin += a;
if (day % 7 == 0)
... | [["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 12, 499]] | 3 | 108 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 15, 339, 51, 16, 12, 91, 28, 23, 0, 24], ["+", 51, 16, 12, 91, 28, 23, 0, 16, 31, 22], ["+", 51, 16, 12, 91, 28, 23, 0, 16, 17, 109], ["+", 51, 16, 12, 91, 28, 23, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 91, 28, 23, 0... | 1 | 464 | 7 |
#include <stdio.h>
int n, a[10][10], now;
void go(int x, int y) {
a[x][y] = now;
now++;
if (x == n - 1) {
if (y == n - 1)
return;
if ((x + y) % 2 == 1) {
go(x, y + 1);
return;
}
}
if (y == n - 1) {
if ((x + y) % 2 == 0) {
go(x + 1, y);
return;
}
}
if (y ==... | #include <stdio.h>
int n, a[10][10], now;
void go(int x, int y) {
a[x][y] = now;
now++;
if (x == n - 1) {
if (y == n - 1)
return;
if ((x + y) % 2 == 1) {
go(x, y + 1);
return;
}
}
if (y == n - 1) {
if ((x + y) % 2 == 0) {
go(x + 1, y);
return;
}
}
if (y ==... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 330 | 1 |
#include <bits/stdc++.h>
using namespace std;
int A[10][10];
int main() {
int N, c = 1;
while (cin >> N, N) {
int x, y, id = 1;
N--;
for (int i = 0; i <= N * 2; ++i) {
if (i % 2 == 0) {
y = min(i, N);
x = i - y;
while (y >= 0 && x <= N) {
A[x][y] = id++;
... | #include <bits/stdc++.h>
using namespace std;
int A[10][10];
int main() {
int N, c = 1;
while (cin >> N, N) {
int x, y, id = 1;
N--;
for (int i = 0; i <= N * 2; ++i) {
if (i % 2 == 1) {
y = min(i, N);
x = i - y;
while (y >= 0 && x <= N) {
A[x][y] = id++;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 236 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int dy[] = {0, 1, 1, -1};
const int dx[] = {1, -1, 0, 1};
enum Situation {
RIGHT,
LEFTDOWN,
DOWN,
RIGHTUP,
};
int main() {
int n;
int cs = 0;
while (cin >> n && n != 0) {
cout << "Case " << cs... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int dy[] = {0, 1, 1, -1};
const int dx[] = {1, -1, 0, 1};
enum Situation {
RIGHT,
LEFTDOWN,
DOWN,
RIGHTUP,
};
int main() {
int n;
int cs = 1;
while (cin >> n && n != 0) {
cout << "Case " << cs... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 1,051 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const string mas[10][10] = {
/*気合い！！ n < 10 だし！*/
{" 1"},
{" 1 2", " 3 4"},
{" 1 2 6", " 3 5 7", " 4 8 9"},
{" 1 2 6 7", " 3 5 8 13", " 4 9 12 14", " 10 11 15 16"},
{" 1 2 6 7 15", " 3 5 ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const string mas[10][10] = {
/*気合い！！ n < 10 だし！*/
{" 1"},
{" 1 2", " 3 4"},
{" 1 2 6", " 3 5 7", " 4 8 9"},
{" 1 2 6 7", " 3 5 8 13", " 4 9 12 14", " 10 11 15 16"},
{" 1 2 6 7 15", " 3 5 ... | [["-", 49, 50, 51, 83, 0, 83, 0, 5, 0, 6], ["+", 49, 50, 51, 83, 0, 83, 0, 5, 0, 6]] | 1 | 291 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
bool out(int x, int y, int n) { return (x < 0 || x >= n || y < 0 || y >= n); }
int main() {
int n;
int cnt = 1;
while (cin >> n && n) {
vector<vector<int>> field(n, vector<int>(n, 0)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
bool out(int x, int y, int n) { return (x < 0 || x >= n || y < 0 || y >= n); }
int main() {
int n;
int cnt = 1;
while (cin >> n && n) {
vector<vector<int>> field(n, vector<int>(n, 0)... | [["+", 0, 16, 31, 16, 31, 16, 12, 27, 17, 29]] | 1 | 352 | 1 |
class Map
def initialize(x,y,number,move)
@x = x
@y = y
@move = move
@number = number
end
attr_accessor :x,:y,:move,:number
def +(map)
x = self.x + map.x
y = self.y + map.y
m = self.move
n = self.number + 1
tmp = Map.new(x,y,n,m)
end
end
@b = []
@b << Map.new(1,0, 1,0) #sit... | class Map
def initialize(x,y,number,move)
@x = x
@y = y
@move = move
@number = number
end
attr_accessor :x,:y,:move,:number
def +(map)
x = self.x + map.x
y = self.y + map.y
m = self.move
n = self.number + 1
tmp = Map.new(x,y,n,m)
end
end
@b = []
@b << Map.new(1,0, 1,0) #sit... | [["-", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 738, 31, 557, 0, 6]] | 4 | 473 | 2 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) throws IOException {
... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) throws IOException {
... | [["-", 0, 52, 8, 196, 0, 503, 49, 200, 51, 146], ["+", 0, 52, 8, 196, 0, 503, 49, 200, 51, 147]] | 3 | 549 | 2 |
/* template.cpp [[[ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) \
get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, r... | /* template.cpp [[[ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) \
get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, r... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 44]] | 1 | 416 | 1 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> M;
int main() {
int n;
while (cin >> n, n) {
int ans = -1;
for (int i = 0, a; i < n; i++) {
cin >> a;
M[a]++;
if (M[a] > n / 2)
ans = a;
}
if (ans == -1)
cout << "NO COLOR" << endl;
else
cout << a... | #include <bits/stdc++.h>
using namespace std;
map<int, int> M;
int main() {
int n;
while (cin >> n, n) {
int ans = -1;
M.clear();
for (int i = 0, a; i < n; i++) {
cin >> a;
M[a]++;
if (M[a] > n / 2)
ans = a;
}
if (ans == -1)
cout << "NO COLOR" << endl;
else
... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 105 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int A[1000000];
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A, A + n);
int cnt;
int maxi = -1;
int maxA;
for (int i = 0; i < n;) {
i... | #include <algorithm>
#include <iostream>
using namespace std;
int A[1000000];
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A, A + n);
int cnt;
int maxi = -1;
int maxA;
for (int i = 0; i < n;) {
i... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 176 | 2 |
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int tmp;
int n;
while (cin >> n && n != 0) {
map<int, int> s;
int maxNum;
int maxCnt = 0;
// fill(s.begin(),s.end(),0);
for (int i = 0; i < n; i++) {
cin >> tmp;
s[tmp]++;
... | #include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int tmp;
int n;
while (cin >> n && n != 0) {
map<int, int> s;
int maxNum;
int maxCnt = 0;
// fill(s.begin(),s.end(),0);
for (int i = 0; i < n; i++) {
cin >> tmp;
s[tmp]++;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 134 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
while (s... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 25]] | 1 | 161 | 4 |
while True:
num=int(input())
if num==0:
break
stars=sorted(input().split())
print(stars)
if stars.count(stars[num//2]) > num/2 :
print(stars[num//2])
else:
print("NO COLOR") | while True:
num=int(input())
if num==0:
break
stars=sorted(input().split())
if stars.count(stars[num//2]) > num/2 :
print(stars[num//2])
else:
print("NO COLOR") | [["-", 0, 52, 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 | 67 | 4 |
#include <stdio.h>
int gcd(int a, int b) {
if (b == 0)
return 0;
return gcd(b, a % b);
}
int main(void) {
int a, b;
while (scanf("%d %d", &a, &b) != EOF) {
printf("%d\n", gcd(a, b));
}
return 0;
} | #include <stdio.h>
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main(void) {
int a, b;
while (scanf("%d %d", &a, &b) != EOF) {
printf("%d\n", gcd(a, b));
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22]] | 0 | 81 | 2 |
#include <stdio.h>
long gcd(long a, long b) {
if (a % b == 0) {
return b;
}
gcd(b, a % b);
}
int main(void) {
long a, b, c, g;
while (scanf("%ld %ld", &a, &b) != EOF) {
if (a < b) {
c = a;
a = b;
b = c;
}
g = gcd(a, b);
printf("%ld", g);
}
return 0;
} | #include <stdio.h>
long gcd(long a, long b) {
if (a % b == 0) {
return b;
}
gcd(b, a % b);
}
int main(void) {
long a, b, c, g;
while (scanf("%ld %ld", &a, &b) != EOF) {
if (a < b) {
c = a;
a = b;
b = c;
}
g = gcd(a, b);
printf("%ld\n", g);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 111 | 1 |
#include <stdio.h>
main() {
int a, b;
int i, temp;
while (1) {
if (scanf("%d %d", &a, &b) == EOF)
break;
if (a >= b) {
for (i = 2; i <= b; i++) {
if (a % i == 0 && b % i == 0)
temp = i;
}
printf("%d\n", temp);
} else {
for (i = 2; i <= a; i++) {
... | #include <stdio.h>
main() {
int a, b;
int i, temp;
while (1) {
if (scanf("%d %d", &a, &b) == EOF)
break;
if (a >= b) {
for (i = 1; i <= b; i++) {
if (a % i == 0 && b % i == 0)
temp = i;
}
printf("%d\n", temp);
} else {
for (i = 1; i <= a; i++) {
... | [["-", 0, 57, 64, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 10, 11, 12, 13], ["-", 75, 76, 0, 9, 0, 7, 10, 11, 12, 13], ["+", 75, 76, 0, 9, 0, 7, 10, 11, 12, 13]] | 0 | 143 | 4 |
#include <stdio.h>
#include <string.h>
long int gcd(long int a, long int b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
long long a, b;
while (scanf("%lld %lld", &a, &b) != EOF) {
long long x = gcd(a, b);
printf("%d", x);
}
return 0;
} | #include <stdio.h>
#include <string.h>
long int gcd(long int a, long int b) { return (b == 0 ? a : gcd(b, a % b)); }
int main() {
long long a, b;
while (scanf("%lld %lld", &a, &b) != EOF) {
long long x = gcd(a, b);
printf("%d\n", x);
}
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 90 | 1 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int pgcd(int a, int b) { return b == 0 ? a : pgcd(b % a, a); }
int main() {
int a, b;
while (cin >> a >> b) {
cout << pgcd(a, b) << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int pgcd(int a, int b) { return a == 0 ? b : pgcd(b % a, a); }
int main() {
int a, b;
while (cin >> a >> b) {
cout << pgcd(a, b) << endl;
}
return 0;
} | [["-", 8, 9, 0, 37, 0, 41, 15, 16, 31, 22], ["+", 8, 9, 0, 37, 0, 41, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 37, 0, 41, 64, 22], ["+", 0, 14, 8, 9, 0, 37, 0, 41, 64, 22]] | 1 | 76 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << __gcd(a, b) << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int a, b;
while (cin >> a >> b)
cout << __gcd(a, b) << endl;
} | [["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25]] | 1 | 37 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) ... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 22]] | 1 | 708 | 4 |
#include <algorithm>
#include <climits>
#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 REP(i, n) for (int i = 0; i < (int)n; ... | #include <algorithm>
#include <climits>
#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 REP(i, n) for (int i = 0; i < (int)n; ... | [["-", 0, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 16, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22]] | 1 | 861 | 6 |
// 34
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
for (int s, dd; cin >> s >> dd, s | dd;) {
int d[100][100];
fill(d[0], d[100], 1 << 30);
for (int i = 0; i < s; i++) {
for (int j = 0; j < s; j++) {
d[i + dd][j + dd] = 0;
}
}
for (int j = 0; j <... | // 34
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
for (int s, dd; cin >> s >> dd, s | dd;) {
int d[100][100];
fill(d[0], d[100], 1 << 30);
for (int i = 0; i < s; i++) {
for (int j = 0; j < s; j++) {
d[i + dd][j + dd] = 0;
}
}
for (int j = 0; j <... | [["-", 0, 11, 12, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 11, 31, 69, 341, 342, 0, 22]] | 1 | 427 | 2 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 1 << 27;
const int MAX = 51;
int dis_d[MAX][MAX], in, s, d, G[MAX];
int min_d[MAX];
bool used[MAX];
int prim() {
for (int i = 0; i < d; i++) {
min_d[i] = INF;
used[i] = false;
}
min_d[0] = 0;
int res = 0;
... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 1 << 27;
const int MAX = 51;
int dis_d[MAX][MAX], in, s, d, G[MAX];
int min_d[MAX];
bool used[MAX];
int prim() {
for (int i = 0; i < d; i++) {
min_d[i] = INF;
used[i] = false;
}
min_d[0] = 0;
int res = 0;
... | [["+", 0, 52, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 440 | 5 |
while(1):
s,d=[int(x) for x in input().split()]
A=[999 for x in range(d)]
if s==0: break
for j in range(s):
l=[int(x) for x in input().split()]
for i in range(d):
if l[i]!=0:
A[i]=min(A[i], l[i])
B=[[999 for x in range(d)] for y in range(d)]
for j ... | while(1):
s,d=[int(x) for x in input().split()]
A=[999 for x in range(d)]
if s==0: break
for j in range(s):
l=[int(x) for x in input().split()]
for i in range(d):
if l[i]!=0:
A[i]=min(A[i], l[i])
B=[[999 for x in range(d)] for y in range(d)]
for j ... | [["-", 0, 1, 0, 662, 31, 206, 51, 206, 206, 22], ["+", 0, 1, 0, 662, 31, 206, 51, 206, 206, 22], ["-", 64, 196, 0, 1, 0, 662, 31, 206, 206, 22], ["+", 64, 196, 0, 1, 0, 662, 31, 206, 206, 22]] | 5 | 293 | 4 |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
// Dominating Set
public class Main {
int n, m, res, INF = 1 << 29;
List<Integer>[] adj;
int[] cover;
boolean[] special;
void f(int k, int num) {
if (res <= num)
return;
if (k == n) {
boolean ok = true;
f... | import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
// Dominating Set
public class Main {
int n, m, res, INF = 1 << 29;
List<Integer>[] adj;
int[] cover;
boolean[] special;
void f(int k, int num) {
if (res <= num)
return;
if (k == n) {
boolean ok = true;
f... | [["+", 0, 514, 8, 57, 15, 15, 0, 16, 17, 98], ["+", 8, 57, 15, 15, 0, 16, 12, 91, 17, 111], ["+", 15, 15, 0, 16, 12, 91, 439, 504, 516, 22], ["+", 15, 15, 0, 16, 12, 91, 439, 504, 0, 70], ["+", 15, 15, 0, 16, 12, 91, 439, 504, 71, 22], ["+", 15, 15, 0, 16, 12, 91, 439, 504, 0, 73]] | 3 | 691 | 6 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef ve... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef ve... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 345 | 4 |
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
constexpr int MAX_N = 30;
int ans;
int n, m;
int cover[30];
int can[30];
int used;
int ok;
vector<vector<int>> edges;
void dfs(int idx, int sum) {
if (sum >= ans)
return;
if (used == ok) {
... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
constexpr int MAX_N = 30;
int ans;
int n, m;
int cover[30];
int can[30];
int used;
int ok;
vector<vector<int>> edges;
void dfs(int idx, int sum) {
if (sum >= ans)
return;
if (used == ok) {
... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+"... | 1 | 502 | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int V, d;
while (cin >> V >> d) {
vector<int> fib_mod(V);
fib_mod[0] = 2;
fib_mod[1] = 3;
for (int i = 2; i < V; i++) {
fib_mod[i] = fib_mod[i - 1] + fib_mod[i - 2];
fib_mod[i] %= 1001;
}
sort(fib_mod.begin(), fib_mod.en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int V, d;
while (cin >> V >> d) {
vector<int> fib_mod(V);
fib_mod[0] = 2;
fib_mod[1] = 3;
for (int i = 2; i < V; i++) {
fib_mod[i] = fib_mod[i - 1] + fib_mod[i - 2];
fib_mod[i] %= 1001;
}
sort(fib_mod.begin(), fib_mod.en... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 156 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r), end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((... | #include <bits/stdc++.h>
using namespace std;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r), end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout << #x << ": " << x << endl
#define fcout(n) cout << fixed << setprecision((... | [["-", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 31, 22], ["-", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 11, 12, ... | 1 | 583 | 8 |
#include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n, d, array[1005], count;
while (scanf("%d %d", &n, &d) != EOF) {
array[0] = 2;
array[1] = 3;
for (int i = 2; i < n; i++) {
array[i] = (array[i - 1] + array[i - 2]) % 1001;
}
std::sort(ar... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n, d, array[1005], count;
while (scanf("%d %d", &n, &d) != EOF) {
array[0] = 2;
array[1] = 3;
for (int i = 2; i < n; i++) {
array[i] = (array[i - 1] + array[i - 2]) % 1001;
}
std::sort(ar... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 168 | 2 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 0, 9, 0, 57, 64, 9, 0, 93, 0, 94]] | 1 | 537 | 4 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 557 | 7 |
// 1016.cpp
//
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
class UnionFind {
public:
int par[MAX_N]; // 親
int rank[MAX_N]; // 木の深さ
// n要素で初期化
UnionFind(int n) {
for (int i = 0; i < n; ++i) {
par[i] = i;
rank[i] = 0;
}
}
// 木の根を求める
int find(int x) {
if... | // 1016.cpp
//
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000;
class UnionFind {
public:
int par[MAX_N]; // 親
int rank[MAX_N]; // 木の深さ
// n要素で初期化
UnionFind(int n) {
for (int i = 0; i < n; ++i) {
par[i] = i;
rank[i] = 0;
}
}
// 木の根を求める
int find(int x) {
if... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 420 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#define N_F 1010
#define N_CONST 1001
using namespace std;
int v, d, f1, f2;
unsigned long long int f[N_F];
int node[N_CONST + 10][N_CONST + 10];
void rmNode(int i) {
// cout << " remove : "<<i<<endl;
node[i][i] = 0;
for (int j = 0; j < N_CONST; j++... | #include <algorithm>
#include <cstring>
#include <iostream>
#define N_F 1010
#define N_CONST 1001
using namespace std;
int v, d, f1, f2;
unsigned long long int f[N_F];
int node[N_CONST + 10][N_CONST + 10];
void rmNode(int i) {
// cout << " remove : "<<i<<endl;
node[i][i] = 0;
for (int j = 0; j < N_CONST; j++... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 109], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 351 | 4 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | #define _USE_MATH_DEFINES
#define INF 100000000
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
using... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 336 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1001;
int main() {
int V, d;
while (cin >> V >> d) {
int p1 = 1, p2 = 1;
vector<int> fib(V);
for (int i = 0; i < V; ++i) {
fib[i] = p1 + p2;
p2 = p1;
p1 = fib[i];
}
sort(fib.begin(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1001;
int main() {
int V, d;
while (cin >> V >> d) {
int p1 = 1, p2 = 1;
vector<int> fib(V);
for (int i = 0; i < V; ++i) {
fib[i] = (p1 + p2) % MOD;
p2 = p1;
p1 = fib[i];
}
sort(fi... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 109], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 157 | 4 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#define N 1001
using namespace std;
vector<int> par;
void init(int);
int root(int);
void uni(int, int);
bool same(int, int);
int main() {
int V, d;
while (cin >> V >> d) {
init(V);
vector<int> f(V);
int temp1, temp2;
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#define N 1001
using namespace std;
vector<int> par;
void init(int);
int root(int);
void uni(int, int);
bool same(int, int);
int main() {
int V, d;
while (cin >> V >> d) {
init(V);
vector<int> f(V);
int temp1, temp2;
... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 17, 109], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 402 | 4 |
N = 1001
def init_fib
fib = Array.new(1002)
fib[0] = 1
fib[1] = 2
2.upto(N) do |i|
fib[i] = (fib[i-1] + fib[i-2]) % N
end
fib
end
def root(tree, i)
if tree[i] == i
i
else
root(tree, tree[i])
end
end
if __FILE__ == $0
fib = init_fib
STDIN.each_line do |input|
count = 0
v, d =... | N = 1001
def init_fib
fib = Array.new(1002)
fib[0] = 1
fib[1] = 2
2.upto(N) do |i|
fib[i] = (fib[i-1] + fib[i-2]) % N
end
fib
end
def root(tree, i)
if tree[i] == i
i
else
root(tree, tree[i])
end
end
if __FILE__ == $0
fib = init_fib
STDIN.each_line do |input|
count = 0
v, d =... | [["+", 0, 751, 8, 662, 31, 742, 0, 652, 735, 22], ["+", 8, 662, 31, 742, 0, 652, 3, 4, 0, 24], ["+", 8, 662, 31, 742, 0, 652, 3, 4, 0, 22], ["+", 8, 662, 31, 742, 0, 652, 3, 4, 0, 21], ["+", 8, 662, 31, 742, 0, 652, 3, 4, 0, 25]] | 4 | 226 | 5 |
while 1:
try:
v,d=map(int,input().split())
f=[0]*(v+1)
f[0],f[1]=1,2
for i in range(2,v+1):
f[i]=f[i-1]+f[i-2]
f.sort()
c=1
for i in range(2,v+1):
if f[i]-f[i-1]>=d: c+=1
print(c)
except:break | while 1:
try:
v,d=map(int,input().split())
f=[0]*(v+1)
f[0],f[1]=1,2
for i in range(2,v+1):
f[i]=(f[i-1]+f[i-2])%1001
f.sort()
c=1
for i in range(2,v+1):
if f[i]-f[i-1]>=d: c+=1
print(c)
except:break | [["+", 0, 1, 0, 662, 12, 657, 31, 23, 0, 24], ["+", 0, 1, 0, 662, 12, 657, 31, 23, 0, 25], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 109], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 120 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.