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 9 values |
|---|---|---|---|---|---|---|---|
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
string str(50, '\0');
cin >> a >> b;
cin >> str;
str[b] += 'a' - 'A';
cout << str << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
string str(50, '\0');
cin >> a >> b;
cin >> str;
str[b - 1] += 'a' - 'A';
cout << str << endl;
return 0;
} | [
"assignment.change"
] | 856,748 | 856,749 | u551841275 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
s[k] = tolower(s[k - 1]);
cout << s << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << "\n";
} | [
"assignment.change"
] | 856,756 | 856,757 | u303884911 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
s[k] = tolower(s[k]);
cout << s << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << "\n";
} | [
"assignment.change"
] | 856,758 | 856,757 | u303884911 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s, t;
cin >> n >> k;
cin >> s;
t = s.substr(k - 1, 1);
if (t == "A")
s.replace(k - 1, 1, "a");
else if (t == "B")
s.replace(k - 1, 1, "b");
else if (t == "C")
s.replace(k - 1, 1, "c");
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s, t;
cin >> n >> k;
cin >> s;
t = s.substr(k - 1, 1);
if (t == "A")
s.replace(k - 1, 1, "a");
else if (t == "B")
s.replace(k - 1, 1, "b");
else if (t == "C")
s.replace(k - 1, 1, "c");
cout << s;
return 0;
} | [] | 856,759 | 856,760 | u408650734 | cpp |
p03041 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
char s[50];
cin >> n >> k;
scanf("%s", s);
s[k] = tolower(s[k - 1]);
cout << s << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
char s[50];
cin >> n >> k;
scanf("%s", s);
s[k - 1] = tolower(s[k - 1]);
cout << s << endl;
}
| [
"assignment.change"
] | 856,761 | 856,762 | u432551953 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
const long long MOD = 1000000007LL;
const long long INFL = 1LL << 60;
const int INF = 1 << 29;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
if (S[K - 1] == 'A')
S[K - 1] = 'a';
if (S[K - 1] == 'B')
S[K - 1] = 'b';
if (S[K - 1] == 'c')
S[K - 1] = 'c';
cout << S << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
const long long MOD = 1000000007LL;
const long long INFL = 1LL << 60;
const int INF = 1 << 29;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
if (S[K - 1] == 'A')
S[K - 1] = 'a';
if (S[K - 1] == 'B')
S[K - 1] = 'b';
if (S[K - 1] == 'C')
S[K - 1] = 'c';
cout << S << endl;
return 0;
} | [
"misc.typo",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 856,763 | 856,764 | u703669948 | cpp |
p03041 | #include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, k, n) for (int i = k; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k + 1] = (char)(s[k + 1] + 32);
cout << s << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, k, n) for (int i = k; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = (char)(s[k - 1] + 32);
cout << s << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 856,765 | 856,766 | u424967964 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int length, num;
cin >> length >> num;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (i == num) {
S[i] = tolower(S[i]);
} else {
S[i] = S[i];
}
}
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int length, num;
cin >> length >> num;
string S;
cin >> S;
num--;
for (int i = 0; i < S.size(); i++) {
if (i == num) {
S[i] = tolower(S[i]);
} else {
S[i] = S[i];
}
}
cout << S << endl;
}
| [
"expression.unary.arithmetic.add"
] | 856,769 | 856,770 | u006721330 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] == 'A')
S[K] = 'a';
else if (S[K - 1] == 'B')
S[K] = 'b';
else
S[K - 1] = 'c';
cout << S << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (S[K - 1] == 'A')
S[K - 1] = 'a';
else if (S[K - 1] == 'B')
S[K - 1] = 'b';
else
S[K - 1] = 'c';
cout << S << endl;
} | [
"assignment.change"
] | 856,775 | 856,776 | u656929062 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b;
cin >> s;
s[b - 1] = s[b - 1] + 32 + '0';
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b;
cin >> s;
s[b - 1] = s[b - 1] + 32;
cout << s << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 856,779 | 856,780 | u842407954 | cpp |
p03041 | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define ll long long int
#define pi 3.1415926536
using namespace std;
void solve() {
ll t, n, k, c = 0;
cin >> n >> k;
string s, x;
cin >> s;
transform(s.begin() + k - 1, s.begin() + k, s.begin(), ::tolower);
cout << s;
return;
}
int main() {
fast ll t = 1;
while (t--) {
solve();
// cout<<ma<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define ll long long int
#define pi 3.1415926536
using namespace std;
void solve() {
ll t, n, k, c = 0;
cin >> n >> k;
string s, x;
cin >> s;
transform(s.begin() + k - 1, s.begin() + k, s.begin() + k - 1, ::tolower);
cout << s;
return;
}
int main() {
fast ll t = 1;
while (t--) {
solve();
// cout<<ma<<endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 856,793 | 856,794 | u181413291 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string S;
cin.ignore();
getline(cin, S);
char K[] = {'a', 'b', 'c'};
if (S[B - 1] == 'A') {
S[B - 1] = 'a';
} else if (S[B - 1] == 'b') {
S[B - 1] = 'b';
} else {
S[B - 1] = 'c';
}
cout << S << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string S;
cin.ignore();
getline(cin, S);
char K[] = {'a', 'b', 'c'};
if (S[B - 1] == 'A') {
S[B - 1] = 'a';
} else if (S[B - 1] == 'B') {
S[B - 1] = 'b';
} else {
S[B - 1] = 'c';
}
cout << S << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 856,804 | 856,805 | u860597287 | cpp |
p03041 |
#include <iostream>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (i == K)
S[i] += 32;
cout << S[i];
}
cout << endl;
} |
#include <iostream>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (i == K - 1) {
S[i] += 32;
}
cout << S[i];
}
cout << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 856,813 | 856,814 | u142946678 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define FORI(n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
FORI(s.size()) {
if (i != k - 1)
cout << s[i];
else
cout << tolower(s[i]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FORI(n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
FORI(s.size()) {
if (i != k - 1)
cout << s[i];
else
putchar(tolower(s[i]));
}
return 0;
} | [
"call.arguments.change"
] | 856,815 | 856,816 | u731506888 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[k] == 'A') {
s[k] = 'a';
} else if (s[k] == 'B') {
s[k] = 'b';
} else if (s[k] == 'C') {
s[k] = 'c';
}
cout << s << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
k--;
string s;
cin >> s;
if (s[k] == 'A') {
s[k] = 'a';
} else if (s[k] == 'B') {
s[k] = 'b';
} else if (s[k] == 'C') {
s[k] = 'c';
}
cout << s << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 856,817 | 856,818 | u769062455 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
char a;
cin >> n >> k >> s;
a = s.at(k);
if (a == 'A') {
s.at(k - 1) = 'a';
} else if (a == 'B') {
s.at(k - 1) = 'b';
} else {
s.at(k - 1) = 'c';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
char a;
cin >> n >> k >> s;
a = s.at(k - 1);
if (a == 'A') {
s.at(k - 1) = 'a';
} else if (a == 'B') {
s.at(k - 1) = 'b';
} else {
s.at(k - 1) = 'c';
}
cout << s << endl;
} | [
"assignment.change"
] | 856,821 | 856,822 | u348914050 | cpp |
p03041 | //#include "pch.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define fri(n) for (i = 0; i < (n); i++)
#define frj(n) for (j = 0; j < (n); i++)
#define min(p, q) ((p) < (q) ? (p) : (q))
#define max(p, q) ((p) > (q) ? (p) : (q))
#define INF 1000000000000000000 // 10^18
#define INFINT 2000000001 // 2*10^9+1
#define MOD 1000000007
#define MODANOTHER 998244353
#define PI acos(-1)
using namespace std;
int main(void) {
//変数の宣言
int n, k;
char s[55];
//よく使う変数
int i, j, l;
int flag = 0;
int ans = 0;
int count = 0;
int temp = 0;
int temp1 = 0;
int temp2 = 0;
int max = 0;
int min = INFINT;
int len = 0;
int sum = 0;
int ok = 0;
int ng = 0;
char dummy;
//データの読み込み
scanf("%d %d", &n, &k);
// scanf_s("%d %d",&n,&k);
scanf("%s", &s);
// scanf_s("%s",&s,55);
/* for(i=1;i<=n;i++){
// scanf("%c",&a,&b,&f);
scanf_s("%c",&a,&b,&f);
}*/
// printf("nは%dです\n", n);
// printf("データの読み込み終了\n");
//実際の処理
s[k] = s[k] + 32;
// printf("計算部分終了\n");
//出力
printf("%s", s);
// printf("結果の出力終了\n");
return 0;
}
| //#include "pch.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define fri(n) for (i = 0; i < (n); i++)
#define frj(n) for (j = 0; j < (n); i++)
#define min(p, q) ((p) < (q) ? (p) : (q))
#define max(p, q) ((p) > (q) ? (p) : (q))
#define INF 1000000000000000000 // 10^18
#define INFINT 2000000001 // 2*10^9+1
#define MOD 1000000007
#define MODANOTHER 998244353
#define PI acos(-1)
using namespace std;
int main(void) {
//変数の宣言
int n, k;
char s[55];
//よく使う変数
int i, j, l;
int flag = 0;
int ans = 0;
int count = 0;
int temp = 0;
int temp1 = 0;
int temp2 = 0;
int max = 0;
int min = INFINT;
int len = 0;
int sum = 0;
int ok = 0;
int ng = 0;
char dummy;
//データの読み込み
scanf("%d %d", &n, &k);
// scanf_s("%d %d",&n,&k);
scanf("%s", &s);
// scanf_s("%s",&s,55);
/* for(i=1;i<=n;i++){
// scanf("%c",&a,&b,&f);
scanf_s("%c",&a,&b,&f);
}*/
// printf("nは%dです\n", n);
// printf("データの読み込み終了\n");
//実際の処理
s[k - 1] = s[k - 1] + 32;
// printf("計算部分終了\n");
//出力
printf("%s", s);
// printf("結果の出力終了\n");
return 0;
}
| [
"assignment.change"
] | 856,823 | 856,824 | u705931757 | cpp |
p03041 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
char tolower(char c) { return (c + 0x20); }
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
S.at(K) = tolower(S.at(K));
cout << S << endl;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
char tolower(char c) { return (c + 0x20); }
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
S.at(K - 1) = tolower(S.at(K - 1));
cout << S << endl;
} | [
"assignment.change"
] | 856,829 | 856,830 | u066926272 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
S[K] += 32;
cout << S << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
S[K - 1] += 32;
cout << S << endl;
return 0;
} | [
"assignment.change"
] | 856,831 | 856,832 | u083912840 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
if (s[k - 1] == 'A')
s[k - 1] = 'a';
if (s[k - 1] == 'B')
s[k] = 'b';
if (s[k - 1] == 'C')
s[k - 1] = 'c';
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
if (s[k - 1] == 'A')
s[k - 1] = 'a';
if (s[k - 1] == 'B')
s[k - 1] = 'b';
if (s[k - 1] == 'C')
s[k - 1] = 'c';
cout << s << endl;
} | [
"assignment.change"
] | 856,845 | 856,846 | u079470909 | cpp |
p03041 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
lin(n, k);
stin(s);
if (s[k - 1] > 'a' - 1)
s[k - 1] -= 'A' - 'a';
cout << s << endl;
}
// sub-EOF
|
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cVf ?Y! JM V$ `
+++++= OunkoI Xppppp dMN .MM+ .MM MM| MM] JMMMMMM+
|@tqkoh) ,y0 (V$ yyyyyyyV7 VV JMWyZWr TWVVVVW&,
++++++ dZZZZ0 Xppppp ^HMN, _.db WMm, .MMF MM| ..MM` JMF .
|yk .WV&. .XW' yy 4yn. jyn +. JM #S
`++++` ?ZZZX= ?WWWW= -THMMMMH9^ (TMMMMM9! MMMMMMM"" JMMMMMMMME
|UU. ?TUUUUY= UU. (UU- ^7TUUUV7! JUUUUUUUU 7TUNKO*/
// Ricty Diminished
#include "bits/stdc++.h"
using namespace std;
typedef long long lint;
typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define linf 1152921504606846976
#define MAXN 100100
#define md 1000000007 // 998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
// template<class T>
// ostream& operator<<(ostream& os,vector<T>& vec){
// os<<vec[0];rep(i,1,vec.size())os<<' '<<vec[i];return os; } template<class T>
// ostream& operator<<(ostream& os,deque<T>& deq){
// os<<deq[0];rep(i,1,deq.size())os<<' '<<deq[i];return os; }
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
} // http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define rrep(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(v) for (auto &i : v)
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define fi i.first
#define se i.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define o(p) cout << p << endl, 0
#define dd(n) cout << fixed << setprecision(n)
#define inf linf
int main() {
lin(n, k);
stin(s);
if (s[k - 1] < 'a')
s[k - 1] -= 'A' - 'a';
cout << s << endl;
}
// sub-EOF
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 856,850 | 856,851 | u675296835 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
k--;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
cout << s << endl;
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 856,856 | 856,857 | u355424600 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
k++;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
k--;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
cout << s << endl;
return 0;
}
| [] | 856,858 | 856,857 | u355424600 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n, k, s;
k++;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> k >> s;
k--;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
cout << s << endl;
return 0;
}
| [] | 856,859 | 856,857 | u355424600 | cpp |
p03041 | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define bit(x, v) ((ll)x << v)
const ll INF = 1000000007;
const ll MAX = 1000010;
const ll MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (px < py) {
pr[py] = px;
} else {
pr[px] = py;
}
return true;
}
// res[i][c] := i 文字目以降で最初に文字 c が登場する index (存在しないときは n)
vector<vector<int>> calcNext(const string &S) {
int n = (int)S.size();
vector<vector<int>> res(n + 1, vector<int>(26, n));
for (int i = n - 1; i >= 0; --i) {
for (int j = 0; j < 26; ++j)
res[i][j] = res[i + 1][j];
res[i][S[i] - 'a'] = i;
}
return res;
}
// mod 1000000007 の世界で a += b する関数
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
const ll ainf = 998244353;
struct cell {
int x, y;
int deep;
cell(int x, int y, int deep) : x(x), y(y), deep(deep) {}
};
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
int W, H, N;
int X1[500], X2[500], Y1[500], Y2[500];
bool fld[500 * 6][500 * 6];
int compress(int *x1, int *x2, int w) {
vector<int> xs;
for (int i = 0; i < N; i++) {
for (int d = -1; d <= 1; d++) {
int tx1 = x1[i] + d, tx2 = x2[i] + d;
if (1 <= tx1 && tx1 <= W)
xs.push_back(tx1);
if (1 <= tx2 && tx2 <= W)
xs.push_back(tx2);
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (size_t i = 0; i < N; i++) {
x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
}
return xs.size();
}
const int MAX_N = 1 << 17;
//
// int n,dat[2 * MAX_N - 1];
//
// void init(int n_) {
// n = 1;
// while (n < n_)
// {
// n *= 2;
// }
// for (size_t i = 0; i < 2 * n - 1; i++)
// {
// dat[i] = INT_MAX;
// }
//}
//
// void update(int k, int a) {
// k += n - 1;
// dat[k] = a;
// while (k > 0) {
// k = (k - 1) / 2;
// dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
// }
//}
// int query(int a, int b, int k, int l, int r) {
// if (r <= a || b <= 1) return INT_MAX;
//
// if (a <= l && r <= b) return dat[k];
// else {
// int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
// int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);
// return min(vl, vr);
// }
//
// auto p = tie(a,b,k);
//}
ll fmemo[1000010];
ll fact(ll x) {
if (fmemo[x] > 0)
return fmemo[x];
if (x == 0)
return 1;
fmemo[x] = (x * fact(x - 1));
fmemo[x] %= INF;
return fmemo[x];
}
void solv() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
map<char, char> m;
m['A'] = 'a';
m['B'] = 'b';
m['C'] = 'C';
s[k - 1] = m[s[k - 1]];
cout << s << endl;
}
int main() {
// COMinit();
solv();
return 0;
}
| #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define bit(x, v) ((ll)x << v)
const ll INF = 1000000007;
const ll MAX = 1000010;
const ll MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (px < py) {
pr[py] = px;
} else {
pr[px] = py;
}
return true;
}
// res[i][c] := i 文字目以降で最初に文字 c が登場する index (存在しないときは n)
vector<vector<int>> calcNext(const string &S) {
int n = (int)S.size();
vector<vector<int>> res(n + 1, vector<int>(26, n));
for (int i = n - 1; i >= 0; --i) {
for (int j = 0; j < 26; ++j)
res[i][j] = res[i + 1][j];
res[i][S[i] - 'a'] = i;
}
return res;
}
// mod 1000000007 の世界で a += b する関数
void add(long long &a, long long b) {
a += b;
if (a >= MOD)
a -= MOD;
}
const ll ainf = 998244353;
struct cell {
int x, y;
int deep;
cell(int x, int y, int deep) : x(x), y(y), deep(deep) {}
};
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
int W, H, N;
int X1[500], X2[500], Y1[500], Y2[500];
bool fld[500 * 6][500 * 6];
int compress(int *x1, int *x2, int w) {
vector<int> xs;
for (int i = 0; i < N; i++) {
for (int d = -1; d <= 1; d++) {
int tx1 = x1[i] + d, tx2 = x2[i] + d;
if (1 <= tx1 && tx1 <= W)
xs.push_back(tx1);
if (1 <= tx2 && tx2 <= W)
xs.push_back(tx2);
}
}
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (size_t i = 0; i < N; i++) {
x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
}
return xs.size();
}
const int MAX_N = 1 << 17;
//
// int n,dat[2 * MAX_N - 1];
//
// void init(int n_) {
// n = 1;
// while (n < n_)
// {
// n *= 2;
// }
// for (size_t i = 0; i < 2 * n - 1; i++)
// {
// dat[i] = INT_MAX;
// }
//}
//
// void update(int k, int a) {
// k += n - 1;
// dat[k] = a;
// while (k > 0) {
// k = (k - 1) / 2;
// dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
// }
//}
// int query(int a, int b, int k, int l, int r) {
// if (r <= a || b <= 1) return INT_MAX;
//
// if (a <= l && r <= b) return dat[k];
// else {
// int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
// int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);
// return min(vl, vr);
// }
//
// auto p = tie(a,b,k);
//}
ll fmemo[1000010];
ll fact(ll x) {
if (fmemo[x] > 0)
return fmemo[x];
if (x == 0)
return 1;
fmemo[x] = (x * fact(x - 1));
fmemo[x] %= INF;
return fmemo[x];
}
void solv() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
map<char, char> m;
m['A'] = 'a';
m['B'] = 'b';
m['C'] = 'c';
s[k - 1] = m[s[k - 1]];
cout << s << endl;
}
int main() {
// COMinit();
solv();
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 856,860 | 856,861 | u224756887 | cpp |
p03041 | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
if (s[k] == 'A') {
s[k] = 'a';
} else if (s[k] == 'B') {
s[k] = 'b';
} else {
s[k] = 'c';
}
cout << s;
return 0;
} | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
k--;
if (s[k] == 'A') {
s[k] = 'a';
} else if (s[k] == 'B') {
s[k] = 'b';
} else {
s[k] = 'c';
}
cout << s;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 856,885 | 856,886 | u468506413 | cpp |
p03041 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i <= n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define SORT(v, n) sort(v, v + n)
#define VSORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define VI vector<int>
#define PB(x) push_back(x)
#define SZ(x) end(x) - begin(x)
#define DEBUG(x) cerr << __LINE__ << ":" << #x << ": " << x << "\n";
//#define int long long
using namespace std;
using lint = long long;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} fast;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
inline void CO(auto &a) { REP(i, SZ(a)) cout << i << ": " << a[i] << "\n"; }
// if (IO > 1e5){lint a; scanf(%lld, &a); printf("%lld\n", a);}
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] += 32;
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i <= n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define SORT(v, n) sort(v, v + n)
#define VSORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define VI vector<int>
#define PB(x) push_back(x)
#define SZ(x) end(x) - begin(x)
#define DEBUG(x) cerr << __LINE__ << ":" << #x << ": " << x << "\n";
//#define int long long
using namespace std;
using lint = long long;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} fast;
const int INF = INT_MAX;
const lint LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
inline void CO(auto &a) { REP(i, SZ(a)) cout << i << ": " << a[i] << "\n"; }
// if (IO > 1e5){lint a; scanf(%lld, &a); printf("%lld\n", a);}
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] += 32;
cout << s << endl;
return 0;
}
| [
"assignment.change"
] | 856,889 | 856,890 | u013120980 | cpp |
p03041 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P;
map<int, int> dp;
#define REP(i, n) for (int i = 0; i < n; i++)
bool in(int target, int max) { return 0 <= target && target < max - 1; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> K;
cin >> S;
S[K] = S[K] + 32;
cout << S << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P;
map<int, int> dp;
#define REP(i, n) for (int i = 0; i < n; i++)
bool in(int target, int max) { return 0 <= target && target < max - 1; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> K;
cin >> S;
S[K - 1] = S[K - 1] + 32;
cout << S << endl;
return 0;
}
| [
"assignment.change"
] | 856,891 | 856,892 | u276479653 | cpp |
p03041 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int number, count;
string str;
cin >> number >> count;
cin >> str;
str.at(count) += 0x20;
cout << str << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int number, count;
string str;
cin >> number >> count;
cin >> str;
str.at(count - 1) += 0x20;
cout << str << endl;
return 0;
}
| [
"assignment.change"
] | 856,897 | 856,898 | u303719334 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
string S;
cin >> S;
S[K] += 0x20;
cout << S;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
string S;
cin >> S;
S[K - 1] += 0x20;
cout << S;
}
| [
"assignment.change"
] | 856,903 | 856,904 | u084968244 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define all(c) begin(c), end(c)
#define al(d) d.begin(), d.end()
#define fill(n) std::setfill('0') << std::right << std::setw(n)
#define intmax 2147483647
#define llmax 9223372036854775807
#define mod 1000000007
template <typename T> using vec = std::vector<T>;
using vi = vec<int>;
using vvi = vec<vi>;
using pii = std::pair<int, int>;
using ll = long long;
using vll = vec<ll>;
using ld = long double;
#define pair(a, b) "(" << a << "," << b << ")"
#define pairr(a, b, c) "(" << a << "," << b << "," << c << ")"
#define lmin(a, b) (a < b) ? a : b
template <typename T> void putv(vector<T> &V) {
// cout << "The elements in the vector are: " << endl;
for (auto x : V)
cout << x << " ";
cout << endl;
}
template <class T> vector<T> getv(int n) {
vector<T> vec;
rep(i, n) {
T input;
cin >> input;
vec.emplace_back(input);
}
return vec;
}
////Graph
using Weight = ll;
using Flow = int;
struct Edge {
int src, dst;
Weight weight;
Flow cap;
Edge() : src(0), dst(0), weight(0) {}
Edge(int s, int d, Weight w) : src(s), dst(d), weight(w) {}
};
using Edges = std::vector<Edge>;
using Graph = std::vector<Edges>;
using Array = std::vector<Weight>;
using Matrix = std::vector<Array>;
void add_edge(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
g[b].emplace_back(b, a, w);
}
void add_arc(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
}
void init_weighted_graph(Graph &g, int N, int M) {
vector<Edge> empty_Edges;
g = Graph(N, empty_Edges);
rep(i, M) {
int a, b, w;
cin >> a >> b >> w;
add_edge(g, a - 1, b - 1, w);
}
// 例えば
//// 3 3
//// 1 2 1
//// 1 3 1
//// 2 3 3
// から
//// The Adjacency List of
//// G=(V,E) (n=3,m=6)
//// 0: (1,1)(2,1)
//// 1: (0,1)(2,3)
//// 2: (0,1)(1,3)
// を得る．
}
void init_weighted_directed_graph(Graph &g, int N, int M) {
vector<Edge> empty_Edges;
g = Graph(N, empty_Edges);
rep(i, M) {
int a, b, w;
cin >> a >> b >> w;
add_arc(g, a - 1, b - 1, w);
}
}
void show_weighted_graph(const Graph &g) {
int N = g.size();
int M = 0;
rep(s, N) M += g[s].size();
cout << "///////////////////////" << endl;
cout << "The Adjacency List of" << endl
<< "G=(V,E) (n=" << N << ","
<< "m=" << M << ")" << endl;
rep(s, N) {
cout << s << ": ";
int size = g[s].size();
rep(t, size) cout << pair(g[s][t].dst, g[s][t].weight);
cout << endl;
}
cout << "////////////////////////" << endl << endl;
}
// a->bが存在するか
bool is_adj(Graph &g, int a, int b) {
for (auto e : g[a])
if (b == e.dst)
return true;
return false;
}
// O(V^3)
Matrix warshallFloyd(const Graph &g) {
auto const inf = numeric_limits<Weight>::max() / 8;
int n = g.size();
Matrix d(n, Array(n, inf));
rep(i, n) d[i][i] = 0;
rep(i, n) for (auto &e : g[i]) d[e.src][e.dst] =
min(d[e.src][e.dst], e.weight);
rep(k, n) rep(i, n) rep(j, n) if (d[i][k] != inf && d[k][j] != inf) d[i][j] =
min(d[i][j], d[i][k] + d[k][j]);
return d;
}
//////////
void out(bool ans) {
if (ans == true)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Out(bool ans) {
if (ans == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void OUT(bool ans) {
if (ans == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
//// Mathematical functions
ll gcd(const ll a, const ll b) { return (b == 0) ? a : gcd(b, a % b); }
ll lcm(const ll a, const ll b) { return a * (b / gcd(a, b)); }
ll Manhattan_dist(ll x1, ll y1, ll x2, ll y2) {
return abs(x1 - x2) + abs(y1 - y2);
}
// nをpで何回割れるか
ll hmt_p_divides_n(ll p, ll n) {
ll s = 0;
while (n % p == 0) {
n /= p;
s++;
}
return s;
}
int digit(ll n) {
int cntr = 0;
while (n > 0) {
n /= 10;
cntr++;
}
return cntr;
}
// generarized absolute value
template <class T> T gabs(const T &x) { return max(x, -x); }
#define abs gabs
ll memo[100][100] = {};
ll binom(const int n, const int r) {
if (n < r)
return 0;
if (r == 0 || n == r)
return 1;
if (memo[n][r] > 0)
return memo[n][r];
else
return memo[n][r] = binom(n - 1, r) + binom(n - 1, r - 1);
}
ll pw(ll x, int y) {
ll a = 1;
while (y) {
if (y & 1)
a = (a * x) % mod;
x = (x * x) % mod;
y >>= 1;
}
return a;
}
ll modinv(ll x) { return pw(x, mod - 2); }
bool is_prime(int p) {
if (p <= 1)
return false;
for (int n = 2; n <= pow(p, 0.5); ++n)
if (p % n == 0)
return false;
return true;
}
// n以下の最大の素因数を求める
int max_prime_divisor(int n) {
for (int x = n; x > 1; --x)
if (is_prime(x) && n % x == 0)
return x;
return -1;
}
vi factorize(int n) {
vi factors;
while (n > 1) {
int p = max_prime_divisor(n);
factors.emplace_back(p);
n /= p;
}
sort(factors.begin(), factors.end());
putv(factors);
return factors;
}
// b進数での各桁の合計
ll f(ll b, ll n) {
if (n < b)
return n;
return f(b, n / b) + n % b;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
//////////////////////////////////////////////////
void field_table(int p) {
// 素数pに対して
// 0..p-1の和と
// 1..p-1の積テーブルを作る
cout << "MOD = " << p << endl << endl;
cout << " + | ";
for (int a = 0; a <= p - 1; ++a)
cout << fill(2) << a << " ";
cout << endl;
cout << "----";
for (int i = 0; i < p; ++i)
cout << "---";
cout << endl;
for (int a = 0; a <= p - 1; ++a) {
cout << fill(2) << a << " | ";
for (int b = 0; b <= p - 1; ++b)
cout << fill(2) << (a + b) % p << " ";
cout << endl;
}
cout << endl << " * | ";
for (int a = 1; a <= p - 1; ++a)
cout << fill(2) << a << " ";
cout << endl;
cout << "----";
for (int i = 0; i < p - 1; ++i)
cout << "---";
cout << endl;
for (int a = 1; a <= p - 1; ++a) {
cout << fill(2) << a << " | ";
for (int b = 1; b <= p - 1; ++b)
cout << fill(2) << (a * b) % p << " ";
cout << endl;
}
}
// mod p で見て nのマイナスの逆元を調べる
int minus_inverse(int p, int n) {
int a = p - n;
for (int b = 1; b < p; ++b)
if ((a * b) % p == 1)
return b;
return -1;
}
int inverse(int p, int n) {
int a = 1;
while ((n * a) % p != 1)
a++;
return a;
}
int inverse_minus_inverese(int p, int n) {
int a = inverse(p, n);
return inverse(p, p - a);
}
// int main(){
// int p = 7;
// field_table(p);
// for(int n=1; n<p; ++n){
// cout << n << ": "<< inverse(p,n);
// cout << " " << p-inverse(p,n);
// cout << " " << inverse_minus_inverese(p,n) << endl;
// }
// }
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = s[k] + 32;
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define all(c) begin(c), end(c)
#define al(d) d.begin(), d.end()
#define fill(n) std::setfill('0') << std::right << std::setw(n)
#define intmax 2147483647
#define llmax 9223372036854775807
#define mod 1000000007
template <typename T> using vec = std::vector<T>;
using vi = vec<int>;
using vvi = vec<vi>;
using pii = std::pair<int, int>;
using ll = long long;
using vll = vec<ll>;
using ld = long double;
#define pair(a, b) "(" << a << "," << b << ")"
#define pairr(a, b, c) "(" << a << "," << b << "," << c << ")"
#define lmin(a, b) (a < b) ? a : b
template <typename T> void putv(vector<T> &V) {
// cout << "The elements in the vector are: " << endl;
for (auto x : V)
cout << x << " ";
cout << endl;
}
template <class T> vector<T> getv(int n) {
vector<T> vec;
rep(i, n) {
T input;
cin >> input;
vec.emplace_back(input);
}
return vec;
}
////Graph
using Weight = ll;
using Flow = int;
struct Edge {
int src, dst;
Weight weight;
Flow cap;
Edge() : src(0), dst(0), weight(0) {}
Edge(int s, int d, Weight w) : src(s), dst(d), weight(w) {}
};
using Edges = std::vector<Edge>;
using Graph = std::vector<Edges>;
using Array = std::vector<Weight>;
using Matrix = std::vector<Array>;
void add_edge(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
g[b].emplace_back(b, a, w);
}
void add_arc(Graph &g, int a, int b, Weight w = 1) {
g[a].emplace_back(a, b, w);
}
void init_weighted_graph(Graph &g, int N, int M) {
vector<Edge> empty_Edges;
g = Graph(N, empty_Edges);
rep(i, M) {
int a, b, w;
cin >> a >> b >> w;
add_edge(g, a - 1, b - 1, w);
}
// 例えば
//// 3 3
//// 1 2 1
//// 1 3 1
//// 2 3 3
// から
//// The Adjacency List of
//// G=(V,E) (n=3,m=6)
//// 0: (1,1)(2,1)
//// 1: (0,1)(2,3)
//// 2: (0,1)(1,3)
// を得る．
}
void init_weighted_directed_graph(Graph &g, int N, int M) {
vector<Edge> empty_Edges;
g = Graph(N, empty_Edges);
rep(i, M) {
int a, b, w;
cin >> a >> b >> w;
add_arc(g, a - 1, b - 1, w);
}
}
void show_weighted_graph(const Graph &g) {
int N = g.size();
int M = 0;
rep(s, N) M += g[s].size();
cout << "///////////////////////" << endl;
cout << "The Adjacency List of" << endl
<< "G=(V,E) (n=" << N << ","
<< "m=" << M << ")" << endl;
rep(s, N) {
cout << s << ": ";
int size = g[s].size();
rep(t, size) cout << pair(g[s][t].dst, g[s][t].weight);
cout << endl;
}
cout << "////////////////////////" << endl << endl;
}
// a->bが存在するか
bool is_adj(Graph &g, int a, int b) {
for (auto e : g[a])
if (b == e.dst)
return true;
return false;
}
// O(V^3)
Matrix warshallFloyd(const Graph &g) {
auto const inf = numeric_limits<Weight>::max() / 8;
int n = g.size();
Matrix d(n, Array(n, inf));
rep(i, n) d[i][i] = 0;
rep(i, n) for (auto &e : g[i]) d[e.src][e.dst] =
min(d[e.src][e.dst], e.weight);
rep(k, n) rep(i, n) rep(j, n) if (d[i][k] != inf && d[k][j] != inf) d[i][j] =
min(d[i][j], d[i][k] + d[k][j]);
return d;
}
//////////
void out(bool ans) {
if (ans == true)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Out(bool ans) {
if (ans == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void OUT(bool ans) {
if (ans == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
//// Mathematical functions
ll gcd(const ll a, const ll b) { return (b == 0) ? a : gcd(b, a % b); }
ll lcm(const ll a, const ll b) { return a * (b / gcd(a, b)); }
ll Manhattan_dist(ll x1, ll y1, ll x2, ll y2) {
return abs(x1 - x2) + abs(y1 - y2);
}
// nをpで何回割れるか
ll hmt_p_divides_n(ll p, ll n) {
ll s = 0;
while (n % p == 0) {
n /= p;
s++;
}
return s;
}
int digit(ll n) {
int cntr = 0;
while (n > 0) {
n /= 10;
cntr++;
}
return cntr;
}
// generarized absolute value
template <class T> T gabs(const T &x) { return max(x, -x); }
#define abs gabs
ll memo[100][100] = {};
ll binom(const int n, const int r) {
if (n < r)
return 0;
if (r == 0 || n == r)
return 1;
if (memo[n][r] > 0)
return memo[n][r];
else
return memo[n][r] = binom(n - 1, r) + binom(n - 1, r - 1);
}
ll pw(ll x, int y) {
ll a = 1;
while (y) {
if (y & 1)
a = (a * x) % mod;
x = (x * x) % mod;
y >>= 1;
}
return a;
}
ll modinv(ll x) { return pw(x, mod - 2); }
bool is_prime(int p) {
if (p <= 1)
return false;
for (int n = 2; n <= pow(p, 0.5); ++n)
if (p % n == 0)
return false;
return true;
}
// n以下の最大の素因数を求める
int max_prime_divisor(int n) {
for (int x = n; x > 1; --x)
if (is_prime(x) && n % x == 0)
return x;
return -1;
}
vi factorize(int n) {
vi factors;
while (n > 1) {
int p = max_prime_divisor(n);
factors.emplace_back(p);
n /= p;
}
sort(factors.begin(), factors.end());
putv(factors);
return factors;
}
// b進数での各桁の合計
ll f(ll b, ll n) {
if (n < b)
return n;
return f(b, n / b) + n % b;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
//////////////////////////////////////////////////
void field_table(int p) {
// 素数pに対して
// 0..p-1の和と
// 1..p-1の積テーブルを作る
cout << "MOD = " << p << endl << endl;
cout << " + | ";
for (int a = 0; a <= p - 1; ++a)
cout << fill(2) << a << " ";
cout << endl;
cout << "----";
for (int i = 0; i < p; ++i)
cout << "---";
cout << endl;
for (int a = 0; a <= p - 1; ++a) {
cout << fill(2) << a << " | ";
for (int b = 0; b <= p - 1; ++b)
cout << fill(2) << (a + b) % p << " ";
cout << endl;
}
cout << endl << " * | ";
for (int a = 1; a <= p - 1; ++a)
cout << fill(2) << a << " ";
cout << endl;
cout << "----";
for (int i = 0; i < p - 1; ++i)
cout << "---";
cout << endl;
for (int a = 1; a <= p - 1; ++a) {
cout << fill(2) << a << " | ";
for (int b = 1; b <= p - 1; ++b)
cout << fill(2) << (a * b) % p << " ";
cout << endl;
}
}
// mod p で見て nのマイナスの逆元を調べる
int minus_inverse(int p, int n) {
int a = p - n;
for (int b = 1; b < p; ++b)
if ((a * b) % p == 1)
return b;
return -1;
}
int inverse(int p, int n) {
int a = 1;
while ((n * a) % p != 1)
a++;
return a;
}
int inverse_minus_inverese(int p, int n) {
int a = inverse(p, n);
return inverse(p, p - a);
}
// int main(){
// int p = 7;
// field_table(p);
// for(int n=1; n<p; ++n){
// cout << n << ": "<< inverse(p,n);
// cout << " " << p-inverse(p,n);
// cout << " " << inverse_minus_inverese(p,n) << endl;
// }
// }
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = s[k - 1] + 32;
cout << s << endl;
}
| [
"assignment.change"
] | 856,920 | 856,921 | u153846982 | cpp |
p03041 | #include <iostream>
using namespace std;
int main() {
int n, k;
char s[50];
cin >> n >> k >> s;
if (s[k - 1] == 'A')
s[k] = 'a';
if (s[k - 1] == 'B')
s[k] = 'b';
if (s[k - 1] == 'C')
s[k] = 'c';
cout << s << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
char s[50];
cin >> n >> k >> s;
if (s[k - 1] == 'A')
s[k - 1] = 'a';
if (s[k - 1] == 'B')
s[k - 1] = 'b';
if (s[k - 1] == 'C')
s[k - 1] = 'c';
cout << s << endl;
return 0;
} | [
"assignment.change"
] | 856,930 | 856,931 | u817014213 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K] = tolower(S[K]);
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
S[K - 1] = tolower(S[K - 1]);
cout << S << endl;
} | [
"assignment.change"
] | 856,934 | 856,935 | u111653921 | cpp |
p03041 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
k = k - 1;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'B')
s[k] = 'c';
cout << s << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
k = k - 1;
if (s[k] == 'A')
s[k] = 'a';
if (s[k] == 'B')
s[k] = 'b';
if (s[k] == 'C')
s[k] = 'c';
cout << s << endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 856,936 | 856,937 | u265608204 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##_cond = (b); i >= i##_cond; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend() // sortで大きい順
#define sz(x) ((int)(x).size())
#define pb push_back
#define fst first
#define snd second
#define mp make_pair
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
constexpr ll inf = 1ll << 61;
constexpr ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void add(T &a, const T &b) {
a += b;
a %= mod;
}
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = tolower(s[k - 1]);
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##_cond = (b); i >= i##_cond; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend() // sortで大きい順
#define sz(x) ((int)(x).size())
#define pb push_back
#define fst first
#define snd second
#define mp make_pair
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
constexpr ll inf = 1ll << 61;
constexpr ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void add(T &a, const T &b) {
a += b;
a %= mod;
}
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << endl;
}
| [
"assignment.change"
] | 856,947 | 856,948 | u900834830 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##_cond = (b); i >= i##_cond; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend() // sortで大きい順
#define sz(x) ((int)(x).size())
#define pb push_back
#define fst first
#define snd second
#define mp make_pair
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
constexpr ll inf = 1ll << 61;
constexpr ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void add(T &a, const T &b) {
a += b;
a %= mod;
}
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k] = tolower(s[k]);
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##_cond = (b); i >= i##_cond; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend() // sortで大きい順
#define sz(x) ((int)(x).size())
#define pb push_back
#define fst first
#define snd second
#define mp make_pair
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
constexpr ll inf = 1ll << 61;
constexpr ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void add(T &a, const T &b) {
a += b;
a %= mod;
}
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] = tolower(s[k - 1]);
cout << s << endl;
}
| [
"assignment.change"
] | 856,949 | 856,948 | u900834830 | cpp |
p03041 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define Yes(f) \
cout << (f ? "Yes" : "No") << endl // fが真の場合Yesを出力、偽の場合Noを出力
#define yes(f) cout << (f ? "yes" : "no") << endl
#define YES(f) cout << (f ? "YES" : "NO") << endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
string abc;
cin >> abc;
if (abc[k - 1] == 'A')
abc[k - 1] = 'a';
else if (abc[k - 1] == 'b')
abc[k - 1] = 'b';
else
abc[k - 1] = 'c';
cout << abc << endl;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a, 0, sizeof(a))
#define inf (1ll << 60)
#define Yes(f) \
cout << (f ? "Yes" : "No") << endl // fが真の場合Yesを出力、偽の場合Noを出力
#define yes(f) cout << (f ? "yes" : "no") << endl
#define YES(f) cout << (f ? "YES" : "NO") << endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
string abc;
cin >> abc;
if (abc[k - 1] == 'A')
abc[k - 1] = 'a';
else if (abc[k - 1] == 'B')
abc[k - 1] = 'b';
else
abc[k - 1] = 'c';
cout << abc << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 856,954 | 856,955 | u775507068 | cpp |
p03041 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> K;
cin >> S;
S[K] = S[K] - 'A' + 'a';
cout << S;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> K;
cin >> S;
S[K - 1] = S[K - 1] - 'A' + 'a';
cout << S;
return 0;
} | [
"assignment.change"
] | 856,960 | 856,961 | u472926449 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
scanf("%d", &x);
int a = x / 100, b = x % 100;
int p = 0, q = 0;
if (0 < a <= 12)
p = 1;
if (0 < b <= 12)
q = 1;
if (p == 1 && q == 1)
printf("AMBIGUOUS");
if (p == 1 && q == 0)
printf("MMYY");
if (p == 0 && q == 1)
printf("YYMM");
if (p == 0 && q == 0)
printf("NA");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
scanf("%d", &x);
int a = x / 100, b = x % 100;
int p = 0, q = 0;
if (a > 0 && a <= 12)
p = 1;
if (b > 0 && b <= 12)
q = 1;
if (p == 1 && q == 1)
printf("AMBIGUOUS");
if (p == 1 && q == 0)
printf("MMYY");
if (p == 0 && q == 1)
printf("YYMM");
if (p == 0 && q == 0)
printf("NA");
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 856,973 | 856,974 | u018679195 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
auto a = stoi(S.substr(0, 2)), b = stoi(S.substr(2));
int f = 0;
if (1 <= a and a <= 12)
f |= 1;
if (1 <= b and b <= 12)
f |= 2;
switch (f) {
case 1:
cout << "MMYY\n";
break;
case 2:
cout << "YYMM\n";
break;
case 3:
cout << "AMBIGUOS\n";
break;
default:
cout << "NA\n";
break;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
auto a = stoi(S.substr(0, 2)), b = stoi(S.substr(2));
int f = 0;
if (1 <= a and a <= 12)
f |= 1;
if (1 <= b and b <= 12)
f |= 2;
switch (f) {
case 1:
cout << "MMYY\n";
break;
case 2:
cout << "YYMM\n";
break;
case 3:
cout << "AMBIGUOUS\n";
break;
default:
cout << "NA\n";
break;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 856,977 | 856,978 | u863370423 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s;
cin >> s;
bool fg1 = true; // yymm
bool fg2 = true; // mmyy
if (s[2] == '0' && s[3] == '0')
fg1 = false;
else if (s[2] != '0' && s[2] != '1')
fg1 = false;
else if (s[2] == '1' && s[3] == '3')
fg1 = false;
else if (s[2] == '1' && s[3] == '4')
fg1 = false;
else if (s[2] == '1' && s[3] == '5')
fg1 = false;
else if (s[2] == '1' && s[3] == '6')
fg1 = false;
else if (s[2] == '1' && s[3] == '7')
fg1 = false;
else if (s[2] == '1' && s[3] == '8')
fg1 = false;
else if (s[2] == '1' && s[3] == '9')
fg1 = false;
string t = s;
s[0] = t[2];
s[1] = t[3];
s[2] = t[1];
s[3] = t[2];
if (s[2] == '0' && s[3] == '0')
fg2 = false;
else if (s[2] != '0' && s[2] != '1')
fg2 = false;
else if (s[2] == '1' && s[3] == '3')
fg2 = false;
else if (s[2] == '1' && s[3] == '4')
fg2 = false;
else if (s[2] == '1' && s[3] == '5')
fg2 = false;
else if (s[2] == '1' && s[3] == '6')
fg2 = false;
else if (s[2] == '1' && s[3] == '7')
fg2 = false;
else if (s[2] == '1' && s[3] == '8')
fg2 = false;
else if (s[2] == '1' && s[3] == '9')
fg2 = false;
if (fg1 && fg2) {
cout << "AMBIGUOUS" << endl;
} else if (fg1)
cout << "YYMM" << endl;
else if (fg2)
cout << "MMYY" << endl;
else
cout << "NA" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s;
cin >> s;
bool fg1 = true; // yymm
bool fg2 = true; // mmyy
if (s[2] == '0' && s[3] == '0')
fg1 = false;
else if (s[2] != '0' && s[2] != '1')
fg1 = false;
else if (s[2] == '1' && s[3] == '3')
fg1 = false;
else if (s[2] == '1' && s[3] == '4')
fg1 = false;
else if (s[2] == '1' && s[3] == '5')
fg1 = false;
else if (s[2] == '1' && s[3] == '6')
fg1 = false;
else if (s[2] == '1' && s[3] == '7')
fg1 = false;
else if (s[2] == '1' && s[3] == '8')
fg1 = false;
else if (s[2] == '1' && s[3] == '9')
fg1 = false;
string t = s;
s[0] = t[2];
s[1] = t[3];
s[2] = t[0];
s[3] = t[1];
if (s[2] == '0' && s[3] == '0')
fg2 = false;
else if (s[2] != '0' && s[2] != '1')
fg2 = false;
else if (s[2] == '1' && s[3] == '3')
fg2 = false;
else if (s[2] == '1' && s[3] == '4')
fg2 = false;
else if (s[2] == '1' && s[3] == '5')
fg2 = false;
else if (s[2] == '1' && s[3] == '6')
fg2 = false;
else if (s[2] == '1' && s[3] == '7')
fg2 = false;
else if (s[2] == '1' && s[3] == '8')
fg2 = false;
else if (s[2] == '1' && s[3] == '9')
fg2 = false;
if (fg1 && fg2) {
cout << "AMBIGUOUS" << endl;
} else if (fg1)
cout << "YYMM" << endl;
else if (fg2)
cout << "MMYY" << endl;
else
cout << "NA" << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 856,981 | 856,982 | u489823438 | cpp |
p03042 | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int s1, s2;
s1 = stoi(s.substr(0, 2));
s2 = stoi(s.substr(2, 2));
if (1 <= s1 && s1 <= 12) {
if (1 <= s2 && s2 <= 12)
cout << "ANBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= s2 && s2 <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
} | #include <bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template <typename T_char> T_char ToUpper(T_char cX) { return toupper(cX); }
int main() {
string s;
cin >> s;
int s1, s2;
s1 = stoi(s.substr(0, 2));
s2 = stoi(s.substr(2, 2));
if (1 <= s1 && s1 <= 12) {
if (1 <= s2 && s2 <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= s2 && s2 <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 856,992 | 856,993 | u145562832 | 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 rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A;
cin >> A;
int Y, M;
Y = A / 100;
M = A % 100;
int YM, MY;
YM = MY = 0;
if (1 <= M && M <= 12) {
YM++;
}
if (1 <= Y && Y <= 12) {
MY++;
}
if (YM == 1 && MY == 0) {
cout << "YYMM" << endl;
} else if (MY == 1 && YM == 0) {
cout << "MMYY" << endl;
} else if (MY == 0 && YM == 0) {
cout << "NA" << endl;
} else {
cout << "AMBIGUOUSAMBIGUOUS" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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++)
int main() {
int A;
cin >> A;
int Y, M;
Y = A / 100;
M = A % 100;
int YM, MY;
YM = MY = 0;
if (1 <= M && M <= 12) {
YM++;
}
if (1 <= Y && Y <= 12) {
MY++;
}
if (YM == 1 && MY == 0) {
cout << "YYMM" << endl;
} else if (MY == 1 && YM == 0) {
cout << "MMYY" << endl;
} else if (MY == 0 && YM == 0) {
cout << "NA" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 856,994 | 856,995 | u025773431 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int ans1 = s / 100;
int ans2 = s % 100;
if (1 <= ans2 && ans2 <= 12) {
if (1 <= ans1 && ans1 <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= ans1 && ans1 <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
int ans1 = s / 100;
int ans2 = s % 100;
if (1 <= ans1 && ans1 <= 12) {
if (1 <= ans2 && ans2 <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= ans2 && ans2 <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 856,996 | 856,997 | u353630064 | cpp |
p03042 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exout(x) printf("%.12f\n", x)
const double pi = acos(-1.0);
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX_N = 1010101;
//組み合わせの余りを求める
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// mod.m での a の逆元 a^ { -1 } を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
//最大公約数
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)
return 0;
return (x / gcd(x, y) * y);
}
ll dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
ll dy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
char c[2010][2010];
ll sum[2010][2010];
ll res[10][10];
// long longしか使わない
//素数は1より大きい
// lower_boundは指定したkey以上の要素の一番左のイテレータをかえす
// upper_boundは指定したkeyより大きい要素の一番左のイテレータをかえす
int main() {
string s;
cin >> s;
ll res = 0;
ll res2 = 0;
rep(i, 4) {
if (i == 0 || i == 1) {
if (i == 0)
res += 1000 * (s[i] - '0');
else
res += 100 * (s[i] - '0');
} else {
if (i == 2)
res2 += 10 * (s[i] - '0');
else
res2 += s[i] - '0';
}
}
if (0 < res && res <= 12 && 0 < res2 && res2 <= 12)
puts("AMBIGUOUS");
else if (0 < res && res <= 12)
puts("MMYY");
else if (0 < res2 && res2 <= 12)
puts("YYMM");
else
puts("NA");
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exout(x) printf("%.12f\n", x)
const double pi = acos(-1.0);
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX_N = 1010101;
//組み合わせの余りを求める
ll fac[MAX_N], finv[MAX_N], inv[MAX_N];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// mod.m での a の逆元 a^ { -1 } を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
//最大公約数
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) {
if (x == 0 || y == 0)
return 0;
return (x / gcd(x, y) * y);
}
ll dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
ll dy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
char c[2010][2010];
ll sum[2010][2010];
ll res[10][10];
// long longしか使わない
//素数は1より大きい
// lower_boundは指定したkey以上の要素の一番左のイテレータをかえす
// upper_boundは指定したkeyより大きい要素の一番左のイテレータをかえす
int main() {
string s;
cin >> s;
ll res = 0;
ll res2 = 0;
rep(i, 4) {
if (i == 0 || i == 1) {
if (i == 0)
res += 10 * (s[i] - '0');
else
res += 1 * (s[i] - '0');
} else {
if (i == 2)
res2 += 10 * (s[i] - '0');
else
res2 += s[i] - '0';
}
}
if (0 < res && res <= 12 && 0 < res2 && res2 <= 12)
puts("AMBIGUOUS");
else if (0 < res && res <= 12)
puts("MMYY");
else if (0 < res2 && res2 <= 12)
puts("YYMM");
else
puts("NA");
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 856,998 | 856,999 | u631558039 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(i) (i).begin(), (i).end()
#define RALL(i) (i).begin(), (i).end(), greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
#define TENFIVE2 200005
// #define int long long
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double EPS = 1e9 + 7;
const double PI = acos(-1);
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
inline int in() {
int x;
std::cin >> x;
return x;
}
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vp = vector<pint>;
template <typename T> void print(T x) { std::cout << x << '\n'; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
signed main() {
int S;
cin >> S;
int head, tail;
tail = S % 100;
head = S / 100;
bool yymm = false;
bool mmyy = false;
if (1 <= tail && tail <= 12) {
yymm = true;
}
if (1 <= head && head <= 12) {
mmyy = true;
}
// print(head);
// print(tail);
// print(yymm);
// print(mmyy);
if (yymm & mmyy) {
print("AMBIGUOUS");
}
elif (yymm) { print("YYMM"); }
elif (mmyy) { print("YYMM"); }
else {
print("NA");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define ALL(i) (i).begin(), (i).end()
#define RALL(i) (i).begin(), (i).end(), greater<int>()
#define elif else if
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define fst first
#define sec second
typedef long long ll;
#define TENNINE 1000000005
#define TENFIVE 100005
#define TENFIVE2 200005
// #define int long long
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double EPS = 1e9 + 7;
const double PI = acos(-1);
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
inline int in() {
int x;
std::cin >> x;
return x;
}
using lint = long long;
using pint = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vp = vector<pint>;
template <typename T> void print(T x) { std::cout << x << '\n'; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// bool check_mm(bool mm){
// bool flag = ( 1<= mm && mm <= 12);
// return flag;
// }
signed main() {
int S;
cin >> S;
int head, tail;
tail = S % 100;
head = S / 100;
bool yymm = false;
bool mmyy = false;
if (1 <= tail && tail <= 12) {
yymm = true;
}
if (1 <= head && head <= 12) {
mmyy = true;
}
// print(head);
// print(tail);
// print(yymm);
// print(mmyy);
if (yymm & mmyy) {
print("AMBIGUOUS");
}
elif (yymm) { print("YYMM"); }
elif (mmyy) { print("MMYY"); }
else {
print("NA");
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 857,011 | 857,012 | u989274743 | cpp |
p03042 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int y1 = s / 100;
int y2 = s % 100;
if (y1 >= 1 && y1 <= 12) {
if (y2 >= 1 && y2 <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (y1 >= 1 && y1 <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
int y1 = s / 100;
int y2 = s % 100;
if (y1 >= 1 && y1 <= 12) {
if (y2 >= 1 && y2 <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (y2 >= 1 && y2 <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,013 | 857,014 | u682413606 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<char> vec(4);
for (ll i = 0; i < 4; i++) {
cin >> vec.at(i);
}
vector<ll> veco(2, 0);
if (vec.at(0) == '0') {
if (vec.at(1) != '0') {
veco.at(1) = 1;
}
}
if (vec.at(0) == '1') {
if (vec.at(1) == '0' || vec.at(1) == '1' || vec.at(1) == '2') {
veco.at(1) = 1;
}
}
if (vec.at(2) == '0') {
if (vec.at(3) != '0') {
veco.at(0) = 1;
}
}
if (vec.at(2) == '1') {
if (vec.at(3) == '0' || vec.at(3) == '1' || vec.at(3) == '2') {
veco.at(0) = 1;
}
}
vector<ll> yymm = {1, 0};
vector<ll> mmyy = {0, 1};
if (veco == yymm) {
cout << "YYMM" << endl;
} else if (veco == mmyy) {
cout << "MMYY" << endl;
} else if (veco.at(0) + veco.at(1) == 0) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<char> vec(4);
for (ll i = 0; i < 4; i++) {
cin >> vec.at(i);
}
vector<ll> veco(2, 0);
if (vec.at(0) == '0') {
if (vec.at(1) != '0') {
veco.at(1) = 1;
}
}
if (vec.at(0) == '1') {
if (vec.at(1) == '0' || vec.at(1) == '1' || vec.at(1) == '2') {
veco.at(1) = 1;
}
}
if (vec.at(2) == '0') {
if (vec.at(3) != '0') {
veco.at(0) = 1;
}
}
if (vec.at(2) == '1') {
if (vec.at(3) == '0' || vec.at(3) == '1' || vec.at(3) == '2') {
veco.at(0) = 1;
}
}
vector<ll> yymm = {1, 0};
vector<ll> mmyy = {0, 1};
if (veco == yymm) {
cout << "YYMM" << endl;
} else if (veco == mmyy) {
cout << "MMYY" << endl;
} else if (veco.at(0) + veco.at(1) == 2) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,017 | 857,018 | u883297128 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
int a;
cin >> a;
int c = a / 100, b = a % 100;
if (1 <= b && b <= 12) {
if (1 <= c && c <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= c && c <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
int a;
cin >> a;
int b = a / 100, c = a % 100;
if (1 <= b && b <= 12) {
if (1 <= c && c <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= c && c <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
}
| [
"variable_declaration.name.change",
"identifier.change"
] | 857,019 | 857,020 | u079532978 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
const ll mod = 1000000007;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n % 100 == 0 || n % 100 > 12) {
n /= 100;
if (n % 100 == 0 || n % 100 > 12)
cout << "NA";
else
cout << "MMYY";
} else {
n /= 100;
if (n % 100 == 0 || n % 100 > 12) {
cout << "YYMM";
} else
cout << "Ambiguous";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
typedef double db;
const ll mod = 1000000007;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n % 100 == 0 || n % 100 > 12) {
n /= 100;
if (n % 100 == 0 || n % 100 > 12)
cout << "NA";
else
cout << "MMYY";
} else {
n /= 100;
if (n % 100 == 0 || n % 100 > 12) {
cout << "YYMM";
} else
cout << "AMBIGUOUS";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 857,025 | 857,026 | u237593839 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, n, s;
cin >> S;
n = S % 100;
s = (S - n) / 100;
if (0 < n && n <= 12 && 0 < s && s <= 12)
cout << "AMBIGUOUS" << endl;
else if (0 < s && s <= 12)
cout << "MMYY" << endl;
else if (0 < n && s <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int S, n, s;
cin >> S;
n = S % 100;
s = (S - n) / 100;
if (0 < n && n <= 12 && 0 < s && s <= 12)
cout << "AMBIGUOUS" << endl;
else if (0 < s && s <= 12)
cout << "MMYY" << endl;
else if (0 < n && n <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,033 | 857,034 | u458713847 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(void) {
string S;
cin >> S;
bool YYMM = false, MMYY = false;
if (S[0] == '0' && S[1] != '0') {
MMYY = true;
} else if (S[0] == '1' && S[1] <= '2') {
MMYY = true;
}
if (S[2] == '0' && S[1] != '0') {
YYMM = true;
} else if (S[2] == '1' && S[3] <= '2') {
YYMM = true;
}
if (MMYY == true && YYMM == false) {
cout << "MMYY" << endl;
} else if (MMYY == false && YYMM == true) {
cout << "YYMM" << endl;
} else if (MMYY == true && YYMM == true) {
cout << "AMBIGUOUS" << endl;
} else if (MMYY == false && YYMM == false) {
cout << "NA" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(void) {
string S;
cin >> S;
bool YYMM = false, MMYY = false;
if (S[0] == '0' && S[1] != '0') {
MMYY = true;
} else if (S[0] == '1' && S[1] <= '2') {
MMYY = true;
}
if (S[2] == '0' && S[3] != '0') {
YYMM = true;
} else if (S[2] == '1' && S[3] <= '2') {
YYMM = true;
}
if (MMYY == true && YYMM == false) {
cout << "MMYY" << endl;
} else if (MMYY == false && YYMM == true) {
cout << "YYMM" << endl;
} else if (MMYY == true && YYMM == true) {
cout << "AMBIGUOUS" << endl;
} else if (MMYY == false && YYMM == false) {
cout << "NA" << endl;
}
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 857,035 | 857,036 | u114143339 | cpp |
p03042 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
string s;
int upper, downer;
bool um = false, dm = false;
cin >> s;
upper = stoi(s.substr(0, 2));
downer = stoi(s.substr(2, 2));
if (1 <= upper && upper <= 12)
um = true;
if (1 <= downer && downer <= 12)
dm = true;
if (um && dm) {
cout << "AMBIGIOUS" << endl;
} else if (um) {
cout << "MMYY" << endl;
} else if (dm) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
string s;
int upper, downer;
bool um = false, dm = false;
cin >> s;
upper = stoi(s.substr(0, 2));
downer = stoi(s.substr(2, 2));
if (1 <= upper && upper <= 12)
um = true;
if (1 <= downer && downer <= 12)
dm = true;
if (um && dm) {
cout << "AMBIGUOUS" << endl;
} else if (um) {
cout << "MMYY" << endl;
} else if (dm) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
| [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 857,039 | 857,040 | u262646906 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
#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++)
#define _GLIBCXX_DEBUG
int main() {
int s;
cin >> s;
int sf = s / 100;
int sr = s % 100;
if (0 < sf && 0 < sr && sf <= 12 && sr <= 12)
cout << "AMBIGUOUS" << endl;
else if ((sf > 12 || sf == 0) && (sr > 12 || sf == 0))
cout << "NA" << endl;
else if (0 < sf && sf <= 12 && (sr > 12 || sr == 0))
cout << "MMYY" << endl;
else if ((sf > 12 || sf == 00) && sr <= 12 && 0 < sr)
cout << "YYMM" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
#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++)
#define _GLIBCXX_DEBUG
int main() {
int s;
cin >> s;
int sf = s / 100;
int sr = s % 100;
if (0 < sf && 0 < sr && sf <= 12 && sr <= 12)
cout << "AMBIGUOUS" << endl;
else if ((sf > 12 || sf == 0) && (sr > 12 || sr == 0))
cout << "NA" << endl;
else if (0 < sf && sf <= 12 && (sr > 12 || sr == 0))
cout << "MMYY" << endl;
else if ((sf > 12 || sf == 00) && sr <= 12 && 0 < sr)
cout << "YYMM" << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,047 | 857,048 | u919867411 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, up, dw;
cin >> S;
up = S / 100;
dw = S % 100;
if (1 <= up && up <= 12) {
if (1 <= dw && dw <= 12)
cout << "AMBIGIOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= dw && dw <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int S, up, dw;
cin >> S;
up = S / 100;
dw = S % 100;
if (1 <= up && up <= 12) {
if (1 <= dw && dw <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= dw && dw <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
} | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 857,063 | 857,064 | u485673106 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define PI 3.1415926535
int main() {
string s;
cin >> s;
string ym = "YYMM", my = "MMYY", amb = "AMBIGOUS", na = "NA";
if ((s[0] == '0' && '1' <= s[1] && s[1] <= '9') ||
(s[0] == '1' && '0' <= s[1] && s[1] <= '2')) {
if ((s[2] == '0' && '1' <= s[3] && s[3] <= '9') ||
(s[2] == '1' && '0' <= s[3] && s[3] <= '2')) {
cout << amb << endl;
return 0;
}
}
if ((s[0] == '0' && '1' <= s[1] && s[1] <= '9') ||
(s[0] == '1' && '0' <= s[1] && s[1] <= '2')) {
cout << my << endl;
return 0;
}
if ((s[2] == '0' && '1' <= s[3] && s[3] <= '9') ||
(s[2] == '1' && '0' <= s[3] && s[3] <= '2')) {
cout << ym << endl;
return 0;
}
cout << na << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define PI 3.1415926535
int main() {
string s;
cin >> s;
string ym = "YYMM", my = "MMYY", amb = "AMBIGUOUS", na = "NA";
if ((s[0] == '0' && '1' <= s[1] && s[1] <= '9') ||
(s[0] == '1' && '0' <= s[1] && s[1] <= '2')) {
if ((s[2] == '0' && '1' <= s[3] && s[3] <= '9') ||
(s[2] == '1' && '0' <= s[3] && s[3] <= '2')) {
cout << amb << endl;
return 0;
}
}
if ((s[0] == '0' && '1' <= s[1] && s[1] <= '9') ||
(s[0] == '1' && '0' <= s[1] && s[1] <= '2')) {
cout << my << endl;
return 0;
}
if ((s[2] == '0' && '1' <= s[3] && s[3] <= '9') ||
(s[2] == '1' && '0' <= s[3] && s[3] <= '2')) {
cout << ym << endl;
return 0;
}
cout << na << endl;
}
| [
"literal.string.change",
"variable_declaration.value.change"
] | 857,065 | 857,066 | u475885263 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stringstream ss;
ss << s[0] << s[1];
string saki;
saki = ss.str();
// cout<<saki<<endl;
ss.str("");
ss << s[2] << s[3];
string ato;
ato = ss.str();
// cout<<ato<<endl;
bool hantei_saki_nen = true;
bool hantei_saki_tuki = false;
bool hantei_ato_nen = true;
bool hantei_ato_tuki = false;
bool YYMM = false;
bool MMYY = false;
// if(saki!="0")hantei_saki_nen=true;
if (saki == "01" || saki == "02" || saki == "03" || saki == "04" ||
saki == "05" || saki == "06" || saki == "07" || saki == "08" ||
saki == "09" || saki == "10" || saki == "11" || saki == "12")
hantei_saki_tuki = true;
// if(ato!="0")hantei_ato_nen=true;
if (ato == "01" || ato == "02" || ato == "03" || ato == "04" || ato == "05" ||
ato == "06" || ato == "07" || ato == "08" || ato == "09" || ato == "10" ||
ato == "11" || ato == "12")
hantei_ato_tuki = true;
if (hantei_saki_nen == true) {
if (hantei_ato_tuki == true) {
YYMM = true;
} else {
YYMM = false;
}
}
// cout<<hantei_saki_nen<<" "<<hantei_ato_tuki<<" "<<YYMM<<endl;
if (hantei_ato_nen == true) {
if (hantei_saki_tuki == true) {
MMYY = true;
} else {
MMYY = false;
}
}
// cout<<hantei_ato_nen<<" "<<hantei_saki_tuki<<" "<<MMYY<<endl;
if (YYMM == true && MMYY == true) {
cout << "AMBGUOUS" << endl;
} else if (YYMM == true && MMYY == false) {
cout << "YYMM" << endl;
} else if (YYMM == false && MMYY == true) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
stringstream ss;
ss << s[0] << s[1];
string saki;
saki = ss.str();
// cout<<saki<<endl;
ss.str("");
ss << s[2] << s[3];
string ato;
ato = ss.str();
// cout<<ato<<endl;
bool hantei_saki_nen = true;
bool hantei_saki_tuki = false;
bool hantei_ato_nen = true;
bool hantei_ato_tuki = false;
bool YYMM = false;
bool MMYY = false;
// if(saki!="0")hantei_saki_nen=true;
if (saki == "01" || saki == "02" || saki == "03" || saki == "04" ||
saki == "05" || saki == "06" || saki == "07" || saki == "08" ||
saki == "09" || saki == "10" || saki == "11" || saki == "12")
hantei_saki_tuki = true;
// if(ato!="0")hantei_ato_nen=true;
if (ato == "01" || ato == "02" || ato == "03" || ato == "04" || ato == "05" ||
ato == "06" || ato == "07" || ato == "08" || ato == "09" || ato == "10" ||
ato == "11" || ato == "12")
hantei_ato_tuki = true;
if (hantei_saki_nen == true) {
if (hantei_ato_tuki == true) {
YYMM = true;
} else {
YYMM = false;
}
}
// cout<<hantei_saki_nen<<" "<<hantei_ato_tuki<<" "<<YYMM<<endl;
if (hantei_ato_nen == true) {
if (hantei_saki_tuki == true) {
MMYY = true;
} else {
MMYY = false;
}
}
// cout<<hantei_ato_nen<<" "<<hantei_saki_tuki<<" "<<MMYY<<endl;
if (YYMM == true && MMYY == true) {
cout << "AMBIGUOUS" << endl;
} else if (YYMM == true && MMYY == false) {
cout << "YYMM" << endl;
} else if (YYMM == false && MMYY == true) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 857,071 | 857,072 | u406647332 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void white_cells() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H * W) - (h * W) - (H * w) + (h * w) << "\n";
}
void double_helix() {
char b;
cin >> b;
if (b == 'A')
cout << "T\n";
else if (b == 'T')
cout << "A\n";
else if (b == 'C')
cout << "G\n";
else
cout << "C\n";
}
void five_antennas() {
vector<int> a(5);
for (int i = 0; i < 5; ++i)
cin >> a[i];
int k;
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(\n";
return;
}
cout << "Yay!\n";
}
void buttons() {
int a, b;
cin >> a >> b;
int v_max = 0;
for (int i = 0; i < 2; ++i) {
if (a > b) {
v_max += a;
--a;
} else {
v_max += b;
--b;
}
}
cout << v_max << "\n";
}
void biscuit_generator() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << "\n";
}
void changing_a_character() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] += 32;
cout << s << "\n";
}
void ferris_wheel() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << "\n";
else if (a >= 6)
cout << b / 2 << "\n";
else
cout << 0 << "\n";
}
void apple_pie() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 2 << "\n";
}
void airplane() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
sort(a.begin(), a.end());
cout << a[0] + a[1] << "\n";
}
void rounding() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << "\n";
else
cout << 10 << "\n";
}
void can_you_solve_this() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
cin >> a[i][j];
int cnt = 0;
for (int i = 0; i < n; ++i) {
int point = 0;
for (int j = 0; j < m; ++j)
point += a[i][j] * b[j];
if (point > -c)
++cnt;
}
cout << cnt << "\n";
}
void ATCoder() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); ++i) {
int cnt = 0;
while (i < s.size() &&
(s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')) {
++cnt;
++i;
}
ans = max(ans, cnt);
}
cout << ans << "\n";
}
void five_dises() {
vector<int> v(5);
int r_max = 0;
int ans = 0;
for (int i = 0; i < 5; ++i) {
cin >> v[i];
if (v[i] % 10 != 0) {
r_max = max(r_max, 10 - v[i] % 10);
v[i] += 10 - (v[i] % 10);
}
ans += v[i];
}
ans -= r_max;
cout << ans << "\n";
}
void great_ocean_view() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int v_max = 0, cnt = 0;
for (int i = 0; i < n; ++i) {
if (h[i] >= v_max) {
v_max = h[i];
++cnt;
}
}
cout << cnt << "\n";
}
void resale() {
int n;
cin >> n;
vector<int> v(n), c(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (v[i] - c[i] > 0)
ans += v[i] - c[i];
}
cout << ans << "\n";
}
void yymm() {
string s;
cin >> s;
int left = stoi(s.substr(0, 2));
int right = stoi(s.substr(2, 2));
bool yymm = (1 <= right && right <= 12);
bool mmyy = (1 <= left && left <= 12);
if (yymm && mmyy)
cout << "AMBIGOUS\n";
else if (yymm)
cout << "YYMM\n";
else if (mmyy)
cout << "MMYY\n";
else
cout << "NA\n";
}
int main() {
// white_cells();
// double_helix();
// five_antennas();
// buttons();
// biscuit_generator();
// changing_a_character();
// ferris_wheel();
// apple_pie();
// airplane();
// rounding();
// can_you_solve_this();
// ATCoder();
// five_dises();
// great_ocean_view();
// resale();
yymm();
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void white_cells() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H * W) - (h * W) - (H * w) + (h * w) << "\n";
}
void double_helix() {
char b;
cin >> b;
if (b == 'A')
cout << "T\n";
else if (b == 'T')
cout << "A\n";
else if (b == 'C')
cout << "G\n";
else
cout << "C\n";
}
void five_antennas() {
vector<int> a(5);
for (int i = 0; i < 5; ++i)
cin >> a[i];
int k;
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(\n";
return;
}
cout << "Yay!\n";
}
void buttons() {
int a, b;
cin >> a >> b;
int v_max = 0;
for (int i = 0; i < 2; ++i) {
if (a > b) {
v_max += a;
--a;
} else {
v_max += b;
--b;
}
}
cout << v_max << "\n";
}
void biscuit_generator() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << "\n";
}
void changing_a_character() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] += 32;
cout << s << "\n";
}
void ferris_wheel() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << "\n";
else if (a >= 6)
cout << b / 2 << "\n";
else
cout << 0 << "\n";
}
void apple_pie() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 2 << "\n";
}
void airplane() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
sort(a.begin(), a.end());
cout << a[0] + a[1] << "\n";
}
void rounding() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << "\n";
else
cout << 10 << "\n";
}
void can_you_solve_this() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
cin >> a[i][j];
int cnt = 0;
for (int i = 0; i < n; ++i) {
int point = 0;
for (int j = 0; j < m; ++j)
point += a[i][j] * b[j];
if (point > -c)
++cnt;
}
cout << cnt << "\n";
}
void ATCoder() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); ++i) {
int cnt = 0;
while (i < s.size() &&
(s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')) {
++cnt;
++i;
}
ans = max(ans, cnt);
}
cout << ans << "\n";
}
void five_dises() {
vector<int> v(5);
int r_max = 0;
int ans = 0;
for (int i = 0; i < 5; ++i) {
cin >> v[i];
if (v[i] % 10 != 0) {
r_max = max(r_max, 10 - v[i] % 10);
v[i] += 10 - (v[i] % 10);
}
ans += v[i];
}
ans -= r_max;
cout << ans << "\n";
}
void great_ocean_view() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int v_max = 0, cnt = 0;
for (int i = 0; i < n; ++i) {
if (h[i] >= v_max) {
v_max = h[i];
++cnt;
}
}
cout << cnt << "\n";
}
void resale() {
int n;
cin >> n;
vector<int> v(n), c(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (v[i] - c[i] > 0)
ans += v[i] - c[i];
}
cout << ans << "\n";
}
void yymm() {
string s;
cin >> s;
int left = stoi(s.substr(0, 2));
int right = stoi(s.substr(2, 2));
bool yymm = (1 <= right && right <= 12);
bool mmyy = (1 <= left && left <= 12);
if (yymm && mmyy)
cout << "AMBIGUOUS\n";
else if (yymm)
cout << "YYMM\n";
else if (mmyy)
cout << "MMYY\n";
else
cout << "NA\n";
}
int main() {
// white_cells();
// double_helix();
// five_antennas();
// buttons();
// biscuit_generator();
// changing_a_character();
// ferris_wheel();
// apple_pie();
// airplane();
// rounding();
// can_you_solve_this();
// ATCoder();
// five_dises();
// great_ocean_view();
// resale();
yymm();
} | [
"literal.string.change",
"io.output.change"
] | 857,073 | 857,074 | u546641746 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void white_cells() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H * W) - (h * W) - (H * w) + (h * w) << "\n";
}
void double_helix() {
char b;
cin >> b;
if (b == 'A')
cout << "T\n";
else if (b == 'T')
cout << "A\n";
else if (b == 'C')
cout << "G\n";
else
cout << "C\n";
}
void five_antennas() {
vector<int> a(5);
for (int i = 0; i < 5; ++i)
cin >> a[i];
int k;
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(\n";
return;
}
cout << "Yay!\n";
}
void buttons() {
int a, b;
cin >> a >> b;
int v_max = 0;
for (int i = 0; i < 2; ++i) {
if (a > b) {
v_max += a;
--a;
} else {
v_max += b;
--b;
}
}
cout << v_max << "\n";
}
void biscuit_generator() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << "\n";
}
void changing_a_character() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] += 32;
cout << s << "\n";
}
void ferris_wheel() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << "\n";
else if (a >= 6)
cout << b / 2 << "\n";
else
cout << 0 << "\n";
}
void apple_pie() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 2 << "\n";
}
void airplane() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
sort(a.begin(), a.end());
cout << a[0] + a[1] << "\n";
}
void rounding() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << "\n";
else
cout << 10 << "\n";
}
void can_you_solve_this() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
cin >> a[i][j];
int cnt = 0;
for (int i = 0; i < n; ++i) {
int point = 0;
for (int j = 0; j < m; ++j)
point += a[i][j] * b[j];
if (point > -c)
++cnt;
}
cout << cnt << "\n";
}
void ATCoder() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); ++i) {
int cnt = 0;
while (i < s.size() &&
(s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')) {
++cnt;
++i;
}
ans = max(ans, cnt);
}
cout << ans << "\n";
}
void five_dises() {
vector<int> v(5);
int r_max = 0;
int ans = 0;
for (int i = 0; i < 5; ++i) {
cin >> v[i];
if (v[i] % 10 != 0) {
r_max = max(r_max, 10 - v[i] % 10);
v[i] += 10 - (v[i] % 10);
}
ans += v[i];
}
ans -= r_max;
cout << ans << "\n";
}
void great_ocean_view() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int v_max = 0, cnt = 0;
for (int i = 0; i < n; ++i) {
if (h[i] >= v_max) {
v_max = h[i];
++cnt;
}
}
cout << cnt << "\n";
}
void resale() {
int n;
cin >> n;
vector<int> v(n), c(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (v[i] - c[i] > 0)
ans += v[i] - c[i];
}
cout << ans << "\n";
}
void yymm() {
string s;
cin >> s;
int left = stoi(s.substr(0, 2));
int right = stoi(s.substr(2, 2));
bool yymm = (1 <= right && right <= 12);
bool mmyy = (1 <= left && left <= 12);
if (yymm && mmyy)
cout << "AMBIGIOUS\n";
else if (yymm)
cout << "YYMM\n";
else if (mmyy)
cout << "MMYY\n";
else
cout << "NA\n";
}
int main() {
// white_cells();
// double_helix();
// five_antennas();
// buttons();
// biscuit_generator();
// changing_a_character();
// ferris_wheel();
// apple_pie();
// airplane();
// rounding();
// can_you_solve_this();
// ATCoder();
// five_dises();
// great_ocean_view();
// resale();
yymm();
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void white_cells() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H * W) - (h * W) - (H * w) + (h * w) << "\n";
}
void double_helix() {
char b;
cin >> b;
if (b == 'A')
cout << "T\n";
else if (b == 'T')
cout << "A\n";
else if (b == 'C')
cout << "G\n";
else
cout << "C\n";
}
void five_antennas() {
vector<int> a(5);
for (int i = 0; i < 5; ++i)
cin >> a[i];
int k;
cin >> k;
if (a[4] - a[0] > k) {
cout << ":(\n";
return;
}
cout << "Yay!\n";
}
void buttons() {
int a, b;
cin >> a >> b;
int v_max = 0;
for (int i = 0; i < 2; ++i) {
if (a > b) {
v_max += a;
--a;
} else {
v_max += b;
--b;
}
}
cout << v_max << "\n";
}
void biscuit_generator() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << "\n";
}
void changing_a_character() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s[k - 1] += 32;
cout << s << "\n";
}
void ferris_wheel() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << "\n";
else if (a >= 6)
cout << b / 2 << "\n";
else
cout << 0 << "\n";
}
void apple_pie() {
int a, p;
cin >> a >> p;
p += 3 * a;
cout << p / 2 << "\n";
}
void airplane() {
vector<int> a(3);
for (int i = 0; i < 3; ++i)
cin >> a[i];
sort(a.begin(), a.end());
cout << a[0] + a[1] << "\n";
}
void rounding() {
int x, a;
cin >> x >> a;
if (x < a)
cout << 0 << "\n";
else
cout << 10 << "\n";
}
void can_you_solve_this() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; ++i)
cin >> b[i];
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
cin >> a[i][j];
int cnt = 0;
for (int i = 0; i < n; ++i) {
int point = 0;
for (int j = 0; j < m; ++j)
point += a[i][j] * b[j];
if (point > -c)
++cnt;
}
cout << cnt << "\n";
}
void ATCoder() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); ++i) {
int cnt = 0;
while (i < s.size() &&
(s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')) {
++cnt;
++i;
}
ans = max(ans, cnt);
}
cout << ans << "\n";
}
void five_dises() {
vector<int> v(5);
int r_max = 0;
int ans = 0;
for (int i = 0; i < 5; ++i) {
cin >> v[i];
if (v[i] % 10 != 0) {
r_max = max(r_max, 10 - v[i] % 10);
v[i] += 10 - (v[i] % 10);
}
ans += v[i];
}
ans -= r_max;
cout << ans << "\n";
}
void great_ocean_view() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int v_max = 0, cnt = 0;
for (int i = 0; i < n; ++i) {
if (h[i] >= v_max) {
v_max = h[i];
++cnt;
}
}
cout << cnt << "\n";
}
void resale() {
int n;
cin >> n;
vector<int> v(n), c(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
if (v[i] - c[i] > 0)
ans += v[i] - c[i];
}
cout << ans << "\n";
}
void yymm() {
string s;
cin >> s;
int left = stoi(s.substr(0, 2));
int right = stoi(s.substr(2, 2));
bool yymm = (1 <= right && right <= 12);
bool mmyy = (1 <= left && left <= 12);
if (yymm && mmyy)
cout << "AMBIGUOUS\n";
else if (yymm)
cout << "YYMM\n";
else if (mmyy)
cout << "MMYY\n";
else
cout << "NA\n";
}
int main() {
// white_cells();
// double_helix();
// five_antennas();
// buttons();
// biscuit_generator();
// changing_a_character();
// ferris_wheel();
// apple_pie();
// airplane();
// rounding();
// can_you_solve_this();
// ATCoder();
// five_dises();
// great_ocean_view();
// resale();
yymm();
} | [
"literal.string.change",
"io.output.change"
] | 857,075 | 857,074 | u546641746 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
bool isM(int n) { return n >= 1 && n <= 12; }
int main() {
int n;
cin >> n;
int a, b;
a = n / 100, b = n % 100;
if (isM(a)) {
if (isM(b))
cout << "AMBIGOUS";
else
cout << "MMYY";
} else {
if (isM(b))
cout << "YYMM";
else
cout << "NA";
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
bool isM(int n) { return n >= 1 && n <= 12; }
int main() {
int n;
cin >> n;
int a, b;
a = n / 100, b = n % 100;
if (isM(a)) {
if (isM(b))
cout << "AMBIGUOUS";
else
cout << "MMYY";
} else {
if (isM(b))
cout << "YYMM";
else
cout << "NA";
}
cout << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 857,078 | 857,079 | u154898295 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) \
fill((ll *)n, (ll *)(n + first_dimension_size), value)
#define FILL(n, first_dimension_size, value) \
fill((int *)n, (int *)(n + first_dimension_size), value)
#define INF (1 << 29)
#define MOD 1000000007
// int dx[4] = {1,0,0,-1};
// int dy[4] = {0,1,-1,0};
int main() {
string s;
cin >> s;
int ff = (s[0] - '0') * 10 + s[1] - '0';
int bb = (s[2] - '0') * 10 + s[3] - '0';
if (ff > 0 && ff <= 12 && bb > 0 && bb <= 12) {
cout << "AMBIGUOUS" << endl;
} else if ((ff < 1 || ff > 12) && bb > 1 && bb <= 12) {
cout << "YYMM" << endl;
} else if ((bb < 1 || bb > 12) && ff > 1 && ff <= 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) \
fill((ll *)n, (ll *)(n + first_dimension_size), value)
#define FILL(n, first_dimension_size, value) \
fill((int *)n, (int *)(n + first_dimension_size), value)
#define INF (1 << 29)
#define MOD 1000000007
// int dx[4] = {1,0,0,-1};
// int dy[4] = {0,1,-1,0};
int main() {
string s;
cin >> s;
int ff = (s[0] - '0') * 10 + s[1] - '0';
int bb = (s[2] - '0') * 10 + s[3] - '0';
if (ff > 0 && ff <= 12 && bb > 0 && bb <= 12) {
cout << "AMBIGUOUS" << endl;
} else if ((ff < 1 || ff > 12) && bb > 0 && bb <= 12) {
cout << "YYMM" << endl;
} else if ((bb < 1 || bb > 12) && ff > 0 && ff <= 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,080 | 857,081 | u204536668 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int s1 = stoi(s.substr(1, 2));
int s2 = stoi(s.substr(3, 2));
string k;
if (s1 > 0 && s1 < 13) {
if (s2 > 0 && s2 < 13) {
k = "AMBIGUOUS";
} else {
k = "MMYY";
}
} else {
if (s2 > 0 && s2 < 13) {
k = "YYMM";
} else {
k = "NA";
}
}
cout << k << endl;
return 0;
}
// YYMM, MMYY, AMBIGUOUS, NA | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int s1 = stoi(s.substr(0, 2));
int s2 = stoi(s.substr(2, 2));
string k;
if (s1 > 0 && s1 < 13) {
if (s2 > 0 && s2 < 13) {
k = "AMBIGUOUS";
} else {
k = "MMYY";
}
} else {
if (s2 > 0 && s2 < 13) {
k = "YYMM";
} else {
k = "NA";
}
}
cout << k << endl;
return 0;
}
// YYMM, MMYY, AMBIGUOUS, NA | [
"literal.number.change",
"call.arguments.change"
] | 857,090 | 857,091 | u323864528 | cpp |
p03042 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
// srandom((unsigned long)time(NULL));
int s;
cin >> s;
int a, b;
a = s / 100;
b = s % 100;
// 00-99 1
// 01-12 2
int x = 0;
int y = 0;
if (a == 0 || a > 12)
x = 1;
if (b == 0 || b > 12)
y = 1;
if (x == 1 && y == 1)
cout << "AMBIGUOUS" << endl;
else if (x == 1 && y == 0)
cout << "YYMM" << endl;
else if (x == 0 && y == 1)
cout << "MMYY" << endl;
else
cout << "NA" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
// srandom((unsigned long)time(NULL));
int s;
cin >> s;
int a, b;
a = s / 100;
b = s % 100;
// 00-99 1
// 01-12 2
int x = 0;
int y = 0;
if (a == 0 || a > 12)
x = 1;
if (b == 0 || b > 12)
y = 1;
if (x == 1 && y == 1)
cout << "NA" << endl;
else if (x == 1 && y == 0)
cout << "YYMM" << endl;
else if (x == 0 && y == 1)
cout << "MMYY" << endl;
else
cout << "AMBIGUOUS" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 857,099 | 857,100 | u036401720 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (1 <= l and l <= 12) {
if (r <= 1 and r <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= r and r <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int s;
cin >> s;
int l = s / 100;
int r = s % 100;
if (1 <= l and l <= 12) {
if (1 <= r and r <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else {
if (1 <= r and r <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 857,113 | 857,114 | u709373021 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int nums = stoi(s);
int p = nums / 100;
int q = nums % 100;
if (1 <= p && p <= 12 && 1 <= q && q <= 12) {
cout << "AMBIGIOUS" << endl;
} else if (1 <= q && q <= 12) {
cout << "YYMM" << endl;
} else if (1 <= p && p <= 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int nums = stoi(s);
int p = nums / 100;
int q = nums % 100;
if (1 <= p && p <= 12 && 1 <= q && q <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= q && q <= 12) {
cout << "YYMM" << endl;
} else if (1 <= p && p <= 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
return 0;
} | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 857,119 | 857,120 | u550374978 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s, t, u;
cin >> s;
t = s % 100;
u = s / 100;
u = u % 100;
if (t > 0 && t < 12) {
if (u > 0 && u < 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "YYMM" << endl;
}
} else if (u > 0 && u < 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s, t, u;
cin >> s;
t = s % 100;
u = s / 100;
u = u % 100;
if (t > 0 && t <= 12) {
if (u > 0 && u <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "YYMM" << endl;
}
} else if (u > 0 && u <= 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 857,127 | 857,128 | u564755644 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l = n / 100;
int r = n % 100;
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12)
cout << "AMBIGUOUS";
else
cout << "MMYY";
} else {
if (1 <= r && r <= 12)
cout << "YYMM";
else
"NA";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l = n / 100;
int r = n % 100;
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12)
cout << "AMBIGUOUS";
else
cout << "MMYY";
} else {
if (1 <= r && r <= 12)
cout << "YYMM";
else
cout << "NA";
}
}
| [
"io.output.change"
] | 857,129 | 857,130 | u933936078 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S, ans;
cin >> S;
int l, d;
l = (S[0] - '0') * 10 + (S[1] - '0');
d = (S[2] - '0') * 10 + (S[3] - '0');
if (l >= 1 && l <= 12) {
if (d >= 1 && d <= 12)
ans = "AMBIGUOUS";
else
ans = "YYMM";
} else {
if (d >= 1 && d <= 12)
ans = "MMYY";
else
ans = "NA";
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S, ans;
cin >> S;
int l, d;
l = (S[0] - '0') * 10 + (S[1] - '0');
d = (S[2] - '0') * 10 + (S[3] - '0');
if (l >= 1 && l <= 12) {
if (d >= 1 && d <= 12)
ans = "AMBIGUOUS";
else
ans = "MMYY";
} else {
if (d >= 1 && d <= 12)
ans = "YYMM";
else
ans = "NA";
}
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change"
] | 857,131 | 857,132 | u143222136 | cpp |
p03042 | #include <stdio.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef LOCAL
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll S;
cin >> S;
ll head = S / 100;
ll tail = S - (S / 100) * 100;
bool head_checker = false;
bool tail_checker = false;
if (head > 12 || head == 0) {
head_checker = true;
if (tail > 12 || tail == 0) {
tail_checker = true;
}
}
debug(head, tail);
if (head_checker && tail_checker) {
cout << "NA" << endl;
} else if (head_checker) {
cout << "YYMM" << endl;
} else if (tail_checker) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
return 0;
}
| #include <stdio.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef LOCAL
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll S;
cin >> S;
ll head = S / 100;
ll tail = S - (S / 100) * 100;
bool head_checker = false;
bool tail_checker = false;
if (head > 12 || head == 0) {
head_checker = true;
}
if (tail > 12 || tail == 0) {
tail_checker = true;
}
debug(head, tail);
if (head_checker && tail_checker) {
cout << "NA" << endl;
} else if (head_checker) {
cout << "YYMM" << endl;
} else if (tail_checker) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
return 0;
}
| [] | 857,137 | 857,138 | u422886513 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
inline void fileio(const char *in, const char *out) {
freopen(in, "r", stdin);
freopen(out, "w", stdout);
}
#define TD typedef
#define forx(i, n) for (int i = 0; i < (n); ++i)
#define forxr(i, n) for (int i = (n)-1; i >= 0; --i)
TD long long ll;
TD long double ld;
TD pair<int, int> pii;
TD pair<ll, ll> pll;
TD vector<int> VI;
TD vector<bool> VB;
TD vector<ll> VL;
const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const ld EPS = 1e-9, PI = acos(-1);
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
int get() {
char t, o;
cin >> t >> o;
return (t - '0') * 10 + o - '0';
}
string ans[2][2] = {{"NA", "YYMM"}, {"MMYY", "AMBIGUOUS"}};
int main() {
atexit([]() { cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << nl; });
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
// Emily <3
int a = get();
int b = get();
a = a && a <= 12;
b = a && b <= 12;
cout << ans[a][b] << nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
inline void fileio(const char *in, const char *out) {
freopen(in, "r", stdin);
freopen(out, "w", stdout);
}
#define TD typedef
#define forx(i, n) for (int i = 0; i < (n); ++i)
#define forxr(i, n) for (int i = (n)-1; i >= 0; --i)
TD long long ll;
TD long double ld;
TD pair<int, int> pii;
TD pair<ll, ll> pll;
TD vector<int> VI;
TD vector<bool> VB;
TD vector<ll> VL;
const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const ld EPS = 1e-9, PI = acos(-1);
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
int get() {
char t, o;
cin >> t >> o;
return (t - '0') * 10 + o - '0';
}
string ans[2][2] = {{"NA", "YYMM"}, {"MMYY", "AMBIGUOUS"}};
int main() {
atexit([]() { cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << nl; });
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
// Emily <3
int a = get();
int b = get();
a = a && a <= 12;
b = b && b <= 12;
cout << ans[a][b] << nl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 857,141 | 857,142 | u856481043 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
inline void fileio(const char *in, const char *out) {
freopen(in, "r", stdin);
freopen(out, "w", stdout);
}
#define TD typedef
#define forx(i, n) for (int i = 0; i < (n); ++i)
#define forxr(i, n) for (int i = (n)-1; i >= 0; --i)
TD long long ll;
TD long double ld;
TD pair<int, int> pii;
TD pair<ll, ll> pll;
TD vector<int> VI;
TD vector<bool> VB;
TD vector<ll> VL;
const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const ld EPS = 1e-9, PI = acos(-1);
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
int get() {
char t, o;
cin >> t >> o;
return (t - '0') * 10 + o - '0';
}
string ans[2][2] = {{"NA", "YYMM"}, {"MMYY", "AMBIGUOUS"}};
int main() {
atexit([]() { cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << nl; });
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
// Emily <3
int a = get();
int b = get();
a = a <= 12;
b = b <= 12;
cout << ans[a][b] << nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
inline void fileio(const char *in, const char *out) {
freopen(in, "r", stdin);
freopen(out, "w", stdout);
}
#define TD typedef
#define forx(i, n) for (int i = 0; i < (n); ++i)
#define forxr(i, n) for (int i = (n)-1; i >= 0; --i)
TD long long ll;
TD long double ld;
TD pair<int, int> pii;
TD pair<ll, ll> pll;
TD vector<int> VI;
TD vector<bool> VB;
TD vector<ll> VL;
const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const ld EPS = 1e-9, PI = acos(-1);
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
int get() {
char t, o;
cin >> t >> o;
return (t - '0') * 10 + o - '0';
}
string ans[2][2] = {{"NA", "YYMM"}, {"MMYY", "AMBIGUOUS"}};
int main() {
atexit([]() { cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << nl; });
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
// Emily <3
int a = get();
int b = get();
a = a && a <= 12;
b = b && b <= 12;
cout << ans[a][b] << nl;
return 0;
}
| [
"assignment.change"
] | 857,143 | 857,142 | u856481043 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int back_num = (S[2] - '0') * 10 + (S[3] - '0');
int front_num = (S[0] - '0') * 10 + (S[1] - '0');
bool isYYMM = false, isMMYY = false;
if (0 < front_num && front_num < 13) {
isMMYY = true;
if (0 < back_num && back_num < 13) {
isYYMM = true;
}
}
if (0 < back_num && back_num < 13) {
isYYMM = true;
}
if (isYYMM = true && isMMYY == true)
cout << "AMBIGUOUS" << endl;
else if (isYYMM = true && isMMYY == false)
cout << "YYMM" << endl;
else if (isYYMM = false && isMMYY == true)
cout << "MMYY" << endl;
else
cout << "NA" << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int back_num = (S[2] - '0') * 10 + (S[3] - '0');
int front_num = (S[0] - '0') * 10 + (S[1] - '0');
bool isYYMM = false, isMMYY = false;
if (0 < front_num && front_num < 13) {
isMMYY = true;
if (0 < back_num && back_num < 13) {
isYYMM = true;
}
}
if (0 < back_num && back_num < 13) {
isYYMM = true;
}
if (isYYMM == true && isMMYY == true)
cout << "AMBIGUOUS" << endl;
else if (isYYMM == true && isMMYY == false)
cout << "YYMM" << endl;
else if (isYYMM == false && isMMYY == true)
cout << "MMYY" << endl;
else
cout << "NA" << endl;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 857,144 | 857,145 | u323542775 | cpp |
p03042 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.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++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vpii = vector<pair<int, int>>;
using vivi = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int mod = 10000007;
const int inf = 1001001001;
int main(void) {
string s;
cin >> s;
string a = s.substr(0, 2);
string b = s.substr(2, 2);
int p = stoi(a);
int q = stoi(b);
if (p > 0 && p < 13 && q > 0 && p < 13)
cout << "AMBIGUOUS" << endl;
else if (p > 0 && p < 13)
cout << "MMYY" << endl;
else if (q > 0 && q < 13)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.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++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vpii = vector<pair<int, int>>;
using vivi = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int mod = 10000007;
const int inf = 1001001001;
int main(void) {
string s;
cin >> s;
string a = s.substr(0, 2);
string b = s.substr(2, 2);
int p = stoi(a);
int q = stoi(b);
if (p > 0 && p < 13 && q > 0 && q < 13)
cout << "AMBIGUOUS" << endl;
else if (p > 0 && p < 13)
cout << "MMYY" << endl;
else if (q > 0 && q < 13)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,150 | 857,151 | u751409274 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in();
int A = N % 100;
int B = (N - A) / 100;
bool ao = 0, bo = 0;
if (1 <= A && A <= 12)
ao = 1;
if (1 <= B && B <= 12)
bo = 1;
if (ao && bo) {
cout << "AMBIGUOUS"
<< "\n";
} else if (ao && bo != 1) {
cout << "YYMM"
<< "\n";
} else if (ao != 1 && bo) {
cout << "MMYY"
<< "\n";
} else {
cout << "NA" << bo << ao << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in();
int A = N % 100;
int B = (N - A) / 100;
bool ao = 0, bo = 0;
if (1 <= A && A <= 12)
ao = 1;
if (1 <= B && B <= 12)
bo = 1;
if (ao && bo) {
cout << "AMBIGUOUS"
<< "\n";
} else if (ao && bo != 1) {
cout << "YYMM"
<< "\n";
} else if (ao != 1 && bo) {
cout << "MMYY"
<< "\n";
} else {
cout << "NA"
<< "\n";
}
} | [
"expression.operation.binary.remove"
] | 857,160 | 857,161 | u017078415 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in();
int A = N % 100;
int B = (N - A) / 100;
bool ao = 0, bo = 0;
if (1 <= A && A <= 12)
ao = 1;
if (1 <= B && B <= 12)
bo = 1;
if (ao && bo) {
cout << "AMBIGUOUS"
<< "\n";
} else if (ao && bo != 1) {
cout << "YYMM"
<< "\n";
} else if (ao != 0 && bo) {
cout << "MMYY"
<< "\n";
} else {
cout << "NA"
<< "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N = in();
int A = N % 100;
int B = (N - A) / 100;
bool ao = 0, bo = 0;
if (1 <= A && A <= 12)
ao = 1;
if (1 <= B && B <= 12)
bo = 1;
if (ao && bo) {
cout << "AMBIGUOUS"
<< "\n";
} else if (ao && bo != 1) {
cout << "YYMM"
<< "\n";
} else if (ao != 1 && bo) {
cout << "MMYY"
<< "\n";
} else {
cout << "NA"
<< "\n";
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,162 | 857,161 | u017078415 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int x = (s[2] - '0') * 10 + s[3] - '0';
int y = (s[0] - '0') * 10 + s[1] - '0';
bool invx = false, invy = false;
if (!x || x > 12)
invx = true;
if (!y || y > 12)
invy = true;
if (invx && invy) {
cout << "NA\n";
} else {
if (!invx && !invy) {
cout << "AMBIGIOUS\n";
} else {
if (invx) {
cout << "MMYY\n";
} else {
cout << "YYMM\n";
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int x = (s[2] - '0') * 10 + s[3] - '0';
int y = (s[0] - '0') * 10 + s[1] - '0';
bool invx = false, invy = false;
if (!x || x > 12)
invx = true;
if (!y || y > 12)
invy = true;
if (invx && invy) {
cout << "NA\n";
} else {
if (!invx && !invy) {
cout << "AMBIGUOUS\n";
} else {
if (invx) {
cout << "MMYY\n";
} else {
cout << "YYMM\n";
}
}
}
}
| [
"literal.string.change",
"io.output.change"
] | 857,163 | 857,164 | u630713695 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define R cin >>
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout << (p) << endl;
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void co(T e) { cout << e << "\n"; }
template <typename T> void co(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << "\n";
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) {
if (k > n)
return 0;
return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
int main() {
string s;
R s;
int a = stoi(s.substr(0, 2));
int b = stoi(s.substr(2, 2));
bool f1 = (1 <= a && a <= 12);
bool f2 = (1 <= a && a <= 12);
if (f1 && f2)
co("AMBIGUOUS");
else if (f1)
co("MMYY");
else if (f2)
co("YYMM");
else
co("NA");
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define R cin >>
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout << (p) << endl;
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void co(T e) { cout << e << "\n"; }
template <typename T> void co(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << "\n";
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) {
if (k > n)
return 0;
return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
int main() {
string s;
R s;
int a = stoi(s.substr(0, 2));
int b = stoi(s.substr(2, 2));
bool f1 = (1 <= a && a <= 12);
bool f2 = (1 <= b && b <= 12);
if (f1 && f2)
co("AMBIGUOUS");
else if (f1)
co("MMYY");
else if (f2)
co("YYMM");
else
co("NA");
} | [
"identifier.change",
"expression.operation.binary.change"
] | 857,167 | 857,168 | u499381410 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string a = s.substr(0, 2), b = s.substr(2, 2);
if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) > 0 && stoi(b) < 13)
cout << "AMBIGOUS";
else if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) >= 0 && stoi(b) < 100)
cout << "MMYY";
else if (stoi(b) > 0 && stoi(b) < 13 && stoi(a) >= 0 && stoi(a) < 100)
cout << "YYMM";
else
cout << "NA";
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string a = s.substr(0, 2), b = s.substr(2, 2);
if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) > 0 && stoi(b) < 13)
cout << "AMBIGUOUS";
else if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) >= 0 && stoi(b) < 100)
cout << "MMYY";
else if (stoi(b) > 0 && stoi(b) < 13 && stoi(a) >= 0 && stoi(a) < 100)
cout << "YYMM";
else
cout << "NA";
}
| [
"literal.string.change",
"io.output.change"
] | 857,173 | 857,174 | u724012411 | cpp |
p03042 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string a = s.substr(0, 2), b = s.substr(2, 2);
if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) >= 0 && stoi(b) < 100)
cout << "AMBIGOUS";
else if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) >= 0 && stoi(b) < 100)
cout << "MMYY";
else if (stoi(b) > 0 && stoi(b) < 13 && stoi(a) >= 0 && stoi(a) < 100)
cout << "YYMM";
else
cout << "NA";
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string a = s.substr(0, 2), b = s.substr(2, 2);
if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) > 0 && stoi(b) < 13)
cout << "AMBIGUOUS";
else if (stoi(a) > 0 && stoi(a) < 13 && stoi(b) >= 0 && stoi(b) < 100)
cout << "MMYY";
else if (stoi(b) > 0 && stoi(b) < 13 && stoi(a) >= 0 && stoi(a) < 100)
cout << "YYMM";
else
cout << "NA";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"literal.string.change",
"io.output.change"
] | 857,175 | 857,174 | u724012411 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
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 << "YYMM" << endl;
} else {
if (b >= 1 && b <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
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 << "YYMM" << endl;
} else {
if (b >= 1 && b <= 12)
cout << "MMYY" << endl;
else
cout << "NA" << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 857,177 | 857,178 | u356754940 | cpp |
p03042 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 >= 13 || a == 0) && 0 < b && b < 12)
cout << "YYMM" << endl;
else if (0 < a && a < 12 && (b >= 13 || b == 0))
cout << "MMYY" << endl;
else if ((a >= 13 || a == 0) && (b >= 13 || b == 0))
cout << "NA" << endl;
else
cout << "AMBIGUOUS" << endl;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 >= 13 || a == 0) && 0 < b && b <= 12)
cout << "YYMM" << endl;
else if (0 < a && a <= 12 && (b >= 13 || b == 0))
cout << "MMYY" << endl;
else if ((a >= 13 || a == 0) && (b >= 13 || b == 0))
cout << "NA" << endl;
else
cout << "AMBIGUOUS" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 857,184 | 857,185 | u138273120 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool can1 = false, can2 = false;
if (S[0] == '0' ||
(S[0] == '1' && (S[1] == '2' || S[1] == '1' || S[1] == '0'))) {
can1 = true;
if (S[0] == '0' && S[1] == '0') {
can1 = false;
}
} else if (S[2] == '0' ||
(S[2] == '1' && (S[3] == '2' || S[3] == '1' || S[3] == '0'))) {
can2 = true;
if (S[2] == '0' && S[3] == '0') {
can2 = false;
}
}
if (can1 && can2) {
cout << "AMBIGUOUS";
} else if (!can1 && !can2) {
cout << "NA";
} else if (can1 && !can2) {
cout << "MMYY";
} else if (!can1 && can2) {
cout << "YYMM";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool can1 = false, can2 = false;
if (S[0] == '0' ||
(S[0] == '1' && (S[1] == '2' || S[1] == '1' || S[1] == '0'))) {
can1 = true;
if (S[0] == '0' && S[1] == '0') {
can1 = false;
}
}
if (S[2] == '0' ||
(S[2] == '1' && (S[3] == '2' || S[3] == '1' || S[3] == '0'))) {
can2 = true;
if (S[2] == '0' && S[3] == '0') {
can2 = false;
}
}
if (can1 && can2) {
cout << "AMBIGUOUS";
} else if (!can1 && !can2) {
cout << "NA";
} else if (can1 && !can2) {
cout << "MMYY";
} else if (!can1 && can2) {
cout << "YYMM";
}
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 857,186 | 857,187 | u231455327 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int p = S / 100;
int q = S % 100;
if (1 <= p && p <= 12) {
if (1 <= q && q <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "YYMM" << endl;
} else if (1 <= q && q <= 12)
cout << "MMYY" << endl;
else
cout << "NA" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int p = S / 100;
int q = S % 100;
if (1 <= p && p <= 12) {
if (1 <= q && q <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else if (1 <= q && q <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 857,191 | 857,192 | u981759938 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int p = S / 100;
int q = S % 100;
if (1 <= p && p <= 12) {
if (1 <= q && q <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "YYMM" << endl;
} else if (1 <= q && q <= 12)
cout << "MMYY" << endl;
cout << "NA" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int p = S / 100;
int q = S % 100;
if (1 <= p && p <= 12) {
if (1 <= q && q <= 12)
cout << "AMBIGUOUS" << endl;
else
cout << "MMYY" << endl;
} else if (1 <= q && q <= 12)
cout << "YYMM" << endl;
else
cout << "NA" << endl;
} | [
"literal.string.change",
"io.output.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 857,193 | 857,192 | u981759938 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int l = a / 100, r = a % 100;
bool ym = true, my = true;
if (l > 12 || l >= 0)
my = false;
if (r > 12 || r >= 0)
ym = false;
string ans;
if (ym && my)
ans = "AMBIGUOUS";
if (ym && !my)
ans = "YYMM";
if (!ym && my)
ans = "MMYY";
if (!my && !ym)
ans = "NA";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int l = a / 100, r = a % 100;
bool ym = true, my = true;
if (l > 12 || l <= 0)
my = false;
if (r > 12 || r <= 0)
ym = false;
string ans;
if (ym && my)
ans = "AMBIGUOUS";
if (ym && !my)
ans = "YYMM";
if (!ym && my)
ans = "MMYY";
if (!my && !ym)
ans = "NA";
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 857,196 | 857,197 | u217508499 | cpp |
p03042 | // include
//------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fore(i, a) for (auto &i : a)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
LL lcm(LL a, LL b) {
LL g = gcd(a, b);
return a / g * b;
}
int main() {
int A;
cin >> A;
int L = A / 100;
int R = A % 100;
if (L >= 1 && L <= 1) {
if (R >= 1 && R <= 12) {
cout << "AMBIGUOUS";
} else {
cout << "MMYY";
}
} else {
if (R >= 1 && R <= 12) {
cout << "YYMM";
} else {
cout << "NA";
}
}
} | // include
//------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fore(i, a) for (auto &i : a)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
LL lcm(LL a, LL b) {
LL g = gcd(a, b);
return a / g * b;
}
int main() {
int A;
cin >> A;
int L = A / 100;
int R = A % 100;
if (L >= 1 && L <= 12) {
if (R >= 1 && R <= 12) {
cout << "AMBIGUOUS";
} else {
cout << "MMYY";
}
} else {
if (R >= 1 && R <= 12) {
cout << "YYMM";
} else {
cout << "NA";
}
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 857,199 | 857,200 | u266763028 | cpp |
p03042 | #include <iostream>
using namespace std;
int main() {
string ans;
int a, f, s;
cin >> a;
f = a / 100;
s = a % 100;
if (f <= 12) {
if (f == 0 && 0 < s && s <= 12)
ans = "YYMM";
if (0 < f)
ans = "MMYY";
if (0 < f && 0 < s && s <= 12)
ans = "AMBIGuOUS";
} else if (12 < f) {
if (0 < s && s <= 12)
ans = "YYMM";
if (12 < s || s == 0)
ans = "NA";
}
if ((s == 0 && f == 0) || (s > 12 && f > 12))
ans = "NA";
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
string ans;
int a, f, s;
cin >> a;
f = a / 100;
s = a % 100;
if (f <= 12) {
if (f == 0 && 0 < s && s <= 12)
ans = "YYMM";
if (0 < f)
ans = "MMYY";
if (0 < f && 0 < s && s <= 12)
ans = "AMBIGUOUS";
} else if (12 < f) {
if (0 < s && s <= 12)
ans = "YYMM";
if (12 < s || s == 0)
ans = "NA";
}
if ((s == 0 && f == 0) || (s > 12 && f > 12))
ans = "NA";
cout << ans << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 857,208 | 857,209 | u141567616 | cpp |
p03042 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
string s;
cin >> s;
string substr1 = s.substr(0, 2);
string substr2 = s.substr(2, 2);
if ((stoi(substr1) >= 01 && stoi(substr1) <= 12) &&
(stoi(substr2) >= 01 && stoi(substr2) <= 12))
print("AMBIGUOUS");
else if (stoi(substr1) >= 01 && stoi(substr1) <= 12)
print("YYMM");
else if (stoi(substr2) >= 01 && stoi(substr2) <= 12)
print("MMYY");
else
print("NA");
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
string s;
cin >> s;
string substr1 = s.substr(0, 2);
string substr2 = s.substr(2, 2);
if ((stoi(substr1) >= 01 && stoi(substr1) <= 12) &&
(stoi(substr2) >= 01 && stoi(substr2) <= 12))
print("AMBIGUOUS");
else if (stoi(substr1) >= 01 && stoi(substr1) <= 12)
print("MMYY");
else if (stoi(substr2) >= 01 && stoi(substr2) <= 12)
print("YYMM");
else
print("NA");
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 857,210 | 857,211 | u999788719 | cpp |
p03042 | #include <bits/stdc++.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++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
int main() {
int A;
cin >> A;
int B;
B = A % 100;
A /= 100;
if (A > 12 || A == 0) {
if (B < 13 && B > 0) {
cout << "YYMM" << endl;
return 0;
} else {
cout << "NA" << endl;
return 0;
}
} else {
if (B < 13 && B > 0) {
cout << "MMYY" << endl;
return 0;
} else {
cout << "AMBIGUOUS" << endl;
return 0;
}
}
}
| #include <bits/stdc++.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++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
int main() {
int A;
cin >> A;
int B;
B = A % 100;
A /= 100;
if (A > 12 || A == 0) {
if (B < 13 && B > 0) {
cout << "YYMM" << endl;
return 0;
} else {
cout << "NA" << endl;
return 0;
}
} else {
if (B < 13 && B > 0) {
cout << "AMBIGUOUS" << endl;
return 0;
} else {
cout << "MMYY" << endl;
return 0;
}
}
}
| [
"literal.string.change",
"io.output.change"
] | 857,212 | 857,213 | u170513117 | cpp |
p03042 | #include <bits/stdc++.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++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
int main() {
int A;
cin >> A;
int B;
B = A / 100;
A %= 100;
if (A > 12 || A == 0) {
if (B < 13 && B > 0) {
cout << "YYMM" << endl;
return 0;
} else {
cout << "NA" << endl;
return 0;
}
} else {
if (B < 13 && B > 0) {
cout << "MMYY" << endl;
return 0;
} else {
cout << "AMBIGUOUS" << endl;
return 0;
}
}
}
| #include <bits/stdc++.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++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
int main() {
int A;
cin >> A;
int B;
B = A % 100;
A /= 100;
if (A > 12 || A == 0) {
if (B < 13 && B > 0) {
cout << "YYMM" << endl;
return 0;
} else {
cout << "NA" << endl;
return 0;
}
} else {
if (B < 13 && B > 0) {
cout << "AMBIGUOUS" << endl;
return 0;
} else {
cout << "MMYY" << endl;
return 0;
}
}
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.change",
"literal.string.change",
"io.output.change"
] | 857,214 | 857,213 | u170513117 | 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() {
int a;
std::cin >> a;
int l = a / 100;
int r = a % 100;
if (1 <= l && r <= 12) {
if (1 <= r && r <= 12)
printf("AMBIGUOUS\n");
else
printf("MMYY\n");
} else {
if (1 <= r && r <= 12)
printf("YYMM\n");
else
printf("NA\n");
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a;
std::cin >> a;
int l = a / 100;
int r = a % 100;
if (1 <= l && l <= 12) {
if (1 <= r && r <= 12)
printf("AMBIGUOUS\n");
else
printf("MMYY\n");
} else {
if (1 <= r && r <= 12)
printf("YYMM\n");
else
printf("NA\n");
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,217 | 857,218 | u589238650 | cpp |
p03042 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
int main() {
string s;
cin >> s;
int x = 0;
int y = 0;
for (int i = 0; i < 2; i++) {
x = x * 10 + (s[i] - '0');
y = y * 10 + (s[i + 2] - '0');
}
if (x > 12 || x == 0) {
if (y > 12 || y == 0) {
cout << "NA" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (y > 12 || y == 0) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOS" << endl;
}
}
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
int main() {
string s;
cin >> s;
int x = 0;
int y = 0;
for (int i = 0; i < 2; i++) {
x = x * 10 + (s[i] - '0');
y = y * 10 + (s[i + 2] - '0');
}
if (x > 12 || x == 0) {
if (y > 12 || y == 0) {
cout << "NA" << endl;
} else {
cout << "YYMM" << endl;
}
} else {
if (y > 12 || y == 0) {
cout << "MMYY" << endl;
} else {
cout << "AMBIGUOUS" << endl;
}
}
}
| [
"literal.string.change",
"io.output.change"
] | 857,223 | 857,224 | u156778176 | cpp |
p03042 | #include <bits/stdc++.h>
#define int long long
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define REP_sz(i, s) for (int i = 0; i < s.size(); i++)
#define RE return
#define FILL(a, b) memset(a, b, sizeof(a))
#define SO(a) sort(all(a))
#define pb push_back
#define sz(a) a.size()
#define V vector
#define ld long double
#define viit(a) vector<int>::iterator a
#define msit1(a) map<string, int>::iterator a
#define miit(a) map<int, int>::iterator a
#define msit2(a) map<int, string>::iterator a
#define IT iterator
#define FOR(i, a, n) for (int i = a; i <= (n); i++)
#define B(s) s.back()
#define all(a) a.begin(), a.end()
#define ER1(a) a.erase(a.begin())
#define ER0(a) a.erase(a.end())
#define pii pair<int, int>
#define pause system("PAUSE")
#define cls system("CLS")
using namespace std;
bool isMonth(int month) { return month >= 1 && month <= 12; }
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
int mon1 = (s[0] - '0') * 10 + (s[1] - '0');
int mon2 = (s[2] - '0') * 10 + (s[3] - '0');
if (isMonth(mon1) && !isMonth(mon2))
cout << "MMYY\n";
else if (!isMonth(mon1) && isMonth(mon2))
cout << "YYMM\n";
else if (isMonth(mon1) && isMonth(mon2))
cout << "AMBIGUOUS\n";
else if (!isMonth(mon1) && !isMonth(mon2))
cout << "NA\n";
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define REP_sz(i, s) for (int i = 0; i < s.size(); i++)
#define RE return
#define FILL(a, b) memset(a, b, sizeof(a))
#define SO(a) sort(all(a))
#define pb push_back
#define sz(a) a.size()
#define V vector
#define ld long double
#define viit(a) vector<int>::iterator a
#define msit1(a) map<string, int>::iterator a
#define miit(a) map<int, int>::iterator a
#define msit2(a) map<int, string>::iterator a
#define IT iterator
#define FOR(i, a, n) for (int i = a; i <= (n); i++)
#define B(s) s.back()
#define all(a) a.begin(), a.end()
#define ER1(a) a.erase(a.begin())
#define ER0(a) a.erase(a.end())
#define pii pair<int, int>
#define pause system("PAUSE")
#define cls system("CLS")
using namespace std;
bool isMonth(int month) { return month >= 1 && month <= 12; }
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int mon1 = (s[0] - '0') * 10 + (s[1] - '0');
int mon2 = (s[2] - '0') * 10 + (s[3] - '0');
if (isMonth(mon1) && !isMonth(mon2))
cout << "MMYY\n";
else if (!isMonth(mon1) && isMonth(mon2))
cout << "YYMM\n";
else if (isMonth(mon1) && isMonth(mon2))
cout << "AMBIGUOUS\n";
else if (!isMonth(mon1) && !isMonth(mon2))
cout << "NA\n";
return 0;
}
| [] | 857,235 | 857,236 | u163700211 | cpp |
p03042 | #pragma region header
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
bool isprime(ll a) //素数判定、primeならtrue,違うならfalse
{
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2) {
if (a % i == 0) {
return false;
}
}
// 素数である
return true;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
string S;
cin >> S;
string zenhan = S.substr(0, 2);
string kohan = S.substr(2, 2);
int A = stoi(zenhan);
int B = stoi(kohan);
if (A != 0 && A < 13 && B != 0 && B < 13) {
cout << "AMBIGUOUS" << endl;
} else if (A == 0 || A > 12 && B != 0 && B < 13) {
cout << "YYMM" << endl;
} else if (A != 0 && A < 13 && B == 0 || B > 12) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
}
| #pragma region header
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
bool isprime(ll a) //素数判定、primeならtrue,違うならfalse
{
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2) {
if (a % i == 0) {
return false;
}
}
// 素数である
return true;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
string S;
cin >> S;
string zenhan = S.substr(0, 2);
string kohan = S.substr(2, 2);
int A = stoi(zenhan);
int B = stoi(kohan);
if (A != 0 && A < 13 && B != 0 && B < 13) {
cout << "AMBIGUOUS" << endl;
} else if ((A == 0 || A > 12) && B != 0 && B < 13) {
cout << "YYMM" << endl;
} else if (A != 0 && A < 13 && (B == 0 || B > 12)) {
cout << "MMYY" << endl;
} else {
cout << "NA" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 857,245 | 857,246 | u851044959 | cpp |
p03042 | /*
author : nishi5451
created : 15.08.2020 00:36:19
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int l = 10 * (s[0] - '0') + (s[1] - '0');
int r = 10 * (s[2] - '0') + (s[3] - '0');
if (1 <= r && r <= 12 && 1 <= l && l <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= r && r <= 12) {
cout << "MMYY" << endl;
} else if (1 <= l && l <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
return 0;
} | /*
author : nishi5451
created : 15.08.2020 00:36:19
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
int l = 10 * (s[0] - '0') + (s[1] - '0');
int r = 10 * (s[2] - '0') + (s[3] - '0');
if (1 <= r && r <= 12 && 1 <= l && l <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= l && l <= 12) {
cout << "MMYY" << endl;
} else if (1 <= r && r <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,249 | 857,250 | u033937898 | cpp |
p03042 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int S;
cin >> S;
if (S / 100 <= 12 && S / 100 >= 1) {
if (S - S / 100 * 100 <= 12 && S - S / 100 * 100 >= 1) {
cout << "AMBIGOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (S - S / 100 * 100 <= 12 && S - S / 100 * 100 >= 1) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int S;
cin >> S;
if (S / 100 <= 12 && S / 100 >= 1) {
if (S - S / 100 * 100 <= 12 && S - S / 100 * 100 >= 1) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (S - S / 100 * 100 <= 12 && S - S / 100 * 100 >= 1) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
} | [
"literal.string.change",
"io.output.change"
] | 857,260 | 857,261 | u686962993 | 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 && 1 <= R && R <= 12) {
cout << "AMBIGUOS" << endl;
} else if (1 <= L && L <= 12) {
cout << "MMYY" << endl;
} else if (1 <= R && R <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
| #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 && 1 <= R && R <= 12) {
cout << "AMBIGUOUS" << endl;
} else if (1 <= L && L <= 12) {
cout << "MMYY" << endl;
} else if (1 <= R && R <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 857,262 | 857,263 | u856957535 | cpp |
p03042 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
//最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
string S;
cin >> S;
int a = (int)(S[0] - '0') * 10 + (int)(S[1] - '0');
int b = (int)(S[2] - '0') * 10 + (int)(S[3] - '0');
cerr << a << "\t" << b << endl;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout << "AMBIGOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= b && b <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
//最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
string S;
cin >> S;
int a = (int)(S[0] - '0') * 10 + (int)(S[1] - '0');
int b = (int)(S[2] - '0') * 10 + (int)(S[3] - '0');
cerr << a << "\t" << b << endl;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= b && b <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 857,264 | 857,265 | u024764559 | cpp |
p03042 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
//最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
string S;
cin >> S;
int a = (int)(S[0] - '0') * 10 + (int)(S[1] - '0');
int b = (int)(S[2] - '0') * 10 + (int)(S[3] - '0');
cerr << a << "\t" << b << endl;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout << "AMBIGUOS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= b && b <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 法mでのaの逆元を計算
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
//最小公倍数
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n, long long k) {
com[0] = 1;
for (int i = 1; i <= k; i++) {
com[i] = (com[i - 1] * (n - i + 1) % MOD) * modinv(i, MOD) % MOD;
}
}
int main() {
string S;
cin >> S;
int a = (int)(S[0] - '0') * 10 + (int)(S[1] - '0');
int b = (int)(S[2] - '0') * 10 + (int)(S[3] - '0');
cerr << a << "\t" << b << endl;
if (1 <= a && a <= 12) {
if (1 <= b && b <= 12) {
cout << "AMBIGUOUS" << endl;
} else {
cout << "MMYY" << endl;
}
} else {
if (1 <= b && b <= 12) {
cout << "YYMM" << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 857,266 | 857,265 | u024764559 | cpp |
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 <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int ll
#define double ld
#define loop(i, n) for (int i = 0; i < (int)n; ++i)
#define loop1(i, n) for (int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair<int, int>
#define all(x) begin(x), end(x)
#define ti tuple<int, int, int>
#define Point Vect
#define mkt make_tuple
#define no \
{ \
cout << -1; \
return; \
}
void solve() {
char a, b, c, d;
cin >> a >> b >> c >> d;
int x = (a - '0') * 10 + b - '0', y = (c - '0') * 10 + d - '0';
bool f1 = x > 0 && x <= 12, f2 = y > 0 && y <= 12;
if (f1 && f2)
cout << "AMBIGIOUS";
else if (f1)
cout << "MMYY";
else if (f2)
cout << "YYMM";
else
cout << "NA";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// int t; cin >> t; loop(i, t)
solve();
return 0;
} | #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 <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int ll
#define double ld
#define loop(i, n) for (int i = 0; i < (int)n; ++i)
#define loop1(i, n) for (int i = 1; i <= (int)n; ++i)
#define F first
#define S second
#define pb push_back
#define pi pair<int, int>
#define all(x) begin(x), end(x)
#define ti tuple<int, int, int>
#define Point Vect
#define mkt make_tuple
#define no \
{ \
cout << -1; \
return; \
}
void solve() {
char a, b, c, d;
cin >> a >> b >> c >> d;
int x = (a - '0') * 10 + b - '0', y = (c - '0') * 10 + d - '0';
bool f1 = x > 0 && x <= 12, f2 = y > 0 && y <= 12;
if (f1 && f2)
cout << "AMBIGUOUS";
else if (f1)
cout << "MMYY";
else if (f2)
cout << "YYMM";
else
cout << "NA";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// int t; cin >> t; loop(i, t)
solve();
return 0;
} | [
"misc.typo",
"literal.string.change",
"io.output.change"
] | 857,272 | 857,273 | u727064118 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.