problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
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 << "\... | [
"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 << "\... | [
"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;
re... | [] | 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 <ut... | #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 <ut... | [
"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'... | #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'... | [
"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 pu... | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb pu... | [
"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]... | #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]... | [
"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] = '... | #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... | [
"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... | //#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... | [
"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 ... |
/*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 ... | [
"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>... | #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>... | [
"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';
}... | #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] = '... | [
"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... | #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... | [
"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 <vec... | #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 <vec... | [
"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 al... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define al... | [
"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##... | #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##... | [
"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##... | #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##... | [
"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>
#defi... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = 0; i < b; i++)
#define REP(i, a, b) for (int i = 0; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define vvi vector<vi>
#defi... | [
"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)
... | #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 ... | [
"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... | #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... | [
"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 =... | #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 =... | [
"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 ... | #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 ... | [
"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++... | #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++... | [
"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)... | #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)... | [
"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 <st... | #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 <st... | [
"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 (i... | #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 (i... | [
"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" << en... | #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" << en... | [
"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) == '... | #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) == '... | [
"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 (... | #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 (... | [
"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;
... | #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;
... | [
"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
... | #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
... | [
"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]... | #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]... | [
"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, setprecis... | #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, setprecis... | [
"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); ... | #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); ... | [
"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" << end... | #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" << end... | [
"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] == ... | #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] ==... | [
"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_sak... | #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_sak... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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
... | #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
... | [
"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) ... | #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) ... | [
"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) {
... | #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) {
... | [
"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 % 10... | #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 % 10... | [
"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... | #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... | [
"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 <= ... | #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 <= ... | [
"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... | #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 >... | [
"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... | #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... | [
"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 __pri... | #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 __pri... | [] | 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 pa... | #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 pa... | [
"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 pa... | #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 pa... | [
"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 (... | #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 (... | [
"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>;
usin... | #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>;
usin... | [
"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(... | #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(... | [
"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(... | #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(... | [
"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)
... | #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)
... | [
"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<V... | #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<V... | [
"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 && ... | #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 &&... | [
"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 &... | #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 &&... | [
"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 && ... | #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 && ... | [
"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 <<... | #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 <... | [
"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' ||
... | #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' ||
... | [
"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
cou... | #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
cou... | [
"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"... | #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
cou... | [
"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 ... | #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 ... | [
"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
//------------------------------------------
#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... | [
"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) {
... | #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) {
... | [
"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... | #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... | [
"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_I... | #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_I... | [
"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_I... | #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_I... | [
"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 {... | #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 {... | [
"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;
... | #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;
... | [
"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 d... | #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 d... | [] | 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>... | #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>... | [
"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 <= ... | /*
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 <= ... | [
"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... | #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 {
cou... | [
"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... | #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" << end... | [
"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};
i... | #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};
i... | [
"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};
i... | #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};
i... | [
"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 <se... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | [
"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.