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 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | [
"expression.operator.compare.change",
"expression.operation.binary.change",
"misc.typo",
"literal.string.change",
"io.output.change"
] | 857,274 | 857,273 | u727064118 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
void b_yymm_or_mmyy(void) {
string s;
cin >> s;
int upper, lower;
string sub_s;
sub_s = s.substr(0, 2);
upper = stoi(sub_s);
sub_s = s.substr(2, 2);
lower = stoi(sub_s);
string upper_type, lower_type;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
void b_yymm_or_mmyy(void) {
string s;
cin >> s;
int upper, lower;
string sub_s;
sub_s = s.substr(0, 2);
upper = stoi(sub_s);
sub_s = s.substr(2, 2);
lower = stoi(sub_s);
string upper_type, lower_type;
... | [
"literal.string.change",
"io.output.change"
] | 857,275 | 857,276 | u635435492 | cpp |
p03042 | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
char *S = (char *)calloc(5, sizeof(char));
cin >> S;
string ans;
char *first = (char *)calloc(3, sizeof(char));
first[0] = S[0];
first[1] = S[1];
... | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
char *S = (char *)calloc(5, sizeof(char));
cin >> S;
string ans;
char *first = (char *)calloc(3, sizeof(char));
first[0] = S[0];
first[1] = S[1];
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,283 | 857,284 | u944033453 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"literal.string.change",
"io.output.change"
] | 857,287 | 857,288 | u899592602 | cpp |
p03042 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
ifstream in("bleach.in");
ofstream out("bleach.out");
int const NMAX = 1e6;
int v[1 + NMAX];
int main() {
string inp;
cin >> inp;
if ((inp[0] - '0') * 10 + (inp[1] - '0') <= 12 &&
(inp[2] - '0') * 10 + (i... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
ifstream in("bleach.in");
ofstream out("bleach.out");
int const NMAX = 1e6;
int v[1 + NMAX];
int main() {
string inp;
cin >> inp;
if ((inp[0] - '0') * 10 + (inp[1] - '0') <= 12 &&
(inp[2] - '0') * 10 + (i... | [
"literal.string.change",
"io.output.change"
] | 857,292 | 857,293 | u529371621 | cpp |
p03042 | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define ll long long
#define pi (acos(-1))
int main() {
int s;
std::cin >> s;
int a, b;
a = s / 100;
b = s % 100;
if (1 < a && a <= 12) {
if (1 < b && b <= 12) {
std::cout << "AMBIGUOUS" << std::endl;
} else {
st... | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define ll long long
#define pi (acos(-1))
// https://atcoder.jp/contests/abc172/tasks/abc172_d
int main() {
int s;
std::cin >> s;
int a, b;
a = s / 100;
b = s % 100;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
std::... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 857,294 | 857,295 | u430479790 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b;
cin >> S;
a = S / 100;
b = S % 100;
if (a != 0 && a <= 12) {
if (b != 0 && b <= 12)
cout << "AMBIGOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (b != 0 && b <= 12)
cout << "YYMM" << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, a, b;
cin >> S;
a = S / 100;
b = S % 100;
if (a != 0 && a <= 12) {
if (b != 0 && b <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (b != 0 && b <= 12)
cout << "YYMM" << endl;
else... | [
"literal.string.change",
"io.output.change"
] | 857,321 | 857,322 | u113287534 | cpp |
p03042 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string S;
cin >> S;
string S1 = S.substr(0, 2);
string S2 = S.substr(2, 2);
int s1 = atoi(S1.c_str());
int s2 = atoi(S2.c_str());
if (1 <= s1 && ... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string S;
cin >> S;
string S1 = S.substr(0, 2);
string S2 = S.substr(2, 2);
int s1 = atoi(S1.c_str());
int s2 = atoi(S2.c_str());
if (1 <= s1 && ... | [
"literal.string.change",
"io.output.change"
] | 857,329 | 857,330 | u083494782 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#i... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#i... | [
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 857,331 | 857,332 | u940569542 | cpp |
p03042 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | [
"literal.string.change",
"call.arguments.change"
] | 857,333 | 857,334 | u950002813 | cpp |
p03042 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | [
"literal.string.change",
"call.arguments.change"
] | 857,335 | 857,334 | u950002813 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
cin >> s;
int f, b;
int ff = 0;
f = (s[0] - '0') * 10;
f += s[1] - '0';
b = (s[2] - '0') * 10;
b += s[3] - '0';
if (f <= 13 && f > 0) {
ff = 1;
}
if (b <= 13 && b > 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
string s;
cin >> s;
int f, b;
int ff = 0;
f = (s[0] - '0') * 10;
f += s[1] - '0';
b = (s[2] - '0') * 10;
b += s[3] - '0';
if (f < 13 && f > 0) {
ff = 1;
}
if (b < 13 && b > 0) {
ff... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 857,355 | 857,356 | u056793408 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define AL... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define AL... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,361 | 857,362 | u379928983 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define AL... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define AL... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,364 | 857,362 | u379928983 | cpp |
p03042 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define M_PI 3.14159265358979323846
void solve() {
string s;
cin >> s;
string s1 = s.substr(0, 2);
string s2 = s.substr(2, 2);
int x = stoi(s1);
int y = stoi(s2);
int ans = 0;
if (x >=... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define M_PI 3.14159265358979323846
void solve() {
string s;
cin >> s;
string s1 = s.substr(0, 2);
string s2 = s.substr(2, 2);
int x = stoi(s1);
int y = stoi(s2);
int ans = 0;
if (x >=... | [
"literal.string.change",
"io.output.change"
] | 857,377 | 857,378 | u395652671 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int a = n / 100;
int b = n % 100;
if (1 <= a && a <= 12) {
if (1 <= b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int a = n / 100;
int b = n % 100;
if (1 <= a && a <= 12) {
if (1 <= b... | [
"literal.string.change",
"io.output.change"
] | 857,402 | 857,403 | u534923072 | cpp |
p03042 | #include <bits/stdc++.h>
#include <math.h>
int n, m, i, j, k, count1 = 0, count2 = 0;
using namespace std;
void ABC120(void);
void ABC121(void);
void ABC122(void);
void ABC123(void);
void ABC124(void);
void ABC125(void);
void ABC126(void);
void ABC127(void);
void ABC128(void);
void ABC129(void);
int main(void) { ABC12... | #include <bits/stdc++.h>
#include <math.h>
int n, m, i, j, k, count1 = 0, count2 = 0;
using namespace std;
void ABC120(void);
void ABC121(void);
void ABC122(void);
void ABC123(void);
void ABC124(void);
void ABC125(void);
void ABC126(void);
void ABC127(void);
void ABC128(void);
void ABC129(void);
int main(void) { ABC12... | [
"literal.string.change",
"io.output.change"
] | 857,410 | 857,411 | u225660136 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool a = (n % 100 == 0 || n % 100 > 12), b = (n / 100 == 0 || n / 100 > 12);
if (a && b)
cout << "NA";
if (!a && b)
cout << "YYMM";
if (a && !b)
cout << "MMYY";
if (!a && !b)
cout << "AMBGIOUS";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool a = (n % 100 == 0 || n % 100 > 12), b = (n / 100 == 0 || n / 100 > 12);
if (a && b)
cout << "NA";
if (!a && b)
cout << "YYMM";
if (a && !b)
cout << "MMYY";
if (!a && !b)
cout << "AMBIGUOUS";
cout << endl;
} | [
"literal.string.change",
"io.output.change"
] | 857,412 | 857,413 | u346324165 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
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 << "AMBIGUOS";
else
cout << "YYMM";
} else {
if (1 <= R && R <= 12)
cout << "MMYY";
el... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
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 << "YYMM";
} else {
if (1 <= R && R <= 12)
cout << "MMYY";
e... | [
"literal.string.change",
"io.output.change"
] | 857,414 | 857,415 | u058742919 | cpp |
p03042 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | [
"literal.string.change"
] | 857,416 | 857,417 | u803173123 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define all(v) (v).begin(), (v).end()
const int INF = 1001001001;
int main() {
int s;
cin >> s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define all(v) (v).begin(), (v).end()
const int INF = 1001001001;
int main() {
int s;
cin >> s... | [
"misc.opposites",
"variable_declaration.value.change"
] | 857,420 | 857,421 | u160861278 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string fs = s.substr(0, 2);
string ls = s.substr(2);
bool yymm = false;
bool mmyy = false;
int f = atoi(fs.c_str());
int l = atoi(ls.c_str());
if (1 <= l && l <= 12)
yymm = true;
if (f <= l && f <= 12)
mmyy = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string fs = s.substr(0, 2);
string ls = s.substr(2);
bool yymm = false;
bool mmyy = false;
int f = atoi(fs.c_str());
int l = atoi(ls.c_str());
if (1 <= l && l <= 12)
yymm = true;
if (1 <= f && f <= 12)
mmyy = ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 857,426 | 857,427 | u679419784 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
// std::sort(v.begin(), v.end(), std::greater<Type>());
int gcd(int x, i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
// std::sort(v.begin(), v.end(), std::greater<Type>());
int gcd(int x, i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,434 | 857,435 | u229427161 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s;
cin >> s;
int L = s / 100;
int R = s % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= R && R <= 12) {
cout << "Y... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s;
cin >> s;
int L = s / 100;
int R = s % 100;
if (1 <= L && L <= 12) {
if (1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= R && R <= 12) {
cout << "Y... | [
"literal.string.change",
"io.output.change"
] | 857,450 | 857,451 | u150155436 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A = 0;
cin >> N;
if (A / 100 > 0 && A / 100 < 13) {
A += 2;
}
if (A % 100 > 0 && A % 100 < 13) {
A++;
}
if (A == 3) {
cout << "AMBIGUOUS" << endl;
}
if (A == 2) {
cout << "MMYY" << endl;
}
if (A == 1) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A = 0;
cin >> N;
if (N / 100 > 0 && N / 100 < 13) {
A += 2;
}
if (N % 100 > 0 && N % 100 < 13) {
A++;
}
if (A == 3) {
cout << "AMBIGUOUS" << endl;
}
if (A == 2) {
cout << "MMYY" << endl;
}
if (A == 1) {
cout << ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,456 | 857,457 | u158290747 | cpp |
p03042 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REPR(i, n) for (long long i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FORR(i, m, n) for (long long i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.en... | [
"literal.string.change",
"io.output.change"
] | 857,468 | 857,469 | u557565572 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int x = s / 100;
int y = x % 100;
if (1 <= x && x <= 12) {
if (1 <= y && y <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= y && y <= 12)
cout << "YYMM" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int x = s / 100;
int y = s % 100;
if (1 <= x && x <= 12) {
if (1 <= y && y <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= y && y <= 12)
cout << "YYMM" << endl;
... | [
"identifier.change",
"expression.operation.binary.change"
] | 857,491 | 857,492 | u736265891 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int x = s / 100;
int y = x % 100;
if (1 <= x && x <= 12) {
if (1 <= y && y <= 12)
cout << "AMBIGUOUS" << endl;
cout << "MMYY" << endl;
} else {
if (1 <= y && y <= 12)
cout << "YYMM" << endl;
cout << "NA... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int x = s / 100;
int y = s % 100;
if (1 <= x && x <= 12) {
if (1 <= y && y <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= y && y <= 12)
cout << "YYMM" << endl;
... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 857,493 | 857,492 | u736265891 | cpp |
p03042 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define init() \
ios::sync_with_stdio(false); \
cin.tie(0)
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = ... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define init() \
ios::sync_with_stdio(false); \
cin.tie(0)
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = ... | [
"literal.string.change",
"io.output.change"
] | 857,498 | 857,499 | u887924592 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int S;
cin >> S;
int u = S / 100;
int l = S % 100;
if (u > 12) { // YY**
if (l == 0)
puts("NA");
else if (l <= 12)
puts("YYMM");
else
puts("NA");
} else if (u == 0) { // YY**
if (l == 0)
puts("NA");
el... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int S;
cin >> S;
int u = S / 100;
int l = S % 100;
if (u > 12) { // YY**
if (l == 0)
puts("NA");
else if (l <= 12)
puts("YYMM");
else
puts("NA");
} else if (u == 0) { // YY**
if (l == 0)
puts("NA");
el... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 857,500 | 857,501 | u799164835 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,502 | 857,503 | u655179794 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 857,504 | 857,503 | u655179794 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
bool x = 1 <= a && a <= 12;
bool y = 1 <= b && b <= 12;
if (x && y)
cout << "AMBIGOUS" << endl;
if (!x && y)
cout << "YYMM" << endl;
if (x && !y)
cout << "MMYY" << endl;
if (!x &... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
bool x = 1 <= a && a <= 12;
bool y = 1 <= b && b <= 12;
if (x && y)
cout << "AMBIGUOUS" << endl;
if (!x && y)
cout << "YYMM" << endl;
if (x && !y)
cout << "MMYY" << endl;
if (!x ... | [
"literal.string.change",
"io.output.change"
] | 857,514 | 857,515 | u101018317 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int s;
cin >> s;
int r = s % 100;
int l = (s - r) % 1000;
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int s;
cin >> s;
int r = s % 100;
int l = s / 100;
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << end... | [
"expression.operation.binary.remove"
] | 857,522 | 857,523 | u945761460 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
int main() {
int a, b;
scanf("%2d %2d", &a, &b);
if (a >= 1 and a <= 12 and b >= 1 and b <= 12)
puts("AMBIGUOUS");
else if ((a == 0 or a > 12) or (b == 0 or b > 12))
puts("NA");
else if ... | #include <bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
int main() {
int a, b;
scanf("%2d %2d", &a, &b);
if (a >= 1 and a <= 12 and b >= 1 and b <= 12)
puts("AMBIGUOUS");
else if ((a == 0 or a > 12) and (b == 0 or b > 12))
puts("NA");
else if... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,526 | 857,525 | u329902718 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
if ((a == 0 || a > 12) && (b == 0 && b > 12))
cout << "NA" << endl;
else if (a > ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
string s;
cin >> s;
int a, b;
a = (s[0] - '0') * 10 + (s[1] - '0');
b = (s[2] - '0') * 10 + (s[3] - '0');
if ((a == 0 || a > 12) && (b == 0 || b > 12))
cout << "NA" << endl;
else if (a > ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 857,542 | 857,543 | u890331732 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b;
cin >> n;
a = n / 100;
b = n % 100;
if (a >= 1 && a <= 12 && b >= 1 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (a >= 1 && a <= 12) {
cout << "MMYY" << endl;
} else if (b >= 1 && b <= 12) {
cout << "YYMM" <<... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, b;
cin >> n;
a = n / 100;
b = n % 100;
if (a >= 1 && a <= 12 && b >= 1 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (a >= 1 && a <= 12) {
cout << "MMYY" << endl;
} else if (b >= 1 && b <= 12) {
cout << "YYMM" <<... | [
"literal.string.change",
"io.output.change"
] | 857,544 | 857,545 | u821989875 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int front = (s[1] - '0') + (s[0] - '0') * 10;
int back = (s[3] - '0') + (s[2] - '0') * 10;
if (1 <= front && front <= 12) {
if (1 <= back <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int front = (s[1] - '0') + (s[0] - '0') * 10;
int back = (s[3] - '0') + (s[2] - '0') * 10;
if (1 <= front && front <= 12) {
if (1 <= back && back <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;... | [
"control_flow.branch.if.condition.change"
] | 857,546 | 857,547 | u105533331 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int front = (s[1] - '0') + (s[0] - '0') * 10;
int back = (s[3] - '0') + (s[2] - '0') * 10;
if (1 <= front <= 12) {
if (1 <= back <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int front = (s[1] - '0') + (s[0] - '0') * 10;
int back = (s[3] - '0') + (s[2] - '0') * 10;
if (1 <= front && front <= 12) {
if (1 <= back && back <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;... | [
"control_flow.branch.if.condition.change"
] | 857,548 | 857,547 | u105533331 | 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(void) {
string S;
cin >> S;
int f = (S[0] - '0') * 10 + S[1] - '0';
int b = (S[2] - '0') * 10 + S[3] - '0';
if (1 <= f && f <= 12) {
if (1 <= b && b <= 12) {
puts("AMBIGUOUS")... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main(void) {
string S;
cin >> S;
int f = (S[0] - '0') * 10 + S[1] - '0';
int b = (S[2] - '0') * 10 + S[3] - '0';
if (1 <= f && f <= 12) {
if (1 <= b && b <= 12) {
puts("AMBIGUOUS")... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 857,563 | 857,564 | u058720266 | 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() {
string S;
cin >> S;
bool f = false, g = false;
int a = (S[0] - '0') * 10 + (S[1] - '0');
int b = (S[2] - '0') * 10 + (S[3] - '0');
if (1 <= a && a <= 12)
f = true;
if (1 ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
bool f = false, g = false;
int a = (S[0] - '0') * 10 + (S[1] - '0');
int b = (S[2] - '0') * 10 + (S[3] - '0');
if (1 <= a && a <= 12)
f = true;
if (1 ... | [
"literal.string.change",
"io.output.change"
] | 857,568 | 857,569 | u810388173 | cpp |
p03042 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
int s;
cin >> s;
int x, y;
x = (s - s % 100) / 100;
y = s % 100;
int YYMM = 0;
int MMYY = 0;
if (x > 1 && y <= 12 && y >= 1) {
YYMM++;
}
if (y > 1 && x <= 12 && x >= 1) {
M... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
int s;
cin >> s;
int x, y;
x = (s - s % 100) / 100;
y = s % 100;
int YYMM = 0;
int MMYY = 0;
if (x >= 0 && y <= 12 && y >= 1) {
YYMM++;
}
if (y >= 0 && x <= 12 && x >= 1) {
... | [] | 857,585 | 857,583 | u117737149 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll /*, vl, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll /*, vl, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, ... | [
"literal.string.change",
"io.output.change"
] | 857,586 | 857,587 | u682191329 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 857,608 | 857,609 | u825601908 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
int s1 = stoi(s.substr(0, 2));
int s2 = stoi(s.substr(2, 2));
bool isM1 = false, isM2 = false;
if (s1 >= 0 && s1 <= 12)
isM1 = true;
if (s2 >= 0 &... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
int s1 = stoi(s.substr(0, 2));
int s2 = stoi(s.substr(2, 2));
bool isM1 = false, isM2 = false;
if (s1 >= 1 && s1 <= 12)
isM1 = true;
if (s2 >= 1 &... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,612 | 857,613 | u425086757 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int s;
cin >> s;
int y, m;
y = s / 100;
m = s % 100;
if (0 < y && y < 13 && 0 < m && m < 13)
cout << "AMBIGUOUS" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int s;
cin >> s;
int y, m;
y = s / 100;
m = s % 100;
if (0 < y && y < 13 && 0 < m && m < 13)
cout << "AMBIGUOUS" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 857,614 | 857,615 | u016334391 | cpp |
p03042 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | [
"literal.string.change",
"expression.operation.binary.change"
] | 857,624 | 857,625 | u225053756 | cpp |
p03042 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | [
"literal.number.change",
"call.arguments.change",
"literal.string.change",
"expression.operation.binary.change"
] | 857,627 | 857,625 | u225053756 | cpp |
p03042 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var <<... | [
"literal.number.change",
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change"
] | 857,628 | 857,625 | u225053756 | cpp |
p03042 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
bool yy = false;
bool mm = false;
if (s[0] == '1' && (s[1] == '0' || s[1] == '1' || s[1] == '2')) {
yy = true;
}
if (s[0] == '0' && s[1] != '0')
y... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
bool yy = false;
bool mm = false;
if (s[0] == '1' && (s[1] == '0' || s[1] == '1' || s[1] == '2')) {
yy = true;
}
if (s[0] == '0' && s[1] != '0')
y... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"variable_declaration.remove"
] | 857,629 | 857,630 | u047572420 | cpp |
p03042 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
bool yy = false;
bool mm = false;
if (s[0] == '1' && (s[1] == '0' || s[1] == '1' || s[1] == '2')) {
yy = true;
}
if (s[0] == '0' && s[1] != '0')
y... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
bool yy = false;
bool mm = false;
if (s[0] == '1' && (s[1] == '0' || s[1] == '1' || s[1] == '2')) {
yy = true;
}
if (s[0] == '0' && s[1] != '0')
y... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 857,631 | 857,630 | u047572420 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dig(int x, int y) {
rep(i, y - 1) x /= 10;
return x % 10;
}
int main() {
string s;
cin >> s;
int num = stoi(s);
int a = dig(num, 1) + 10 * dig(num, 2);
int b = dig(num, 3) + 10 *... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dig(int x, int y) {
rep(i, y - 1) x /= 10;
return x % 10;
}
int main() {
string s;
cin >> s;
int num = stoi(s);
int a = dig(num, 1) + 10 * dig(num, 2);
int b = dig(num, 3) + 10 *... | [
"literal.string.change",
"io.output.change"
] | 857,632 | 857,633 | u826608257 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
if (0 < S / 100 && S / 100 <= 12)
if (0 < S % 100 && S % 100 <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "YYMM" << endl;
else if (0 < S % 100 && S % 100 <= 12)
cout << "MMYY" << endl;
else
cout << "NA... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
if (0 < S / 100 && S / 100 <= 12)
if (0 < S % 100 && S % 100 <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
else if (0 < S % 100 && S % 100 <= 12)
cout << "YYMM" << endl;
else
cout << "NA... | [
"literal.string.change",
"io.output.change"
] | 857,650 | 857,651 | u306482197 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string A = S.substr(0, 2);
string B = S.substr(2, 2);
int C = stoi(A);
int D = stoi(B);
int a = 0;
int b = 0;
if (0 <= C && C <= 99) {
if (1 <= D && D <= 12) {
a = 1;
}
}
if (1 <= C && C <= 12) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string A = S.substr(0, 2);
string B = S.substr(2, 2);
int C = stoi(A);
int D = stoi(B);
int a = 0;
int b = 0;
if (0 <= C && C <= 99) {
if (1 <= D && D <= 12) {
a = 1;
}
}
if (1 <= C && C <= 12) {
if... | [
"literal.string.change",
"io.output.change"
] | 857,652 | 857,653 | u245412777 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string A = S.substr(0, 2);
string B = S.substr(2);
int C = stoi(A);
int D = stoi(B);
int a = 0;
int b = 0;
if (0 <= C && C <= 99) {
if (1 <= D && D <= 12) {
a = 1;
}
}
if (1 <= C && C <= 12) {
if (0... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string A = S.substr(0, 2);
string B = S.substr(2, 2);
int C = stoi(A);
int D = stoi(B);
int a = 0;
int b = 0;
if (0 <= C && C <= 99) {
if (1 <= D && D <= 12) {
a = 1;
}
}
if (1 <= C && C <= 12) {
if... | [
"call.arguments.add",
"literal.string.change",
"io.output.change"
] | 857,654 | 857,653 | u245412777 | cpp |
p03042 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
usi... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
usi... | [
"literal.string.change",
"io.output.change"
] | 857,657 | 857,658 | u007099475 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 1... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 1... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 857,667 | 857,668 | u102842945 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
b = s % 100;
a = s / 100;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12) {
cout << "AMBIGUOUS";
} else {
cout << "MMYY";
}
} else {
if (b >= 1 && b <= 12)
cout << "MMYY";
else
cou... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
b = s % 100;
a = s / 100;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12) {
cout << "AMBIGUOUS";
} else {
cout << "MMYY";
}
} else {
if (b >= 1 && b <= 12)
cout << "YYMM";
else
cou... | [
"literal.string.change",
"io.output.change"
] | 857,669 | 857,670 | u140131311 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
b = s % 100;
a = s / 100;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12) {
cout << "AMBIGOUS";
} else {
cout << "MMYY";
}
} else {
if (b >= 1 && b <= 12)
cout << "MMYY";
else
cout... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int a, b;
b = s % 100;
a = s / 100;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12) {
cout << "AMBIGUOUS";
} else {
cout << "MMYY";
}
} else {
if (b >= 1 && b <= 12)
cout << "YYMM";
else
cou... | [
"literal.string.change",
"io.output.change"
] | 857,671 | 857,670 | u140131311 | cpp |
p03042 | // ABC 126 B: YYMM or MMYY
// https://atcoder.jp/contests/abc126/tasks/abc126_b
#include <iostream>
#include <vector>
int main() {
std::vector<int> sequence(4);
for (int i = 0; i < sequence.size(); i++) {
char tmp;
std::cin >> tmp;
sequence.at(i) = static_cast<int>(tmp - '0');
}
int first_part = s... | // ABC 126 B: YYMM or MMYY
// https://atcoder.jp/contests/abc126/tasks/abc126_b
#include <iostream>
#include <vector>
int main() {
std::vector<int> sequence(4);
for (int i = 0; i < sequence.size(); i++) {
char tmp;
std::cin >> tmp;
sequence.at(i) = static_cast<int>(tmp - '0');
}
int first_part = s... | [
"literal.string.change",
"expression.operation.binary.change"
] | 857,680 | 857,681 | u019820084 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
const int64_t INF = 9999999999999999;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
if (a >= 1 && b <= 12) {
if (b >= 1 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} el... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
const int64_t INF = 9999999999999999;
int main() {
int S;
cin >> S;
int a = S / 100;
int b = S % 100;
if (a >= 1 && a <= 12) {
if (b >= 1 && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} el... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,688 | 857,689 | u209457657 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
//////////////////
// A
/*int main(void){
int n,k;
string s;
cin >> n>>k>>s;
for(int i=0 ;i<... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// Shift+Command+bでデバッグ
//その後ターミナルで./a.outを実行
//入力を貼り付ける
//////////////////
// A
/*int main(void){
int n,k;
string s;
cin >> n>>k>>s;
for(int i=0 ;i<... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 857,696 | 857,697 | u317432339 | 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 || a >= 13 && b == 0 || b >= 13) {
cout << "NA" << endl;
} else if (a == 0 || a >= 13) {
cout << "YYMM" << 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 || a >= 13) && (b == 0 || b >= 13)) {
cout << "NA" << endl;
} else if (a == 0 || a >= 13) {
cout << "YYMM" << endl;
} else... | [
"control_flow.branch.if.condition.change"
] | 857,700 | 857,701 | u108108663 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int f;
cin >> f;
int s = f % 100;
f /= 100;
bool fbl = (1 <= f && 12 >= f), sbl = (1 <= s && 12 >= s);
if (fbl && sbl)
cout << "AMBIGUOUS";
else if (fbl)
cout << "MMYY";
else if (sbl)
cout << "YYMM";
else
cout << "NAN";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int f;
cin >> f;
int s = f % 100;
f /= 100;
bool fbl = (1 <= f && 12 >= f), sbl = (1 <= s && 12 >= s);
if (fbl && sbl)
cout << "AMBIGUOUS";
else if (fbl)
cout << "MMYY";
else if (sbl)
cout << "YYMM";
else
cout << "NA";
} | [
"literal.string.change",
"io.output.change"
] | 857,704 | 857,705 | u369712616 | cpp |
p03042 | #include <cstdio>
using namespace std;
int main() {
int S;
scanf("%d", &S);
int S1, S2;
S1 = S / 100;
S2 = S % 100;
bool month1 = (1 <= S1 && S1 <= 12) ? true : false;
bool month2 = (1 <= S2 && S2 <= 12) ? true : false;
if (month1) {
if (month2)
printf("AMBIGIOUS");
else
printf("... | #include <cstdio>
using namespace std;
int main() {
int S;
scanf("%d", &S);
int S1, S2;
S1 = S / 100;
S2 = S % 100;
bool month1 = (1 <= S1 && S1 <= 12) ? true : false;
bool month2 = (1 <= S2 && S2 <= 12) ? true : false;
if (month1) {
if (month2)
printf("AMBIGUOUS");
else
printf("... | [
"misc.typo",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 857,706 | 857,707 | u316549668 | cpp |
p03042 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
cin >> S;
int front = S / 100;
int end = S % 100;
if (front >= 1 && front <= 12) {
if (end >= 1 && front <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "YYMM" << endl;
... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int S;
cin >> S;
int front = S / 100;
int end = S % 100;
if (front >= 1 && front <= 12) {
if (end >= 1 && end <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
}... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 857,726 | 857,727 | u049740716 | cpp |
p03042 | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio ... | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio ... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 857,740 | 857,741 | u567661286 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int N = stoi(s);
int d1 = N / 100;
int d2 = N % 100;
string a = "NA";
if (0 < d1 && d1 <= 12 && 0 < d2 && d2 <= 12) {
a = "ANBIGUOUS";
} else if (0 < d1 && d1 <= 12) {
a = "MMYY";
} else if (0 < d2 && d2 <= 12) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int N = stoi(s);
int d1 = N / 100;
int d2 = N % 100;
string a = "NA";
if (0 < d1 && d1 <= 12 && 0 < d2 && d2 <= 12) {
a = "AMBIGUOUS";
} else if (0 < d1 && d1 <= 12) {
a = "MMYY";
} else if (0 < d2 && d2 <= 12) {
... | [
"literal.string.change",
"assignment.value.change"
] | 857,742 | 857,743 | u251242696 | cpp |
p03042 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
typedef long long ll;
ty... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
typedef long long ll;
ty... | [
"literal.string.change",
"io.output.change"
] | 857,752 | 857,753 | u089177147 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int down = S % 100;
int up = S / 100;
if (1 <= up && up <= 12) {
if (1 <= down && down <= 12) {
cout << "ANBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= down && down <= 12) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int down = S % 100;
int up = S / 100;
if (1 <= up && up <= 12) {
if (1 <= down && down <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= down && down <= 12) {
... | [
"literal.string.change",
"io.output.change"
] | 857,756 | 857,757 | u826189900 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
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 num = 10 * a + b;
int n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
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 num = 10 * a + b;
int n... | [
"literal.string.change",
"io.output.change"
] | 857,762 | 857,763 | u024191315 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a, b, count = 0;
cin >> s;
a = s / 100;
b = s % 100;
vector<string> ans{"NA", "MMYY", "YYMM", "ANBIGUOUS"};
if (1 <= a && a <= 12)
count += 1;
if (1 <= b && b <= 12)
count += 2;
cout << ans[count] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a, b, count = 0;
cin >> s;
a = s / 100;
b = s % 100;
vector<string> ans{"NA", "MMYY", "YYMM", "AMBIGUOUS"};
if (1 <= a && a <= 12)
count += 1;
if (1 <= b && b <= 12)
count += 2;
cout << ans[count] << endl;
} | [
"literal.string.change"
] | 857,768 | 857,769 | u868580535 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P1, P2, R;
string s;
cin >> s;
R = stoi(s);
P1 = (R / 100);
P2 = (R % 100);
if ((P1 > 12 && P2 == 0) && (P2 > 12 || P2 == 0))
cout << "NA";
else if (P1 == 0 || P1 > 12)
cout << "YYMM";
else if (P2 == 0 || P2 > 12)
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int P1, P2, R;
string s;
cin >> s;
R = stoi(s);
P1 = (R / 100);
P2 = (R % 100);
if ((P1 > 12 || P1 == 0) && (P2 > 12 || P2 == 0))
cout << "NA";
else if (P1 == 0 || P1 > 12)
cout << "YYMM";
else if (P2 == 0 || P2 > 12)
cout <<... | [] | 857,777 | 857,778 | u736460212 | cpp |
p03042 | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 857,785 | 857,786 | u782387599 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using llpair = pair<ll, ll>;
using llvec = vector<ll>;
using llmat = vector<vector<ll>>;
#define llmattp(name, a, b, num) name(a, vector<ll>(b, num))
#define LLINF 1LL << 60
#define ABS(x) ((x) > 0 ? (x) : -(x))
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using llpair = pair<ll, ll>;
using llvec = vector<ll>;
using llmat = vector<vector<ll>>;
#define llmattp(name, a, b, num) name(a, vector<ll>(b, num))
#define LLINF 1LL << 60
#define ABS(x) ((x) > 0 ? (x) : -(x))
template <class T> inline bool chmin(T ... | [
"literal.string.change",
"io.output.change"
] | 857,789 | 857,790 | u195036695 | cpp |
p03042 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR ... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(X, N) for (ll X = 0; X < (N); X++)
#define PI (acos(-1.0))
#define pback push_back
#define mpair make_pair
#define MODN 1000000007
#define ALL(V) (V).begin(), (V).end()
#define CERR ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,794 | 857,795 | u145078501 | cpp |
p03042 | #include <ctype.h>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int a = n / 100;
int b = n % 100;
if (a and a <= 12 and b and b <= 12) {
cout << "ANBIGUOUS" << endl;
} else if (a and a <= 12) {
cout << "MMYY" << endl;
} else ... | #include <ctype.h>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int a = n / 100;
int b = n % 100;
if (a and a <= 12 and b and b <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (a and a <= 12) {
cout << "MMYY" << endl;
} else ... | [
"literal.string.change",
"io.output.change"
] | 857,802 | 857,803 | u534223360 | cpp |
p03042 | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
/... | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
/... | [
"literal.string.change",
"io.output.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,804 | 857,805 | u226951654 | cpp |
p03042 | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
/... | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
/... | [
"literal.string.change",
"io.output.change"
] | 857,806 | 857,805 | u226951654 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int ym = 0;
if (s / 100 > 0 && s / 100 < 13) {
ym = 1;
}
if (s % 100 > 0 && s / 100 < 13) {
if (ym == 1) {
cout << "AMBIGUOUS" << endl;... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int ym = 0;
if (s / 100 > 0 && s / 100 < 13) {
ym = 1;
}
if (s % 100 > 0 && s % 100 < 13) {
if (ym == 1) {
cout << "AMBIGUOUS" << endl;... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 857,809 | 857,810 | u819402602 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i;
cin >> i;
if (i % 100 <= 12 && i % 12 != 0 && i / 100 != 0 && i / 100 <= 12) {
cout << "AMBIGUOUS" << endl;
return 0;
}
if (i % 100 <= 12 && i % 12 != 0) {
cout << "YYMM" << endl;
return 0;
}
if (i / 100 != 0 && i / 100 <= 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i;
cin >> i;
if (i % 100 <= 12 && i % 100 != 0 && i / 100 != 0 && i / 100 <= 12) {
cout << "AMBIGUOUS" << endl;
return 0;
}
if (i % 100 <= 12 && i % 100 != 0) {
cout << "YYMM" << endl;
return 0;
}
if (i / 100 != 0 && i / 100 <=... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,811 | 857,812 | u960779345 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s = 0;
cin >> s;
int UP = s / 100;
int DOWN = s - UP * 100;
if (UP >= 0) {
if (UP >= 13 || UP == 0) {
if (DOWN >= 1 && DOWN <= 12) {
cout << "YYMM";
} else {
cout << "NA";
}
}
if (UP <= 12 && UP >= 1) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s = 0;
cin >> s;
int UP = s / 100;
int DOWN = s - UP * 100;
if (UP >= 0) {
if (UP >= 13 || UP == 0) {
if (DOWN >= 1 && DOWN <= 12) {
cout << "YYMM";
} else {
cout << "NA";
}
}
if (UP <= 12 && UP >= 1) ... | [
"literal.string.change",
"io.output.change"
] | 857,815 | 857,816 | u531790559 | cpp |
p03042 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#in... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,819 | 857,820 | u113081402 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define cint const int
#define ld long double
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb pu... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define cint const int
#define ld long double
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb pu... | [
"assignment.change"
] | 857,823 | 857,824 | u751518217 | cpp |
p03042 | #include <bits/stdc++.h>
#define I int
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define P(a) printf("%d\n", a)
#define PL(a) printf("%lld\n", a)
#define PT(t) printf("Case %d: ", t)
#define PB(a) push_back(a)
#define SET(a) memset(a, 0, sizeof a)
#define SETR(a) memset(a, -1, sizeof a)
#defin... | #include <bits/stdc++.h>
#define I int
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define P(a) printf("%d\n", a)
#define PL(a) printf("%lld\n", a)
#define PT(t) printf("Case %d: ", t)
#define PB(a) push_back(a)
#define SET(a) memset(a, 0, sizeof a)
#define SETR(a) memset(a, -1, sizeof a)
#defin... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,835 | 857,836 | u449403739 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
string x;
cin >> x;
int xdigit = atoi(x.c_str());
int hi = xdigit / 100;
int lo = xdigit % 100;
bool chi = hi > 0 && hi < 13;
bool clo = lo > 0 && lo < 13;
if (chi && chi) {
cout << "AMBIGUOUS" << endl;
} else if (chi && !clo) {
cout << "M... | #include <iostream>
using namespace std;
int main() {
string x;
cin >> x;
// int hi = atoi(x.substr(0, 2).c_str());
// int lo = atoi(x.substr(2).c_str());
int xdigit = atoi(x.c_str());
int hi = xdigit / 100;
int lo = xdigit % 100;
bool chi = hi > 0 && hi < 13;
bool clo = lo > 0 && lo < 13;
// cout ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,845 | 857,846 | u774438048 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
char num[4];
cin >> num;
if (((num[0] == '0' && num[1] != '0') ||
(num[0] == '1' && (num[1] == '0' || num[1] == '1' || num[1] == '2'))) &&
((num[2] == '0' && num[2] != '0') ||
(num[2] == '1' && (num[3] == '0' || num[3] == '1' || num[3] =... | #include <iostream>
using namespace std;
int main() {
char num[4];
cin >> num;
if (((num[0] == '0' && num[1] != '0') ||
(num[0] == '1' && (num[1] == '0' || num[1] == '1' || num[1] == '2'))) &&
((num[2] == '0' && num[3] != '0') ||
(num[2] == '1' && (num[3] == '0' || num[3] == '1' || num[3] =... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 857,851 | 857,852 | u161418539 | cpp |
p03042 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
string S;
cin >> S;
int first ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
string S;
cin >> S;
int first ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,855 | 857,856 | u715366261 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sh = n / 100, ji = n % 100;
string out = "NA";
if (sh <= 12 & sh > 0) {
if (ji <= 12 & ji > 0) {
out = "UMBIGUOUS";
} else {
out = "MMYY";
}
} else {
if (ji <= 12 & ji > 0) {
out = "YYMM";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sh = n / 100, ji = n % 100;
string out = "NA";
if (sh <= 12 & sh > 0) {
if (ji <= 12 & ji > 0) {
out = "AMBIGUOUS";
} else {
out = "MMYY";
}
} else {
if (ji <= 12 & ji > 0) {
out = "YYMM";
... | [
"literal.string.change",
"assignment.value.change"
] | 857,861 | 857,862 | u431602218 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sh = n / 100, ji = n % 100;
string out = "NA";
if (sh <= 12 & sh > 0) {
if (ji <= 12 & ji > 0) {
out = "UNBIGUOUS";
} else {
out = "MMYY";
}
} else {
if (ji <= 12 & ji > 0) {
out = "YYMM";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sh = n / 100, ji = n % 100;
string out = "NA";
if (sh <= 12 & sh > 0) {
if (ji <= 12 & ji > 0) {
out = "AMBIGUOUS";
} else {
out = "MMYY";
}
} else {
if (ji <= 12 & ji > 0) {
out = "YYMM";
... | [
"literal.string.change",
"assignment.value.change"
] | 857,863 | 857,862 | u431602218 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | [
"literal.string.change",
"io.output.change"
] | 857,872 | 857,873 | u155216115 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | [
"literal.string.change",
"io.output.change"
] | 857,874 | 857,873 | u155216115 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int change(char x) {
if (x == '0') {
return 0;
}
if (x == '1') {
return 1;
}
if (x == '2') {
return 2;
}
if (x == '3') {
return 3;
}
if (x == '4') {
return 4;
}
... | #include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int change(char x) {
if (x == '0') {
return 0;
}
if (x == '1') {
return 1;
}
if (x == '2') {
return 2;
}
if (x == '3') {
return 3;
}
if (x == '4') {
return 4;
}
... | [
"literal.string.change",
"io.output.change"
] | 857,875 | 857,876 | u491330513 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int left = s / 100;
int right = s % 100;
if (1 <= left && 12 >= left) {
if (1 <= right && 12 >= right)
cout << "AMBIGOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= right && 12 >= right)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int left = s / 100;
int right = s % 100;
if (1 <= left && 12 >= left) {
if (1 <= right && 12 >= right)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= right && 12 >= right)
... | [
"literal.string.change",
"io.output.change"
] | 857,893 | 857,894 | u372581122 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int left = s / 100;
int right = s % 100;
if (1 <= left && 12 >= left) {
if (1 <= right && 12 >= right)
cout << "AMBIGOUS" << endl;
else
cout << "NA" << endl;
} else {
if (1 <= right && 12 >= right)
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int left = s / 100;
int right = s % 100;
if (1 <= left && 12 >= left) {
if (1 <= right && 12 >= right)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= right && 12 >= right)
... | [
"literal.string.change",
"io.output.change"
] | 857,895 | 857,894 | u372581122 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s, fir, sec;
cin >> s;
fir = s / 100;
sec = s - fir * 100;
if (fir > 12 || fir == 0) {
if (sec > 12 || sec == 0)
puts("NA");
else
puts("YYMM");
} else if (sec > 12 || sec == 0) {
puts("YYMM");
} else
puts("AM... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int s, fir, sec;
cin >> s;
fir = s / 100;
sec = s - fir * 100;
if (fir > 12 || fir == 0) {
if (sec > 12 || sec == 0)
puts("NA");
else
puts("YYMM");
} else if (sec > 12 || sec == 0) {
puts("MMYY");
} else
puts("AM... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 857,915 | 857,916 | u326152409 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int x = stoi(s.substr(0, 2));
int y = stoi(s.substr(2, 2));
if (1 <= x && x <= 12) {
if (1 <= y && y <= 12)
cout << "AMBIGIOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= y && y <= 12)
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int x = stoi(s.substr(0, 2));
int y = stoi(s.substr(2, 2));
if (1 <= x && x <= 12) {
if (1 <= y && y <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= y && y <= 12)
... | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 857,917 | 857,918 | u932033261 | 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 (0 < a && a <= 12 && 0 < b && b <= 12)
cout << "AMBIGUOU" << endl;
else if (0 < a && a <= 12)
cout << "MMYY" << endl;
else if (0 < b ... | #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 (0 < a && a <= 12 && 0 < b && b <= 12)
cout << "AMBIGUOUS" << endl;
else if (0 < a && a <= 12)
cout << "MMYY" << endl;
else if (0 < b... | [
"literal.string.change",
"io.output.change"
] | 857,939 | 857,940 | u593459816 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a;
cin >> a;
int y = a / 100, m = a % 100;
if (1 <= y && y <= 12 && 1 <= m && 1 <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= y && y <= 12) {
cout << "MMYY" << endl;
} else if (1 <= m && m <= 12) {
cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a;
cin >> a;
int y = a / 100, m = a % 100;
if (1 <= y && y <= 12 && 1 <= m && m <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= y && y <= 12) {
cout << "MMYY" << endl;
} else if (1 <= m && m <= 12) {
cout ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 857,941 | 857,942 | u905715926 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a;
cin >> a;
int y = a / 100, m = a % 100;
if (1 <= y && y <= 12 && 1 <= m && 1 <= 12) {
cout << "AMBIGOUS" << endl;
} else if (1 <= y && y <= 12) {
cout << "MMYY" << endl;
} else if (1 <= m && m <= 12) {
cout <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a;
cin >> a;
int y = a / 100, m = a % 100;
if (1 <= y && y <= 12 && 1 <= m && m <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= y && y <= 12) {
cout << "MMYY" << endl;
} else if (1 <= m && m <= 12) {
cout ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 857,943 | 857,942 | u905715926 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.