problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a, b;
cin >> s;
a = s / 100;
b = s % 100;
if (a > 0 && a < 13) {
if (b > 0 && a < 13)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (b > 0 && b < 13)
cout << "YYMM" << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a, b;
cin >> s;
a = s / 100;
b = s % 100;
if (a > 0 && a < 13) {
if (b > 0 && b < 13)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (b > 0 && b < 13)
cout << "YYMM" << endl;
else
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,967 | 857,968 | u072080927 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int sub(vector<int> array) {
int ans = 0;
for (int i = 0; i < array.size(); i++)
ans = max(ans, array.at(i));
return ans;
}
int main() {
int n;
cin >> n;
bool YYMM = 0 < n / 100 && n / 100 <= 12;
bool MMYY = 0 < n % 100 && n % 100 <= 12;
if (YYMM && MMYY... | #include <bits/stdc++.h>
using namespace std;
int sub(vector<int> array) {
int ans = 0;
for (int i = 0; i < array.size(); i++)
ans = max(ans, array.at(i));
return ans;
}
int main() {
int n;
cin >> n;
bool MMYY = 0 < n / 100 && n / 100 <= 12;
bool YYMM = 0 < n % 100 && n % 100 <= 12;
if (YYMM && MMYY... | [
"variable_declaration.name.change",
"identifier.change"
] | 857,981 | 857,982 | u288432959 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int pre, end;
pre = (s[0] - '0') * 10 + s[1] - '0';
end = (s[2] - '0') * 10 + s[3] - '0';
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int pre, end;
pre = (s[0] - '0') * 10 + s[1] - '0';
end = (s[2] - '0') * 10 + s[3] - '0';
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,991 | 857,992 | u471144507 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
using namespace std;
const long long mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ch... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
using namespace std;
const long long mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ch... | [
"literal.string.change",
"io.output.change"
] | 857,995 | 857,996 | u020230257 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int y = (s[0] - '0') * 10 + (s[1] - '0');
int m = (s[2] - '0') * 10 + (s[3] - '0');
if ((m < 1 || m > 12) && (y < 1 || y > 12))
cout << "NA";
else if ((m > 0 || m < 13) && (y < 1 || y > 12))
cout << "YYMM";
else if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int y = (s[0] - '0') * 10 + (s[1] - '0');
int m = (s[2] - '0') * 10 + (s[3] - '0');
if ((m < 1 || m > 12) && (y < 1 || y > 12))
cout << "NA";
else if ((m > 0 || m < 13) && (y < 1 || y > 12))
cout << "YYMM";
else if (... | [
"literal.string.change",
"io.output.change"
] | 857,997 | 857,998 | u383681712 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <queue>
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <queue>
... | [
"literal.string.change",
"io.output.change"
] | 857,999 | 858,000 | u667375816 | cpp |
p03042 | #include <iostream>
using namespace std;
main() {
string s;
int a, b;
cin >> s;
a = (s[0] ^ 48) * 10 + (s[1] ^ 48);
b = (s[2] ^ 48) * 10 + (s[3] ^ 48);
;
if ((0 < a && a <= 12) && (0 < b && a <= 12)) {
printf("AMBIGUOUS\n");
} else if (0 < b && b <= 12) {
printf("YYMM\n");
} else if (0 < a && ... | #include <iostream>
using namespace std;
main() {
string s;
int a, b;
cin >> s;
a = (s[0] ^ 48) * 10 + (s[1] ^ 48);
b = (s[2] ^ 48) * 10 + (s[3] ^ 48);
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
printf("AMBIGUOUS\n");
} else if (0 < b && b <= 12) {
printf("YYMM\n");
} else if (0 < a && a <... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,001 | 858,002 | u468811760 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int s;
cin >> s;
int l = s / 100, r = s % 100;
bool is_yymm = 1 <= r && r <= 12;
bool is_mmyy = 1 <= l && l <= 12;
if (is_yymm && is_mmyy)
cout << "AMBIGUOUS" << endl;
else if (is_yymm)
co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int s;
cin >> s;
int l = s / 100, r = s % 100;
bool is_yymm = 1 <= r && r <= 12;
bool is_mmyy = 1 <= l && l <= 12;
if (is_yymm && is_mmyy)
cout << "AMBIGUOUS" << endl;
else if (is_yymm)
co... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,008 | 858,009 | u237022500 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int i[3][110000];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a = 0, b, c, d = 0, e = 0, f, g;
string s;
cin >> c;
a = c / 100, b = c % 100;
if (a <= 12 && a > 0) {
if (b <= 12 && b > 0)
cout << "AMBIIG... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int i[3][110000];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a = 0, b, c, d = 0, e = 0, f, g;
string s;
cin >> c;
a = c / 100, b = c % 100;
if (a <= 12 && a > 0) {
if (b <= 12 && b > 0)
cout << "AMBIGU... | [
"literal.string.change",
"io.output.change"
] | 858,022 | 858,023 | u331081465 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MAX 300000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int S, up, down, hup, hdown;
cin >> S;
up = S / 100;
down = S % 100;
hup = up ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MAX 300000
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int S, up, down, hup, hdown;
cin >> S;
up = S / 100;
down = S % 100;
hup = up ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 858,028 | 858,029 | u591914971 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
bool flag1 = false, flag2 = false;
int s1 = s / 100, s2 = s % 100;
if (1 <= s1 && s1 <= 12) {
flag1 = true;
}
if (1 <= s2 && s2 <= 12) {
flag2 = true;
}
if (flag1 == true && flag1 == true) {
cout << "AMBIGUOUS" <<... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
bool flag1 = false, flag2 = false;
int s1 = s / 100, s2 = s % 100;
if (1 <= s1 && s1 <= 12) {
flag1 = true;
}
if (1 <= s2 && s2 <= 12) {
flag2 = true;
}
if (flag1 == true && flag2 == true) {
cout << "AMBIGUOUS" <<... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,030 | 858,031 | u185037583 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag1 = 0, flag2 = 0;
if (S.at(0) == '0' && S.at(0) != '0')
flag1 = 1;
else if (S.at(0) == '1') {
if ('0' <= S.at(1) && S.at(1) <= '2')
flag1 = 1;
}
if (S.at(2) == '0' && S.at(2) != '0')
flag2 = 1;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag1 = 0, flag2 = 0;
if (S.at(0) == '0' && S.at(1) != '0')
flag1 = 1;
else if (S.at(0) == '1') {
if ('0' <= S.at(1) && S.at(1) <= '2')
flag1 = 1;
}
if (S.at(2) == '0' && S.at(3) != '0')
flag2 = 1;
else... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 858,049 | 858,050 | u347057617 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define RANGE(i, a, b) for (int i = (a); i <= (b); i++)
#define RANGER(i, a, b) for (int i = (b); i >= (a); i++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define RANGE(i, a, b) for (int i = (a); i <= (b); i++)
#define RANGER(i, a, b) for (int i = (b); i >= (a); i++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) ... | [
"literal.string.change",
"io.output.change"
] | 858,057 | 858,058 | u891876603 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a = 0, b = 0;
cin >> s;
if (s / 100 > 0 && s / 100 <= 12)
a = 1;
if (s - (s / 100) * 100 > 0 && s - (s / 100) * 100 <= 12)
b = 1;
if (b == 1 && a == 1)
cout << "AMBIGUOUS";
else if (a + b == 0)
cout << "NO";
else if (a == 1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a = 0, b = 0;
cin >> s;
if (s / 100 > 0 && s / 100 <= 12)
a = 1;
if (s - (s / 100) * 100 > 0 && s - (s / 100) * 100 <= 12)
b = 1;
if (b == 1 && a == 1)
cout << "AMBIGUOUS";
else if (a + b == 0)
cout << "NA";
else if (a == 1)... | [
"literal.string.change",
"io.output.change"
] | 858,059 | 858,060 | u621527413 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (l >= 1 || l <= 12) {
if (r > 12 && r == 0) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
} else {
if (r > 12 || r == 0) {
cout << "NA" << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (l >= 1 && l <= 12) {
if (r > 12 || r == 0) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
} else {
if (r > 12 || r == 0) {
cout << "NA" << en... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 858,066 | 858,067 | u796877631 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (l >= 1 || l <= 12) {
if (r > 12 || r == 0) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
} else {
if (r > 12 || r == 0) {
cout << "NA" << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (l >= 1 && l <= 12) {
if (r > 12 || r == 0) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
} else {
if (r > 12 || r == 0) {
cout << "NA" << en... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 858,068 | 858,067 | u796877631 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string s1 = s.substr(0, 2), s2 = s.substr(2, 2);
int zero = '0';
int n = ((int)s1[0] - zero) * 10 + ((int)s1[1] - zero);
int m = ((int)s2[0] - zero) * 10 + ((int)s2[1] - zero);
// cout<<n<<endl<<m<<endl;
if ((n <= 12 && n >... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string s1 = s.substr(0, 2), s2 = s.substr(2, 2);
int zero = '0';
int n = ((int)s1[0] - zero) * 10 + ((int)s1[1] - zero);
int m = ((int)s2[0] - zero) * 10 + ((int)s2[1] - zero);
// cout<<n<<endl<<m<<endl;
if ((n <= 12 && n >... | [
"literal.string.change",
"io.output.change"
] | 858,069 | 858,070 | u844640682 | cpp |
p03042 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const ll INF = 100000000000000001;
const double PI = 3.141592653589;
int main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + (s[1] - ... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long l;
typedef pair<int, int> P;
const ll INF = 100000000000000001;
const double PI = 3.141592653589;
int main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + (s[1] - ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 858,080 | 858,081 | u634999820 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int R = S % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12)
cout << "AMBIGUOUOS" << endl;
else
cout << "MMYY" << endl;
} else {
if (R >= 1 && R <= 12)
cout << "YYMM" << endl;
e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int R = S % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (R >= 1 && R <= 12)
cout << "YYMM" << endl;
el... | [
"literal.string.change",
"io.output.change"
] | 858,094 | 858,095 | u297195722 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int R = S % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12)
cout << "AMBIGOUOS" << endl;
else
cout << "YYMM" << endl;
} else {
if (R >= 1 && R <= 12)
cout << "MMYY" << endl;
el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int R = S % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (R >= 1 && R <= 12)
cout << "YYMM" << endl;
el... | [
"literal.string.change",
"io.output.change"
] | 858,096 | 858,095 | u297195722 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define... | [
"literal.string.change",
"io.output.change"
] | 858,099 | 858,100 | u450832845 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int m, y;
cin >> s;
string s1 = s.substr(0, 2);
string s2 = s.substr(2, 2);
m = atoi(s1.c_str());
y = atoi(s2.c_str());
if ((m == 0 or m > 12) and (y > 0 and y < 12)) {
cout << "YYMM" << endl;
} else if ((y == 0 or y > 12)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int m, y;
cin >> s;
string s1 = s.substr(0, 2);
string s2 = s.substr(2, 2);
m = atoi(s1.c_str());
y = atoi(s2.c_str());
if ((m == 0 or m > 12) and (y > 0 and y <= 12)) {
cout << "YYMM" << endl;
} else if ((y == 0 or y > 12... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,101 | 858,102 | u798678713 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int isMon(string s) {
if (s[0] == '0') {
if (s[1] == '0')
return 0;
return 1;
}
if (s[1] == '1') {
if (s[1] == '0' || s[1] == '1' || s[1] == '2')
return 1;
return 0;
}
return 0;
}
int main() {
string s;
cin >> s;
if (isMon(s.sub... | #include <bits/stdc++.h>
using namespace std;
int isMon(string s) {
if (s[0] == '0') {
if (s[1] == '0')
return 0;
return 1;
}
if (s[0] == '1') {
if (s[1] == '0' || s[1] == '1' || s[1] == '2')
return 1;
return 0;
}
return 0;
}
int main() {
string s;
cin >> s;
if (isMon(s.sub... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 858,111 | 858,112 | u952130512 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | [
"literal.string.change",
"io.output.change"
] | 858,113 | 858,114 | u971166345 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a, ua, da;
istringstream ss;
cin >> s;
ss = istringstream(s);
ss >> a;
ua = a / 100;
da = a % 100;
if ((ua >= 0 && ua < 100 && da > 0 && da < 13) &&
(ua > 0 && ua < 13 && da >= 0 && da < 100)) {
cout << "AMBIGUOUS" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a, ua, da;
istringstream ss;
cin >> s;
ss = istringstream(s);
ss >> a;
ua = a / 100;
da = a % 100;
if ((ua >= 0 && ua < 100 && da > 0 && da < 13) &&
(ua > 0 && ua < 13 && da >= 0 && da < 100)) {
cout << "AMBIGUOUS" <... | [
"literal.string.change",
"io.output.change"
] | 858,130 | 858,131 | u663775885 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, yy, mm, y, m;
cin >> s;
y = m = 0;
yy = s / 100;
mm = s % 100;
if (mm > 0 && mm <= 12) {
y = 1;
}
if (yy > 0 && yy <= 12) {
m = 1;
}
if (y == 1 && m == 1) {
cout << "AMBIGUOUS" << endl;
} else if (m == 1) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, yy, mm, y, m;
cin >> s;
y = m = 0;
yy = s / 100;
mm = s % 100;
if (mm > 0 && mm <= 12) {
m = 1;
}
if (yy > 0 && yy <= 12) {
y = 1;
}
if (y == 1 && m == 1) {
cout << "AMBIGUOUS" << endl;
} else if (m == 1) {
cout <<... | [
"assignment.variable.change",
"identifier.change"
] | 858,132 | 858,133 | u144029820 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N % 100;
int b = (b - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
} else if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
} else if ((0 < b && b <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N % 100;
int b = (N - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
} else if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
} else if ((0 < b && b <... | [
"identifier.change",
"expression.operation.binary.change"
] | 858,134 | 858,135 | u387371565 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N % 100;
int b = (b - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
}
if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
}
if ((0 < b && b <= 12) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N % 100;
int b = (N - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
} else if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
} else if ((0 < b && b <... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 858,136 | 858,135 | u387371565 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N / 100;
int b = (b - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
}
if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "MMYY" << endl;
}
if ((0 < b && b <= 12) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N % 100;
int b = (N - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
} else if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
} else if ((0 < b && b <... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"literal.string.change",
"io.output.change"
] | 858,137 | 858,135 | u387371565 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N / 100;
int b = (N - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
} else if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
} else if ((0 < b && b <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N % 100;
int b = (N - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
} else if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
} else if ((0 < b && b <... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 858,138 | 858,135 | u387371565 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N / 100;
int b = (b - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
}
if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
}
if ((0 < b && b <= 12) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N % 100;
int b = (N - a) / 100;
if ((0 < a && a <= 12) && (0 < b && b <= 12)) {
cout << "AMBIGUOUS" << endl;
} else if ((0 < a && a <= 12) && (0 == b || b > 12)) {
cout << "YYMM" << endl;
} else if ((0 < b && b <... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 858,139 | 858,135 | u387371565 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int m, u;
m = s / 100;
u = s % 100;
if (m <= 12 && m > 0) {
if (u <= 12 && u > 0) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else if (u <= 12 && u > 0) {
cout << "YYMM" << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int m, u;
m = s / 100;
u = s % 100;
if (m <= 12 && m > 0) {
if (u <= 12 && u > 0) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else if (u <= 12 && u > 0) {
cout << "YYMM" << endl... | [
"literal.string.change",
"io.output.change"
] | 858,160 | 858,161 | u768638812 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
void ABC126B() {
string S;
cin >> S;
int a = stoi(S.substr(0, 2));
int b = stoi(S.substr(2, 2));
bool a1 = false;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
void ABC126B() {
string S;
cin >> S;
int a = stoi(S.substr(0, 2));
int b = stoi(S.substr(2, 2));
bool a1 = false;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,162 | 858,163 | u227117171 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi... | [
"literal.string.change",
"io.output.change"
] | 858,173 | 858,174 | u273004731 | cpp |
p03042 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int A = S / 100;
int B = S % 100;
if (A = 0)
A = 100;
if (B = 0)
B = 100;
if (A <= 12 && B <= 12)
cout << "AMBIGUOUS" << endl;
else if (A > 12 && B <= 12)
cout << "YYMM" << endl;
else if (A... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int A = S / 100;
int B = S % 100;
if (A == 0)
A = 100;
if (B == 0)
B = 100;
if (A <= 12 && B <= 12)
cout << "AMBIGUOUS" << endl;
else if (A > 12 && B <= 12)
cout << "YYMM" << endl;
else if ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 858,189 | 858,190 | u127314985 | cpp |
p03042 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"literal.string.change",
"io.output.change"
] | 858,191 | 858,192 | u237054088 | cpp |
p03042 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"literal.number.change",
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 858,193 | 858,192 | u237054088 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
i... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
i... | [
"literal.string.change",
"assignment.value.change"
] | 858,204 | 858,205 | u680707192 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
stri... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
stri... | [
"literal.string.change",
"io.output.change"
] | 858,206 | 858,207 | u227379863 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
stri... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
stri... | [
"literal.string.change",
"io.output.change"
] | 858,208 | 858,207 | u227379863 | cpp |
p03042 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define alfc 32
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a)... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define alfc 32
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a)... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 858,212 | 858,213 | u456658814 | cpp |
p03042 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define alfc 32
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a)... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define alfc 32
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a)... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 858,214 | 858,213 | u456658814 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100; //上2つ
int b = s % 100; //下2つ
bool aRes;
bool bRes;
if (12 >= a && a >= 1) {
aRes = true;
}
if (12 >= b && b >= 1) {
bRes = true;
}
if (aRes && bRes) {
cout << "AMBIGUOUS" << endl;
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100; //上2つ
int b = s % 100; //下2つ
bool aRes = false;
bool bRes = false;
if (12 >= a && a >= 1) {
aRes = true;
}
if (12 >= b && b >= 1) {
bRes = true;
}
if (aRes && bRes) {
cout << "AMBIGUOUS" ... | [
"variable_declaration.value.change"
] | 858,218 | 858,219 | u318027064 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | [
"literal.string.change",
"io.output.change"
] | 858,224 | 858,225 | u478997153 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Int int64_t
void printVec(std::vector<int> &vec) {
std::cout << "";... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Int int64_t
void printVec(std::vector<int> &vec) {
std::cout << "";... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 858,228 | 858,229 | u565624841 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, L, R;
cin >> i;
L = i / 100;
R = i % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (R >= 1 && R <= 12) {
cout << "MMYY" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, L, R;
cin >> i;
L = i / 100;
R = i % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (R >= 1 && R <= 12) {
cout << "YYMM" ... | [
"literal.string.change",
"io.output.change"
] | 858,230 | 858,231 | u995485610 | cpp |
p03042 | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_D... | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 111111111;
const int c_mINF = -111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int c_D... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 858,234 | 858,235 | u433195318 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool yymm = 0;
bool mmyy = 0;
if (stoi(s.substr(0, 2)) <= 12 && stoi(s.substr(0, 2)) != 0)
mmyy = 1;
if (stoi(s.substr(2, 2)) <= 12 && stoi(s.substr(2, 2)) != 0)
yymm = 1;
if (mmyy & yymm)
cout << "AMBIGOUS" << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool yymm = 0;
bool mmyy = 0;
if (stoi(s.substr(0, 2)) <= 12 && stoi(s.substr(0, 2)) != 0)
mmyy = 1;
if (stoi(s.substr(2, 2)) <= 12 && stoi(s.substr(2, 2)) != 0)
yymm = 1;
if (mmyy & yymm)
cout << "AMBIGUOUS" << ... | [
"literal.string.change",
"io.output.change"
] | 858,236 | 858,237 | u168860135 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100, b = s % 100;
bool yymm, mmyy;
if (b >= 1 && b <= 12) {
yymm = true;
}
if (a >= 1 && a <= 12) {
mmyy = true;
}
if (yymm && mmyy) {
cout << "AMBIGUOUS" << endl;
} else if (yymm) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100, b = s % 100;
bool yymm = false, mmyy = false;
if (b >= 1 && b <= 12) {
yymm = true;
}
if (a >= 1 && a <= 12) {
mmyy = true;
}
if (yymm && mmyy) {
cout << "AMBIGUOUS" << endl;
} else... | [
"variable_declaration.value.change"
] | 858,238 | 858,239 | u167161639 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
char a[4];
int n, k;
int main() {
scanf("%s", a);
int x = (a[0] - '0') * 10 + (a[1] - '0');
int y = (a[2] - '0') * 10 + (a[1] - '0');
if (x > 0 && x <= 12 && y > 0 && y <= 12)
printf("AMBIGUOUS\n");
else if (y <= 12 && y > 0 && x >= 0 && x < 100)
printf(... | #include <bits/stdc++.h>
using namespace std;
char a[4];
int n, k;
int main() {
scanf("%s", a);
int x = (a[0] - '0') * 10 + (a[1] - '0');
int y = (a[2] - '0') * 10 + (a[3] - '0');
if (x > 0 && x <= 12 && y > 0 && y <= 12)
printf("AMBIGUOUS\n");
else if (y <= 12 && y > 0 && x >= 0 && x < 100)
printf(... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 858,240 | 858,241 | u623136228 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int a, b;
a = (str[0] - '0') * 10 + (str[1] - '0');
b = (str[2] - '0') * 10 + (str[3] - '0');
string ans = "";
if (a > 0 && a <= 12 && b > 0 && b <= 12) {
ans = "AMBIGUOUS";
} else if (a > 0 && a <= 12 && b >= 0 && b... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int a, b;
a = (str[0] - '0') * 10 + (str[1] - '0');
b = (str[2] - '0') * 10 + (str[3] - '0');
string ans = "";
if (a > 0 && a <= 12 && b > 0 && b <= 12) {
ans = "AMBIGUOUS";
} else if (a > 0 && a <= 12 && b >= 0 && b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,242 | 858,243 | u863841238 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int a, b;
a = (str[0] - '0') * 10 + (str[1] - '0');
b = (str[2] - '0') * 10 + (str[3] - '0');
string ans = "";
if (a > 0 && a <= 12 && b > 0 && b <= 12) {
ans = "AMBIGUOUS";
} else if (a > 0 && a <= 12 && b >= 0 && b... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int a, b;
a = (str[0] - '0') * 10 + (str[1] - '0');
b = (str[2] - '0') * 10 + (str[3] - '0');
string ans = "";
if (a > 0 && a <= 12 && b > 0 && b <= 12) {
ans = "AMBIGUOUS";
} else if (a > 0 && a <= 12 && b >= 0 && b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,244 | 858,243 | u863841238 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int a, b;
a = (str[0] - '0') * 10 + (str[1] - '0');
b = (str[2] - '0') * 10 + (str[3] - '0');
string ans = "";
if (a > 0 && a <= 12 && b > 0 && b <= 12) {
ans = "AMBIGUOUS";
} else if (a > 0 && a <= 12 && b >= 0 && b... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int a, b;
a = (str[0] - '0') * 10 + (str[1] - '0');
b = (str[2] - '0') * 10 + (str[3] - '0');
string ans = "";
if (a > 0 && a <= 12 && b > 0 && b <= 12) {
ans = "AMBIGUOUS";
} else if (a > 0 && a <= 12 && b >= 0 && b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,245 | 858,243 | u863841238 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int former = std::stoi(S.substr(0, 2));
int latter = std::stoi(S.substr(2, 2));
// cout << former << endl; //test
// cout << latter << endl; //test
if (former == 0) {
//この時点で前者はY確定
if (latter == 0) {
//後者もYはありえ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int former = std::stoi(S.substr(0, 2));
int latter = std::stoi(S.substr(2, 2));
// cout << former << endl; //test
// cout << latter << endl; //test
if (former == 0) {
//この時点で前者はY確定
if (latter == 0) {
//後者もYはありえ... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 858,248 | 858,249 | u132364782 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] = {};
const long long INF = 1LL << 60;
template <class T> inline bo... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
long long dp[3][100100] = {};
const long long INF = 1LL << 60;
template <class T> inline bo... | [
"literal.string.change",
"io.output.change"
] | 858,260 | 858,261 | u959822889 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, s1, s2;
cin >> s;
s1 = s / 100;
s2 = s % 100;
bool flag = true;
if (s1 < 12 && s1 > 0)
if (s2 == 0 || s2 > 12) {
cout << "MMYY" << endl;
flag = false;
}
if (s2 < 12 && s2 > 0)
if (s1 == 0 || s1 > 12) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, s1, s2;
cin >> s;
s1 = s / 100;
s2 = s % 100;
bool flag = true;
if (s1 <= 12 && s1 > 0)
if (s2 == 0 || s2 > 12) {
cout << "MMYY" << endl;
flag = false;
}
if (s2 <= 12 && s2 > 0)
if (s1 == 0 || s1 > 12) {
cout ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,266 | 858,267 | u366115355 | cpp |
p03042 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
string a = s.substr(0, 2);
string b = s.substr(2, 2);
int flag = 0;
if (1 <= stoi(a) && stoi(a) <= 12) {
flag |= 0b10;
}
if (1 <= stoi(b) && stoi(b) <= 12) {
flag |= 0b01;
}
if (flag & 0b11 == ... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
string a = s.substr(0, 2);
string b = s.substr(2, 2);
int flag = 0;
if (1 <= stoi(a) && stoi(a) <= 12) {
flag |= 0b10;
}
if (1 <= stoi(b) && stoi(b) <= 12) {
flag |= 0b01;
}
if ((flag & 0b11) =... | [
"control_flow.branch.if.condition.change"
] | 858,272 | 858,273 | u680087927 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
string S;
cin >> S;
string first = S.substr(0, 2), second = S.substr(2, 2);
int first_num = atoi(first.c_str()), second_num = atoi(second.c_str());
bool first_month = false, second_month = false;
if (1 <= first... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
string S;
cin >> S;
string first = S.substr(0, 2), second = S.substr(2, 2);
int first_num = atoi(first.c_str()), second_num = atoi(second.c_str());
bool first_month = false, second_month = false;
if (1 <= first... | [
"literal.string.change",
"io.output.change"
] | 858,274 | 858,275 | u380928000 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
cout << (s / 100 >= 1 && s / 100 <= 12
? s % 100 >= 1 && s % 100 <= 12 ? "AMBIGIOUS" : "MMYY"
: s % 100 >= 1 && s % 100 <= 12 ? "YYMM"
: "NA");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
cout << (s / 100 >= 1 && s / 100 <= 12
? s % 100 >= 1 && s % 100 <= 12 ? "AMBIGUOUS" : "MMYY"
: s % 100 >= 1 && s % 100 <= 12 ? "YYMM"
: "NA");
return 0;
} | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 858,287 | 858,288 | u930561195 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, f, n) for (int i = (f); (i) < (f); i++)
int main() {
int target;
cin >> target;
int head = target / 100;
int tail = target % 100;
if (1 <= head && head <= 12) {
if (1 <= tail && tail <= 12) {
cout << "AMBIGUOUS" << endl;
} else
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, f, n) for (int i = (f); (i) < (f); i++)
int main() {
int target;
cin >> target;
int head = target / 100;
int tail = target % 100;
if (1 <= head && head <= 12) {
if (1 <= tail && tail <= 12) {
cout << "AMBIGUOUS" << endl;
} else
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 858,289 | 858,290 | u873269440 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
bool month(int x) { return x >= 0 && x <= 12; }
int main() {
string str;
cin >> str;
bool first = month(stoi(str.substr(0, 2)));
bool second = month(stoi(str.substr(2, 2)));
if (first && second)
cout << "AMBIGUOUS";
else if (first)
cout << "MMYY";
el... | #include <bits/stdc++.h>
using namespace std;
bool month(int x) { return x >= 1 && x <= 12; }
int main() {
string str;
cin >> str;
bool first = month(stoi(str.substr(0, 2)));
bool second = month(stoi(str.substr(2, 2)));
if (first && second)
cout << "AMBIGUOUS";
else if (first)
cout << "MMYY";
el... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 858,298 | 858,299 | u676654593 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int A, B;
A = S / 100;
B = S % 100;
if (1 <= A, A <= 12) {
if (1 <= B, B <= 12) {
cout << "AMBIGUOUS'" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= B, B <= 12) {
cout << "YYMM" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int A, B;
A = S / 100;
B = S % 100;
if (1 <= A && A <= 12) {
if (1 <= B && B <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= B && B <= 12) {
cout << "YY... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 858,300 | 858,301 | u816390432 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int A, B;
A = S / 100;
B = S % 100;
if (1 <= A, A <= 12) {
if (1 <= B, B <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= B, B <= 12) {
cout << "YYMM" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int A, B;
A = S / 100;
B = S % 100;
if (1 <= A && A <= 12) {
if (1 <= B && B <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= B && B <= 12) {
cout << "YY... | [
"control_flow.branch.if.condition.change"
] | 858,302 | 858,301 | u816390432 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
// cout << S;
string c12;
c12[0] = S[0];
c12[1] = S[1];
int i12 = stoi(c12);
string c34;
c34[0] = S[3];
c34[1] = S[4];
int i34 = stoi(c34);
if (1 <= i12 && i12 <= 12) {
if (1 <= i34 && i34 <=... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S;
cin >> S;
// cout << S;
string c12;
c12[0] = S[0];
c12[1] = S[1];
int i12 = stoi(c12);
string c34;
c34[0] = S[2];
c34[1] = S[3];
int i34 = stoi(c34);
if (1 <= i12 && i12 <= 12) {
if (1 <= i34 && i34 <=... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 858,303 | 858,304 | u616901930 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
if (1 <= a <= 12) {
if (1 <= b <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= b <= 12)
cout << "YYMM" << endl;
else
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= b && b <= 12)
cout << "YYMM" << endl;
... | [
"control_flow.branch.if.condition.change"
] | 858,309 | 858,310 | u469953228 | cpp |
p03042 | #include <iostream>
using namespace std;
int main(void) {
int s;
cin >> s;
if (s / 100 >= 1 && s / 100 <= 12) {
if (s % 100 >= 1 && s / 100 <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (s % 100 >= 1 && s % 100 <= 12)
cout << "YYMM" << endl;
els... | #include <iostream>
using namespace std;
int main(void) {
int s;
cin >> s;
if (s / 100 >= 1 && s / 100 <= 12) {
if (s % 100 >= 1 && s % 100 <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (s % 100 >= 1 && s % 100 <= 12)
cout << "YYMM" << endl;
els... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 858,323 | 858,324 | u297477387 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int R = S % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12) {
printf("AMBIGOUS\n");
} else {
printf("MMYY\n");
}
} else {
if (R >= 1 && R <= 12) {
printf("YYMM\n");
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int R = S % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12) {
printf("AMBIGUOUS\n");
} else {
printf("MMYY\n");
}
} else {
if (R >= 1 && R <= 12) {
printf("YYMM\n");
} e... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 858,329 | 858,330 | u456633003 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int l, r;
l = s[0] - '0' * 10 + s[1] - '0';
r = s[2] - '0' * 10 + s[3] - '0';
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "M... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int l, r;
l = (s[0] - '0') * 10 + s[1] - '0';
r = (s[2] - '0') * 10 + s[3] - '0';
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout <... | [] | 858,335 | 858,336 | u401900157 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,337 | 858,338 | u373984877 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int Y = s / 100, M = s % 100;
if (Y > 0 && Y < 13 && M < 13 && M > 0)
cout << "AMBIGUOUS";
else if (M > 0 && M < 13)
cout << "MMYY";
else if (Y < 13 && Y > 0)
cout << "YYMM";
else
cout << "NA";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int Y = s / 100, M = s % 100;
if (Y > 0 && Y < 13 && M < 13 && M > 0)
cout << "AMBIGUOUS";
else if (M > 0 && M < 13)
cout << "YYMM";
else if (Y < 13 && Y > 0)
cout << "MMYY";
else
cout << "NA";
}
| [
"literal.string.change",
"io.output.change"
] | 858,341 | 858,342 | u532401120 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L = n / 100;
int R = n % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= R && R <= 12) {
c... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L = n / 100;
int R = n % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= R && R <= 12) {
c... | [
"control_flow.branch.else.add"
] | 858,350 | 858,351 | u953753178 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L = n / 100;
int R = n % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
}
cout << "MMYY" << endl;
} else {
if (1 <= R && R <= 12) {
cout << "YYMM" <... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L = n / 100;
int R = n % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= R && R <= 12) {
c... | [
"control_flow.branch.else.add"
] | 858,352 | 858,351 | u953753178 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L = n / 100;
int R = n % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
}
cout << "MMYY" << endl;
} else if (1 <= R && R <= 12) {
cout << "YYMM" << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L = n / 100;
int R = n % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= R && R <= 12) {
c... | [
"control_flow.branch.else.add"
] | 858,353 | 858,351 | u953753178 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (1 <= s / 100 && s / 100 <= 12) {
if (1 <= s % 100 && s % 100 <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (1 <= s % 100 && s % 100 <= 12) {
cout << "MMYY" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (1 <= s / 100 && s / 100 <= 12) {
if (1 <= s % 100 && s % 100 <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= s % 100 && s % 100 <= 12) {
cout << "YYMM" << ... | [
"literal.string.change",
"io.output.change"
] | 858,354 | 858,355 | u244626757 | cpp |
p03042 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int i, x, y;
cin >> i;
x = i % 100;
y = i / 100;
if (x >= 0 && y >= 0) {
if (y >= 1 && y <= 1211111200) {
if (x >= 1 && x <= 12)
cout << "AMBIGUOUS";
if (x > 12 || x == 0)
cout << "MMYY";
}
i... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int i, x, y;
cin >> i;
x = i % 100;
y = i / 100;
if (x >= 0 && y >= 0) {
if (y >= 1 && y <= 12) {
if (x >= 1 && x <= 12)
cout << "AMBIGUOUS";
if (x > 12 || x == 0)
cout << "MMYY";
}
if (y > 1... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 858,356 | 858,357 | u218552319 | cpp |
p03042 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + s[1] - '0';
int b = (s[2] - '0') * 10 + s[3] - '0'... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + s[1] - '0';
int b = (s[2] - '0') * 10 + s[3] - '0'... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,358 | 858,359 | u654240084 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100, b = s % 100;
string ans = "NA";
if (a > 0 && a < 13 && b > 0 && b < 13)
ans = "AMBIGUOUS";
if (a > 0 && a < 13 && b == 0 || b > 12)
ans = "MMYY";
if (a == 0 || a > 12 && b > 0 && b < 13)
ans = "YYMM";... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100, b = s % 100;
string ans = "NA";
if (a > 0 && a < 13 && b > 0 && b < 13)
ans = "AMBIGUOUS";
if (a > 0 && a < 13 && (b == 0 || b > 12))
ans = "MMYY";
if ((a == 0 || a > 12) && b > 0 && b < 13)
ans = "YY... | [
"control_flow.branch.if.condition.change"
] | 858,360 | 858,361 | u117348081 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, S1, S2;
int A, B;
cin >> S;
S1 = S.substr(0, 2);
S2 = S.substr(2, 2);
A = stoi(S1);
B = stoi(S2);
if (A <= 12 && A != 0 && B <= 12 && B != 0) {
cout << "AMBIGUOUS" << endl;
} else if ((B > 13 || B == 0) && (A > 13 || A == 0)) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, S1, S2;
int A, B;
cin >> S;
S1 = S.substr(0, 2);
S2 = S.substr(2, 2);
A = stoi(S1);
B = stoi(S2);
if (A <= 12 && A != 0 && B <= 12 && B != 0) {
cout << "AMBIGUOUS" << endl;
} else if ((B > 12 || B == 0) && (A > 12 || A == 0)) {... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 858,362 | 858,363 | u170324846 | cpp |
p03042 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (l >= 1 && l <= 12) {
if (r >= 1 && r <= 12)
cout << "AMBIGOUS";
else
cout << "MMYY";
} else if (r >= 1 && r <= 12)
cout << "YYMM";
else
cout << ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (l >= 1 && l <= 12) {
if (r >= 1 && r <= 12)
cout << "AMBIGUOUS";
else
cout << "MMYY";
} else if (r >= 1 && r <= 12)
cout << "YYMM";
else
cout <<... | [
"literal.string.change",
"io.output.change"
] | 858,370 | 858,371 | u188903786 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
int l = s / 100;
int r = s % 100;
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else if (1 <= r && r <= 12) {
cout << "YYMM" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else if (1 <= r && r <= 12) {
cout << "YYMM" << endl;
... | [] | 858,372 | 858,373 | u392569193 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
for (int c = 1; c <= n - 1; c++) {
ll score = 0;
vector<char> v(n, '0');
for (int x = 0; (x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = 0;
for (int c = 1; c <= n - 1; c++) {
ll score = 0;
vector<char> v(n, '0');
for (int x = 0; (x... | [
"assignment.value.change"
] | 858,379 | 858,380 | u562608561 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long... | [
"control_flow.loop.for.condition.change",
"variable_declaration.value.change",
"expression.operation.unary.remove"
] | 858,408 | 858,409 | u342075214 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
/* y = (A-B)*x
* y = (A-B)*x + b */
int N;
cin >> N;
long long s[N];
for (int i = 0; i < N; i++)
cin >> s[i];
long long ans = 0;
for (int i = 1; i < N - 1; i++) {
long long f = 0;
for (int j = i, k = N - 1 - i; k > 0; j += ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
/* y = (A-B)*x
* y = (A-B)*x + b */
int N;
cin >> N;
long long s[N];
for (int i = 0; i < N; i++)
cin >> s[i];
long long ans = 0;
for (int i = 1; i < N - 1; i++) {
long long f = 0;
for (int j = i, k = N - 1 - i; k > i; j += ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 858,415 | 858,416 | u018916376 | cpp |
p03034 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define ln '\n'
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull;
typede... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define ln '\n'
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull;
typede... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 858,419 | 858,420 | u842939260 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXN 100000
#define DEBUG true
int N, s[MAXN + 3];
bool visited[MAXN + 3];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &s[i]);
LL answer = 0;
for (int C = 1; C < N - 1; C++) {
LL currentProfit = 0... | #include <bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXN 100000
#define DEBUG false
int N, s[MAXN + 3];
bool visited[MAXN + 3];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &s[i]);
LL answer = 0;
for (int C = 1; C < N - 1; C++) {
LL currentProfit = ... | [
"misc.opposites",
"preprocessor.define.value.change"
] | 858,428 | 858,429 | u569149712 | cpp |
p03034 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <q... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <q... | [] | 858,440 | 858,441 | u736004166 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define show(x) \
for (auto i : x) { \
cout << i << " "; ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define show(x) \
for (auto i : x) { \
cout << i << " "; ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,442 | 858,443 | u317715099 | cpp |
p03034 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [] | 858,448 | 858,449 | u498141549 | cpp |
p03034 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"variable_declaration.type.change"
] | 858,450 | 858,449 | u498141549 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100100;
int N;
ll s[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin >> N;
for (int i = 0; i < N; i++)
cin >> s[i];
ll ans = 0;
for (int i = 1; i < N; i++) {
ll res = 0;
for (int j = 0; j < N; j += i) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100100;
int N;
ll s[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin >> N;
for (int i = 0; i < N; i++)
cin >> s[i];
ll ans = 0;
for (int i = 1; i < N; i++) {
ll res = 0;
for (int j = 0; j + i < N; j += i... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,456 | 858,457 | u409373192 | cpp |
p03034 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 858,474 | 858,475 | u284124505 | cpp |
p03034 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"identifier.change"
] | 858,481 | 858,482 | u378419207 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define rev(i, s, e) for (i64(i) = (e); (i)-- > (s);)
#define all(x) x.begin(), x.end()
int main() {
i64 N;
cin >> N;
vector<i64> s(N);
rep(i, 0, N) cin >> s[i];
i64 ans = s[0] + s[... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define rev(i, s, e) for (i64(i) = (e); (i)-- > (s);)
#define all(x) x.begin(), x.end()
int main() {
i64 N;
cin >> N;
vector<i64> s(N);
rep(i, 0, N) cin >> s[i];
i64 ans = s[0] + s[... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 858,485 | 858,486 | u852585808 | cpp |
p03034 | #include "bits/stdc++.h"
using namespace std;
typedef long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li n;
cin >> n;
vector<li> ss(n);
for (int i = 0; i < n; ++i) {
cin >> ss[i];
}
li ans = 0;
for (int d = 1; d < n; ++d) {
li sum = 0;
set<li> lvisit;
for (int l ... | #include "bits/stdc++.h"
using namespace std;
typedef long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li n;
cin >> n;
vector<li> ss(n);
for (int i = 0; i < n; ++i) {
cin >> ss[i];
}
li ans = 0;
for (int d = 1; d < n; ++d) {
li sum = 0;
set<li> lvisit;
for (int l ... | [] | 858,491 | 858,492 | u817026203 | cpp |
p03034 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, A[100000], sco, ans;
set<ll> se;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
for (ll c = 1; c < n; c++) {
se.clear();
sco = 0;
for (ll x = 1;; x++) {
if (c * x >= n)
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a, A[100000], sco, ans;
set<ll> se;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
for (ll c = 1; c < n; c++) {
se.clear();
sco = 0;
for (ll x = 1;; x++) {
if (c * x >= n)
... | [] | 858,499 | 858,500 | u050428930 | cpp |
p03034 | #include "bits/stdc++.h"
using namespace std;
void solve() {
int n;
cin >> n;
vector<long> as(n);
for (int i = 0; i < n; i++) {
cin >> as[i];
}
long ans = 0;
vector<int> vst(n);
for (int d = 1; d <= (n - 1) / 2; d++) {
long res = 0;
fill(vst.begin(), vst.end(), 0);
for (int k = 0; (k +... | #include "bits/stdc++.h"
using namespace std;
void solve() {
int n;
cin >> n;
vector<long> as(n);
for (int i = 0; i < n; i++) {
cin >> as[i];
}
long ans = 0;
vector<int> vst(n);
for (int d = 1; d <= (n - 1) / 2; d++) {
long res = 0;
fill(vst.begin(), vst.end(), 0);
for (int k = 0; (k +... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 858,528 | 858,529 | u344412812 | cpp |
p03034 | #include <algorithm>
#include <iostream>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int inf = 1e18;
int N;
int s[100000];
int calc(int A, int B) {
// printf("A = %lld, B = %lld\n",A,B);
int sum = 0;
int x = 0;
// while(x < N) {
while (true) {
int ... | #include <algorithm>
#include <iostream>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int inf = 1e18;
int N;
int s[100000];
int calc(int A, int B) {
// printf("A = %lld, B = %lld\n",A,B);
int sum = 0;
int x = 0;
// while(x < N) {
while (true) {
int ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 858,562 | 858,563 | u653699618 | cpp |
p03034 | #include <algorithm>
#include <iostream>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int inf = 1e18;
int N;
int s[100000];
int calc(int A, int B) {
// printf("A = %lld, B = %lld\n",A,B);
int sum = 0;
int x = 0;
// while(x < N) {
while (true) {
int ... | #include <algorithm>
#include <iostream>
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int inf = 1e18;
int N;
int s[100000];
int calc(int A, int B) {
// printf("A = %lld, B = %lld\n",A,B);
int sum = 0;
int x = 0;
// while(x < N) {
while (true) {
int ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 858,564 | 858,563 | u653699618 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int s[N];
for (int i = 0; i < N; i++)
cin >> s[i];
long long ans = 0;
int passed[N] = {};
for (int c = 1; c < N; c++) {
long long point = 0;
for (int k = 0; k < N; k++) {
int s1 = N - 1 - k * c;
int s2 = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int s[N];
for (int i = 0; i < N; i++)
cin >> s[i];
long long ans = 0;
int passed[N] = {};
for (int c = 1; c < N; c++) {
long long point = 0;
for (int k = 0; k < N; k++) {
int s1 = N - 1 - k * c;
int s2 = ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 858,571 | 858,572 | u303454114 | cpp |
p03034 | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T> bool chmin(T &a, T b) {
i... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T> bool chmin(T &a, T b) {
i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 858,573 | 858,574 | u924339359 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.