buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int hand[5], result[5];
int rock, scissors, paper, win;
while (cin >> hand[0], hand[0]) {
cin >> hand[1] >> hand[2] >> hand[3] >> hand[4];
rock = scissors = paper = 0;
for (int i = 0; i < 5; ++i) {
switch (hand[i]) {
case 1:
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int hand[5], result[5];
int rock, scissors, paper, win;
while (cin >> hand[0], hand[0]) {
cin >> hand[1] >> hand[2] >> hand[3] >> hand[4];
rock = scissors = paper = 0;
for (int i = 0; i < 5; ++i) {
switch (hand[i]) {
case 1:
... | [["-", 75, 76, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 277 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (1) {
int a, b, c, d, e;
cin >> a;
if (a == 0)
break;
cin >> b >> c >> d >> e;
if (a == b == c == d == e) {
cout << "3\n3\n3\n3\n3\n";
continue;
}
vector<... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
while (1) {
int a, b, c, d, e;
cin >> a;
if (a == 0)
break;
cin >> b >> c >> d >> e;
if (a == b && b == c && c == d && d == e) {
cout << "3\n3\n3\n3\n3\n";
continue;
... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 98], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 31, 22], ["+", 51, 16, 31, 16, 31, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 394 | 6 |
#include <iostream>
using namespace std;
int main() {
int a[5], i, flg, j;
while (1) {
int g = 0, t = 0, p = 0;
int mflg, kflg;
int aaflg;
flg = 0;
for (i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] == 0)
break;
if (a[i] == 1)
g = 1;
else if (a[i] == 2)
... | #include <iostream>
using namespace std;
int main() {
int a[5], i, flg, j;
while (1) {
int g = 0, t = 0, p = 0;
int mflg, kflg;
int aaflg;
flg = 0;
for (i = 0; i < 5; i++) {
cin >> a[i];
if (a[i] == 0)
break;
if (a[i] == 1)
g = 1;
else if (a[i] == 2)
... | [["-", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 13]] | 1 | 341 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#def... | [["-", 15, 339, 51, 16, 12, 69, 341, 342, 0, 13], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 13]] | 1 | 384 | 2 |
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int arr[5];
int arr_2[5];
int main() {
i... | #include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int arr[5];
int arr_2[5];
int main() {
i... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46]] | 1 | 454 | 3 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, init, n) for (int i = init; i < (n); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct { int to, cost; };
const int MOD = 1e9 + 7;
const int iINF = 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, init, n) for (int i = init; i < (n); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct { int to, cost; };
const int MOD = 1e9 + 7;
const int iINF = 1... | [["+", 0, 1, 0, 16, 31, 16, 31, 2, 63, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 25]] | 1 | 367 | 6 |
#include <iostream>
using namespace std;
int main() {
int h[5], cnt[3];
while (cin >> h[0], h[0] != 0) {
for (int i = 1; i < 5; i++)
cin >> h[i];
cnt[1] = 0;
cnt[2] = 0;
cnt[3] = 0;
for (int i = 0; i < 5; i++)
cnt[h[i]]++;
for (int i = 0; i < 5; i++) {
if (cnt[1] == 5 ... | #include <iostream>
using namespace std;
int main() {
int h[5], cnt[4];
while (cin >> h[0], h[0] != 0) {
for (int i = 1; i < 5; i++)
cin >> h[i];
cnt[1] = 0;
cnt[2] = 0;
cnt[3] = 0;
for (int i = 0; i < 5; i++)
cnt[h[i]]++;
for (int i = 0; i < 5; i++) {
if (cnt[1] == 5 ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 312 | 2 |
#include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
double dat[100][100];
int dp[1000001]; //動的計画法
int prime[1000001];
int main() {
int hand[5];
int... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
double dat[100][100];
int dp[1000001]; //動的計画法
int prime[1000001];
int main() {
int hand[5];
int... | [["-", 75, 76, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 75, 76, 0, 1, 0, 11, 31, 69, 28, 22]] | 1 | 442 | 4 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() ... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 31, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 151], ["+", 0, 43, 49, 50, 51, 16, 12, 69, 28, 22], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 73]] | 1 | 306 | 5 |
#include <iostream>
#define G 1
#define C 2
#define P 3
#define N 5
using namespace std;
int a[N];
void calc() {
int g, c, p;
g = 0;
c = 0;
p = 0;
for (int i = 0; i < N; i++) {
if (a[i] == G)
g = 1;
if (a[i] == C)
c = 1;
if (a[i] == P)
p = 1;
}
for (int i = 0; i < N; i+... | #include <iostream>
#define G 1
#define C 2
#define P 3
#define N 5
using namespace std;
int a[N];
void calc() {
int g, c, p;
g = 0;
c = 0;
p = 0;
for (int i = 0; i < N; i++) {
if (a[i] == G)
g = 1;
if (a[i] == C)
c = 1;
if (a[i] == P)
p = 1;
}
for (int i = 0; i < N; i+... | [["-", 64, 9, 0, 1, 0, 16, 31, 16, 12, 13], ["+", 64, 9, 0, 1, 0, 16, 31, 16, 12, 13]] | 1 | 478 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {... | [["-", 0, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 293 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25], ["-", 31, 16, 12, 23, 0, 41, 15, 16, 12, 13], ["+", 31, 16, 12, 23, 0, 41, 15, 16, 12, 13], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 350 | 6 |
#include <cstdio>
#include <vector>
using namespace std;
vector<int> hand;
int main() {
int self;
while (1) {
hand.clear();
scanf("%d", &self);
if (self == 0) {
break;
}
hand.push_back(self);
for (int i = 1; i < 5; i++) {
scanf("%d", &self);
hand.push_back(self);
}
... | #include <cstdio>
#include <vector>
using namespace std;
vector<int> hand;
int main() {
int self;
while (1) {
hand.clear();
scanf("%d", &self);
if (self == 0) {
break;
}
hand.push_back(self);
for (int i = 1; i < 5; i++) {
scanf("%d", &self);
hand.push_back(self);
}
... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]] | 1 | 448 | 2 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
bool flag[4];
int hand[5];
int ans[5];
void solve() {
for (int i = 0; i < 5; i++) {
if (hand[i] == 1)
flag[1] = true; //O[
if (hand[i] == 2)
flag[2] = true; //`L
if (hand[i] == 3)
flag[3] = true; //p[... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
bool flag[4];
int hand[5];
int ans[5];
void solve() {
for (int i = 0; i < 5; i++) {
if (hand[i] == 1)
flag[1] = true; //O[
if (hand[i] == 2)
flag[2] = true; //`L
if (hand[i] == 3)
flag[3] = true; //p[... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22]] | 1 | 394 | 4 |
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, hand[3] = {0};
cin >> n;
if (n == 0)
break;
hand[n - 1] = 1;
for (int i = 1; i < 5; i++) {
int h;
cin >> h;
hand[h - 1] = 1 << i;
}
for (int i = 0; i < 5; i++) {
int h = 0;
while (... | #include <iostream>
using namespace std;
int main() {
while (1) {
int n, hand[3] = {0};
cin >> n;
if (n == 0)
break;
hand[n - 1] = 1;
for (int i = 1; i < 5; i++) {
int h;
cin >> h;
hand[h - 1] |= 1 << i;
}
for (int i = 0; i < 5; i++) {
int h = 0;
while ... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 160]] | 1 | 183 | 2 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int n[5];
int c1 = 0, c2 = 0, c3 = 0;
cin >> n[0];
if (n[0] == 0)
break;
for (int i = 1; i < 5; i++)
cin >> n[i];
for (int i = 0; i < 4; i++) {
if (n[i] != n[i + 1])
break;
if (i == 3) {
... | #include <iostream>
using namespace std;
int main() {
while (true) {
int n[5];
int c1 = 0, c2 = 0, c3 = 0;
cin >> n[0];
if (n[0] == 0)
break;
for (int i = 1; i < 5; i++)
cin >> n[i];
for (int i = 0; i < 4; i++) {
if (n[i] != n[i + 1])
break;
if (i == 3) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 412 | 2 |
#include <iostream>
using namespace std;
int main() {
int st[5], res[5];
int g[3], n = 0;
int val = 0;
while (1) {
for (int i = 0; i < 3; i++)
g[i] = 0;
n = 0;
val = 0; // val -> winner
// Input
for (int i = 0; i < 5; i++) {
cin >> st[i];
if (st[i] == 0)
break;... | #include <iostream>
using namespace std;
int main() {
int st[5], res[5];
int g[3], n = 0;
int val = 0;
while (1) {
for (int i = 0; i < 3; i++)
g[i] = 0;
n = 0;
val = 0; // val -> winner
// Input
for (int i = 0; i < 5; i++) {
cin >> st[i];
if (st[i] == 0)
break;... | [["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 109], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 25]] | 1 | 278 | 4 |
#include <iostream>
using namespace std;
int array[5];
int ret[4];
void p(int a, int b, int c) {
for (int i = 0; i < 5; i++) {
if (array[i] == a)
cout << 1 << endl;
else if (array[i] == b)
cout << 2 << endl;
else
cout << 3 << endl;
}
}
int main() {
while (cin >> array[0], array[0])... | #include <iostream>
using namespace std;
int array[5];
int ret[4];
void p(int a, int b, int c) {
for (int i = 0; i < 5; i++) {
if (array[i] == a)
cout << 1 << endl;
else if (array[i] == b)
cout << 2 << endl;
else
cout << 3 << endl;
}
}
int main() {
while (cin >> array[0], array[0])... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 278 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int j[5];
bool R, S, P;
while (cin >> j[0], j[0]) {
for (int i = 1; i < 5; i++) {
cin >> j[i];
}
R = S = P = false;
for (int i = 0; i < 5; i++) {
if (j[i] == 1)
R = true;
if (j[i] == 2)
S = true;
... | #include <iostream>
using namespace std;
int main(void) {
int j[5];
bool R, S, P;
while (cin >> j[0], j[0]) {
for (int i = 1; i < 5; i++) {
cin >> j[i];
}
R = S = P = false;
for (int i = 0; i < 5; i++) {
if (j[i] == 1)
R = true;
if (j[i] == 2)
S = true;
... | [["-", 8, 9, 0, 99, 8, 9, 0, 100, 51, 13], ["+", 8, 9, 0, 99, 8, 9, 0, 100, 51, 13]] | 1 | 404 | 2 |
#include <stdio.h>
int main(void) {
int t[5] = {0}, i, R, P, S;
while (0 == 0) {
R = P = S = 0;
scanf("%d", &t[0]);
if (t[0] == 0)
break;
else if (t[0] == 1)
R++;
else if (t[0] == 2)
S++;
else
P++;
for (i = 1; i < 5; i++) {
scanf("%d", &t[i]);
if... | #include <stdio.h>
int main(void) {
int t[5] = {0}, i, R, P, S;
while (0 == 0) {
R = P = S = 0;
scanf("%d", &t[0]);
if (t[0] == 0)
break;
else if (t[0] == 1)
R++;
else if (t[0] == 2)
S++;
else
P++;
for (i = 1; i < 5; i++) {
scanf("%d", &t[i]);
if... | [["-", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95]] | 1 | 405 | 3 |
puts readlines[0..-2].map(&:to_i).each_slice(5).map{|a|b=a.uniq.sort;b==[1,2]?a:b==[1,3]?a.map{|i|i==3?1:2}:a==[2,3]?a.map{|i|i==2?1:2}:[3]*5} | puts readlines[0..-2].map(&:to_i).each_slice(5).map{|a|b=a.uniq.sort;b==[1,2]?a:b==[1,3]?a.map{|i|i==3?1:2}:b==[2,3]?a.map{|i|i==2?1:2}:[3]*5} | [["-", 0, 754, 75, 754, 75, 754, 15, 738, 31, 22], ["+", 0, 754, 75, 754, 75, 754, 15, 738, 31, 22]] | 4 | 97 | 2 |
St = Win = 1
Sc = Lose = 2
Pa = Draw = 3
def getWinHand hand
st = hand.include? St
sc = hand.include? Sc
pa = hand.include? Pa
if (st && sc && pa) || (st && !sc && !pa) || (!st && sc && !pa) || (!st && !sc && pa)
Draw
elsif st && pa
Pa
elsif st && sc
St
elsif sc && pa
Sc
end
end
def g... | St = Win = 1
Sc = Lose = 2
Pa = Draw = 3
NoWin = -1
def getWinHand hand
st = hand.include? St
sc = hand.include? Sc
pa = hand.include? Pa
if (st && sc && pa) || (st && !sc && !pa) || (!st && sc && !pa) || (!st && !sc && pa)
NoWin
elsif st && pa
Pa
elsif st && sc
St
elsif sc && pa
Sc
en... | [["+", 36, 36, 36, 36, 0, 493, 0, 662, 31, 743], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 0, 32], ["+", 36, 36, 0, 493, 0, 662, 12, 748, 17, 33], ["+", 36, 36, 0, 493, 0, 662, 12, 748, 439, 612], ["-", 0, 735, 8, 736, 0, 121, 64, 749, 0, 743], ["+", 0, 735, 8, 736, 0, 121, 64, 749, 0, 743], ["-", 0, 735, 8, 736, 0, 121, 1... | 4 | 168 | 8 |
while True:
h = int(input())
if h == 0:
break
dataset = [h] + [int(input()) for _ in range(4)]
if len(set(dataset)) == 3 or len(set(dataset)) == 1:
print(*[3]*5, sep="\n")
for data in dataset:
if data == 1:
print(2 if 3 in dataset else 1)
elif data == 2:
... | while True:
h = int(input())
if h == 0:
break
dataset = [h] + [int(input()) for _ in range(4)]
if len(set(dataset)) == 3 or len(set(dataset)) == 1:
print(*[3]*5, sep="\n")
continue
for data in dataset:
if data == 1:
print(2 if 3 in dataset else 1)
... | [["+", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117]] | 5 | 121 | 1 |
# -*- coding: utf-8 -*-
#import pdb; pdb.set_trace()
import sys
def solv(v):
w = set(v)
if len(w)==1 or len(w)==3:
d={1:2, 2:2, 3:2}
elif 1 in w and 2 in w:
d={1:1, 2:2}
elif 2 in w and 3 in w:
d={2:1, 3:2}
else:
d={3:1, 1:2}
return(list(map(lambda x:d[x], v) ... | # -*- coding: utf-8 -*-
#import pdb; pdb.set_trace()
import sys
def solv(v):
w = set(v)
if len(w)==1 or len(w)==3:
d={1:3, 2:3, 3:3}
elif 1 in w and 2 in w:
d={1:1, 2:2}
elif 2 in w and 3 in w:
d={2:1, 3:2}
else:
d={3:1, 1:2}
return(list(map(lambda x:d[x], v) ... | [["-", 0, 1, 0, 662, 12, 680, 0, 569, 51, 612], ["+", 0, 1, 0, 662, 12, 680, 0, 569, 51, 612]] | 5 | 224 | 6 |
def judge(h, hset):
rest = hset - {h}
if len(rest) in (0, 2):
return 3
if (h + 1) % 3 in rest:
return 1
else:
return 2
while True:
h1 = int(input())
if h1 == 0:
break
hlst = []
hset = set()
hlst.append(h1)
hset.add(h1)
for _ in range(4):
h = int(input())
hlst.append(h)
... | def judge(h, hset):
rest = hset - {h}
if len(rest) in (0, 2):
return 3
if h % 3 + 1 in rest:
return 1
else:
return 2
while True:
h1 = int(input())
if h1 == 0:
break
hlst = []
hset = set()
hlst.append(h1)
hset.add(h1)
for _ in range(4):
h = int(input())
hlst.append(h)
h... | [["-", 0, 57, 15, 666, 0, 657, 31, 23, 0, 24], ["-", 15, 666, 0, 657, 31, 23, 0, 657, 17, 72], ["-", 15, 666, 0, 657, 31, 23, 0, 657, 12, 612], ["-", 0, 57, 15, 666, 0, 657, 31, 23, 0, 25], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 17, 72], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 12, 612]] | 5 | 126 | 6 |
while True:
try:
h=[eval(input()) for i in [1]*5]
if (1 in h and 2 in h and 3) in h or max(h.count(1),h.count(2),h.count(3))==5:
for i in h:
print(3)
elif 1 in h:
if 2 in h:
for i in h:
print(1 if i==1 else 2)
else:
for i in h:
print(1 if i==3 else 2)
elif 2 in h:
for i in h:
... | while True:
try:
h=[eval(input()) for i in [1]*5]
if (1 in h and 2 in h and 3) in h or max(h.count(1),h.count(2),h.count(3))==5:
for i in h:print(3)
elif 1 in h:
if 2 in h:
for i in h:print(1 if i==1 else 2)
else:
for i in h:print(1 if i==3 else 2)
elif 2 in h:
for i in h:print(1 if i==2 el... | [["-", 0, 1, 0, 652, 3, 4, 0, 41, 0, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 41, 0, 612]] | 5 | 138 | 2 |
while True:
try:
h=[eval(input()) for i in [1]*5]
if 1 and 2 in h:w=1
elif 1 and 3 in h:w=3
else:w=2
if len(set(h))!=2:
for i in h:print(3)
else:
for i in h:print(1 if i==w else 2)
except:break | while True:
try:
h=[eval(input()) for i in [1]*5]
if 1 in h and 2 in h:w=1
elif 1 in h:w=3
else:w=2
if len(set( h))!=2:
for i in h:print(3)
else:
for i in h:print(1 if i==w else 2)
except:break | [["+", 8, 196, 0, 57, 15, 679, 31, 666, 667, 267], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 22], ["-", 8, 196, 0, 57, 75, 665, 15, 679, 17, 355], ["-", 0, 57, 75, 665, 15, 679, 12, 666, 0, 612]] | 5 | 88 | 4 |
import static java.lang.System.*;
import java.util.*;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
boolean F = false;
int saving = 0;
int[] a = new int[1... | import static java.lang.System.*;
import java.util.*;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
boolean F = false;
int saving = 0;
int[] a = new int[1... | [["+", 8, 196, 0, 57, 15, 15, 0, 91, 17, 111]] | 3 | 200 | 1 |
import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
String r;
for (int m, t; (m = s.nextInt()) > 0; System.out.println(r))
for (r = "NA", t = 12; t-- > 0;)
if ((m -= s.nextInt() - s.nextInt()) <= 0 && r == "NA")
r = "" + t;
}... | import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
String r;
for (int m, t; (m = s.nextInt()) > 0; System.out.println(r))
for (r = "NA", t = 0; t++ < 12;)
if ((m -= s.nextInt() - s.nextInt()) <= 0 && r == "NA")
r = "" + t;
}... | [["-", 8, 196, 0, 7, 8, 7, 502, 11, 12, 499], ["+", 8, 196, 0, 7, 8, 7, 502, 11, 12, 499], ["-", 0, 7, 8, 7, 15, 16, 31, 27, 0, 68], ["-", 8, 196, 0, 7, 8, 7, 15, 16, 17, 47], ["-", 8, 196, 0, 7, 8, 7, 15, 16, 12, 499], ["+", 0, 7, 8, 7, 15, 16, 31, 27, 0, 29], ["+", 8, 196, 0, 7, 8, 7, 15, 16, 17, 18], ["+", 8, 196, 0... | 3 | 116 | 8 |
import java.util.Scanner;
class exe0206 {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
while (true) {
int l = scan.nextInt();
if (l == 0)
break;
int sum = 0, x = 0;
for (int i = 0; i < 12; i++) {
int m, n;
m = scan.nextInt();
... | import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
while (true) {
int l = scan.nextInt();
if (l == 0)
break;
int sum = 0, x = 0;
for (int i = 1; i <= 12; i++) {
int m, n;
m = scan.nextInt();
... | [["-", 36, 36, 36, 36, 0, 493, 0, 235, 141, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 235, 141, 22], ["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["-", 0, 52, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 17, 19], ["-", 64, 1, 0, 492, 3, 4, 0, 16, 17,... | 3 | 152 | 8 |
#include <stdio.h>
int main(void) {
int L, M, N, sum, num, i;
while (scanf("%d", &L), L != 0) {
num = 0;
sum = 0;
for (i = 0; i < 12; i++) {
scanf("%d %d", &M, &N);
sum += M - N;
if (num == 0 && sum >= L) {
num = i + 1;
}
}
if (num == 0) {
printf("NA\n"... | #include <stdio.h>
int main(void) {
int L, M, N, sum, num, i;
while (scanf("%d", &L), L) {
num = 0;
sum = 0;
for (i = 0; i < 12; i++) {
scanf("%d %d", &M, &N);
sum += M - N;
if (num == 0 && sum >= L) {
num = i + 1;
}
}
if (num == 0) {
printf("NA\n");
... | [["-", 0, 52, 15, 23, 0, 34, 12, 16, 17, 79], ["-", 0, 52, 15, 23, 0, 34, 12, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 133 | 3 |
#include <stdio.h>
int main(void) {
int ryohi, in, out, sum;
int i, k;
scanf("%d", &ryohi);
while (ryohi) {
k = 0;
sum = 0;
for (i = 0; i < 12; i++) {
scanf("%d", &in);
scanf("%d", &out);
sum += (in - out);
if (sum < ryohi)
k++;
}
if (k == 12) {
put... | #include <stdio.h>
int main(void) {
int ryohi, in, out, sum;
int i, k;
scanf("%d", &ryohi);
while (ryohi) {
k = 0;
sum = 0;
for (i = 0; i < 12; i++) {
scanf("%d", &in);
scanf("%d", &out);
sum += (in - out);
if (sum < ryohi)
k++;
}
if (k == 12) {
put... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 145 | 1 |
#include <stdio.h>
int main() {
int i = 0, l, n, m, a[12], b;
while (1) {
b = 0;
scanf("%d", &l);
if (l == 0) {
break;
}
for (i = 0; i < 12; i++) {
scanf("%d%d", &m, &n);
a[i] = m - n;
}
for (i = 0; i < 12; i++) {
b = b + a[i];
if (b >= l) {
printf("... | #include <stdio.h>
int main() {
int i = 0, l, n, m, a[12], b;
while (1) {
b = 0;
scanf("%d", &l);
if (l == 0) {
break;
}
for (i = 0; i < 12; i++) {
scanf("%d%d", &m, &n);
a[i] = m - n;
}
for (i = 0; i < 12; i++) {
b = b + a[i];
if (b >= l) {
printf("... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 153 | 2 |
#include <stdio.h>
int main(void) {
int L, M1, M2, sum, i, month;
while (1) {
sum = 0;
month = 0;
scanf("%d", &L);
if (L == 0)
break;
for (i = 0; i < 12; i++) {
scanf("%d %d", &M1, &M2);
sum += M1 - M2;
if (sum >= L && month == 0) {
month = i + 1;
}
}
... | #include <stdio.h>
int main(void) {
int L, M1, M2, sum, i, month;
while (1) {
sum = 0;
month = 0;
scanf("%d", &L);
if (L == 0)
break;
for (i = 0; i < 12; i++) {
scanf("%d %d", &M1, &M2);
sum += M1 - M2;
if (sum >= L && month == 0) {
month = i + 1;
}
}
... | [["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22]] | 0 | 133 | 4 |
#include <stdio.h>
int main() {
int l, n, m, i, count;
while (1) {
count = 0;
scanf("%d", &l);
if (l == 0)
break;
for (i = 0; i < 12; i++) {
scanf("%d %d", &m, &n);
l = l - (m - n);
if (l > 0)
count++;
}
if (count >= 11 && l != 0)
printf("NA\n");
... | #include <stdio.h>
int main() {
int l, n, m, i, count;
while (1) {
count = 0;
scanf("%d", &l);
if (l == 0)
break;
for (i = 0; i < 12; i++) {
scanf("%d %d", &m, &n);
l = l - (m - n);
if (l > 0)
count++;
}
if (count >= 11 && l > 0)
printf("NA\n");
... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 47]] | 0 | 128 | 2 |
L, m, a, i;
main(n) {
for (; scanf("%d", &L) * L; printf(a ? "%d\n" : "NA", a))
for (a = i = 0; ++i<13; a = a | L> 0 ? a : i)
scanf("%d%d", &m, &n), L -= m - n;
} | L, m, a, i;
main(n) {
for (; scanf("%d", &L) * L; printf(a ? "%d\n" : "NA\n", a))
for (a = i = 0; ++i<13; a = a | L> 0 ? a : i)
scanf("%d%d", &m, &n), L -= m - n;
} | [["+", 26, 2, 3, 4, 0, 41, 75, 5, 0, 44]] | 0 | 89 | 1 |
#include <stdio.h>
main() {
int m, n, l, i, s, p;
while (1) {
scanf("%d", &l);
if (l == 0) {
break;
}
i = s = p = 0;
while (i < 12) {
i++;
scanf("%d %d", &m, &n);
s += (m - n);
if (s >= l && p == 0) {
p = i;
}
}
if (p != 12 && p != 0) {
p... | #include <stdio.h>
main() {
int m, n, l, i, s, p;
while (1) {
scanf("%d", &l);
if (l == 0) {
break;
}
i = s = p = 0;
while (i < 12) {
i++;
scanf("%d %d", &m, &n);
s += (m - n);
if (s >= l && p == 0) {
p = i;
}
}
if (p != 0) {
printf("%d\n... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 98], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 79]] | 0 | 139 | 4 |
#include <stdio.h>
int main(void) {
int i, M, N, L, total, month, f = 0;
for (;;) {
total = 0, month = 0;
scanf("%d", &L);
if (L == 0)
break;
for (i = 1; i <= 12; i++) {
scanf("%d%d", &M, &N);
total = total + M - N;
if (total >= L && f == 0) {
month = i;
f++;
... | #include <stdio.h>
int main(void) {
int i, M, N, L, total, month, f = 0;
for (;;) {
total = 0, month = 0, f = 0;
scanf("%d", &L);
if (L == 0)
break;
for (i = 1; i <= 12; i++) {
scanf("%d%d", &M, &N);
total = total + M - N;
if (total >= L && f == 0) {
month = i;
... | [["+", 8, 9, 0, 1, 0, 34, 12, 34, 0, 21], ["+", 0, 1, 0, 34, 12, 34, 12, 11, 31, 22], ["+", 0, 1, 0, 34, 12, 34, 12, 11, 17, 32], ["+", 0, 1, 0, 34, 12, 34, 12, 11, 12, 13]] | 0 | 142 | 4 |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n, m, s, sum;
while (cin >> n && n != 0) {
sum = 0;
int i;
for (i = 0; i < 12; i++) {
cin >> m >> s;
sum += m - s;
if (sum >= n) {
cout << i + 1 << endl;
break;
}
}
for (; ... | #include <iostream>
using namespace std;
int main() {
// your code goes here
int n, m, s, sum;
while (cin >> n && n != 0) {
sum = 0;
int i;
for (i = 0; i < 12; i++) {
cin >> m >> s;
sum += m - s;
if (sum >= n) {
cout << i + 1 << endl;
break;
}
}
for (i ... | [["+", 0, 52, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 17, 32], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 1 | 119 | 5 |
q,w,e=range,(lambda: eval(input())),input
while True:
n=w()
if n==0:break
d={}
for i in q(n):
o=e().split()
d[o[0]]=int(o[1])
for j in q(w()):
t=e().split()
a=sum([d[i] for i in t[2:]])
d[t[0]]=a if a<d[t[0]] else d[t[0]]
print(d[e()])
| q,w,e=range,(lambda: eval(input())),input
while True:
n=w()
if n==0:break
d={}
for i in q(n):
o=e().split()
d[o[0]]=int(o[1])
for j in q(w()):
t=e().split()
a=sum([d[i] if i in d else 0 for i in t[2:]])
d[t[0]]=a if a<d[t[0]] else d[t[0]]
print(d[e()])
| [["+", 12, 652, 3, 4, 0, 658, 8, 41, 0, 121], ["+", 3, 4, 0, 658, 8, 41, 0, 666, 0, 22], ["+", 3, 4, 0, 658, 8, 41, 0, 666, 667, 267], ["+", 12, 652, 3, 4, 0, 658, 8, 41, 0, 95], ["+", 12, 652, 3, 4, 0, 658, 8, 41, 0, 612]] | 5 | 144 | 6 |
import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
private void run() throws IOException {
Scanner scanner = new Scanner(System.in);
int MAX = 1000000;
boolean[] prime = new boolean[MAX + 1];... |
import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
private void run() throws IOException {
Scanner scanner = new Scanner(System.in);
int MAX = 1000000;
boolean[] prime = new boolean[MAX + 1];... | [["+", 8, 196, 0, 57, 15, 15, 0, 91, 17, 111], ["-", 0, 7, 8, 196, 0, 57, 64, 116, 0, 117], ["-", 0, 7, 8, 196, 0, 57, 64, 116, 0, 35]] | 3 | 385 | 3 |
/**
* At Boss's Expense
*/
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
static boolean[] primes = new boolean[1000001];
public static void main(String[] args) throws IOExcept... | /**
* At Boss's Expense
*/
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
static boolean[] primes = new boolean[1000001];
public static void main(String[] args) throws IOExcept... | [["+", 0, 7, 502, 503, 49, 200, 51, 16, 31, 499], ["+", 0, 7, 502, 503, 49, 200, 51, 16, 17, 48], ["-", 0, 1, 0, 11, 31, 504, 71, 16, 31, 22], ["-", 0, 1, 0, 11, 31, 504, 71, 16, 17, 72]] | 3 | 395 | 4 |
import java.util.*;
class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
while (scan.hasNext()) {
int n = scan.nextInt();
int money = scan.nextInt();
boolean[] dp = new boolean[money + 1];
if (n == 0) {
break;
}
int[]... | import java.util.*;
class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
while (scan.hasNext()) {
int n = scan.nextInt();
int money = scan.nextInt();
boolean[] dp = new boolean[money + 1];
if (n == 0) {
break;
}
int[]... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 368 | 2 |
import java.util.*;
class Main {
public static void main(String args[]) {
boolean[] prime = new boolean[1000001];
prime[0] = true;
prime[1] = true;
for (int i = 0; i < 1000001; i++) {
if (!prime[i]) {
int j = 2;
while (i * j < 1000001) {
prime[i * j] = true;
... | import java.util.*;
class Main {
public static void main(String args[]) {
boolean[] prime = new boolean[1000001];
prime[0] = true;
prime[1] = true;
for (int i = 0; i < 1000001; i++) {
if (!prime[i]) {
int j = 2;
while (i * j < 1000001) {
prime[i * j] = true;
... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 17, 19]] | 3 | 313 | 2 |
#define M 1000001
T[M], t[M], a;
main(m, n, x, i, j) {
for (i = 2; i < M; i++)
if (!T[i])
for (j = i * 2; j < M; j += i)
T[j] = 1;
for (; scanf("%d%d", &n, &x), n; printf(m ? "%d\n" : "NA\n", m)) {
for (memset(t, 0, sizeof(t)), t[0] = 1, m = i = 0; i < n; i++) {
for (scanf("%d", &a), j =... | #define M 1000001
T[M], t[M], a;
main(m, n, x, i, j) {
for (i = 2; i < M; i++)
if (!T[i])
for (j = i * 2; j < M; j += i)
T[j] = 1;
for (; scanf("%d%d", &n, &x), n; printf(m ? "%d\n" : "NA\n", m)) {
for (memset(t, 0, sizeof(t)), t[0] = 1, m = i = 0; i < n; i++) {
for (scanf("%d", &a), j =... | [["+", 64, 57, 15, 23, 0, 34, 12, 16, 17, 98], ["+", 15, 23, 0, 34, 12, 16, 12, 16, 31, 22], ["+", 15, 23, 0, 34, 12, 16, 12, 16, 17, 18], ["+", 0, 34, 12, 16, 12, 16, 12, 16, 31, 22], ["+", 0, 34, 12, 16, 12, 16, 12, 16, 17, 72], ["+", 0, 34, 12, 16, 12, 16, 12, 16, 12, 22]] | 0 | 209 | 6 |
#include <stdio.h>
#define S 1000001
#define N 30
int dp[S] = {0}; // dp[i] := 商品の金額和がSとなるか
int main(void) {
int isprime[S];
int i, j;
for (i = 0; i < S; i++)
isprime[i] = 1;
isprime[2] = 1;
for (i = 2; i < S; i++) {
if (isprime[i]) {
for (j = i + i; j < S; j += i) {
isprime[j] = 0;
... | #include <stdio.h>
#define S 1000001
#define N 30
int dp[S] = {0}; // dp[i] := 商品の金額和がSとなるか
int main(void) {
int isprime[S];
int i, j;
for (i = 0; i < S; i++)
isprime[i] = 1;
isprime[2] = 1;
for (i = 2; i < S; i++) {
if (isprime[i]) {
for (j = i + i; j < S; j += i) {
isprime[j] = 0;
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 12, 22]] | 0 | 342 | 6 |
#include <iostream>
using namespace std;
int main() {
bool nonprime[1000001] = {};
nonprime[0] = nonprime[1] = true;
for (int i = 2; i <= 1000000; i++) {
if (!nonprime[i]) {
for (int j = i + i; j <= 1000000; j += i) {
nonprime[j] = true;
}
}
}
while (1) {
int n, x;
cin >>... | #include <iostream>
using namespace std;
int main() {
bool nonprime[1000001] = {};
nonprime[0] = nonprime[1] = true;
for (int i = 2; i <= 1000000; i++) {
if (!nonprime[i]) {
for (int j = i + i; j <= 1000000; j += i) {
nonprime[j] = true;
}
}
}
while (1) {
int n, x;
cin >>... | [["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 248 | 5 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 547 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
bool dp[1000120];
bool notPrime[1000120];
int main() {
notPrime[0] = notPrime[1] = true;
for (int i = 2; i * i < 1000010; i++) {
for (int j = 2 * i; j < 1000010; j += i) {
notPrime[j] = true;
}
}
int n, x;
while (cin >> n >> x, n) {
... | #include <algorithm>
#include <iostream>
using namespace std;
bool dp[1000120];
bool notPrime[1000120];
int main() {
notPrime[0] = notPrime[1] = true;
for (int i = 2; i * i < 1000010; i++) {
for (int j = 2 * i; j < 1000010; j += i) {
notPrime[j] = true;
}
}
int n, x;
while (cin >> n >> x, n) {
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 240 | 2 |
#include <bits/stdc++.h>
#ifndef INCLUDE_BOOL_ARRAY_HPP
#define INCLUDE_BOOL_ARRAY_HPP
#include <cassert>
#include <cstring>
#include <limits>
namespace orliv {
template <unsigned int CAP> struct BoolArray {
typedef int memory_t;
memory_t K;
memory_t data[CAP];
BoolArray() { clear_deep(); }
void clear_deep... | #include <bits/stdc++.h>
#ifndef INCLUDE_BOOL_ARRAY_HPP
#define INCLUDE_BOOL_ARRAY_HPP
#include <cassert>
#include <cstring>
#include <limits>
namespace orliv {
template <unsigned int CAP> struct BoolArray {
typedef int memory_t;
memory_t K;
memory_t data[CAP];
BoolArray() { clear_deep(); }
void clear_deep... | [["+", 0, 57, 15, 339, 51, 16, 31, 91, 17, 111]] | 1 | 949 | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template <typename T> inline
#define TTF_ tem... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template <typename T> inline
#define TTF_ tem... | [["+", 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]] | 1 | 806 | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 1e9
int main() {
int N = 1e6 + 1;
vector<bool> isPrime(N, true);
isPrime[0] = isPrime[1] = fal... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF 1e9
int main() {
int N = 1e6 + 1;
vector<bool> isPrime(N, true);
isPrime[0] = isPrime[1] = fal... | [["+", 0, 57, 64, 1, 0, 11, 12, 2, 63, 22], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 64, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 310 | 5 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
bool FF[1000002];
int main() {
for (int i = 3; i < 1000001; i += 2) {
FF[i] = true;
for (int j = 3; j * j <= i; j += 2)
if (i % j == 0) {
FF[i] = false;
break;
}
}
FF[2] = true;
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
bool FF[1000002];
int main() {
for (int i = 3; i < 1000001; i += 2) {
FF[i] = true;
for (int j = 3; j * j <= i; j += 2)
if (i % j == 0) {
FF[i] = false;
break;
}
}
FF[2] = true;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 304 | 2 |
#include <iostream>
using namespace std;
const int INF = (1 << 25);
bool dp[1000001];
int price[31];
int n, x;
int checkprime(int num) {
for (int i = 2; i * i <= num; i++) {
if (num % i == 0)
return true;
}
return x == 1;
}
int main() {
while (cin >> n >> x, n || x) {
for (int i = 0; i < n; i++... | #include <iostream>
using namespace std;
const int INF = (1 << 25);
bool dp[1000001];
int price[31];
int n, x;
int checkprime(int num) {
for (int i = 2; i * i <= num; i++) {
if (num % i == 0)
return true;
}
return x == 1;
}
int main() {
while (cin >> n >> x, n || x) {
for (int i = 0; i < n; i++... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 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 | 269 | 4 |
#include <bits/stdc++.h>
#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 REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | #include <bits/stdc++.h>
#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 REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22]] | 1 | 337 | 4 |
#include <stdio.h>
int n, x, a[30];
bool dp[1000001], prime[1000001];
int main() {
for (int i = 2; i <= 1000000; i++)
prime[i] = true;
for (int i = 2; i <= 1000; i++) {
if (!prime[i])
continue;
for (int j = i * i; j <= 1000000; j += i)
prime[j] = false;
}
while (scanf("%d%d", &n, &x), n)... | #include <stdio.h>
int n, x, a[30];
bool dp[1000001], prime[1000001];
int main() {
for (int i = 2; i <= 1000000; i++)
prime[i] = true;
for (int i = 2; i <= 1000; i++) {
if (!prime[i])
continue;
for (int j = i * i; j <= 1000000; j += i)
prime[j] = false;
}
while (scanf("%d%d", &n, &x), n)... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 12, 69, 341, 342, 0, 73]] | 1 | 298 | 28 |
#include <iostream>
using namespace std;
bool isprime[1000001]; // false????´???°
int main() {
isprime[1] = true;
int n, x;
int price[30];
for (int i = 2; i <= 1000000; i++) {
if (!isprime[i]) {
for (int j = i * 2; j <= 1000000; j += i) {
isprime[j] = true;
}
}
}
while (cin ... | #include <iostream>
using namespace std;
bool isprime[1000001]; // false????´???°
int main() {
isprime[1] = true;
int n, x;
int price[30];
for (int i = 2; i <= 1000000; i++) {
if (!isprime[i]) {
for (int j = i * 2; j <= 1000000; j += i) {
isprime[j] = true;
}
}
}
while (cin ... | [["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 275 | 3 |
#include <cstring>
#include <iostream>
using namespace std;
int is[1000001];
bool isprime[1000001];
int main() {
isprime[0] = isprime[1] = true;
for (int i = 4; i <= 1000000; i += 2)
isprime[i] = true;
for (int i = 3; i * i <= 1000000; i += 2)
for (int j = 2; i * j <= 1000000; ++j)
isprime[i * j]... | #include <cstring>
#include <iostream>
using namespace std;
int is[1000001];
bool isprime[1000001];
int main() {
isprime[0] = isprime[1] = true;
for (int i = 4; i <= 1000000; i += 2)
isprime[i] = true;
for (int i = 3; i * i <= 1000000; i += 2)
for (int j = 2; i * j <= 1000000; ++j)
isprime[i * j]... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 280 | 2 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, b, n) for (int i = b; i < n; i++)
#define RFOR(i, b, n) for (int i = n - 1; i >= b; i--)
#define CLR(ma... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, b, n) for (int i = b; i < n; i++)
#define RFOR(i, b, n) for (int i = n - 1; i >= b; i--)
#define CLR(ma... | [["-", 12, 23, 0, 16, 31, 23, 0, 16, 17, 47], ["+", 12, 23, 0, 16, 31, 23, 0, 16, 17, 20], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 409 | 4 |
#include <cstring>
#include <iostream>
using namespace std;
bool prime[10000001];
bool dp[10000001];
int menu[30];
int n, x;
void make_prime() {
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for (int i = 2; i < 10000001; i++) {
if (prime[i]) {
for (int j = i + i; j < 10000001; j += ... | #include <cstring>
#include <iostream>
using namespace std;
bool prime[10000001];
bool dp[10000001];
int menu[30];
int n, x;
void make_prime() {
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for (int i = 2; i < 10000001; i++) {
if (prime[i]) {
for (int j = i + i; j < 10000001; j += ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 64, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 7, 8, 57, 15, 339, 51, 16, 17, 19]] | 1 | 299 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUNT(i, n) for ... | [["+", 0, 2, 3, 4, 0, 16, 31, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 337 | 4 |
#include <algorithm>
#include <iostream>
#define INF 999999
typedef long long ll;
using namespace std;
int n, a, b, c, maxm, x;
int sum, miniNo, minim;
bool t[1000001];
bool isPrime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main() {
while (1) {
... | #include <algorithm>
#include <iostream>
#define INF 999999
typedef long long ll;
using namespace std;
int n, a, b, c, maxm, x;
int sum, miniNo, minim;
bool t[1000001];
bool isPrime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
int main() {
while (1) {
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 20]] | 1 | 248 | 4 |
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 100000000
typedef long long int lli;
typedef pair<int, int> P;
bool ... | #include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 100000000
typedef long long int lli;
typedef pair<int, int> P;
bool ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 399 | 2 |
#include <cstring>
#include <iostream>
using namespace std;
const int MAX_N = 1e6 + 1;
bool is_prime[MAX_N + 1];
void SieveOfEratosthenes(int n) {
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])
for (int j = 2 * i... | #include <cstring>
#include <iostream>
using namespace std;
const int MAX_N = 1e6 + 10;
bool is_prime[MAX_N + 1];
void SieveOfEratosthenes(int n) {
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])
for (int j = 2 * ... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 12, 13]] | 1 | 298 | 4 |
#include <cstring>
#include <iostream>
#define MAX 1000000
using namespace std;
int n, x, d[31];
bool p[MAX + 1], dp[MAX + 1];
void isPrime() {
memset(p, 1, sizeof(p));
p[0] = p[1] = false;
for (int i = 2; i * i <= MAX; i++) {
for (int j = i + i; j <= MAX; j += i)
p[j] = false;
}
}
int main() {
i... | #include <cstring>
#include <iostream>
#define MAX 1000000
using namespace std;
int n, x, d[31];
bool p[MAX + 1], dp[MAX + 1];
void isPrime() {
memset(p, 1, sizeof(p));
p[0] = p[1] = false;
for (int i = 2; i * i <= MAX; i++) {
for (int j = i + i; j <= MAX; j += i)
p[j] = false;
}
}
int main() {
i... | [["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 297 | 4 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
MyScanner sc = new MyScanner();
Scanner sc2 = new Scanner(System.in);
int mod = 1000000007;
void run() {
for (;;) {
int X = sc.nextInt();
int Y = sc.nextInt();
if ((X | Y) == 0) {
return;
}
int[][]... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
MyScanner sc = new MyScanner();
Scanner sc2 = new Scanner(System.in);
int mod = 1000000007;
void run() {
for (;;) {
int X = sc.nextInt();
int Y = sc.nextInt();
if ((X | Y) == 0) {
return;
}
int[][]... | [["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46], ["-", 0, 57, 64, 196, 0, 57, 64, 196, 0, 46]] | 3 | 878 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int w, h;
int map[][];
int cnt[][];
while (true) {
w = sc.nextInt();
h = sc.nextInt();
if ((w | h) == 0) {
break;
}
map = new int[h][w... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int w, h;
int map[][];
int cnt[][];
while (true) {
w = sc.nextInt();
h = sc.nextInt();
if ((w | h) == 0) {
break;
}
map = new int[h][w... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 79], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 499]] | 3 | 454 | 4 |
#include <stdio.h>
unsigned int c;
int n, m;
int X[3] = {-1, 0, 1};
int main() {
int i, j, k;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
int d[15][17] = {{0}};
int p[15][17] = {{0}};
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &d[i][j... | #include <stdio.h>
unsigned int c;
int n, m;
int X[3] = {-1, 0, 1};
int main() {
int i, j, k;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
int d[17][15] = {{0}};
int p[17][15] = {{0}};
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &d[i][j... | [["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 0 | 430 | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n != -1) {
int sum = 3130, num[3] = {125, 140, 160};
for (int i = 0; i < 3; i++) {
n -= 10;
if (n > 10)
sum -= num[i] * 10;
else if (n > 0)
sum -= num[i] * n;
}
cout << sum << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n != -1) {
int sum = 3130, num[3] = {125, 140, 160};
for (int i = 0; i < 3; i++) {
n -= 10;
if (n > 10 && i != 2)
sum -= num[i] * 10;
else if (n > 0)
sum -= num[i] * n;
}
cout << su... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 102 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n != -1) {
int sum = 3130, num[3] = {125, 140, 160};
for (int i = 0, j = n - 10; i < 3; i++, j -= 10) {
if (j > 10 && i != 2)
sum -= num[i] * 10;
else if (j > 0)
sum -= num[i] * n;
}
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n && n != -1) {
int sum = 3130, num[3] = {125, 140, 160};
for (int i = 0, j = n - 10; i < 3; i++, j -= 10) {
if (j > 10 && i != 2)
sum -= num[i] * 10;
else if (j > 0)
sum -= num[i] * j;
}
cout... | [["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 22], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 22]] | 1 | 112 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0216
int calc(int w) {
int sum = 1150;
if (w < 10)
return sum;
sum += min(w - 10, 10) * 125;
if (w < 20)
return sum;
sum += min(w - 20, 10) * 140;
if (w < 30)
return sum;
sum... | #include <cmath>
#include <iostream>
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0216
int calc(int w) {
int sum = 1150;
if (w < 10)
return sum;
sum += min(w - 10, 10) * 125;
if (w < 20)
return sum;
sum += min(w - 20, 10) * 140;
if (w < 30)
return sum;
sum... | [["-", 0, 1, 0, 11, 12, 16, 31, 2, 63, 22], ["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 21], ["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 13]] | 1 | 132 | 3 |
#include <stdio.h>
int main(void) {
int n, w, a;
while (1) {
scanf("%d", &n);
if (n == -1)
break;
w = 1150;
if (n > 30) {
w = w + (n - 30) * 160;
if (n >= 40)
n = 30;
else
n = (n / 10) * 10;
}
if (n > 20) {
w = w + (n - 20) * 140;
if (n == ... | #include <stdio.h>
int main(void) {
int n, w, a;
while (1) {
scanf("%d", &n);
if (n == -1)
break;
w = 1150;
if (n > 30) {
w = w + (n - 30) * 160;
if (n >= 40)
n = 30;
else
n = (n / 10) * 10;
}
if (n > 20) {
w = w + (n - 20) * 140;
if (n == ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 167 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for... | [["-", 12, 16, 31, 2, 3, 4, 0, 2, 63, 22], ["-", 31, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["-", 31, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["-", 31, 2, 3, 4, 0, 2, 3, 4, 0, 21], ["-", 31, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 228 | 5 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int w;
int val = 0;
cin >> w;
if (w == -1)
break;
val = 1150;
int n = 0;
int vs[] = {125, 140, 160};
while (true) {
int t = w - 10 * (n + 1);
if (t < 0)
t = 0;
if (t > 10 && n <= 2)
... | #include <iostream>
using namespace std;
int main() {
while (true) {
int w;
int val = 0;
cin >> w;
if (w == -1)
break;
val = 1150;
int n = 0;
int vs[] = {125, 140, 160};
while (true) {
int t = w - 10 * (n + 1);
if (t < 0)
t = 0;
if (t > 10 && n <= 1)
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 134 | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(c) (c).begin(), (c).end()... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(c) (c).begin(), (c).end()... | [["-", 0, 1, 0, 11, 12, 16, 31, 2, 63, 22], ["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 13], ["-", 0, 11, 12, 16, 31, 2, 3, 4, 0, 21]] | 1 | 234 | 3 |
#include <iostream>
using namespace std;
int money(int m) {
int money = 1150;
// if(m==-1)return 0;
if (m <= 10)
return money;
if (m <= 20 && m > 10)
return money + 125 * (m - 10);
if (m <= 30 && m > 20)
return money + 10 * 125 + 140 * (m - 20);
if (m > 30)
return money + 10 * 125 + 10 * 140... | #include <iostream>
using namespace std;
int money(int m) {
int money = 1150;
if (m <= 10)
return money;
if (m <= 20 && m > 10)
return money + 125 * (m - 10);
if (m <= 30 && m > 20)
return money + 10 * 125 + 140 * (m - 20);
if (m > 30)
return money + 10 * 125 + 10 * 140 + 160 * (m - 30);
}
int... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 137 | 2 |
#include <cstdio>
int Solve(int w) {
int c = 1150;
if (w > 30) {
c += (w - 30) * 160;
c += 140 * 10;
c += 125 * 10;
} else if (w > 20) {
c += 140 * (w - 20);
c += 125 * 10;
} else if (w > 10) {
c += 125 * (w - 20);
}
return c;
}
int main() {
int self;
// int bf;
while (1) {
... | #include <cstdio>
int Solve(int w) {
int c = 1150;
if (w > 30) {
c += (w - 30) * 160;
c += 140 * 10;
c += 125 * 10;
} else if (w > 20) {
c += 140 * (w - 20);
c += 125 * 10;
} else if (w > 10) {
c += 125 * (w - 10);
}
return c;
}
int main() {
int self;
// int bf;
while (1) {
... | [["-", 0, 11, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 12, 13]] | 1 | 146 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [["+", 0, 11, 12, 69, 341, 342, 0, 2, 63, 22], ["+", 12, 69, 341, 342, 0, 2, 3, 4, 0, 24], ["+", 12, 69, 341, 342, 0, 2, 3, 4, 0, 21], ["+", 12, 69, 341, 342, 0, 2, 3, 4, 0, 13], ["+", 12, 69, 341, 342, 0, 2, 3, 4, 0, 25]] | 1 | 303 | 5 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int w;
cin >> w;
if (w == -1)
break;
int x = 0, y = 0;
if (w >= 0 && w < 10)
y = 1150;
else if (w >= 10 && w < 20) {
x = w - 10;
y = 1150 + 125 * x;
} else if (w >= 20 && w < 30) {
x = w - ... | #include <iostream>
using namespace std;
int main() {
while (true) {
int w;
cin >> w;
if (w == -1)
break;
int x = 0, y = 0;
if (w >= 0 && w < 10)
y = 1150;
else if (w >= 10 && w < 20) {
x = w - 10;
y = 1150 + 125 * x;
} else if (w >= 20 && w < 30) {
x = w - ... | [["-", 0, 11, 12, 16, 31, 16, 12, 16, 12, 22], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 12, 13]] | 1 | 158 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vect... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vect... | [["-", 0, 57, 64, 1, 0, 11, 12, 2, 63, 22], ["-", 64, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["-", 64, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["-", 12, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["-", 64, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 186 | 5 |
#include <iostream>
using namespace std;
int main() {
int w;
while (cin >> w, w != -1) {
int fee = 1150;
for (int i = 11; i <= 20 && i <= w; i++)
fee += 125;
for (int i = 21; i <= 30 && i <= w; i++)
fee += 140;
for (int i = 31; i < w; i++)
fee += 160;
cout << 4280 - fee << en... | #include <iostream>
using namespace std;
int main() {
int w;
while (cin >> w, w != -1) {
int fee = 1150;
for (int i = 11; i <= 20 && i <= w; i++)
fee += 125;
for (int i = 21; i <= 30 && i <= w; i++)
fee += 140;
for (int i = 31; i <= w; i++)
fee += 160;
cout << 4280 - fee << e... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 102 | 2 |
import java.util.*;
public class Main {
public static void main(String[] a) {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int[] p = new int[n];
int[] d = new int[n];
int max = 0;
int res = 0;
for (int i =... | import java.util.*;
public class Main {
public static void main(String[] a) {
Scanner sc = new Scanner(System.in);
for (;;) {
int n = sc.nextInt();
if (n == 0) {
break;
}
int[] p = new int[n];
int[] d = new int[n];
int max = 0;
int res = 0;
for (int i =... | [["+", 0, 492, 3, 4, 0, 16, 31, 16, 17, 72], ["+", 3, 4, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 3, 4, 0, 16, 31, 16, 12, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 12, 22]] | 3 | 171 | 6 |
#include <stdio.h>
int p[10000], d[10000];
int main(void) {
int n, i, j, d1, d2, T, max = 0, maxn;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p[i], &d1, &d2);
d[i] = d1 + d2;
}
for (i = 0; i < n; i++) {
if (max < d[i]) {
... | #include <stdio.h>
int p[10000], d[10000];
int main(void) {
int n, i, j, d1, d2, T, max = 0, maxn;
while (1) {
max = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p[i], &d1, &d2);
d[i] = d1 + d2;
}
for (i = 0; i < n; i++) {
if (ma... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 161 | 4 |
#include <stdio.h>
int main(void) {
int n, i, p, k, j, gokei, big = 0, b;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 1; i < n + 1; i++) {
scanf("%d %d %d", &p, &k, &j);
gokei = k + j;
if (big < gokei) {
b = p;
big = gokei;
}
}
... | #include <stdio.h>
int main(void) {
int n, i, p, k, j, gokei, big = 0, b;
while (1) {
scanf("%d", &n);
big = 0;
if (n == 0) {
break;
}
for (i = 1; i < n + 1; i++) {
scanf("%d %d %d", &p, &k, &j);
gokei = k + j;
if (big < gokei) {
b = p;
big = gokei;
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 124 | 4 |
#include <stdio.h>
int main(void) {
int n, p, am, pm, i, ban, gou, mos = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p, &am, &pm);
gou = am + pm;
if (mos < gou) {
mos = gou;
ban = p;
}
}
printf("%d ... | #include <stdio.h>
int main(void) {
int n, p, am, pm, i, ban, gou, mos = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p, &am, &pm);
gou = am + pm;
if (mos < gou) {
mos = gou;
ban = p;
}
}
printf("%d ... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 120 | 4 |
m;
main(n, p, d, e, b) {
for (;;) {
scanf("%d", &n);
if (!n)
exit(0);
for (; n--;) {
scanf("%d%d%d", &p, &d, &e);
if (m < d + e)
m = d + e, b = p;
}
printf("%d %d\n", b, m);
}
} | m;
main(n, p, d, e, b) {
for (;;) {
m = scanf("%d", &n);
if (!n)
exit(0);
for (; n--;) {
scanf("%d%d%d", &p, &d, &e);
if (m < d + e)
m = d + e, b = p;
}
printf("%d %d\n", b, m);
}
} | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32]] | 0 | 99 | 2 |
n, p, a, m, c;
main(b) {
for (; scanf("%d", &n) * n; printf("%d %d\n", m, c))
for (m = 0; n--; a + b > c ? c = a + b, m = p : 0)
scanf("%d%d%d", &p, &a, &b);
} | n, p, a, m, c;
main(b) {
for (; c = -scanf("%d", &n) * n; printf("%d %d\n", m, c))
for (; n--; a + b > c ? c = a + b, m = p : 0)
scanf("%d%d%d", &p, &a, &b);
} | [["+", 0, 14, 8, 9, 0, 7, 15, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 11, 17, 32], ["+", 0, 7, 15, 11, 12, 16, 31, 91, 17, 33], ["-", 8, 9, 0, 7, 8, 7, 10, 11, 31, 22], ["-", 8, 9, 0, 7, 8, 7, 10, 11, 17, 32], ["-", 8, 9, 0, 7, 8, 7, 10, 11, 12, 13]] | 0 | 86 | 7 |
n, p, a, m, c;
main(b) {
for (; scanf("%d", &n) * n; printf("%d %d\n", m, c))
for (m = 0; n--; a + b > c ? c = a + b, m = p : 0)
scanf("%d%d%d", &p, &a, &b);
} | n, p, a, m, c;
main(b) {
for (; c = scanf("%d", &n), n; printf("%d %d\n", m, c))
for (; n--; a + b > c ? c = a + b, m = p : 0)
scanf("%d%d%d", &p, &a, &b);
} | [["+", 8, 9, 0, 7, 15, 34, 31, 11, 31, 22], ["+", 8, 9, 0, 7, 15, 34, 31, 11, 17, 32], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 48], ["+", 0, 14, 8, 9, 0, 7, 15, 34, 0, 21], ["-", 8, 9, 0, 7, 8, 7, 10, 11, 31, 22], ["-", 8, 9, 0, 7, 8, 7, 10, 11, 17, 32], ["-", 8, 9, 0, 7, 8, 7, 10, 11, 12, 13]] | 0 | 86 | 7 |
#include <stdio.h>
int main() {
int i, a, b, c, d, max = 0, s = 0;
scanf("%d", &a);
while (a != 0) {
s = 0;
for (i = 0; i < a; i++) {
scanf("%d %d %d", &b, &c, &d);
c = c + d;
if (max < c) {
max = c;
s = b;
}
}
printf("%d %d\n", s, max);
scanf("%d", &a)... | #include <stdio.h>
int main() {
int i, a, b, c, d, max = 0, s = 0;
scanf("%d", &a);
while (a != 0) {
s = 0;
max = 0;
for (i = 0; i < a; i++) {
scanf("%d %d %d", &b, &c, &d);
c = c + d;
if (max < c) {
max = c;
s = b;
}
}
printf("%d %d\n", s, max);
sc... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 127 | 4 |
#include <stdio.h>
typedef struct {
int nam;
int dis;
} set;
int main() {
int n, i, way1, way2, top = 0, rancer;
while (scanf("%d", &n)) {
if (n == 0) {
break;
}
set mem[10000];
for (i = 0; i < n; i++) {
mem[i].dis = 0;
}
for (i = 0; i < n; i++) {
scanf("%d %d %d", &m... | #include <stdio.h>
typedef struct {
int nam;
int dis;
} set;
int main() {
int n, i, way1, way2, top = 0, rancer;
while (scanf("%d", &n)) {
if (n == 0) {
break;
}
set mem[10000];
for (i = 0; i < n; i++) {
mem[i].dis = 0;
}
for (i = 0; i < n; i++) {
scanf("%d %d %d", &m... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 200 | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef struct {
int num;
int first;
int second;
} Walk;
int main() {
int n, max = -1, add;
Walk people[10005];
while (1) {
scanf("%... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef struct {
int num;
int first;
int second;
} Walk;
int main() {
int n, max = -1, add;
Walk people[10005];
while (1) {
scanf("%... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 191 | 4 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 31, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["+", 31, 16, 31, 16, 31, 16, 12, 118, 119, 120], ["-", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["+", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120]] | 1 | 262 | 4 |
#include <iostream>
using namespace std;
int main(void) {
int n, p, d1, d2;
int ans1, ans2;
while (1) {
cin >> n;
if (n == 0) {
break;
}
ans1 = -1, ans2 = -1;
for (int i = 0; i < n; i++) {
cin >> p >> d1 >> d2;
if (ans2 < d1 + d2) {
ans1 = p;
ans2 = d1 + d2;... | #include <iostream>
using namespace std;
int main(void) {
int n, p, d1, d2;
int ans1, ans2;
while (1) {
cin >> n;
if (n == 0) {
break;
}
ans1 = -1, ans2 = -1;
for (int i = 0; i < n; i++) {
cin >> p >> d1 >> d2;
if (ans2 < d1 + d2) {
ans1 = p;
ans2 = d1 + d2;... | [["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 110 | 4 |
#include <stdio.h>
int main(void) {
int i, n, p, d1, d2, ps, d, max;
max = -1;
scanf("%d", &n);
while (!(n == 0)) {
p = 0;
d1 = 0;
d2 = 0;
for (i = 1; i <= n; i++) {
scanf("%d %d %d", &p, &d1, &d2);
d = d1 + d2;
if (max < d) {
max = d;
ps = p;
}
}
... | #include <stdio.h>
int main(void) {
int i, n, p, d1, d2, ps, d, max;
max = -1;
scanf("%d", &n);
while (!(n == 0)) {
p = 0;
d1 = 0;
d2 = 0;
max = -1;
for (i = 1; i <= n; i++) {
scanf("%d %d %d", &p, &d1, &d2);
d = d1 + d2;
if (max < d) {
max = d;
ps = p;
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 141 | 4 |
M[15][15], C[15][15], X, Y;
int D(x, y) {
if (y >= Y - 1)
return 1;
if (M[x][y])
return M[x][y];
if (C[x][y] == 2)
return M[x][y] = y + 2 >= Y || C[x][y + 2] != -1 ? D(x, y + 2) : 0;
int s = 0;
if (0 < x && C[x - 1][y + 1] == 0)
s += D(x - 1, y + 1);
if (C[x][y + 1] != 1)
s += D(x, y + 1... | M[15][15], C[15][15], X, Y;
int D(x, y) {
if (y >= Y - 1)
return 1;
if (M[x][y])
return M[x][y];
if (C[x][y] == 2)
return M[x][y] = y + 2 >= Y || C[x][y + 2] != 1 ? D(x, y + 2) : 0;
int s = 0;
if (0 < x && C[x - 1][y + 1] == 0)
s += D(x - 1, y + 1);
if (C[x][y + 1] != 1)
s += D(x, y + 1)... | [["-", 0, 11, 12, 41, 15, 16, 12, 16, 12, 13], ["+", 0, 11, 12, 41, 15, 16, 12, 16, 12, 13]] | 0 | 352 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, mas[16][16];
while (cin >> W >> H, W) {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> mas[i][j];
}
}
vector<vector<int>> dp(H + 1, vector<int>(W, 0));
for (int i = 0; i < W; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, mas[16][16];
while (cin >> W >> H, W) {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> mas[i][j];
}
}
vector<vector<int>> dp(H + 1, vector<int>(W, 0));
for (int i = 0; i < W; i++) {
if... | [["-", 31, 69, 28, 69, 341, 342, 0, 2, 63, 22], ["+", 31, 69, 28, 69, 341, 342, 0, 2, 63, 22]] | 1 | 414 | 2 |
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H;
while (cin >> W >> H, W) {
int b[15][20] = {0};
for (int i = 0; i < H; i++) {
for (int j = 0; j ... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H;
while (cin >> W >> H, W) {
int b[20][15] = {0};
for (int i = 0; i < H; i++) {
for (int j = 0; j ... | [["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 393 | 8 |
#include <iostream>
using namespace std;
int main() {
int x, y;
while (cin >> x >> y, x * y) { //
int skimap[15][15] = {}; // x = j y = i
int dp[15][15] = {}; // x = j y = i
int flyover = 0; //??´????£??????????????????????
for (int i = 0; i < y; i++) {
for (int j = 0... | #include <iostream>
using namespace std;
int main() {
int x, y;
while (cin >> x >> y, x * y) { //
int skimap[15][15] = {}; // x = j y = i
int dp[15][15] = {}; // x = j y = i
int flyover = 0; //??´????£??????????????????????
for (int i = 0; i < y; i++) {
for (int j = 0... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 25], ["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["-", 75, 76, 0, 9, 0, 57, 64, 9, 0, 45]] | 1 | 435 | 6 |
/* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 958 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
template <typename A, typename B> inline bool chmax(A &a, B b) {
if (a < b) {
a = b;
return 1;
}
ret... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 520 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.