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 |
|---|---|---|---|---|---|---|---|
p03034 | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> s(N);
for (auto &i : s)
cin >> i;
long ans{0};
for (unsigned long i = 1; i < N; ++i) {
long tmp{0};
for (unsigned long j = 0, k = N - 1; k > 0 && (k % i != 0 || j < k);
j += i, k -= i)
... | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> s(N);
for (auto &i : s)
cin >> i;
long ans{0};
for (unsigned long i = 1; i < N; ++i) {
long tmp{0};
for (unsigned long j = 0, k = N - 1; k > i && (k % i != 0 || j < k);
j += i, k -= i)
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 858,579 | 858,580 | u462437857 | cpp |
p03034 | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> s(N);
for (auto &i : s)
cin >> i;
long ans{0};
for (unsigned long i = 1; i < N; ++i) {
long tmp{0};
for (unsigned long j = 0, k = N - 1; (k % i != 0 || j < k); j += i, k -= i)
ans = max(an... | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> s(N);
for (auto &i : s)
cin >> i;
long ans{0};
for (unsigned long i = 1; i < N; ++i) {
long tmp{0};
for (unsigned long j = 0, k = N - 1; k > i && (k % i != 0 || j < k);
j += i, k -= i)
... | [
"control_flow.loop.for.condition.change"
] | 858,581 | 858,580 | u462437857 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll ans = 0;
vector<ll> s(n), t(n);
rep(i, n) cin >> s[i];
rep... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll ans = 0;
vector<ll> s(n), t(n);
rep(i, n) cin >> s[i];
rep... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"expression.operator.compare.change"
] | 858,590 | 858,588 | u604231488 | cpp |
p03034 | #ifdef LOCAL111
#define _GLIBCXX_DEBUG
#else
// #define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ' ' << p.second << ')';
return os;
}
#... | #ifdef LOCAL111
#define _GLIBCXX_DEBUG
#else
// #define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ' ' << p.second << ')';
return os;
}
#... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.continue.add"
] | 858,591 | 858,592 | u412820911 | cpp |
p03034 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 858,608 | 858,609 | u450494974 | cpp |
p03034 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 858,622 | 858,623 | u780950519 | cpp |
p03034 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long s[n];
for (auto &si : s)
cin >> si;
long dp, best = 0;
for (int c = 1; c < n; c++) {
dp = 0;
for (int k = 1; k < (n - 1) / c - 1; k++) {
if ((n - 1) % c == 0 && n - 1 <= 2 * k * c)
br... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long s[n];
for (auto &si : s)
cin >> si;
long dp, best = 0;
for (int c = 1; c < n; c++) {
dp = 0;
for (int k = 1; k <= (n - 1) / c - 1; k++) {
if ((n - 1) % c == 0 && n - 1 <= 2 * k * c)
b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 858,637 | 858,638 | u956758464 | cpp |
p03034 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long s[n];
for (auto &si : s)
cin >> si;
long dp, best = 0;
for (int c = 1; c < n; c++) {
dp = 0;
for (int k = 1; k < n / c - 1; k++) {
if ((n - 1) % c == 0 && n - 1 <= 2 * k * c)
break;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long s[n];
for (auto &si : s)
cin >> si;
long dp, best = 0;
for (int c = 1; c < n; c++) {
dp = 0;
for (int k = 1; k <= (n - 1) / c - 1; k++) {
if ((n - 1) % c == 0 && n - 1 <= 2 * k * c)
b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 858,639 | 858,638 | u956758464 | cpp |
p03042 |
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
cin >> S;
string answer;
int l = S / 100;
int r = S / 100;
if (l <= 12 && l >= 1) {
if (r <= 12 && r >= 1)
answer = "AMBIGIOUS";
else
... | #include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
cin >> S;
string answer;
int l = S / 100;
int r = S % 100;
if (l <= 12 && l >= 1) {
if (r <= 12 && r >= 1)
answer = "AMBIGUOUS";
else
... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"misc.typo",
"literal.string.change",
"assignment.value.change"
] | 858,661 | 858,662 | u038582728 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
k = n % 100;
n /= 100;
if (k > 0 && k <= 12 && n > 0 && n <= 12) {
cout << "AMBIGIOUS";
} else if (k > 0 && k <= 12) {
cout << "YYMM";
} else if (n > 0 && n <= 12) {
cout << "MMYY";
} else {
cout << "NA";
}
r... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
k = n % 100;
n /= 100;
if (k > 0 && k <= 12 && n > 0 && n <= 12) {
cout << "AMBIGUOUS";
} else if (k > 0 && k <= 12) {
cout << "YYMM";
} else if (n > 0 && n <= 12) {
cout << "MMYY";
} else {
cout << "NA";
}
r... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 858,677 | 858,678 | u162126904 | cpp |
p03042 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#inclu... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#inclu... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 858,689 | 858,690 | u581385507 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int before = S / 100;
int after = S - (before * 100);
if (before == 0 || before > 12) {
if (after == 0 || after > 12) {
cout << "NA" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (after == 0 || be... | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int before = S / 100;
int after = S - (before * 100);
if (before == 0 || before > 12) {
if (after == 0 || after > 12) {
cout << "NA" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (after == 0 || af... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,698 | 858,699 | u369813073 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int ante = S / 100;
int poste = S - (S / 100) * 100;
if (ante >= 1 && ante <= 12 && poste >= 1 && poste <= 12) {
cout << "AMBIGOUS" << endl;
} else if ((ante >= 13 || ante == 0) && poste >= 1 && poste <= 12) {
cout << "YYMM" << ... | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int ante = S / 100;
int poste = S - (S / 100) * 100;
if (ante >= 1 && ante <= 12 && poste >= 1 && poste <= 12) {
cout << "AMBIGUOUS" << endl;
} else if ((ante >= 13 || ante == 0) && poste >= 1 && poste <= 12) {
cout << "YYMM" <<... | [
"literal.string.change",
"io.output.change"
] | 858,709 | 858,710 | u015187377 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
if (0 <= a && a <= 12) {
if (0 <= b && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (0 <= b && b <= 12) {
cout << "NA" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
if (0 < a && a <= 12) {
if (0 < b && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (0 < b && b <= 12) {
cout << "YYMM" << e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 858,711 | 858,712 | u977554186 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
if (0 <= a && a <= 12) {
if (0 <= b && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (0 <= b && b <= 12) {
cout << "YYMM" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
if (0 < a && a <= 12) {
if (0 < b && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (0 < b && b <= 12) {
cout << "YYMM" << e... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,713 | 858,712 | u977554186 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string str;
cin >> str;
int ue = stoi(str) / 100;
int sita = stoi(str) - ue * 100;
string ans = "NA";
if ((ue >= 1 && ue <= 12) && (sita < 1 && sita > 12)) {
ans = "MM... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string str;
cin >> str;
int ue = stoi(str) / 100;
int sita = stoi(str) - ue * 100;
string ans = "NA";
if ((ue >= 1 && ue <= 12) && (sita < 1 || sita > 12)) {
ans = "MM... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 858,716 | 858,717 | u421782399 | cpp |
p03042 | #include <iostream>
using namespace std;
int main(void) {
string S;
cin >> S;
// formatcheck
int A, B;
A = (S[0] - 0x30) * 10 + (S[1] - 0x30);
B = (S[2] - 0x30) * 10 + (S[3] - 0x30);
while (1) {
// AMBIGUOUS ?
if ((A > 0 && A <= 12) && (B > 0 && B <= 12)) {
cout << "AMBIGUOUS" << endl;
... | #include <iostream>
using namespace std;
int main(void) {
string S;
cin >> S;
// formatcheck
int A, B;
A = (S[0] - 0x30) * 10 + (S[1] - 0x30);
B = (S[2] - 0x30) * 10 + (S[3] - 0x30);
while (1) {
// AMBIGUOUS ?
if ((A > 0 && A <= 12) && (B > 0 && B <= 12)) {
cout << "AMBIGUOUS" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,722 | 858,723 | u699680099 | cpp |
p03042 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 300005;
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
char a, b, c, d;
cin >> a >> b >> c >> d;
int x = 10 * (a - '0') + b - 48;
int y = 10 * (c -... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N = 300005;
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
char a, b, c, d;
cin >> a >> b >> c >> d;
int x = 10 * (a - '0') + b - 48;
int y = 10 * (c -... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 858,726 | 858,727 | u792984973 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int s, flag = 0;
cin >> s;
if (s / 100 < 13 && s / 100 >= 1 && s % 100 < 13 && s % 100 > 0)
cout << "AMBIGUOUS";
else if (s / 100 < 13 && s / 100 >= 1 && s % 100 > 0)
cout << "YYMM";
else if (s / 100 >= 1 && s % 100 < 13 && s % 100 > 0)
cout <<... | #include <iostream>
using namespace std;
int main() {
int s, flag = 0;
cin >> s;
if (s / 100 < 13 && s / 100 >= 1 && s % 100 < 13 && s % 100 > 0)
cout << "AMBIGUOUS";
else if (s / 100 < 13 && s / 100 >= 1 && s % 100 >= 0)
cout << "MMYY";
else if (s / 100 >= 0 && s % 100 < 13 && s % 100 > 0)
cout <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change",
"literal.number.change"
] | 858,738 | 858,734 | u340494803 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100;
int b = s - a * 100;
if (a >= 1 && a <= 12 && b <= 12 && b >= 1)
cout << "AMBIGOUS" << endl;
else if (a >= 1 && a <= 12 && (b > 12 || b == 0))
cout << "MMYY" << endl;
else if (b >= 1 && b <= 12 && (a > 12... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100;
int b = s - a * 100;
if (a >= 1 && a <= 12 && b <= 12 && b >= 1)
cout << "AMBIGUOUS" << endl;
else if (a >= 1 && a <= 12 && (b > 12 || b == 0))
cout << "MMYY" << endl;
else if (b >= 1 && b <= 12 && (a > 1... | [
"literal.string.change",
"io.output.change"
] | 858,739 | 858,740 | u535810324 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100;
int b = s - a * 100;
if (a >= 1 && a <= 12 && b <= 12 && b >= 1)
cout << "AMBIGOUS" << endl;
else if (a >= 1 && a <= 12 && b > 12 || b == 0)
cout << "MMYY" << endl;
else if (b >= 1 && b <= 12 && a > 12 ||... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int a = s / 100;
int b = s - a * 100;
if (a >= 1 && a <= 12 && b <= 12 && b >= 1)
cout << "AMBIGUOUS" << endl;
else if (a >= 1 && a <= 12 && (b > 12 || b == 0))
cout << "MMYY" << endl;
else if (b >= 1 && b <= 12 && (a > 1... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 858,742 | 858,740 | u535810324 | cpp |
p03042 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"literal.string.change",
"io.output.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,757 | 858,758 | u874996917 | cpp |
p03042 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ... | [
"literal.string.change",
"call.arguments.change"
] | 858,772 | 858,773 | u528720841 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll d1 = n % 10;
n /= 10;
ll d2 = n % 10;
n /= 10;
ll d3 = n % 10;
n /= 10;
ll d4 = n % 10;
ll x = d4 * 10 + d3;
ll y = d2 * 10 + d1;
if (0 <= x and x <= 99 and 1 <= y and y <= 12) {
if (1 <= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll d1 = n % 10;
n /= 10;
ll d2 = n % 10;
n /= 10;
ll d3 = n % 10;
n /= 10;
ll d4 = n % 10;
ll x = d4 * 10 + d3;
ll y = d2 * 10 + d1;
if (0 <= x and x <= 99 and 1 <= y and y <= 12) {
if (1 <= ... | [
"literal.string.change",
"io.output.change"
] | 858,778 | 858,779 | u477855214 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
int y[2], m[2];
y[0] = 0;
y[1] = 0;
m[0] = 0, m[1] = 0;
if (a >= 0)
y[0] = 1;
if (b >= 0)
y[1] = 1;
if (a >= 1 && a <= 12)... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
int y[2], m[2];
y[0] = 0;
y[1] = 0;
m[0] = 0, m[1] = 0;
if (a >= 0)
y[0] = 1;
if (b >= 0)
y[1] = 1;
if (a >= 1 && a <= 12)... | [
"literal.string.change",
"io.output.change"
] | 858,791 | 858,792 | u228402731 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (s % 100 > 0 && s % 100 < 13) {
if (s / 100 > 0 && s / 100 < 13) {
cout << "AMBIGUOUS";
} else {
cout << "MMYY";
}
} else {
if (s / 100 > 0 && s / 100 < 13) {
cout << "YYMM";
} else {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
if (s % 100 > 0 && s % 100 < 13) {
if (s / 100 > 0 && s / 100 < 13) {
cout << "AMBIGUOUS";
} else {
cout << "YYMM";
}
} else {
if (s / 100 > 0 && s / 100 < 13) {
cout << "MMYY";
} else {
cout... | [
"literal.string.change",
"io.output.change"
] | 858,795 | 858,796 | u058348416 | cpp |
p03042 | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int toInt(char c1, char c2) { return (c1 - '0') * 10 + c2 - '0'; }
int main() {
string str;
cin >> str;
bool isYYMM = true;
bool isMMYY = true;
if (toInt(str[0], str[1]) > 12 || toInt(str[0], str[1]) == 0) {
isMMYY = false;
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int toInt(char c1, char c2) { return (c1 - '0') * 10 + c2 - '0'; }
int main() {
string str;
cin >> str;
bool isYYMM = true;
bool isMMYY = true;
if (toInt(str[0], str[1]) > 12 || toInt(str[0], str[1]) == 0) {
isMMYY = false;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 858,797 | 858,798 | u426837411 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | [
"literal.number.change",
"call.arguments.change"
] | 858,805 | 858,806 | u205561862 | cpp |
p03042 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
bool is_maybe_month(int d) { return (1 <= d) && (d <= 12); }
bool is_maybe_year(int d) { return (0 <= d) && (d <= 99); }
void solve(int fd, int sd) {
if (is_maybe... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
bool is_maybe_month(int d) { return (1 <= d) && (d <= 12); }
bool is_maybe_year(int d) { return (0 <= d) && (d <= 99); }
void solve(int fd, int sd) {
if (is_maybe... | [
"literal.string.change",
"io.output.change"
] | 858,837 | 858,838 | u767777873 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
a = S % 100; /*simo*/
b = (S - a) / 100; /*kami*/
if ((b > 0 && b < 13) && (a > 0 && a < 13)) {
cout << "AMBIGUOUS" << endl;
} else if (a > 0 && a < 13) {
cout << "MMYY" << endl;
} else if (b > 0 && b < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
b = S % 100; /*simo*/
a = (S - b) / 100; /*kami*/
if ((b > 0 && b < 13) && (a > 0 && a < 13)) {
cout << "AMBIGUOUS" << endl;
}
/* else if (((b>0 && b<13) && a==0) || (b==0 && (a>0 && a<13))) {
cout <<... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 858,845 | 858,846 | u508570129 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 858,855 | 858,856 | u017829142 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int a = s[0] - '0';
int b = s[1] - '0';
int c = s[2] - '0';
int d = s[3] - '0';
int x = 10 * a + b;
int y... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int a = s[0] - '0';
int b = s[1] - '0';
int c = s[2] - '0';
int d = s[3] - '0';
int x = 10 * a + b;
int y... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 858,861 | 858,862 | u506112954 | cpp |
p03042 | #include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
char a1 = (int)(s[0]);
char a2 = (int)(s[1]);
char a3 = (int)(s[2]);
char a4 = (int)(s[3]);
int s1 = (a1 - 48) * 10 + (a2 - 48);
int s2 = (a3 - 48) * 10 + (a4 - 48);
// cout << a1 << a2 <<... | #include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
char a1 = (int)(s[0]);
char a2 = (int)(s[1]);
char a3 = (int)(s[2]);
char a4 = (int)(s[3]);
int s1 = (a1 - 48) * 10 + (a2 - 48);
int s2 = (a3 - 48) * 10 + (a4 - 48);
// cout << a1 << a2 <<... | [
"control_flow.branch.if.condition.change"
] | 858,876 | 858,877 | u504879924 | cpp |
p03042 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#def... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,882 | 858,883 | u069521477 | cpp |
p03042 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#d... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,892 | 858,893 | u118846704 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
char s[105];
int main() {
int flag1 = 0;
int flag2 = 0;
int n;
scanf("%d", &n);
if (n / 100 > 12 || n / 100 == 0)
flag1 = 1;
if (n % 100 > 12 || n % 100 == 0)
flag2 = 1;
if (flag1 == 1 && flag2 == 1) {
cout << "AMBIGUOUS" << endl;
} else if (flag... | #include <bits/stdc++.h>
using namespace std;
char s[105];
int main() {
int flag1 = 0;
int flag2 = 0;
int n;
scanf("%d", &n);
if (n / 100 > 12 || n / 100 == 0)
flag1 = 1;
if (n % 100 > 12 || n % 100 == 0)
flag2 = 1;
if (flag1 == 1 && flag2 == 1) {
cout << "NA" << endl;
} else if (flag1 == 1)... | [
"literal.string.change",
"io.output.change"
] | 858,896 | 858,897 | u818518063 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
char s[105];
int main() {
int flag1 = 0;
int flag2 = 0;
int n;
scanf("%d", &n);
if (n / 100 > 12 && n / 100 == 0)
flag1 = 1;
if (n % 100 > 12 && n % 100 == 0)
flag2 = 1;
if (flag1 == 1 && flag2 == 1) {
cout << "AMBIGUOUS" << endl;
} else if (flag... | #include <bits/stdc++.h>
using namespace std;
char s[105];
int main() {
int flag1 = 0;
int flag2 = 0;
int n;
scanf("%d", &n);
if (n / 100 > 12 || n / 100 == 0)
flag1 = 1;
if (n % 100 > 12 || n % 100 == 0)
flag2 = 1;
if (flag1 == 1 && flag2 == 1) {
cout << "NA" << endl;
} else if (flag1 == 1)... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 858,898 | 858,897 | u818518063 | cpp |
p03042 | #include "bits/stdc++.h"
using namespace std;
namespace ORIGIN {
#define LL long long
#define VLL vector<long long>
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
#define WHOLE(x) x.begin(), x.end()
dou... | #include "bits/stdc++.h"
using namespace std;
namespace ORIGIN {
#define LL long long
#define VLL vector<long long>
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define rep(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << x << endl
#define WHOLE(x) x.begin(), x.end()
dou... | [
"literal.string.change",
"call.arguments.change"
] | 858,901 | 858,902 | u196798307 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
bool a1, b1;
if (a >= 1 && a <= 12) {
a1 = 1;
} else {
a1 = 0;
}
if (b >= 1 && b <= 12) {
b1 = 1;
} else {
b1 = 0;
}
if (a1 == 1 && b1 == 1) {
cout << "AMBIGUOUS... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
bool a1, b1;
if (a >= 1 && a <= 12) {
a1 = 1;
} else {
a1 = 0;
}
if (b >= 1 && b <= 12) {
b1 = 1;
} else {
b1 = 0;
}
if (a1 == 1 && b1 == 1) {
cout << "AMBIGUOUS... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 858,914 | 858,915 | u973991908 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
bool a1, b1;
if (a >= 1 || a <= 12) {
a1 = 1;
} else {
a1 = 0;
}
if (b >= 1 || b <= 12) {
b1 = 1;
} else {
b1 = 0;
}
if (a1 == 1 && b1 == 1) {
cout << "AMBIGUOUS... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
bool a1, b1;
if (a >= 1 && a <= 12) {
a1 = 1;
} else {
a1 = 0;
}
if (b >= 1 && b <= 12) {
b1 = 1;
} else {
b1 = 0;
}
if (a1 == 1 && b1 == 1) {
cout << "AMBIGUOUS... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 858,916 | 858,915 | u973991908 | cpp |
p03042 | #include <bits/stdc++.h>
#define lli long long int
#define mod 1000000007
#define pb push_back
#define ulli unsigned long long int
#define what_is(x) cerr << #x << " is " << x << endl;
#define pi 2 * acos(0.0)
#define F first
#define S second
#define endl '\n'
#define all(x) x.begin(), x.end()
using namespace std;
int ... | #include <bits/stdc++.h>
#define lli long long int
#define mod 1000000007
#define pb push_back
#define ulli unsigned long long int
#define what_is(x) cerr << #x << " is " << x << endl;
#define pi 2 * acos(0.0)
#define F first
#define S second
#define endl '\n'
#define all(x) x.begin(), x.end()
using namespace std;
int ... | [
"control_flow.branch.if.condition.change"
] | 858,917 | 858,918 | u909375072 | cpp |
p03042 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"literal.string.change",
"io.output.change"
] | 858,921 | 858,922 | u387013436 | cpp |
p03042 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"assignment.value.change"
] | 858,923 | 858,924 | u775507068 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int front, back;
front = S / 100;
back = S - front;
string SS;
bool f = false, b = false;
if (front <= 12 && 0 < front)
f = true;
if (back <= 12 && 0 < back)
b = true;
if (f && b)
SS = "AMBIGUOUS";
else if (f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int front, back;
front = S / 100;
back = S - front * 100;
string SS;
bool f = false, b = false;
if (front <= 12 && 0 < front)
f = true;
if (back <= 12 && 0 < back)
b = true;
if (f && b)
SS = "AMBIGUOUS";
else... | [
"assignment.change"
] | 858,934 | 858,935 | u607746177 | cpp |
p03042 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define pb push_back
#define hell 1000000007
using namespace std;
void solve() {
ll int m, i, j, k, d = 1, b, c = 0, sum = 0, z = 0, q, x = 0, y = 0, n;
cin... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define pb push_back
#define hell 1000000007
using namespace std;
void solve() {
ll int m, i, j, k, d = 1, b, c = 0, sum = 0, z = 0, q, x = 0, y = 0, n;
cin... | [
"literal.string.change",
"io.output.change"
] | 858,938 | 858,939 | u216069198 | cpp |
p03042 | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int YY, MM;
YY = s / 100;
MM = s % 100;
if (MM == 0 || MM > 12) {
if (YY == 0 || YY > 12) {
printf("NA");
} else {
printf("MMYY");
}
} else {
if (MM > 0 && MM < 13) {
printf("AMBIGUOUS");
} else {
pr... | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int YY, MM;
YY = s / 100;
MM = s % 100;
if (MM == 0 || MM > 12) {
if (YY == 0 || YY > 12) {
printf("NA");
} else {
printf("MMYY");
}
} else {
if (YY > 0 && YY < 13) {
printf("AMBIGUOUS");
} else {
pr... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,952 | 858,953 | u711238850 | cpp |
p03042 | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int YY, MM;
YY = s / 100;
MM = s % 100;
if (MM == 0 || MM > 12) {
if (YY == 0 || YY > 12) {
printf("NA");
} else {
printf("MMYY");
}
} else {
if (YY > 0 || YY < 13) {
printf("AMBIGUOUS");
} else {
pr... | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int YY, MM;
YY = s / 100;
MM = s % 100;
if (MM == 0 || MM > 12) {
if (YY == 0 || YY > 12) {
printf("NA");
} else {
printf("MMYY");
}
} else {
if (YY > 0 && YY < 13) {
printf("AMBIGUOUS");
} else {
pr... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 858,954 | 858,953 | u711238850 | cpp |
p03042 | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int YY, MM;
YY = s / 100;
MM = s % 100;
if (MM == 0 || MM > 12) {
if (YY == 0 || YY > 12) {
printf("NA");
} else {
printf("MMYY");
}
} else {
if (MM > 1 || MM < 13) {
printf("AMBIGUOUS");
} else {
pr... | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int YY, MM;
YY = s / 100;
MM = s % 100;
if (MM == 0 || MM > 12) {
if (YY == 0 || YY > 12) {
printf("NA");
} else {
printf("MMYY");
}
} else {
if (YY > 0 && YY < 13) {
printf("AMBIGUOUS");
} else {
pr... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,955 | 858,953 | u711238850 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <s... | [
"literal.string.change",
"io.output.change"
] | 858,958 | 858,959 | u952843849 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b, c, d;
cin >> S;
a = S / 100;
b = S - a * 100;
if (a < 13 && 0 < a)
c = 1;
else if (12 < a)
c = 2;
else
c = 2;
if (b < 13 && 0 < b)
d = 1;
else if (12 < b)
d = 2;
else
d = 2;
if (d == 1 & c == 2)
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b, c, d;
cin >> S;
a = S / 100;
b = S - a * 100;
if (a < 13 && 0 < a)
c = 1;
else if (12 < a)
c = 2;
else
c = 2;
if (b < 13 && 0 < b)
d = 1;
else if (12 < b)
d = 2;
else
d = 2;
if (d == 1 & c == 2)
co... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,966 | 858,967 | u618604643 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b, c, d;
cin >> S;
a = S / 100;
b = S - a * 100;
if (a < 13 && 0 < a)
c = 1;
else if (12 < a)
c = 2;
else
c = 2;
if (b < 13 && 0 < b)
d = 1;
else if (12 < b)
d = 2;
else
d = 2;
if (d == 1 & c == 2)
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b, c, d;
cin >> S;
a = S / 100;
b = S - a * 100;
if (a < 13 && 0 < a)
c = 1;
else if (12 < a)
c = 2;
else
c = 2;
if (b < 13 && 0 < b)
d = 1;
else if (12 < b)
d = 2;
else
d = 2;
if (d == 1 & c == 2)
co... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 858,968 | 858,967 | u618604643 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
if (((S % 100 <= 12) && (S % 100 > 0)) && ((S / 100 <= 12) && (S / 100 > 0)))
cout << "AMBIGUOUS";
else if ((S / 100 < 12) && (S / 100 > 0))
cout << "MMYY";
else if ((S % 100 < 12) && (S % 100 > 0))
cout << "YYMM";
else
... | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
if (((S % 100 <= 12) && (S % 100 > 0)) && ((S / 100 <= 12) && (S / 100 > 0)))
cout << "AMBIGUOUS";
else if ((S / 100 <= 12) && (S / 100 > 0))
cout << "MMYY";
else if ((S % 100 <= 12) && (S % 100 > 0))
cout << "YYMM";
else
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 858,983 | 858,984 | u313403396 | cpp |
p03042 | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
cin >> S;
int left = S / 100;
int right = S % 100;
int YYMM_f = 1;
int MMYY_f = 1;
if ((left > 13 || left == 0) && (right < 13 ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
cin >> S;
int left = S / 100;
int right = S % 100;
int YYMM_f = 1;
int MMYY_f = 1;
if ((left > 12 || left == 0) && (right < 13 ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 858,985 | 858,986 | u866119355 | cpp |
p03042 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i... | [
"control_flow.branch.if.condition.change"
] | 858,991 | 858,992 | u324303263 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int MMYY = 0;
int YYMM = 0;
if (S.at(0) == '0') {
if (S.at(1) = !'0') {
MMYY++;
}
}
if (S.at(0) == '1') {
if (S.at(1) == '0') {
MMYY++;
} else if (S.at(1) == '1') {
MMYY++;
} else if (S.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int MMYY = 0;
int YYMM = 0;
if (S.at(0) == '0') {
if (S.at(1) != '0') {
MMYY++;
}
}
if (S.at(0) == '1') {
if (S.at(1) == '0') {
MMYY++;
} else if (S.at(1) == '1') {
MMYY++;
} else if (S.at... | [
"control_flow.branch.if.condition.change",
"expression.operation.unary.logical.remove"
] | 859,001 | 859,002 | u332310326 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int y = s[1] - '0';
int m = s[3] - '0';
bool yymm = false;
if (s[2] == '0' && m != 0) {
yymm = true;
} else if (s[2] == '1') {
if (0 <= m && m <= 2) {
yymm = true;
}
}
bool mmyy = false;
if (s[0] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int y = s[1] - '0';
int m = s[3] - '0';
bool yymm = false;
if (s[2] == '0' && m != 0) {
yymm = true;
} else if (s[2] == '1') {
if (0 <= m && m <= 2) {
yymm = true;
}
}
bool mmyy = false;
if (s[0] ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 859,003 | 859,004 | u627431737 | cpp |
p03042 | #include <bits/stdc++.h>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
int s, result = 0;
cin >> s;
if (s / 100 <= 12 && s % 12 >= 1) {
result += 10;
}
if (s % 100 <= 12 && s % 12 >= 1) {
result += 1;
}
if (result == 0) {
cout << "NA" << endl;
} else if (result ==... | #include <bits/stdc++.h>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
int s, result = 0;
cin >> s;
if (s / 100 <= 12 && s / 100 >= 1) {
result += 10;
}
if (s % 100 <= 12 && s % 100 >= 1) {
result += 1;
}
if (result == 0) {
cout << "NA" << endl;
} else if (result ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,014 | 859,015 | u894950682 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + (s[1] - '0');
int b = (s[2] - '0') * 10 + (s[3] - '0');
if (a == 0 && (b == 0 || b >= 13)) {
cout << "NA" << endl;
} else if (b == 0 && (a == 0 || a >= 13)) {
cout << "NA" << endl;
} else if... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = (s[0] - '0') * 10 + (s[1] - '0');
int b = (s[2] - '0') * 10 + (s[3] - '0');
if (a == 0 && (b == 0 || b >= 13)) {
cout << "NA" << endl;
} else if (b == 0 && (a == 0 || a >= 13)) {
cout << "NA" << endl;
} else if... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,033 | 859,034 | u812498271 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rer(i, l, u) for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rer(i, l, u) for (... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,037 | 859,038 | u484962958 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
// YYMM
const int ab = (int)(s[0] - '0') * 10 + (int)(s[1] - '0');
const int cd = (int)(s[2] - '0') * 10 + (int)(s[3] - '0');
bool ab_mm =... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
// YYMM
const int ab = (int)(s[0] - '0') * 10 + (int)(s[1] - '0');
const int cd = (int)(s[2] - '0') * 10 + (int)(s[3] - '0');
bool ab_mm ... | [
"literal.string.change",
"assignment.value.change"
] | 859,039 | 859,040 | u017293723 | cpp |
p03042 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
// YYMM
int ab = (int)(s[0] - '0') * 10 + (int)(s[1] - '0');
int cd = (int)(s[2] - '0') * 10 + (int)(s[3] - '0');
bool ab_mm = false, cd_... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
// YYMM
const int ab = (int)(s[0] - '0') * 10 + (int)(s[1] - '0');
const int cd = (int)(s[2] - '0') * 10 + (int)(s[3] - '0');
bool ab_mm ... | [
"literal.string.change",
"assignment.value.change"
] | 859,041 | 859,040 | u017293723 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string x = "";
x += s.at(0);
x += s.at(1);
string y = "";
y += s.at(2);
y += s.at(3);
int xx = stoi(x);
int yy = sto... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string x = "";
x += s.at(0);
x += s.at(1);
string y = "";
y += s.at(2);
y += s.at(3);
int xx = stoi(x);
int yy = sto... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,052 | 859,053 | u566640130 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string x = "";
x += s.at(0);
x += s.at(1);
string y = "";
y += s.at(2);
y += s.at(3);
int xx = stoi(x);
int yy = sto... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string x = "";
x += s.at(0);
x += s.at(1);
string y = "";
y += s.at(2);
y += s.at(3);
int xx = stoi(x);
int yy = sto... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 859,054 | 859,053 | u566640130 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
a += 10 * (s[0] - '0') + (s[1] - '0');
int b = 0;
b += 10 * (s[2] - '0') + (s[3] - '0');
if ((min(a, b) == 0 && max(a, b) > 12) || (a > 12 && b > 12) ||
(a == 0 && b == 0))
cout << "NA" << endl;
else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
a += 10 * (s[0] - '0') + (s[1] - '0');
int b = 0;
b += 10 * (s[2] - '0') + (s[3] - '0');
if ((min(a, b) == 0 && max(a, b) > 12) || (a > 12 && b > 12) ||
(a == 0 && b == 0))
cout << "NA" << endl;
else {
... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 859,058 | 859,059 | u055447809 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b;
cin >> S;
a = S / 100;
b = S % 100;
bool am = true;
bool bm = true;
if (a > 12 || a == 0) {
am = false;
}
if (b > 12 || b == 0) {
bm = false;
}
if (am && bm) {
cout << "AMBIGUOUS" << endl;
}
if (am == true &&... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b;
cin >> S;
a = S / 100;
b = S % 100;
bool am = true;
bool bm = true;
if (a > 12 || a == 0) {
am = false;
}
if (b > 12 || b == 0) {
bm = false;
}
if (am && bm) {
cout << "AMBIGUOUS" << endl;
} else if (am == true... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 859,062 | 859,063 | u276588887 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<ll> VL;
#define rep(i, n) for (int i = 0; i < (int)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<ll> VL;
#define rep(i, n) for (int i = 0; i < (int)... | [
"control_flow.branch.if.condition.change"
] | 859,066 | 859,067 | u134576652 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define al... | [
"literal.string.change",
"assignment.value.change"
] | 859,079 | 859,080 | u153846982 | cpp |
p03042 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,096 | 859,097 | u937608388 | cpp |
p03042 | /////////////////////////////////////////Info/////////////////////////////////////////////////
// Problem:
// Date:
// Skill:
// Bug:
/////////////////////////////////////////Definations/////////////////////////////////////////////////
//循环控制
#define CLR(a) memset((a), 0, sizeof(a))
#define F(i, a, b) for (int i = a; i... | /////////////////////////////////////////Info/////////////////////////////////////////////////
// Problem:
// Date:
// Skill:
// Bug:
/////////////////////////////////////////Definations/////////////////////////////////////////////////
//循环控制
#define CLR(a) memset((a), 0, sizeof(a))
#define F(i, a, b) for (int i = a; i... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 859,109 | 859,110 | u738285256 | cpp |
p03042 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a = 0, b = 0;
char c;
cin >> c;
a = a * 10 + c - '0';
cin >> c;
a = a * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
if (a <= 12 &... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a = 0, b = 0;
char c;
cin >> c;
a = a * 10 + c - '0';
cin >> c;
a = a * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
if (a <= 12 &... | [
"literal.string.change",
"io.output.change"
] | 859,111 | 859,112 | u866339621 | cpp |
p03042 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a = 0, b = 0;
char c;
cin >> c;
a = a * 10 + c - '0';
cin >> c;
a = a * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
if (a <= 12 &... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a = 0, b = 0;
char c;
cin >> c;
a = a * 10 + c - '0';
cin >> c;
a = a * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
cin >> c;
b = b * 10 + c - '0';
if (a <= 12 &... | [
"literal.string.change",
"io.output.change"
] | 859,113 | 859,112 | u866339621 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 1e5 + 10;
ld pw[40];
bool X(string t) {
int k = 0;
k += (int)(t[1] - '0') + 10 * (int)(t[0] - '0');
if (k >= 1 and k <= 12)
return 1;
return 0;
}
int main() {
ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 1e5 + 10;
ld pw[40];
bool X(string t) {
int k = 0;
k += (int)(t[1] - '0') + 10 * (int)(t[0] - '0');
if (k >= 1 and k <= 12)
return 1;
return 0;
}
int main() {
ios_base::sync_with_stdio(false)... | [
"literal.string.change",
"io.output.change"
] | 859,119 | 859,120 | u001596356 | cpp |
p03042 | #include <stdio.h>
int main() {
int in;
int higher, lower;
scanf("%d", &in);
higher = in / 100;
lower = in - higher;
// AMBIGUOUS
if ((1 <= higher && higher <= 12) && (1 <= lower && lower <= 12)) {
puts("AMBIGUOUS");
return 0;
}
// NA
if ((higher == 0 || 13 <= higher) && (lower == 0 || ... | #include <stdio.h>
int main() {
int in;
int higher, lower;
scanf("%d", &in);
higher = in / 100;
lower = in - higher * 100;
// AMBIGUOUS
if ((1 <= higher && higher <= 12) && (1 <= lower && lower <= 12)) {
puts("AMBIGUOUS");
return 0;
}
// NA
if ((higher == 0 || 13 <= higher) && (lower ==... | [
"assignment.change"
] | 859,131 | 859,132 | u362728536 | cpp |
p03042 | #include <cstdio>
int main() {
int a, b;
a = (getchar() - '0') * 10;
a += (getchar() - '0');
b = (getchar() - '0') * 10;
b += (getchar() - '0');
bool ayy = a >= 1 && a <= 12;
bool byy = b >= 1 && b <= 12;
if (ayy && !byy)
printf("YYMM");
else if (!ayy && byy)
printf("MMYY");
else if (ayy &&... | #include <cstdio>
int main() {
int a, b;
a = (getchar() - '0') * 10;
a += (getchar() - '0');
b = (getchar() - '0') * 10;
b += (getchar() - '0');
bool ayy = a >= 1 && a <= 12;
bool byy = b >= 1 && b <= 12;
if (ayy && !byy)
printf("MMYY");
else if (!ayy && byy)
printf("YYMM");
else if (ayy &&... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,142 | 859,143 | u081249228 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
string raw;
cin >> raw;
int a = stoi(raw.substr(0, 2));
int b = stoi(raw.substr(2, 2));
bool ma = 0 < a && a < 13;
bool mb = 0 < b && b < 13;
if (ma && mb) {
cout << "Ambiguous" << endl;
} else if (ma) {
cout << "MMYY" << ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string raw;
cin >> raw;
int a = stoi(raw.substr(0, 2));
int b = stoi(raw.substr(2, 2));
bool ma = 0 < a && a < 13;
bool mb = 0 < b && b < 13;
if (ma && mb) {
cout << "AMBIGUOUS" << endl;
} else if (ma) {
cout << "MMYY" << ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 859,152 | 859,153 | u166275104 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#d... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#d... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,161 | 859,162 | u505831576 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + s[1] - '0';
b = (s[2] - '0') * 10 + s[3] - '0';
bool yymm = (b <= 12) && (b > 0); // YYMMになる必要条件
bool mmyy = (a <= 12) && (a > 0); // MMYYになる必要条件
if (yymm && mmyy) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + s[1] - '0';
b = (s[2] - '0') * 10 + s[3] - '0';
bool yymm = (b <= 12) && (b > 0); // YYMMになる必要条件
bool mmyy = (a <= 12) && (a > 0); // MMYYになる必要条件
if (yymm && mmyy) {
... | [
"literal.string.change",
"io.output.change"
] | 859,163 | 859,164 | u123896133 | cpp |
p03042 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define INF 100000000;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define REP1(j, n) for (int j = 0; j < (int)... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define INF 100000000;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define REP1(j, n) for (int j = 0; j < (int)... | [
"literal.string.change",
"io.output.change"
] | 859,165 | 859,166 | u817523595 | cpp |
p03042 | #include <stdio.h>
int n, a, b;
int main() {
scanf("%d", &n);
a = n / 100;
b = n % 100;
if ((1 <= a) && (a <= 12) && (1 <= b) && (b <= 12))
printf("AMBIGIOUS");
else if ((1 <= a) && (a <= 12))
printf("MMYY");
else if ((1 <= b) && (b <= 12))
printf("YYMM");
else
printf("NA");
} | #include <stdio.h>
int n, a, b;
int main() {
scanf("%d", &n);
a = n / 100;
b = n % 100;
if ((1 <= a) && (a <= 12) && (1 <= b) && (b <= 12))
printf("AMBIGUOUS");
else if ((1 <= a) && (a <= 12))
printf("MMYY");
else if ((1 <= b) && (b <= 12))
printf("YYMM");
else
printf("NA");
}
| [
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,176 | 859,177 | u076504136 | cpp |
p03042 | #include <stdio.h>
int main() {
int a, b, c, d, e;
scanf("%d", &e);
a = e / 100;
b = e - 100 * a;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12)
printf("AMBIGOUS");
else
printf("MMYY");
} else {
if (b >= 1 && b <= 12)
printf("YYMM");
else
printf("NA");
}
}
| #include <stdio.h>
int main() {
int a, b, c, d, e;
scanf("%d", &e);
a = e / 100;
b = e - 100 * a;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12)
printf("AMBIGUOUS");
else
printf("MMYY");
} else {
if (b >= 1 && b <= 12)
printf("YYMM");
else
printf("NA");
}
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,178 | 859,179 | u362840243 | cpp |
p03042 | #include <stdio.h>
int main() {
int a, b, c, d, e;
scanf("%d", &e);
a = e / 100;
b = e - 100 * a;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12)
printf("AMBIGOUS");
else
printf("MMYY");
} else {
if (b >= 1 && b <= 12)
printf("YYMM");
else
printf("NA");
}
} | #include <stdio.h>
int main() {
int a, b, c, d, e;
scanf("%d", &e);
a = e / 100;
b = e - 100 * a;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12)
printf("AMBIGUOUS");
else
printf("MMYY");
} else {
if (b >= 1 && b <= 12)
printf("YYMM");
else
printf("NA");
}
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,180 | 859,179 | u362840243 | cpp |
p03042 | #include <stdio.h>
int main() {
int a, b, c, d, e, f;
scanf("%d", &e);
a = e / 100;
b = e - 100 * a;
if (a >= 1 && a <= 12) {
if (b >= 1 && a <= 12)
printf("AMBIGOUS");
else
printf("MMYY");
} else {
if (b >= 1 && a <= 12)
printf("YYMM");
else
printf("NA");
}
} | #include <stdio.h>
int main() {
int a, b, c, d, e;
scanf("%d", &e);
a = e / 100;
b = e - 100 * a;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12)
printf("AMBIGUOUS");
else
printf("MMYY");
} else {
if (b >= 1 && b <= 12)
printf("YYMM");
else
printf("NA");
}
}
| [
"variable_declaration.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,181 | 859,179 | u362840243 | cpp |
p03042 | #include <stdio.h>
int main() {
int n;
int a = 0;
int b = 0;
scanf("%d", &n);
if (n % 100 <= 12 && n % 100 >= 12) {
a++;
}
if ((n / 100) <= 12 && n / 100 >= 1) {
b++;
}
if ((a + b) == 2) {
printf("AMBIGUOUS");
} else if (a == 1) {
printf("YYMM");
} else if (b == 1) {
printf("MM... | #include <stdio.h>
int main() {
int n;
int a = 0;
int b = 0;
scanf("%d", &n);
if (n % 100 <= 12 && n % 100 >= 1) {
a++;
}
if ((n / 100) <= 12 && n / 100 >= 1) {
b++;
}
if ((a + b) == 2) {
printf("AMBIGUOUS");
} else if (a == 1) {
printf("YYMM");
} else if (b == 1) {
printf("MMY... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,182 | 859,183 | u484935146 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
string s;
int a = 0;
int b = 0;
cin >> s;
if ((s[0] == '0' && s[1] != '0') || (s[0] == '1' && s[1] >= '0' && s[1] <= '2\
'))
a++;
if ((s[2] == '0' && s[3] != '0') || (s[2] == '1' && s[3] >= '0' && s[3] <= '2\
'))
b++;
if (a == 0 && b == 0)
... | #include <iostream>
using namespace std;
int main() {
string s;
int a = 0;
int b = 0;
cin >> s;
if ((s[0] == '0' && s[1] != '0') || (s[0] == '1' && s[1] >= '0' && s[1] <= '2\
'))
a++;
if ((s[2] == '0' && s[3] != '0') || (s[2] == '1' && s[3] >= '0' && s[3] <= '2\
'))
b++;
if (a == 0 && b == 0)
... | [
"literal.string.change",
"io.output.change"
] | 859,184 | 859,185 | u035009844 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
string s;
int a = 0;
int b = 0;
cin >> s;
if ((s[0] == '0' && s[1] != '0') ||
(s[0] == '1' && s[1] >= '0' && s[1] <= '2'))
a++;
if ((s[2] == '0' && s[3] != '0') ||
(s[2] == '1' && s[3] >= '0' && s[3] <= '2'))
b++;
if (a == 0 && b =... | #include <iostream>
using namespace std;
int main() {
string s;
int a = 0;
int b = 0;
cin >> s;
if ((s[0] == '0' && s[1] != '0') || (s[0] == '1' && s[1] >= '0' && s[1] <= '2\
'))
a++;
if ((s[2] == '0' && s[3] != '0') || (s[2] == '1' && s[3] >= '0' && s[3] <= '2\
'))
b++;
if (a == 0 && b == 0)
... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 859,186 | 859,185 | u035009844 | cpp |
p03042 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int s1 = s / 100, s2 = s % 100;
if (s1 < 13 && s1 > 0) {
if (s2 < 13 && s2 > 0)
cout << "AMBIGUOUS" << endl;
else
cout << "YYMM" << endl;
} else {
if (s2 < 13 && s2 > 0)
cout << "MMYY" << e... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int s1 = s / 100, s2 = s % 100;
if (s1 < 13 && s1 > 0) {
if (s2 < 13 && s2 > 0)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (s2 < 13 && s2 > 0)
cout << "YYMM" << e... | [
"literal.string.change",
"io.output.change"
] | 859,189 | 859,190 | u389766217 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
bool chk(int x) {
if (x > 0 && x <= 12) {
return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int x = (s[0] - '0') * 10 + (s[1] - '0');
int y = (s[2] - ... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
bool chk(int x) {
if (x > 0 && x <= 12) {
return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int x = (s[0] - '0') * 10 + (s[1] - '0');
int y = (s[2] - ... | [
"misc.typo",
"literal.string.change",
"io.output.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,204 | 859,203 | u212176064 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int p, q, s, t, u, v, w, x;
string r;
while (cin >> r) {
p = r[0] - 48;
q = r[1] - 48;
s = (p * 10) + (q);
t = r[2] - 48;
u = r[3] - 48;
v = (t * 10) + u;
if (s >= 1 && s <= 12 && v >= 1 && v <= 12) {
cout << "A... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int p, q, s, t, u, v, w, x;
string r;
while (cin >> r) {
p = r[0] - 48;
q = r[1] - 48;
s = (p * 10) + (q);
t = r[2] - 48;
u = r[3] - 48;
v = (t * 10) + u;
// cout<<s<<" "<<v<<endl;
if (s >= 1 && s <= 12 && v >= 1... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,205 | 859,206 | u970127238 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
bool MMYY = false;
bool YYMM = false;
string ans;
if (s / 100 > 1 && s / 100 < 13) {
MMYY = true;
if (s % 100 > 1 && s % 100 < 13) {
YYMM = true;
}
} else {
if (s % 100 > 1 && s % 100 < 13) {
YYMM = tr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
bool MMYY = false;
bool YYMM = false;
string ans;
if (s / 100 >= 1 && s / 100 < 13) {
MMYY = true;
if (s % 100 >= 1 && s % 100 < 13) {
YYMM = true;
}
} else {
if (s % 100 >= 1 && s % 100 < 13) {
YYMM =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,219 | 859,220 | u370447425 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) Rep(i, 0, n)
#define Rep(i, k, n) for (int i = k; i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,225 | 859,226 | u381585104 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define in(x) ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define in(x) ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 859,234 | 859,235 | u153867760 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int x = s / 100;
int y = s % 100;
int f1 = 1 <= x && x <= 12;
int f2 = 1 <= y && y <= 12;
if (f1) {
cout << (f2 ? "AMbIGUOUS" : "MMYY") << endl;
} else {
cout << (f2 ? "YYMM" : "NA") << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int x = s / 100;
int y = s % 100;
int f1 = 1 <= x && x <= 12;
int f2 = 1 <= y && y <= 12;
if (f1) {
cout << (f2 ? "AMBIGUOUS" : "MMYY") << endl;
} else {
cout << (f2 ? "YYMM" : "NA") << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 859,240 | 859,241 | u976817999 | cpp |
p03042 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e6 + 17;
ll cnt, ans, lnt, n, l1, x, y, a[N];
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
// freopen("input.txt", "r", stdin);
// freopen... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e6 + 17;
ll cnt, ans, lnt, n, l1, x, y, a[N];
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
// freopen("input.txt", "r", stdin);
// freopen... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,245 | 859,246 | u361768313 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int sw;
cin >> sw;
int y = sw / 10;
int m = sw % 10;
if ((m >= 1 && m <= 12) && (y >= 1 && y <= 12))
printf("AMBIGUOUS\n");
else if (y >= 1 && y <= 12)
printf("MMYY\n");
else if (m >= 1 && m <= 12)
printf("YYMM\n");
else
printf(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int sw;
cin >> sw;
int y = sw / 100;
int m = sw % 100;
if ((m >= 1 && m <= 12) && (y >= 1 && y <= 12))
printf("AMBIGUOUS\n");
else if (y >= 1 && y <= 12)
printf("MMYY\n");
else if (m >= 1 && m <= 12)
printf("YYMM\n");
else
print... | [
"literal.number.change",
"expression.operation.binary.change"
] | 859,249 | 859,250 | u542846759 | cpp |
p03042 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define f(i, x, n) for (ll int i = x; i < n; i++)
#define re(j, x, n) for (ll int j = x; j >= n; j--)
#define f1(k, x, n) for (ll int k = x; k <= n; k++)
#define mp make_pair
#define pb push_back
using namespace std;
int main() {
ios_base::s... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define f(i, x, n) for (ll int i = x; i < n; i++)
#define re(j, x, n) for (ll int j = x; j >= n; j--)
#define f1(k, x, n) for (ll int k = x; k <= n; k++)
#define mp make_pair
#define pb push_back
using namespace std;
int main() {
ios_base::s... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 859,251 | 859,252 | u430650458 | cpp |
p03042 | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
int flag = 0;
if (a < 13 and a > 0) {
++flag;
}
if (b < 13 and b > 0) {
++flag;
++flag;
}
if (flag == 0) {
cout << "NA" << end... | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int S;
cin >> S;
int a, b;
a = S / 100;
b = S % 100;
int flag = 0;
if (a < 13 and a > 0) {
++flag;
}
if (b < 13 and b > 0) {
++flag;
++flag;
}
if (flag == 0) {
cout << "NA" << end... | [
"literal.string.change",
"io.output.change"
] | 859,253 | 859,254 | u908393090 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int S;
cin >> S;
int MM = S % 100;
int YY = S / 100;
if ((MM < 1 || 12 < MM) && (YY < 1 || 12 << YY)) {
cout << "NA" << endl;
} else if ((1 <= MM && MM <= 12) && (YY < 1 || 12 < YY)) ... | #include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int S;
cin >> S;
int MM = S % 100;
int YY = S / 100;
if ((MM < 1 || 12 < MM) && (YY < 1 || 12 < YY)) {
cout << "NA" << endl;
} else if ((1 <= MM && MM <= 12) && (YY < 1 || 12 < YY)) {... | [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 859,258 | 859,259 | u692207013 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"literal.string.change",
"io.output.change"
] | 859,260 | 859,261 | u532573979 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int tmp;
int a = s / 1000;
tmp = s % 1000;
int b = tmp / 100;
tmp = tmp % 100;
int c = tmp / 10;
int d = tmp % 10;
bool ab, cd;
ab = false;
cd = false;
if ((a == 0 && b <= 9 && b >= 1) || (a == 1 && b <= 2 && b >= 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int tmp;
int a = s / 1000;
tmp = s % 1000;
int b = tmp / 100;
tmp = tmp % 100;
int c = tmp / 10;
int d = tmp % 10;
bool ab, cd;
ab = false;
cd = false;
if ((a == 0 && b <= 9 && b >= 1) || (a == 1 && b <= 2 && b >= 0... | [
"literal.string.change",
"io.output.change"
] | 859,265 | 859,266 | u985208127 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
// string s;
// cin >> s;
// int num = stoi(s);
int num;
cin >> num;
int f = num / 100;
int b = num % 100;
// cout << "num " << num << "f " << f << "b " << b << endl;
if (0 < f && f < 13) {
if (0 < b && b < 13)
cout... | #include <iostream>
#include <string>
using namespace std;
int main() {
// string s;
// cin >> s;
// int num = stoi(s);
int num;
cin >> num;
int f = num / 100;
int b = num % 100;
// cout << "num " << num << "f " << f << "b " << b << endl;
if (0 < f && f < 13) {
if (0 < b && b < 13)
cout... | [] | 859,269 | 859,270 | u070471279 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.