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, L, R;
cin >> S;
L = S / 100;
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;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, L, R;
cin >> S;
L = S / 100;
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;
else... | [
"literal.string.change",
"io.output.change"
] | 859,275 | 859,276 | u743561048 | cpp |
p03042 | // Author: Rahul Purohit
#include <bits/stdc++.h>
#define vi vector<int>
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define ll long long int
#define pi pair<ll, ll>
#define f first
#define mp make_pair
#define mod 1000000007
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
int gcd(i... | // Author: Rahul Purohit
#include <bits/stdc++.h>
#define vi vector<int>
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define ll long long int
#define pi pair<ll, ll>
#define f first
#define mp make_pair
#define mod 1000000007
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
int gcd(i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,277 | 859,278 | u707655771 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
scanf("%d", &a);
int x = a / 100;
int y = a % 100;
if (x >= 1 && y <= 12) {
if (y >= 1 && y <= 12)
cout << "AMBIGUOUS\n";
else
cout << "MMYY\n";
} else {
if (y >= 1 && y <= 12)
cout << "YYMM\n";
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
scanf("%d", &a);
int x = a / 100;
int y = a % 100;
if (x >= 1 && x <= 12) {
if (y >= 1 && y <= 12)
cout << "AMBIGUOUS\n";
else
cout << "MMYY\n";
} else {
if (y >= 1 && y <= 12)
cout << "YYMM\n";
else
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,290 | 859,291 | u936053819 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string s;
int a, b;
bool aa, bb;
cin >> s;
a = atoi(s.substr(0, 2).c_str());
b = atoi(s.substr(2, 2).c_str());
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout << "AMBIGOUS" ... | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string s;
int a, b;
cin >> s;
a = atoi(s.substr(0, 2).c_str());
b = atoi(s.substr(2, 2).c_str());
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout << "AMBIGUOUS" << endl;
}... | [
"variable_declaration.remove",
"literal.string.change",
"io.output.change"
] | 859,296 | 859,297 | u133765395 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sa, sb;
cin >> s;
sa = 10 * (s[0] - '0') + s[1] - '0';
sb = 10 * (s[2] - '0') + s[3] - '0';
if (0 < sa && sa <= 12) {
if (0 < sb && sb <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int sa, sb;
cin >> s;
sa = 10 * (s[0] - '0') + s[1] - '0';
sb = 10 * (s[2] - '0') + s[3] - '0';
if (0 < sa && sa <= 12) {
if (0 < sb && sb <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,304 | 859,305 | u066372434 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
string s;
cin >> s;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
bool f1 = true, f2 = true;
if ((a > 0) && (a < 13))
f2 = true;
else
f2 = false;
if ((b > 0) && (b < 13))... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
string s;
cin >> s;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
bool f1 = true, f2 = true;
if ((a > 0) && (a < 13))
f2 = true;
else
f2 = false;
if ((b > 0) && (b < 13))... | [
"literal.string.change",
"io.output.change"
] | 859,306 | 859,307 | u172369914 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] - '0' == 0 && s[1] - '0' != 0 ||
s[0] - '0' == 1 && s[1] - '0' <= 2) {
if (s[2] - '0' == 0 && s[3] - '0' != 0 ||
s[2] - '0' == 1 && s[3] - '0' <= 2) {
cout << "ANBIGUOUS" << endl;
} else {
cout <... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] - '0' == 0 && s[1] - '0' != 0 ||
s[0] - '0' == 1 && s[1] - '0' <= 2) {
if (s[2] - '0' == 0 && s[3] - '0' != 0 ||
s[2] - '0' == 1 && s[3] - '0' <= 2) {
cout << "AMBIGUOUS" << endl;
} else {
cout <... | [
"literal.string.change",
"io.output.change"
] | 859,319 | 859,320 | u675125216 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] - '0' == 0 && s[1] - '0' != 0 ||
s[0] - '0' == 1 && s[1] - '0' <= 2) {
if (s[2] - '0' == 0 && s[3] - '0' != 0 ||
s[2] - '0' == 1 && s[3] - '0' <= 2) {
cout << "ANBIGOUS" << endl;
} else {
cout <<... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] - '0' == 0 && s[1] - '0' != 0 ||
s[0] - '0' == 1 && s[1] - '0' <= 2) {
if (s[2] - '0' == 0 && s[3] - '0' != 0 ||
s[2] - '0' == 1 && s[3] - '0' <= 2) {
cout << "AMBIGUOUS" << endl;
} else {
cout <... | [
"literal.string.change",
"io.output.change"
] | 859,321 | 859,320 | u675125216 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool b1, b2;
b1 = false;
b2 = false;
if ((s[0] == '1' && ((int)s[1] >= 48 && (int)s[1] <= 50)) ||
(s[0] == '0' && (int)s[1] >= 49 && (int)s[1] <= 57)) {
b1 = true;
}
if ((s[2] == '1' && ((int)s[3] >= 4... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool b1, b2;
b1 = false;
b2 = false;
if ((s[0] == '1' && ((int)s[1] >= 48 && (int)s[1] <= 50)) ||
(s[0] == '0' && (int)s[1] >= 49 && (int)s[1] <= 57)) {
b1 = true;
}
if ((s[2] == '1' && ((int)s[3] >= 4... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 859,324 | 859,325 | u442039299 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool b1, b2;
b1 = false;
b2 = false;
if ((s[0] == '1' && ((int)s[1] >= 48 && (int)s[1] <= 50)) ||
(s[0] == '0' && (int)s[1] >= 49 && (int)s[1] <= 57)) {
b1 = true;
}
if ((s[2] == '1' && ((int)s[3] >= 4... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool b1, b2;
b1 = false;
b2 = false;
if ((s[0] == '1' && ((int)s[1] >= 48 && (int)s[1] <= 50)) ||
(s[0] == '0' && (int)s[1] >= 49 && (int)s[1] <= 57)) {
b1 = true;
}
if ((s[2] == '1' && ((int)s[3] >= 4... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 859,326 | 859,325 | u442039299 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define reep(i, n) for (ll i = n; i > -1; i--)
#define deb(variable) cout << #variable << "=" << variable << en... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define reep(i, n) for (ll i = n; i > -1; i--)
#define deb(variable) cout << #variable << "=" << variable << en... | [
"control_flow.branch.if.condition.change"
] | 859,327 | 859,328 | u268571052 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
bool a = false, b = false;
string s;
cin >> s;
if (s[0] == '0') {
if (s[1] != '0')
a = true;
} else if (s[0] == '1') {
if (s[1] >= '0' || s[1] <= '2')
a = true;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
bool a = false, b = false;
string s;
cin >> s;
if (s[0] == '0') {
if (s[1] != '0')
a = true;
} else if (s[0] == '1') {
if (s[1] >= '0' && s[1] <= '2')
a = true;
}
... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 859,329 | 859,330 | u987476436 | cpp |
p03042 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
string S;
int first_half;
int second_half;
int main() {
cin >> S;
firs... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
string S;
int first_half;
int second_half;
int main() {
cin >> S;
firs... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,350 | 859,351 | u551247219 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S == "0000") {
cout << "NA" << endl;
return 0;
}
string t = S.substr(0, 2);
string u = S.subst... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
if (S == "0000") {
cout << "NA" << endl;
return 0;
}
string t = S.substr(0, 2);
string u = S.subst... | [
"literal.string.change",
"io.output.change"
] | 859,366 | 859,367 | u755830696 | cpp |
p03042 | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
const int a = std::stoi(S.substr(0, 2));
const int b = std::stoi(S.substr(2, 2));
const auto month = [](int n) -> bool { return 1 <= n && n <= 12; };
std::string result;
if (month(a) && month(b)) {
result = "AMIBUGUOU... | #include <iostream>
#include <string>
int main() {
std::string S;
std::cin >> S;
const int a = std::stoi(S.substr(0, 2));
const int b = std::stoi(S.substr(2, 2));
const auto month = [](int n) -> bool { return 1 <= n && n <= 12; };
std::string result;
if (month(a) && month(b)) {
result = "AMBIGUOUS... | [
"literal.string.change",
"assignment.value.change"
] | 859,375 | 859,376 | u591440280 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define dmp(x) cerr << #x << ":" << x << endl
#define FOR(i, a, b) for (int i = (int)a, c = (int)b; i < c; ++i)
#define rep(i, b) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define dmp(x) cerr << #x << ":" << x << endl
#define FOR(i, a, b) for (int i = (int)a, c = (int)b; i < c; ++i)
#define rep(i, b) ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 859,382 | 859,383 | u084871864 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int d = x % 10;
x /= 10;
int c = x % 10;
x /= 10;
int b = x % 10;
x /= 10;
int a = x;
// abcd
int l = a * 10 + x;
int r = c * 10 + d;
if (l <= 12 && l > 0 && r <= 12 && r > 0) {
cout << "AMBIGUOUS" << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int d = x % 10;
x /= 10;
int c = x % 10;
x /= 10;
int b = x % 10;
x /= 10;
int a = x;
// abcd
int l = a * 10 + b;
int r = c * 10 + d;
if (l <= 12 && l > 0 && r <= 12 && r > 0) {
cout << "AMBIGUOUS" << endl;
ret... | [
"identifier.change",
"expression.operation.binary.change"
] | 859,394 | 859,395 | u504403442 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int main() {
int mae, usiro;
string s, ans;
cin >> s;
mae = (s[0] - '0') * 10 + (s[1] - '0');
usiro = (s[2] - '0') * 10 + (s[3] - '0');
if (mae == 0 || mae > 12) {
if (usiro == 0 || usiro >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int main() {
int mae, usiro;
string s, ans;
cin >> s;
mae = (s[0] - '0') * 10 + (s[1] - '0');
usiro = (s[2] - '0') * 10 + (s[3] - '0');
if (mae == 0 || mae > 12) {
if (usiro == 0 || usiro >... | [
"literal.string.change",
"assignment.value.change"
] | 859,418 | 859,419 | u193591892 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
int num;
int a, b;
cin >> num;
a = 0;
b = 0;
while (num > 99) {
num -= 100;
a++;
}
while (num > 0) {
num -= 1;
b++;
}
if (a < 13 && a > 0 && b < 13 && b > 0) {
cout << "AMBIGUOUS";
} else if (a < 13 && a ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int num;
int a, b;
cin >> num;
a = 0;
b = 0;
while (num > 99) {
num -= 100;
a++;
}
while (num > 0) {
num -= 1;
b++;
}
if (a < 13 && a > 0 && b < 13 && b > 0) {
cout << "AMBIGUOUS";
} else if (a < 13 && a ... | [
"literal.string.change",
"io.output.change"
] | 859,447 | 859,448 | u872794515 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, MOD = 1e9 + 7;
typedef long long ll;
int n, c, u, v, k, tc, ans;
char s[N];
int main() {
bool YYMM = false, MMYY = false;
scanf("%s", s);
int m = (s[0] - '0') * 10 + s[1] - '0', y = (s[2] - '0') * 10 + s[3] - '0';
if (m > 0 && m <= 12)
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, MOD = 1e9 + 7;
typedef long long ll;
int n, c, u, v, k, tc, ans;
char s[N];
int main() {
bool YYMM = false, MMYY = false;
scanf("%s", s);
int m = (s[0] - '0') * 10 + s[1] - '0', y = (s[2] - '0') * 10 + s[3] - '0';
if (m > 0 && m <= 12)
... | [
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,455 | 859,456 | u318875010 | cpp |
p03042 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*
* AND WATCH OUT FOR OFF BY ONE!!!
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*
* AND WATCH OUT FOR OFF BY ONE!!!
*/
#include <bits/stdc++.h>
const bool unsyncedio = std::ios::sync_with_stdio(false);
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define... | [
"literal.string.change",
"io.output.change"
] | 859,481 | 859,482 | u014617387 | cpp |
p03042 | // include
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | // include
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stri... | [
"variable_declaration.name.change",
"identifier.change"
] | 859,483 | 859,484 | u541830414 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int A = S / 100;
int B = S - S / 100 * 100;
bool Abool = false;
bool Bbool = false;
if (A > 1 && A < 13)
Abool = true;
if (B > 1 && B < 13)
Bbool = true;
if (Abool && Bbool)
cout << "AMBIGUOUS" << endl;
if (Abo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int A = S / 100;
int B = S - S / 100 * 100;
bool Abool = false;
bool Bbool = false;
if (A > 0 && A < 13)
Abool = true;
if (B > 0 && B < 13)
Bbool = true;
if (Abool && Bbool)
cout << "AMBIGUOUS" << endl;
if (Abo... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,491 | 859,492 | u689245321 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, tmp, res;
cin >> s;
tmp = s.substr(0, 2);
res = s.substr(2, 2);
if ("00" < tmp && tmp <= "12") {
if ("00" < res && res <= "12") {
cout << "AMBIGUOS";
} else
cout << "MMYY";
} else {
if ("00" < res && re... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, tmp, res;
cin >> s;
tmp = s.substr(0, 2);
res = s.substr(2, 2);
if ("00" < tmp && tmp <= "12") {
if ("00" < res && res <= "12") {
cout << "AMBIGUOUS";
} else
cout << "MMYY";
} else {
if ("00" < res && r... | [
"literal.string.change",
"io.output.change"
] | 859,493 | 859,494 | u661081791 | cpp |
p03042 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
int a = (s[0] - 48) * 10 + s[1] - 48;
int b = (s[2] - 48) * 10 + s[3] - 48;
if (a > 0 && a <= 12) {
if (b > 0 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "YYMM" << endl;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
int a = (s[0] - 48) * 10 + s[1] - 48;
int b = (s[2] - 48) * 10 + s[3] - 48;
if (a > 0 && a <= 12) {
if (b > 0 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 859,496 | 859,497 | u942393279 | cpp |
p03042 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
int a = (s[0] - 48) * 10 + s[1] - 48;
int b = (s[2] - 48) * 10 + s[3] - 48;
if (a >= 0 && a <= 12) {
if (b >= 0 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "YYMM" << endl... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
int a = (s[0] - 48) * 10 + s[1] - 48;
int b = (s[2] - 48) * 10 + s[3] - 48;
if (a > 0 && a <= 12) {
if (b > 0 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 859,498 | 859,497 | u942393279 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int M = S % 100;
if (L >= 1 && L <= 12) {
if (M >= 12 && M <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (M >= 1 && M <= 12)
cout << "YYMM" << endl;
else
... | #include <iostream>
using namespace std;
int main() {
int S;
cin >> S;
int L = S / 100;
int M = S % 100;
if (L >= 1 && L <= 12) {
if (M >= 1 && M <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (M >= 1 && M <= 12)
cout << "YYMM" << endl;
else
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,500 | 859,501 | u272169387 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool YYMM = false, MMYY = false;
if (N <= 1299 && N >= 100)
MMYY = true;
if (N & 100 <= 12 && N % 100 >= 1)
YYMM = true;
if (YYMM && MMYY)
cout << "AMBIGUOUS" << endl;
else if (YYMM)
cout << "YYMM" << endl;
els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool YYMM = false, MMYY = false;
if (N <= 1299 && N >= 100)
MMYY = true;
if (N % 100 <= 12 && N % 100 >= 1)
YYMM = true;
if (YYMM && MMYY)
cout << "AMBIGUOUS" << endl;
else if (YYMM)
cout << "YYMM" << endl;
els... | [
"control_flow.branch.if.condition.change"
] | 859,502 | 859,503 | u507188501 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool YYMM = false, MMYY = false;
if (N <= 1200 && N >= 100)
MMYY = true;
if (N & 100 <= 12 && N % 100 >= 1)
YYMM = true;
if (YYMM && MMYY)
cout << "AMBIGUOUS" << endl;
else if (YYMM)
cout << "YYMM" << endl;
els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool YYMM = false, MMYY = false;
if (N <= 1299 && N >= 100)
MMYY = true;
if (N % 100 <= 12 && N % 100 >= 1)
YYMM = true;
if (YYMM && MMYY)
cout << "AMBIGUOUS" << endl;
else if (YYMM)
cout << "YYMM" << endl;
els... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,504 | 859,503 | u507188501 | cpp |
p03042 | #include <iostream>
using namespace std;
int main(void) {
int num[2] = {0, 0};
string mes[4] = {"NA", "MMYY", "YYMM", "AMBIGUOUS"};
for (int i = 0; i < 3; i++) {
char c;
cin >> c;
num[i / 2] = num[i / 2] * 10 + (c - '0');
if (i % 2) {
num[i / 2] = (num[i / 2] > 0 && num[i / 2] <= 12) ? 1 :... | #include <iostream>
using namespace std;
int main(void) {
int num[2] = {0, 0};
string mes[4] = {"NA", "MMYY", "YYMM", "AMBIGUOUS"};
for (int i = 0; i < 4; i++) {
char c;
cin >> c;
num[i / 2] = num[i / 2] * 10 + (c - '0');
if (i % 2) {
num[i / 2] = (num[i / 2] > 0 && num[i / 2] <= 12) ? 1 :... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 859,505 | 859,506 | u023463844 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using itn = int;
using namespace std;
int ma... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using itn = int;
using namespace std;
int ma... | [
"literal.string.change",
"io.output.change"
] | 859,507 | 859,508 | u499009346 | cpp |
p03042 |
#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";
} else
cout << "MMYY";
}
if (1 <= R && R <= 12) {
cout << "YYMM";
} else
cout << "NA";
}
|
#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";
} else
cout << "MMYY";
} else if (1 <= R && R <= 12) {
cout << "YYMM";
} else
cout << "NA";
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 859,513 | 859,514 | u116136539 | cpp |
p03042 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <c... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <c... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,518 | 859,519 | u199371251 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
a = s / 100;
b = s % 100;
if (a == 0 || a > 12) {
if (b == 0 || b > 12) {
cout << "NA" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (b == 0 || b > 12) {
cout << "MMYY" << endl;
... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
a = s / 100;
b = s % 100;
if (a == 0 || a > 12) {
if (b == 0 || b > 12) {
cout << "NA" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (b == 0 || b > 12) {
cout << "MMYY" << endl;
... | [
"literal.string.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 859,523 | 859,524 | u625026729 | cpp |
p03042 | #include "string.h"
#include <iostream>
#include <sstream>
using namespace std;
int main() {
float s;
cin >> s;
int f2 = s / 100.0;
int l2 = (int)s % 100;
int count_yy_mm = 0;
int count_mm_yy = 0;
if (f2 >= 1 && f2 <= 99)
count_yy_mm++;
if (f2 >= 1 && f2 <= 12)
count_mm_yy++;
if (l2 >= 1 && l2... | #include "string.h"
#include <iostream>
#include <sstream>
using namespace std;
int main() {
float s;
cin >> s;
int f2 = s / 100.0;
int l2 = (int)s % 100;
int count_yy_mm = 0;
int count_mm_yy = 0;
if (f2 >= 0 && f2 <= 99)
count_yy_mm++;
if (f2 >= 1 && f2 <= 12)
count_mm_yy++;
if (l2 >= 1 && l2... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,525 | 859,526 | u008729541 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,530 | 859,531 | u976045235 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a = n / 100, b = n % 100, c = 0, d = 0;
if (a != 0 && a < 13)
c++;
if (b != 0 && b < 13)
d++;
if (c + d == 2)
cout << "NA" << endl;
else if (c + d == 1) {
if (c == 1)
cout << "MMYY" << endl;
else
cou... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a = n / 100, b = n % 100, c = 0, d = 0;
if (a != 0 && a < 13)
c++;
if (b != 0 && b < 13)
d++;
if (c + d == 2)
cout << "AMBIGUOUS" << endl;
else if (c + d == 1) {
if (c == 1)
cout << "MMYY" << endl;
else
... | [
"literal.string.change",
"io.output.change"
] | 859,534 | 859,535 | u921168761 | cpp |
p03042 | /*
author said_v15
*
created with web_programmer
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string stri;
#define forn for (i = 0; i < n; i++)
#define car cin >> arr[i]
#define fl int flag = 0;
#define forn2 for (i = 0; i < 2 * n; i++)
#define pb push_back
#define pob pop_ba... | /*
author said_v15
*
created with web_programmer
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string stri;
#define forn for (i = 0; i < n; i++)
#define car cin >> arr[i]
#define fl int flag = 0;
#define forn2 for (i = 0; i < 2 * n; i++)
#define pb push_back
#define pob pop_ba... | [] | 859,546 | 859,547 | u972416449 | cpp |
p03042 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
#define FOR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
#define FOR(i, a, b) for (l... | [
"literal.string.change",
"call.arguments.change"
] | 859,551 | 859,552 | u835924161 | cpp |
p03042 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [] | 859,553 | 859,554 | u468700753 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
int main() {
string s;
cin >> s;
vl a(4);
for (int i = 0; i < 4; ++i)
a[i] = s[i] - '0';
if (1 <= a[0] * 10 + a[1]... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
int main() {
string s;
cin >> s;
vl a(4);
for (int i = 0; i < 4; ++i)
a[i] = s[i] - '0';
if (1 <= a[0] * 10 + a[1]... | [
"literal.string.change",
"io.output.change"
] | 859,563 | 859,564 | u386131832 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
int main() {
string s;
cin >> s;
vl a(4);
for (int i = 0; i < 4; ++i)
a[i] = s[i] - '0';
if (1 <= a[0] * 10 + a[1]... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
int main() {
string s;
cin >> s;
vl a(4);
for (int i = 0; i < 4; ++i)
a[i] = s[i] - '0';
if (1 <= a[0] * 10 + a[1]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 859,565 | 859,564 | u386131832 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " =... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " =... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,579 | 859,580 | u697232864 | cpp |
p03042 | #include <iostream>
using namespace std;
bool isMM(string s) {
int n = stoi(s);
return 1 <= n && n <= 12;
}
int main() {
string s;
cin >> s;
pair<bool, bool> pa = make_pair(isMM(s.substr(0, 2)), isMM(s.substr(2, 2)));
if (pa.first && pa.second)
cout << "AMIGUOUS";
else if (pa.first && !pa.second)
... | #include <iostream>
using namespace std;
bool isMM(string s) {
int n = stoi(s);
return 1 <= n && n <= 12;
}
int main() {
string s;
cin >> s;
pair<bool, bool> pa = make_pair(isMM(s.substr(0, 2)), isMM(s.substr(2, 2)));
if (pa.first && pa.second)
cout << "AMBIGUOUS";
else if (pa.first && !pa.second)
... | [
"literal.string.change",
"io.output.change"
] | 859,591 | 859,592 | u505195286 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int S, top2, bottom2;
string answer;
cin >> S;
top2 = S / 100;
bottom2 = S % 100;
if ((top2 > 12 || top2 == 0) && (bottom2 <= 12 || bottom2 >= 1))
answer = "YYMM";
else if ((bottom2 > 12 || bottom2 == 0) && ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int S, top2, bottom2;
string answer;
cin >> S;
top2 = S / 100;
bottom2 = S % 100;
if ((top2 > 12 || top2 == 0) && (bottom2 <= 12 && bottom2 >= 1))
answer = "YYMM";
else if ((bottom2 > 12 || bottom2 == 0) && ... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"literal.string.change",
"assignment.value.change"
] | 859,613 | 859,614 | u969617556 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
int S;
cin >> S;
string result;
int up = S / 100;
int down = S % 100;
if ((up >= 13) && (down >= 13))
result = "NA";
else if ((up >= 13) && (1 <= down && down <= 12))
result = "YYMM";
else if ((up >= 13) && (down == 0))
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int S;
cin >> S;
string result;
int up = S / 100;
int down = S % 100;
if ((up >= 13) && (down >= 13))
result = "NA";
else if ((up >= 13) && (1 <= down && down <= 12))
result = "YYMM";
else if ((up >= 13) && (down == 0))
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 859,620 | 859,621 | u704719854 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a % 100 > 12 || a % 100 != 0) {
if (a / 100 > 12 || a / 100 != 0) {
cout << "NA";
} else {
cout << "MMYY";
}
} else {
if (a / 100 > 12 || a / 100 != 0) {
cout << "YYMM";
} else {
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
if (a % 100 > 12 || a % 100 == 0) {
if (a / 100 > 12 || a / 100 == 0) {
cout << "NA";
} else {
cout << "MMYY";
}
} else {
if (a / 100 > 12 || a / 100 == 0) {
cout << "YYMM";
} else {
cout << "... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,622 | 859,623 | u200855589 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int first, last;
bool fYY = 0, fMM = 0;
bool lYY = 0, lMM = 0;
cin >> S;
last = first = atoi(S.c_str());
last = first % 100;
first = first / 100;
// is first YY?
if (first >= 0 && first < 100) {
fYY = true;... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int first, last;
bool fYY = 0, fMM = 0;
bool lYY = 0, lMM = 0;
cin >> S;
last = first = atoi(S.c_str());
last = first % 100;
first = first / 100;
// is first YY?
if (first >= 0 && first < 100) {
fYY = true;... | [
"literal.string.change",
"assignment.value.change"
] | 859,644 | 859,645 | u358822669 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[4][100] = {"AMBIGUOUS", "YYMM", "MMYY", "NA"};
int a, ans = 0;
cin >> a;
if (a / 100 > 12 || a / 100 == 0)
ans += 1;
if (a % 100 > 12 || a / 100 == 0)
ans += 2;
cout << s[ans];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char s[4][100] = {"AMBIGUOUS", "YYMM", "MMYY", "NA"};
int a, ans = 0;
cin >> a;
if (a / 100 > 12 || a / 100 == 0)
ans += 1;
if (a % 100 > 12 || a % 100 == 0)
ans += 2;
cout << s[ans];
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 859,652 | 859,653 | u219398458 | cpp |
p03042 | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int t = s % 100;
int u = s - t;
if (t >= 1 && t <= 12) {
if (u >= 1 && u <= 12) {
printf("AMBIGUOUS");
} else {
printf("YYMM");
}
} else {
if (u >= 1 && u <= 12) {
printf("MMYY");
} else {
printf("NA");
... | #include <stdio.h>
int main(void) {
int s;
scanf("%d", &s);
int t = s % 100;
int u = (s - t) / 100;
if (t >= 1 && t <= 12) {
if (u >= 1 && u <= 12) {
printf("AMBIGUOUS");
} else {
printf("YYMM");
}
} else {
if (u >= 1 && u <= 12) {
printf("MMYY");
} else {
printf(... | [
"assignment.change"
] | 859,659 | 859,660 | u222643545 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
string S;
int main() {
cin >> S;
int up = atoi(S.substr(0, 2).c_str());
int lw = atoi(S.substr(2, 2).c_str());
bool yymm = false;
bool mmyy = false;
if (up >= 0 && up <= 99 && lw >= 1 && lw <= 12) {
yymm =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
string S;
int main() {
cin >> S;
int up = atoi(S.substr(0, 2).c_str());
int lw = atoi(S.substr(2, 2).c_str());
bool yymm = false;
bool mmyy = false;
if (up >= 0 && up <= 99 && lw >= 1 && lw <= 12) {
yymm =... | [
"literal.string.change",
"io.output.change"
] | 859,666 | 859,667 | u489053642 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
if ((n / 100 == 0 || n / 100 > 12) && (n % 100 == 0 || n % 100 > 12))
cout << "NA\n";
else if (n / 100 == 0 || n / 100 > 12)
cout << "YYMM\n";
else if (n % 100 == 0 || n % 100 > 12)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
if ((n / 100 == 0 || n / 100 > 12) && (n % 100 == 0 || n % 100 > 12))
cout << "NA\n";
else if (n / 100 == 0 || n / 100 > 12)
cout << "YYMM\n";
else if (n % 100 == 0 || n % 100 > 12)
... | [
"literal.string.change",
"io.output.change"
] | 859,668 | 859,669 | u132434645 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,670 | 859,671 | u558092537 | cpp |
p03042 | #include <cstdio>
int main() {
int n;
scanf("%d", &n);
int a, b;
a = n / 100;
b = n % 100;
int p = 0;
int q = 0;
if (0 < b && b < 13)
p = 1;
if (0 < a && a < 13)
q = 1;
if (p + q == 2)
printf("AMBIGUOUOS");
else if (p == 1)
printf("YYMM");
else if (q == 1)
printf("MMYY");
e... | #include <cstdio>
int main() {
int n;
scanf("%d", &n);
int a, b;
a = n / 100;
b = n % 100;
int p = 0;
int q = 0;
if (0 < b && b < 13)
p = 1;
if (0 < a && a < 13)
q = 1;
if (p + q == 2)
printf("AMBIGUOUS");
else if (p == 1)
printf("YYMM");
else if (q == 1)
printf("MMYY");
el... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,674 | 859,675 | u016382081 | cpp |
p03042 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,678 | 859,679 | u601825761 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007LL;
int main(void) {
string S;
cin >> S;
int Y, M, flag = 0;
Y = (S[0] - '0') * 10 + (S[1] - '0');
M = (S[2] ... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007LL;
int main(void) {
string S;
cin >> S;
int Y, M, flag = 0;
Y = (S[0] - '0') * 10 + (S[1] - '0');
M = (S[2] ... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 859,680 | 859,681 | u677149117 | cpp |
p03042 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"literal.string.change",
"io.output.change"
] | 859,682 | 859,683 | u918357423 | cpp |
p03042 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < static_cast<long long>(n); i++)
#define repi(i, a, b) \
for (long long i = static_cast<long long>(a); i < static_cast<long long>(b); ... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < static_cast<long long>(n); i++)
#define repi(i, a, b) \
for (long long i = static_cast<long long>(a); i < static_cast<long long>(b); ... | [
"literal.string.change",
"expression.operation.binary.change"
] | 859,684 | 859,685 | u897282055 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 859,692 | 859,693 | u030992242 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long mod2 = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b... | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long mod2 = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b... | [
"variable_declaration.value.change"
] | 859,694 | 859,695 | u811472478 | cpp |
p03042 | #include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define lp(i, a, n) for (int i = a; i <= n; ++i)
#define lpd(i, a, n) for (int i = a; i >= n; --i)
#define mem(a, b) memset(a, b, sizeof a)
#define all(v) v.begin(), v.end()
#define println(a) cout << (a) << endl
#define... | #include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define lp(i, a, n) for (int i = a; i <= n; ++i)
#define lpd(i, a, n) for (int i = a; i >= n; --i)
#define mem(a, b) memset(a, b, sizeof a)
#define all(v) v.begin(), v.end()
#define println(a) cout << (a) << endl
#define... | [
"literal.string.change",
"io.output.change"
] | 859,698 | 859,699 | u527876446 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 200000000007;
signed main() {
int a;
cin >> a;
if ((a % 100) < 13 && (a % 100) > 0) {
if (a / 100 < 13 && a / 100 > 0)
cout << "AMBIGUOUS";
else
cout << "YYMM";
} else {
if (a / 100 < 13 && a / 100 > 0)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 200000000007;
signed main() {
int a;
cin >> a;
if ((a % 100) < 13 && (a % 100) > 0) {
if (a / 100 < 13 && a / 100 > 0)
cout << "AMBIGUOUS";
else
cout << "YYMM";
} else {
if (a / 100 < 13 && a / 100 > 0)... | [
"literal.string.change",
"io.output.change"
] | 859,700 | 859,701 | u651317892 | cpp |
p03042 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4; i++)
s[i] -= '0';
ll a = s[0] * 10 + s[1];
ll b = s[2] * 10 + s[3];
bool vl = (1 <= a && a <= 12);
bool vr = (1 <= b && b <= 12);
if (vl & vr)
cout << "AMB... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 4; i++)
s[i] -= '0';
ll a = s[0] * 10 + s[1];
ll b = s[2] * 10 + s[3];
bool vl = (1 <= a && a <= 12);
bool vr = (1 <= b && b <= 12);
if (vl & vr)
cout << "AMB... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 859,702 | 859,703 | u924885571 | cpp |
p03042 | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,704 | 859,705 | u774596402 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
typedef long long LL;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int a = stoi(s.substr(0, 2));
int b = stoi(s.substr(2, 2));
auto isM = [=](int a) { return a > 0 and a < 12; };
if (isM(a) a... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
typedef long long LL;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int a = stoi(s.substr(0, 2));
int b = stoi(s.substr(2, 2));
auto isM = [=](int a) { return a > 0 and a <= 12; };
if (isM(a) ... | [
"expression.operator.compare.change"
] | 859,706 | 859,707 | u459737327 | cpp |
p03042 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;
int main() {
string s;
cin >> s;
int... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;
int main() {
string s;
cin >> s;
int... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,708 | 859,709 | u407614884 | cpp |
p03042 | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i =... | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i, n) for (int i =... | [
"control_flow.branch.if.condition.change"
] | 859,728 | 859,729 | u435935167 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int S;
cin >> S;
int AA, BB;
AA = S / 100;
BB = S - AA * 100;
if ((0 == AA || AA >... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int S;
cin >> S;
int AA, BB;
AA = S / 100;
BB = S - AA * 100;
if ((0 == AA || AA >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,735 | 859,736 | u963037787 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define mii map<int, int>
#define si set<int>
#define sti stack<int>
#define qi queue<int>
#define vi vector<int>
#define IOS ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define mii map<int, int>
#define si set<int>
#define sti stack<int>
#define qi queue<int>
#define vi vector<int>
#define IOS ... | [
"literal.string.change",
"io.output.change"
] | 859,743 | 859,744 | u231918578 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int N;
int K;
int S;
string b;
cin >> S;
N = S / 100;
K = S - N * 100;
if (N == 0) {
if ((0 < K) && (K < 13)) {
b = "YYMM";
} else
b = "NA";
}
if (K == 0) {
if ((0 < N) && (N < 13)) {
b = "MMYY";
} else
... | #include <iostream>
using namespace std;
int main() {
int N;
int K;
int S;
string b;
cin >> S;
N = S / 100;
K = S - N * 100;
if (N == 0) {
if ((0 < K) && (K < 13)) {
b = "YYMM";
} else
b = "NA";
}
if (K == 0) {
if ((0 < N) && (N < 13)) {
b = "MMYY";
} else
... | [
"literal.string.change",
"assignment.value.change"
] | 859,752 | 859,753 | u768204022 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> P;
int main() {
int S, L, R;
string ans;
cin >> S;
R = S % 100;
L = S / 100;
if (R <= 12 && L <= 12 && L > 0 && R > 0) {
ans = "MBIGUOUS";
} else if ((R > 12 |... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> P;
int main() {
int S, L, R;
string ans;
cin >> S;
R = S % 100;
L = S / 100;
if (R <= 12 && L <= 12 && L > 0 && R > 0) {
ans = "AMBIGUOUS";
} else if ((R > 12 ... | [
"literal.string.change",
"assignment.value.change"
] | 859,758 | 859,759 | u283779141 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> P;
int main() {
int S, L, R;
string ans;
cin >> S;
R = S % 100;
L = S / 100;
if (R <= 12 && L <= 12 && (L > 0 || R > 0)) {
ans = "MBIGUOUS";
} else if ((R > 12... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> P;
int main() {
int S, L, R;
string ans;
cin >> S;
R = S % 100;
L = S / 100;
if (R <= 12 && L <= 12 && L > 0 && R > 0) {
ans = "AMBIGUOUS";
} else if ((R > 12 ... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"literal.string.change",
"assignment.value.change"
] | 859,760 | 859,759 | u283779141 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,761 | 859,762 | u550398291 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b;
cin >> S;
a = S / 100;
b = S - 100 * a;
if ((a > 12 || a == 0) && (b > 12 || b == 0)) {
cout << "NA" << endl;
} else if ((a > 12 || a == 0) && 12 >= b && b > 0) {
cout << "YYMM" << endl;
} else if (12 >= a && a > 0 && (b > 12 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b;
cin >> S;
a = S / 100;
b = S - 100 * a;
if ((a > 12 || a == 0) && (b > 12 || b == 0)) {
cout << "NA" << endl;
} else if ((a > 12 || a == 0) && 12 >= b && b > 0) {
cout << "YYMM" << endl;
} else if (12 >= a && a > 0 && (b > 12 ... | [
"literal.string.change",
"io.output.change"
] | 859,765 | 859,766 | u801530021 | cpp |
p03042 | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> S;
string result = "NA";
int str_first = atoi(S.substr(0, 2).c_str());
int str_second = atoi(S.substr(2, 2).c_str());... | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> S;
string result = "NA";
int str_first = atoi(S.substr(0, 2).c_str());
int str_second = atoi(S.substr(2, 2).c_str());... | [
"literal.string.change",
"assignment.value.change"
] | 859,807 | 859,808 | u758765597 | cpp |
p03042 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int S, AA, BB;
string tmp;
bool isYYMM = false;
bool isMMYY = false;
cin >> tmp;
S = stoi(tmp);
AA = S / 100;
BB = S % 100;
// judge YYMM
if ((12 >= BB) && (BB >= 1)) {
isYYMM = true;
}
// judg... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int S, AA, BB;
string tmp;
bool isYYMM = false;
bool isMMYY = false;
cin >> tmp;
S = stoi(tmp);
AA = S / 100;
BB = S % 100;
// judge YYMM
if ((12 >= BB) && (BB >= 1)) {
isYYMM = true;
}
// judg... | [
"literal.string.change",
"io.output.change"
] | 859,813 | 859,814 | u989110852 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
bool ym_able, my_able;
int date = stoi(s);
if (date % 100 >= 1 && date % 100 <= 12)
ym_able = true;
if (date / 100 >= 1 && date / 100 <= 12)
my_able = true;
if (ym_able) {
if (my_able)
cout <... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
bool ym_able = false, my_able = false;
int date = stoi(s);
if (date % 100 >= 1 && date % 100 <= 12)
ym_able = true;
if (date / 100 >= 1 && date / 100 <= 12)
my_able = true;
if (ym_able) {
if (my_ab... | [
"variable_declaration.value.change"
] | 859,815 | 859,816 | u451538287 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,821 | 859,822 | u614063956 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 859,823 | 859,822 | u614063956 | cpp |
p03042 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define RFOR(i, a, b) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define ALL(obj) (obj).begin... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define RFOR(i, a, b) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define ALL(obj) (obj).begin... | [
"literal.string.change",
"io.output.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,835 | 859,836 | u220997159 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a;
int a1, a2;
cin >> a1;
a2 = a1 % 100;
a1 = a1 / 100;
if (a1 < 12 && a1 != 0) {
a1 = 9;
} else {
a1 = 0;
}
if (a2 < 12 && a2 != 0) {
a2 = 9;
} else {
a2 = 0;
}
if (a1 * a2 == 81... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a;
int a1, a2;
cin >> a1;
a2 = a1 % 100;
a1 = a1 / 100;
if (a1 <= 12 && a1 != 0) {
a1 = 9;
} else {
a1 = 0;
}
if (a2 <= 12 && a2 != 0) {
a2 = 9;
} else {
a2 = 0;
}
if (a1 * a2 == ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,846 | 859,847 | u373291210 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a;
int a1, a2;
cin >> a1;
a2 = a1 % 100;
a1 = a1 / 100;
if (a1 < 12 && a1 != 0) {
a1 = 9;
} else {
a1 = 0;
}
if (a1 < 12 && a1 != 0) {
a2 = 9;
} else {
a2 = 0;
}
if (a1 * a2 == 81... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
int a;
int a1, a2;
cin >> a1;
a2 = a1 % 100;
a1 = a1 / 100;
if (a1 <= 12 && a1 != 0) {
a1 = 9;
} else {
a1 = 0;
}
if (a2 <= 12 && a2 != 0) {
a2 = 9;
} else {
a2 = 0;
}
if (a1 * a2 == ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 859,848 | 859,847 | u373291210 | cpp |
p03042 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
char a, b, c, d;
cin >> a >> b >> c >> d;
int x = (a - '0') * 10 + b - '0';
int y = (c - '0') * 10 + d - '0';
if (x > 0 && x < 13) {
if (y > 0 && y < 13) {
cout << "AMBIGU... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
char a, b, c, d;
cin >> a >> b >> c >> d;
int x = (a - '0') * 10 + b - '0';
int y = (c - '0') * 10 + d - '0';
if (x > 0 && x < 13) {
if (y > 0 && y < 13) {
cout << "AMBIGU... | [
"literal.string.change",
"io.output.change"
] | 859,857 | 859,858 | u555962250 | cpp |
p03042 | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 859,859 | 859,860 | u109311178 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
int f = (S[0] - '0') * 10 + (S[1] - '0');
int l = (S[2] - '0') * 10 + (S[3] - '0');
if ((f == 0 || f >= 13) && (1 <= l && l < 12)) {
cout << "YYMM" << endl;
} else if ((1 <= f && f ... | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
cin >> S;
int f = (S[0] - '0') * 10 + (S[1] - '0');
int l = (S[2] - '0') * 10 + (S[3] - '0');
if ((f == 0 || f >= 13) && (1 <= l && l <= 12)) {
cout << "YYMM" << endl;
} else if ((1 <= f && f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 859,870 | 859,871 | u341347211 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int s;
cin >> s;
int f = s / 100, l = s %= 100;
if (0 < f && f <= 12 && 0 < l && l <= 12)
cout << "AMBIGIOUS\n";
else if (0 < f && f <= 12)
cout << "MMYY\n";
else if (0 < l && l <= 12)
cout << "YYMM\n";
else
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int s;
cin >> s;
int f = s / 100, l = s %= 100;
if (0 < f && f <= 12 && 0 < l && l <= 12)
cout << "AMBIGUOUS\n";
else if (0 < f && f <= 12)
cout << "MMYY\n";
else if (0 < l && l <= 12)
cout << "YYMM\n";
else
... | [
"literal.string.change",
"io.output.change"
] | 859,872 | 859,873 | u997023236 | cpp |
p03042 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int trans(std::string x) {
int ret = 0;
for (int i = 0; i < x.length(); ++i)
ret = ret * 10 + (x[i] ^ 48);
return ret;
}
std::string st;
int main() {
std::io... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int trans(std::string x) {
int ret = 0;
for (int i = 0; i < x.length(); ++i)
ret = ret * 10 + (x[i] ^ 48);
return ret;
}
std::string st;
int main() {
std::io... | [
"literal.number.change",
"call.arguments.change"
] | 859,882 | 859,883 | u240904580 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | [
"assignment.variable.change",
"identifier.change"
] | 859,884 | 859,885 | u714564133 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,886 | 859,885 | u714564133 | cpp |
p03042 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
int main() {
int N;
cin >> N;
int first = N / 100, second = N % 100;
string ans;
if (1 <= first && first <= 12) {
if (1 <= second && second <= 12)
ans = "AMBIGIOUS";
else
ans = "MMYY";
}
else {
if (1 <= second && ... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
int main() {
int N;
cin >> N;
int first = N / 100, second = N % 100;
string ans;
if (1 <= first && first <= 12) {
if (1 <= second && second <= 12)
ans = "AMBIGUOUS";
else
ans = "MMYY";
}
else {
if (1 <= second && ... | [
"misc.typo",
"literal.string.change",
"assignment.value.change"
] | 859,887 | 859,888 | u951952491 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
... | [
"literal.string.change",
"io.output.change"
] | 859,891 | 859,892 | u507128581 | cpp |
p03042 | /**
* @Author: WeakestRookie
* @Email: 1311053296@qq.com
* @DateTime: 2019-05-19 20:06:44
* @Description: Description
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(x, y, z) for (int x = y; x < z; ++x)
#define dwn(x, y, z) for (int x = y; x >= z; --x)
#define mst(a, b) memset(a, b, siz... | /**
* @Author: WeakestRookie
* @Email: 1311053296@qq.com
* @DateTime: 2019-05-19 20:06:44
* @Description: Description
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(x, y, z) for (int x = y; x < z; ++x)
#define dwn(x, y, z) for (int x = y; x >= z; --x)
#define mst(a, b) memset(a, b, siz... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 859,893 | 859,894 | u772258310 | cpp |
p03042 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"control_flow.branch.if.condition.change"
] | 859,899 | 859,900 | u057611820 | cpp |
p03042 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD (long long)1000000007
#define INF (long long)998244353
using namespace std;
int main(void) {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + s[1]... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD (long long)1000000007
#define INF (long long)998244353
using namespace std;
int main(void) {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + s[1]... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 859,901 | 859,902 | u122365993 | cpp |
p03042 | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i =... | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i =... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 859,909 | 859,910 | u379822620 | cpp |
p03042 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ... | [
"literal.string.change",
"call.arguments.change"
] | 859,917 | 859,918 | u190234543 | cpp |
p03042 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a = stoi(s.substr(0, 2));
int b = stoi(s.substr(2, 2));
bool c = (1 <= a && a <= 12);
bool d = (1 <= b && b <= 12);
cout << (!c && d ? "YYMM"
: c && !d ? "MMYY"
: !c && !d ? "NA"
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a = stoi(s.substr(0, 2));
int b = stoi(s.substr(2, 2));
bool c = (1 <= a && a <= 12);
bool d = (1 <= b && b <= 12);
cout << (!c && d ? "YYMM"
: c && !d ? "MMYY"
: !c && !d ? "NA"
... | [
"literal.string.change",
"io.output.change"
] | 859,925 | 859,926 | u338550320 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
bool MMYY = false, YYMM = true;
int k;
cin >> k;
if (k / 100 <= 12 && k / 100 >= 1)
MMYY = true;
if (k % 100 <= 12 && k % 100 >= 1)
YYMM = true;
if (MMYY && YYMM)
cout <... | #include <bits/stdc++.h>
using namespace std;
// __builtin_popcount
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
bool MMYY = false, YYMM = false;
int k;
cin >> k;
if (k / 100 <= 12 && k / 100 >= 1)
MMYY = true;
if (k % 100 <= 12 && k % 100 >= 1)
YYMM = true;
if (MMYY && YYMM)
cout ... | [
"misc.opposites",
"variable_declaration.value.change"
] | 859,929 | 859,930 | u170407818 | cpp |
p03042 | /**
* @Author: G_bg
* @DateTime: 2019-05-19 20:06:26
* @Description:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const double PI = 3.1415926535898;
const double E = 2.718281828459;
const int INF = 0x7fffffff;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int main(int argc, c... | /**
* @Author: G_bg
* @DateTime: 2019-05-19 20:06:26
* @Description:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const double PI = 3.1415926535898;
const double E = 2.718281828459;
const int INF = 0x7fffffff;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int main(int argc, c... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,939 | 859,940 | u838609976 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
int s;
cin >> s;
int a = 0, b = 0;
a += s % 10;
s /= 10;
a += 10 * (s % 10);
s /= 10;
b += s % 10;
s /= 10;
b += 10 * (s % 10);
s /= 10;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
int s;
cin >> s;
int a = 0, b = 0;
a += s % 10;
s /= 10;
a += 10 * (s % 10);
s /= 10;
b += s % 10;
s /= 10;
b += 10 * (s % 10);
s /= 10;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout <... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 859,947 | 859,948 | u905270643 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.