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 |
|---|---|---|---|---|---|---|---|
p03252 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
string S, T;
cin >>... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
string S, T;
cin >>... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,040,389 | 1,040,390 | u774438048 | cpp |
p03252 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
string S, T;
cin >>... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
string S, T;
cin >>... | [
"call.arguments.add",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,040,391 | 1,040,390 | u774438048 | cpp |
p03252 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"assignment.variable.change",
"identifier.change"
] | 1,040,394 | 1,040,395 | u809967037 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
bool flag = true;
map<char, char> a, b;
for (int i = 0; i < S.size(); i++) {
char s = S[i], t = T[i];
if (a.count(s)) {
if (a[s] != t) {
flag = false;
}
}
if (b.count(t)) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
bool flag = true;
map<char, char> a, b;
for (int i = 0; i < S.size(); i++) {
char s = S[i], t = T[i];
if (a.count(s)) {
if (a[s] != t) {
flag = false;
}
}
if (b.count(t)) {
if... | [
"literal.string.change",
"io.output.change"
] | 1,040,396 | 1,040,397 | u637318391 | cpp |
p03252 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
int b = t[i] - 'b';
if (start[... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
int b = t[i] - 'a';
if (start[... | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,040,402 | 1,040,403 | u373047809 | cpp |
p03252 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
int b = t[i] - 'b';
if (start[... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
int b = t[i] - 'a';
if (start[... | [
"literal.string.change",
"expression.operation.binary.change",
"control_flow.branch.else.add"
] | 1,040,404 | 1,040,403 | u373047809 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
// int dp[300006];
int dp[102][102 * 500];
int32_t main() {
string s, t;
cin >> s >> t;
string ans = "Yes";
map<char, char> c1, c2;
for (int i = 0; i < s.size(); i++) {
if (c1.count(s[i])) {
if (c1[s[i]] != t[i]) {
// co... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
// int dp[300006];
int dp[102][102 * 500];
int32_t main() {
string s, t;
cin >> s >> t;
string ans = "Yes";
map<char, char> c1, c2;
for (int i = 0; i < s.size(); i++) {
if (c1.count(s[i])) {
if (c1[s[i]] != t[i]) {
// co... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,040,423 | 1,040,424 | u348641375 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<ll> table1(30, 0);
vector<ll> table2(30, 0);
rep(i, s.size()) {
ll si = s[i] - 'a';
ll ti = t[i] - 'a';
table1[si]++;
table2[t... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<ll> table1(30, 0);
vector<ll> table2(30, 0);
rep(i, s.size()) {
ll si = s[i] - 'a';
ll ti = t[i] - 'a';
table1[si]++;
table2[t... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,040,434 | 1,040,435 | u264265458 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1000000000
#define pow(x) pow(10, (x))
typedef long long int LL;
int main() {
string S, T;
cin >> S >> T;
map... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1000000000
#define pow(x) pow(10, (x))
typedef long long int LL;
int main() {
string S, T;
cin >> S >> T;
map... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,441 | 1,040,442 | u587857074 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using in6 = int64_t;
using ind = double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s, t;
cin >> s >> t;
vi data1(26);
vi data2(26);
rep(i, s.size()) { data1[s[i] - 97]++; }
rep(i, t.... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using in6 = int64_t;
using ind = double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s, t;
cin >> s >> t;
vi data1(26, 0);
vi data2(26, 0);
rep(i, s.size()) { data1[s[i] - 97]++; }
rep... | [
"call.arguments.add",
"variable_declaration.value.change"
] | 1,040,454 | 1,040,455 | u655179794 | cpp |
p03252 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define ... | [] | 1,040,462 | 1,040,463 | u314008046 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int cnt1[26], cnt2[26];
int main() {
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++)
cnt1[s[i] - 'a']++;
for (int i = 0; i < t.size(); i++)
cnt2[t[i] - 'a']++;
sort(cnt1, cnt1 + 26);
sort(cnt2, cnt2 + 26);
for (int i = 0; i < s.size();... | #include <bits/stdc++.h>
using namespace std;
int cnt1[26], cnt2[26];
int main() {
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++)
cnt1[s[i] - 'a']++;
for (int i = 0; i < t.size(); i++)
cnt2[t[i] - 'a']++;
sort(cnt1, cnt1 + 26);
sort(cnt2, cnt2 + 26);
for (int i = 0; i < 26; i++) ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 1,040,464 | 1,040,465 | u324752405 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define prin(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define mi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define prin(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define mi... | [
"literal.string.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 1,040,466 | 1,040,467 | u768152935 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define prin(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define mi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define prin(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define mi... | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,040,466 | 1,040,468 | u768152935 | cpp |
p03252 | // [[ABC134C] Exception Handling] https://www.luogu.com.cn/problem/AT4843
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
using namespace std;
long long a[30], b[30];
int main() {
string s, k;
cin >> s >> k;
for (int i = 0; i < s.length(); i++) {
a[s[i] - 'a']++;
b[s[i] - 'a']++;
... | // [[ABC134C] Exception Handling] https://www.luogu.com.cn/problem/AT4843
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
using namespace std;
long long a[30], b[30];
int main() {
string s, k;
cin >> s >> k;
for (int i = 0; i < s.length(); i++) {
a[s[i] - 'a']++;
b[k[i] - 'a']++;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,040,469 | 1,040,470 | u440588451 | cpp |
p03252 | // [[ABC134C] Exception Handling] https://www.luogu.com.cn/problem/AT4843
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
using namespace std;
int a[26], b[26];
int main() {
string s, k;
cin >> s >> k;
for (int i = 0; i < s.length(); i++) {
a[s[i] - 'a']++;
b[s[i] - 'a']++;
}
... | // [[ABC134C] Exception Handling] https://www.luogu.com.cn/problem/AT4843
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
using namespace std;
long long a[30], b[30];
int main() {
string s, k;
cin >> s >> k;
for (int i = 0; i < s.length(); i++) {
a[s[i] - 'a']++;
b[k[i] - 'a']++;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,040,471 | 1,040,470 | u440588451 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s1;
string s2;
cin >> s1;
cin >> s2;
int length = s1.length();
int m = 26;
int a1[m];
int a2[m];
for (int i = 0; i < m; ++i) {
a1[i] = 0;
a2[i] = 0;
}
int c = 0;
for (int i = 0; i < length; ++i) {
c = static_cas... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s1;
string s2;
cin >> s1;
cin >> s2;
int length = s1.length();
int m = 26;
int a1[m];
int a2[m];
for (int i = 0; i < m; ++i) {
a1[i] = 0;
a2[i] = 0;
}
int c = 0;
for (int i = 0; i < length; ++i) {
c = static_cas... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change",
"expression.operation.binary.change"
] | 1,040,482 | 1,040,481 | u701527888 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
#define CoutV(vec) \
for (auto v : vec) { \
cout << v << " "; ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
#define CoutV(vec) \
for (auto v : vec) { \
cout << v << " "; ... | [
"assignment.variable.change",
"identifier.change"
] | 1,040,483 | 1,040,484 | u833549197 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, s, n) for (int i = s; i < n; i++)
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> s_count(26, 0);
vector<int> t_count(26, 0);
rep(i, 0, s.size()) {
s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define rep(i, s, n) for (int i = s; i < n; i++)
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> s_count(26, 0);
vector<int> t_count(26, 0);
rep(i, 0, s.size()) {
s... | [
"identifier.change",
"call.arguments.change"
] | 1,040,487 | 1,040,488 | u465669072 | cpp |
p03252 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = int64_t;
int main() {
string s, t;
cin >> s >> t;
map<char, char> t2s;
map<char, char> s2t;
bool flag = true;
rep(i, s.size()) {
auto itrt2s = t2s.find(t[i]);
if (itrt2s != t2s.end()) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = int64_t;
int main() {
string s, t;
cin >> s >> t;
map<char, char> t2s;
map<char, char> s2t;
bool flag = true;
rep(i, s.size()) {
auto itrt2s = t2s.find(t[i]);
if (itrt2s != t2s.end()) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,493 | 1,040,494 | u118477733 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<int> a(26, -1);
vector<int> b(26, -1);
for (int i = 0; i < s.size(); i++) {
int aa = s[i] - 'a';
int bb = t[i] - 'a';
if (a[aa] != -1 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<int> a(26, -1);
vector<int> b(26, -1);
for (int i = 0; i < s.size(); i++) {
int aa = s[i] - 'a';
int bb = t[i] - 'a';
if (a[aa] != -1 ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,496 | 1,040,497 | u796877631 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<int> a(26, -1);
vector<int> b(26, -1);
for (int i = 0; i < s.size(); i++) {
int aa = s[i] - 'a';
int bb = t[i] - 'b';
if (a[aa] != -1 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<int> a(26, -1);
vector<int> b(26, -1);
for (int i = 0; i < s.size(); i++) {
int aa = s[i] - 'a';
int bb = t[i] - 'a';
if (a[aa] != -1 ... | [
"literal.string.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,498 | 1,040,497 | u796877631 | cpp |
p03252 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 1,040,499 | 1,040,500 | u502772848 | cpp |
p03252 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) FOR(i, 0, n)
#define repi(i, n) FOR(i, 1, n + 1)
#define pp(v) cerr << #v "=" << (v) << endl;
#define ppa(v) ... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) FOR(i, 0, n)
#define repi(i, n) FOR(i, 1, n + 1)
#define pp(v) cerr << #v "=" << (v) << endl;
#define ppa(v) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,503 | 1,040,504 | u106964380 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, k;
cin >> s >> k;
int arr[30] = {0};
int frr[30] = {0};
for (int i = 0; i < s.size(); i++) {
char a = s[i] - 'a';
arr[a]++;
}
for (int i = 0; i < k.size(); i++) {
char a = k[i] - 'a';
frr[a]++;
}
// for(int i=0;i<30... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, k;
cin >> s >> k;
int arr[30] = {0};
int frr[30] = {0};
for (int i = 0; i < s.size(); i++) {
char a = s[i] - 'a';
arr[a]++;
}
for (int i = 0; i < k.size(); i++) {
char a = k[i] - 'a';
frr[a]++;
}
// for(int i=0;i<30... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,509 | 1,040,510 | u351012095 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).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 chma... | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).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 chma... | [
"assignment.variable.change",
"identifier.change"
] | 1,040,515 | 1,040,516 | u628332144 | cpp |
p03252 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int cs[26] = {}, ct[26] = {};
for (int i = 0; i < s.size(); i++) {
cs[s[i] - 'a']++;
ct[t[i] - 'a']++;
if (cs[s[i] - 'a'] != ct[t[i] - 'a']) {
cout << "No" << endl;
break;
}
}
co... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int cs[26] = {}, ct[26] = {};
for (int i = 0; i < s.size(); i++) {
cs[s[i] - 'a']++;
ct[t[i] - 'a']++;
if (cs[s[i] - 'a'] != ct[t[i] - 'a']) {
cout << "No" << endl;
return 0;
}
}
... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 1,040,524 | 1,040,525 | u633402865 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
string t;
char c = ' ';
bool aru[2][30];
cin >> s;
cin >> t;
for (int i = 0; i < s.size(); i++) {
aru[0][s[i] - 'a'] = true;
aru[1][t[i] - 'a'] = true;
}
int aa, bb;
aa = 0;
bb = 0;
for (int i = 0; i < 26; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
string t;
char c = ' ';
bool aru[2][30] = {};
cin >> s;
cin >> t;
for (int i = 0; i < s.size(); i++) {
aru[0][s[i] - 'a'] = true;
aru[1][t[i] - 'a'] = true;
}
int aa, bb;
aa = 0;
bb = 0;
for (int i = 0; i < 26; ... | [
"variable_declaration.value.change"
] | 1,040,526 | 1,040,527 | u509327994 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using st = string;
using ch = char;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using st = string;
using ch = char;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#def... | [] | 1,040,781 | 1,040,782 | u328811800 | cpp |
p03252 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,040,787 | 1,040,788 | u983547593 | cpp |
p03252 | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ve... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ve... | [
"literal.string.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 1,040,790 | 1,040,791 | u798339690 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int len = s.size();
vector<int> alfa1(26, 0), alfa2(26, 0);
bool ans = true;
for (int i = 0; i < len; i++) {
int a1 = s[i] - 'a', a2 = t[i] - 'a';
alfa1[a1]++;
alfa2[a2]++;
if (alfa1[a1] != alfa2[a2]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int len = s.size();
vector<int> alfa1(26, 0), alfa2(26, 0);
bool ans = true;
for (int i = 0; i < len; i++) {
int a1 = s[i] - 'a', a2 = t[i] - 'a';
alfa1[a1]++;
alfa2[a2]++;
if (alfa1[a1] != alfa2[a2]) ... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 1,040,792 | 1,040,793 | u494609869 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S[2];
cin >> S[1] >> S[2];
int S_[2][200001];
int N = (int)S[1].size();
for (int i = 0; i < 2; i++) {
string a = "";
for (int j = 0; j < N; j++) {
int n = a.size();
int p = 0;
while (p < n && a[p] != S[i][j])
p... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S[2];
cin >> S[0] >> S[1];
int S_[2][200001];
int N = (int)S[1].size();
for (int i = 0; i < 2; i++) {
string a = "";
for (int j = 0; j < N; j++) {
int n = a.size();
int p = 0;
while (p < n && a[p] != S[i][j])
p... | [
"expression.operation.binary.remove"
] | 1,040,796 | 1,040,797 | u058186113 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define nl cout << "\n"
#define dbg(x) cout << x << " ";
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define UM unordered_map<char, int>
#define ULL unordered_map<ll, int>
void fun() {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define nl cout << "\n"
#define dbg(x) cout << x << " ";
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define UM unordered_map<char, int>
#define ULL unordered_map<ll, int>
void fun() {... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,798 | 1,040,799 | u706950394 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
vector<vector<int>> f(string s) {
vector<vector<int>> ret(26, vector<int>(0));
vector<char> m(26, 'X');
int n = s.size();
char p = 'a';
rep(i, n) {
int c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
vector<vector<int>> f(string s) {
vector<vector<int>> ret(26, vector<int>(0));
vector<char> m(26, 'X');
int n = s.size();
char p = 'a';
rep(i, n) {
int c... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,040,802 | 1,040,803 | u389007679 | cpp |
p03252 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,040,806 | 1,040,807 | u690326065 | cpp |
p03252 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
char memo[26] = {};
char memo1[26] = {};
string ans = "Yes";
for (int i = 0; i < s.length(); i++) {
if (memo[t[i] - 'a'] == 0) {
memo[t[i] - 'a'] = s[i];
} else if (memo[t[i] - 'a'] != ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
char memo[26] = {};
char memo1[26] = {};
string ans = "Yes";
for (int i = 0; i < s.length(); i++) {
if (memo[t[i] - 'a'] == 0) {
memo[t[i] - 'a'] = s[i];
} else if (memo[t[i] - 'a'] != ... | [
"assignment.value.change",
"identifier.change"
] | 1,040,812 | 1,040,813 | u828593789 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
string s, t;
cin >> s >> t;
map<char, char> cs, ct;
int n = sz(s);
bool ok = true;
for (int i = 0; i < n; i++) {
char x ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
string s, t;
cin >> s >> t;
map<char, char> cs, ct;
int n = sz(s);
bool ok = true;
for (int i = 0; i < n; i++) {
char x ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,821 | 1,040,822 | u108540384 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
string s, t;
cin >> s >> t;
map<char, char> cs, ct;
int n = sz(s);
bool ok = true;
for (int i = 0; i < n; i++) {
int x =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
string s, t;
cin >> s >> t;
map<char, char> cs, ct;
int n = sz(s);
bool ok = true;
for (int i = 0; i < n; i++) {
char x ... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,823 | 1,040,822 | u108540384 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s, t, c1, c2;
int count = 0;
cin >> s;
cin >> t;
int sc[27], tc[27];
for (int i = 0; i < 27; i++) {
sc[i] = 0;
tc[i] = 0;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string s, t, c1, c2;
int count = 0;
cin >> s;
cin >> t;
int sc[27], tc[27];
for (int i = 0; i < 27; i++) {
sc[i] = 0;
tc[i] = 0;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,040,826 | 1,040,827 | u157195505 | cpp |
p03252 | #include <iostream>
#include <map>
#include <string>
int main() {
std::string S, T;
std::cin >> S >> T;
std::map<char, char> m, m2;
for (int i = 0; i < S.size(); i++) {
if (!m.count(T[i]))
m[T[i]] = S[i];
else {
if (m[T[i]] != S[i]) {
std::cout << "No" << std::endl;
return 0;... | #include <iostream>
#include <map>
#include <string>
int main() {
std::string S, T;
std::cin >> S >> T;
std::map<char, char> m, m2;
for (int i = 0; i < S.size(); i++) {
if (!m.count(T[i]))
m[T[i]] = S[i];
else {
if (m[T[i]] != S[i]) {
std::cout << "No" << std::endl;
return 0;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,834 | 1,040,835 | u503221936 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), ... | [
"assignment.value.change"
] | 1,040,840 | 1,040,841 | u145179061 | cpp |
p03252 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define in(a) cin >> a
#define ou... | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = a; i < n; i++)
#define in(a) cin >> a
#define ou... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,040,842 | 1,040,843 | u829260400 | cpp |
p03252 | #include <iostream>
using namespace std;
int letters1[26] = {0}, letters2[26] = {0};
int main() {
int i = 0;
string S, T;
cin >> S >> T;
for (i = 0; i < S.length(); i++) {
letters1[int(S[i] - 'a')]++;
}
for (i = 0; i < T.length(); i++) {
letters2[int(T[i] - 'a')]++;
}
for (i = 0; i < T.length... | #include <iostream>
using namespace std;
int letters1[26] = {0}, letters2[26] = {0};
int main() {
int i = 0;
string S, T;
cin >> S >> T;
for (i = 0; i < S.length(); i++) {
letters1[int(S[i] - 'a')]++;
}
for (i = 0; i < T.length(); i++) {
letters2[int(T[i] - 'a')]++;
}
for (i = 0; i < T.length... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,848 | 1,040,849 | u927572682 | cpp |
p03252 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
string s, t;
cin >> s >> t;
map<char, char> st, ts;
for (int i = 0; i < s.length(); i++) {
if (st.count(s[i])) {
if (st[s[i]] != t[i]) {
cout << "No" << endl;
return 0;
}
}
if (ts.count(t[i... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
string s, t;
cin >> s >> t;
map<char, char> st, ts;
for (int i = 0; i < s.length(); i++) {
if (st.count(s[i])) {
if (st[s[i]] != t[i]) {
cout << "No" << endl;
return 0;
}
}
if (ts.count(t[i... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,040,852 | 1,040,853 | u394759653 | cpp |
p03252 | /**************************************************************************
Coded by: Saba Karimi(_VINTAGE)
Institution: AIT PUNE
***************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define fast ... | /**************************************************************************
Coded by: Saba Karimi(_VINTAGE)
Institution: AIT PUNE
***************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define fast ... | [
"variable_declaration.type.change"
] | 1,040,861 | 1,040,862 | u509167006 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<long long>;
const string YES = "Yes";
const string NO = "No";
void solve(std::string S, std::string T) {
map<char, vll> rs, rt;
ll N = S.size();
for (ll i = 0; i < N; i++) {
char s = S.at(i), t = T.at(i);
if (!rs.cou... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<long long>;
const string YES = "Yes";
const string NO = "No";
void solve(std::string S, std::string T) {
map<char, vll> rs, rt;
ll N = S.size();
for (ll i = 0; i < N; i++) {
char s = S.at(i), t = T.at(i);
if (!rs.cou... | [] | 1,040,871 | 1,040,872 | u960267905 | cpp |
p03252 | //============================================================================
// Name : abc110c.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <a... | //============================================================================
// Name : abc110c.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <a... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 1,040,873 | 1,040,874 | u055685044 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin()... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin()... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,040,887 | 1,040,888 | u352200121 | cpp |
p03252 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#includ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,889 | 1,040,890 | u585670083 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const long long mod = 1e9 + 7;
int main(void) {
string S, T;
cin >> S >> T;
bool flag = true;
vector<pair<char, char>> a(S.size()), b(S.size());
for (int i = 0; i < S.size(); i++) {
a.at(i) = make_pair(S.at(i), T.at(i));
b.at(i) = mak... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const long long mod = 1e9 + 7;
int main(void) {
string S, T;
cin >> S >> T;
bool flag = true;
vector<pair<char, char>> a(S.size()), b(S.size());
for (int i = 0; i < S.size(); i++) {
a.at(i) = make_pair(S.at(i), T.at(i));
b.at(i) = mak... | [
"assignment.change"
] | 1,040,891 | 1,040,892 | u822169805 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
auto m = vector<int>('z' - 'a' + 1, -1);
auto m1 = vector<int>('z' - 'a' + 1, -1);
bool flag = true;
for (int i = 0; i < s.size(); i++) {
if (m[s[i] - 'a'] < 0) {
m[s[i] - 'a'] = t[i] - 'a';
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
auto m = vector<int>('z' - 'a' + 1, -1);
auto m1 = vector<int>('z' - 'a' + 1, -1);
bool flag = true;
for (int i = 0; i < s.size(); i++) {
if (m[s[i] - 'a'] < 0) {
m[s[i] - 'a'] = t[i] - 'a';
} else ... | [] | 1,040,895 | 1,040,896 | u533749093 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
char t_map[30];
char s_map[30];
int main(void) {
string s, t;
cin >> s >> t;
for (int i = 0; i < 30; i++) {
t_map[i] = s_map[i] = 0;
}
bool f = true;
for (int i = 0; i < s.size(); i++) {
if (t_map[t[i]] != 0) {
t_map[t[i]] = s[i];
} else {
... | #include <bits/stdc++.h>
using namespace std;
char t_map[30];
char s_map[30];
int main(void) {
string s, t;
cin >> s >> t;
for (int i = 0; i < 30; i++) {
t_map[i] = s_map[i] = 0;
}
bool f = true;
for (int i = 0; i < s.size(); i++) {
if (t_map[t[i]] == 0) {
t_map[t[i]] = s[i];
} else {
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,040,897 | 1,040,898 | u753982487 | cpp |
p03252 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_... | [] | 1,040,903 | 1,040,904 | u561443723 | cpp |
p03252 | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Code author: Saurabh Singhal
Code copy karne vaale tera muh kaala
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ppb pop_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi_t;
typ... | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Code author: Saurabh Singhal
Code copy karne vaale tera muh kaala
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ppb pop_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi_t;
typ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,040,905 | 1,040,906 | u366445643 | cpp |
p03252 | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Code author: Saurabh Singhal
Code copy karne vaale tera muh kaala
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ppb pop_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi_t;
typ... | /*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Code author: Saurabh Singhal
Code copy karne vaale tera muh kaala
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
#include <bits/stdc++.h>
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ppb pop_back
using namespace std;
typedef long long int ll;
typedef vector<int> vi_t;
typ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 1,040,907 | 1,040,906 | u366445643 | cpp |
p03252 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#defi... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#defi... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,040,908 | 1,040,909 | u324303263 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
sort(S.begin(), S.end());
sort(T.begin(), T.end());
vector<int> s(256, 0);
vector<int> t(256, 0);
for (int i = 0; i < (int)S.size(); i++) {
int index_s = S[i] - '0';
int index_t = T[i] - '0';
s[index_s... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
sort(S.begin(), S.end());
sort(T.begin(), T.end());
vector<int> s(256, 0);
vector<int> t(256, 0);
for (int i = 0; i < (int)S.size(); i++) {
int index_s = S[i] - '0';
int index_t = T[i] - '0';
s[index_s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,910 | 1,040,911 | u725069695 | cpp |
p03252 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
int main(void) {
string s, t;
cin >> s >>... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef pair<int, int> P;
typedef long long ll;
int main(void) {
string s, t;
cin >> s >>... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,914 | 1,040,915 | u744305661 | cpp |
p03252 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s, t;
cin >> s >> t;
unordered_map<char, char> stmap, tsmap;
bool match = true;
for (int i = 0; i < s.size(); ++i) {
if (stm... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main(void) {
string s, t;
cin >> s >> t;
unordered_map<char, char> stmap, tsmap;
bool match = true;
for (int i = 0; i < s.size(); ++i) {
if (stm... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,924 | 1,040,925 | u871841829 | cpp |
p03252 | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
bool flag = true;
rep(i, s.length()) {... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
bool flag = true;
rep(i, s.length()) {... | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,040,936 | 1,040,937 | u539199630 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
string first, second;
char hashT[30];
int intOf(char x) { return x - 'a'; }
int main() {
// ifstream iff ( stdin, ifstream::in );
// ofstream off ( stdout, ofstream::out );
cin >> first >> second;
memset(hashT, 0, sizeof hashT);
bool flag = true;
int sz ... | #include <bits/stdc++.h>
using namespace std;
string first, second;
char hashT[30];
int intOf(char x) { return x - 'a'; }
int main() {
// ifstream iff ( stdin, ifstream::in );
// ofstream off ( stdout, ofstream::out );
cin >> first >> second;
memset(hashT, 0, sizeof hashT);
bool flag = true;
int sz ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,040,940 | 1,040,941 | u251201232 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - '0';
int b = T[i] - '0';
if (start[a] != -1 || goal[b] != -1) {
if (start[a] != b || goal[b] != ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] - 'a';
if (start[a] != -1 || goal[b] != -1) {
if (start[a] != b || goal[b] != ... | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,040,948 | 1,040,949 | u966508131 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] - 'a';
if (start[a] != -1 || goal[b] != -1) {
if (start[a] != b || goal[b] != ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] - 'a';
if (start[a] != -1 || goal[b] != -1) {
if (start[a] != b || goal[b] != ... | [
"assignment.variable.change",
"identifier.change"
] | 1,040,950 | 1,040,949 | u966508131 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - '0';
int b = T[i] - '0';
if (start[a] != -1 || goal[b] != -1) {
if (start[a] != b || goal[b] != ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] - 'a';
if (start[a] != -1 || goal[b] != -1) {
if (start[a] != b || goal[b] != ... | [
"literal.string.change",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change"
] | 1,040,951 | 1,040,949 | u966508131 | cpp |
p03252 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
string begin(26, -1);
string end(26, -1);
bool flag = true;
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] - 'a';
if (begin[i] != -1 || end[i] != -1) {
if (begin[... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
string begin(26, -1);
string end(26, -1);
bool flag = true;
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] - 'a';
if (begin[a] != -1 || end[b] != -1) {
if (begin[... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,040,952 | 1,040,953 | u904123392 | cpp |
p03252 | /**
* Name: Ajay Subhash Jadhav
* Institute: International Institute of Technology Hyderabad
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#... | /**
* Name: Ajay Subhash Jadhav
* Institute: International Institute of Technology Hyderabad
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#... | [
"control_flow.loop.for.remove",
"expression.unary.arithmetic.remove",
"expression.unary.arithmetic.add",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,040,954 | 1,040,955 | u139573956 | cpp |
p03252 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> d1(26, 0);
for (int i = 0; i < S.size(); i++) {
if (d1[S[i] - 'a'] == 0) {
d1[S[i]] = T[i];
} else if (d1[S[i] - 'a'] != T[i]) {
cout << "No" << endl;
re... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> d1(26, 0);
for (int i = 0; i < S.size(); i++) {
if (d1[S[i] - 'a'] == 0) {
d1[S[i] - 'a'] = T[i];
} else if (d1[S[i] - 'a'] != T[i]) {
cout << "No" << endl;
... | [
"assignment.change"
] | 1,040,960 | 1,040,961 | u547844563 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll r, g, b, n;
ll ans = 0, tmp = 0;
int main(void) {
string s, t;
cin >> s >> t;
string m[s.length() + 1][2];
ll n = s.length();
vector<pair<char, char>> p;
vector<char> ch;
for (ll i = 0; i < n; i++) {
p.push_back(make_pair(t[i], s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll r, g, b, n;
ll ans = 0, tmp = 0;
int main(void) {
string s, t;
cin >> s >> t;
string m[s.length() + 1][2];
ll n = s.length();
vector<pair<char, char>> p;
vector<char> ch;
for (ll i = 0; i < n; i++) {
p.push_back(make_pair(t[i], s[... | [
"identifier.change",
"call.arguments.change"
] | 1,040,962 | 1,040,963 | u876784108 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int i, j;
bool same = true;
for (i = 'a'; i <= 'z'; i++) {
char check = '#';
char check2 = '#';
for (j = 0; j < s.length(); j++) {
if (s.at(j) == i && check != '#') {
if (check != t.at(j)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int i, j;
bool same = true;
for (i = 'a'; i <= 'z'; i++) {
char check = '#';
char check2 = '#';
for (j = 0; j < s.length(); j++) {
if (s.at(j) == i && check != '#') {
if (check != t.at(j)) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,967 | 1,040,968 | u989336028 | cpp |
p03252 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
bool equal(vector<ll> v1... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
bool equal(vector<ll> v1... | [] | 1,040,969 | 1,040,970 | u336721073 | cpp |
p03252 | #include <iostream>
#include <map>
#include <vector>
std::map<char, char> m;
std::map<char, char> w;
std::string s, t;
bool all_same = true;
int main() {
std::cin >> s >> t;
for (int i = 0; i < t.size(); i++) {
auto g = w[s[i]];
auto p = m[t[i]];
if (p == '\0') {
m[t[i]] = s[i];
}
if (g =... | #include <iostream>
#include <map>
#include <vector>
std::map<char, char> m;
std::map<char, char> w;
std::string s, t;
bool all_same = true;
int main() {
std::cin >> s >> t;
for (int i = 0; i < t.size(); i++) {
auto g = w[s[i]];
auto p = m[t[i]];
if (p == '\0') {
m[t[i]] = s[i];
}
if (g =... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,040,973 | 1,040,974 | u537538698 | cpp |
p03252 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string s;
string ts;
cin >> s >> ts;
map<char, char> rule_change1{};
map<char, char> rule_change2{};
str... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string s;
string ts;
cin >> s >> ts;
map<char, char> rule_change1{};
map<char, char> rule_change2{};
str... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,040,991 | 1,040,992 | u179987763 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
string s, t;
int ma... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
string s, t;
int ma... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 1,040,993 | 1,040,994 | u620242073 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,041,001 | 1,041,002 | u038027079 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | [
"identifier.change",
"expression.operation.binary.change",
"literal.string.change"
] | 1,041,003 | 1,041,002 | u038027079 | cpp |
p03252 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> alphabet(27);
vector<int> alphabet2(27);
string output = "Yes";
for (int i = 0; i < S.length(); i++) {
if (alphabet[S[i] ... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> alphabet(27);
vector<int> alphabet2(27);
string output = "Yes";
for (int i = 0; i < S.length(); i++) {
if (alphabet[S[i] ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,041,004 | 1,041,005 | u544361885 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> l1(26, -1);
vector<int> l2(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] = 'a';
if (l1[a] != -1 || l2[b] != -1) {
if (l1[a] != b || l2[b] != a) {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
vector<int> l1(26, -1);
vector<int> l2(26, -1);
for (int i = 0; i < S.size(); i++) {
int a = S[i] - 'a';
int b = T[i] - 'a';
if (l1[a] != -1 || l2[b] != -1) {
if (l1[a] != b || l2[b] != a) {
cout... | [] | 1,041,046 | 1,041,047 | u823444917 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <typeinfo>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <typeinfo>
#include <utility>
#include <vector>
using n... | [
"identifier.change",
"call.function.change"
] | 1,041,050 | 1,041,051 | u587217971 | cpp |
p03252 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define M 100000007
using namespace std;
char c;
int a1[30];
int a2[30];
int n = 0;
int main() {
for (int i = 0; i < 26; ++i)
a1[i] = a2[i] = 1;
while (true) {
scanf("%c", &c);
if (c == '\n')
break;
a1[c - 'a'] *= (n++);
if (a1[c ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define M 100000007
using namespace std;
char c;
int a1[30];
int a2[30];
int n = 0;
int main() {
for (int i = 0; i < 26; ++i)
a1[i] = a2[i] = 1;
while (true) {
scanf("%c", &c);
if (c == '\n')
break;
a1[c - 'a'] *= (++n);
if (a1[c ... | [] | 1,041,057 | 1,041,058 | u806661586 | cpp |
p03252 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s, t;
int c1[26] = {}, c2[26] = {};
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
c1[s[i] - 'a']++;
c2[s[i] - 'a']++;
}
sort(c1, c1 + 26);
sort(c2, c2 + 2... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s, t;
int c1[26] = {}, c2[26] = {};
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
c1[s[i] - 'a']++;
c2[t[i] - 'a']++;
}
sort(c1, c1 + 26);
sort(c2, c2 + 2... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,041,063 | 1,041,064 | u855186748 | cpp |
p03253 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) ;
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) ;
i... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,041,091 | 1,041,092 | u350072791 | cpp |
p03253 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 10;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 1000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,041,093 | 1,041,094 | u309168663 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
vector<int> a(26, -1);
vector<int> b(26... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
vector<int> a(26, -1);
vector<int> b(26... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,041,303 | 1,041,304 | u480831358 | cpp |
p03252 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long LL;
using namespace std;
typedef pair<int, int> Pii;
typedef pair<LL, LL> PLL;
const ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long LL;
using namespace std;
typedef pair<int, int> Pii;
typedef pair<LL, LL> PLL;
const ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,041,305 | 1,041,306 | u964392356 | cpp |
p03252 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long LL;
using namespace std;
typedef pair<int, int> Pii;
typedef pair<LL, LL> PLL;
const ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long LL;
using namespace std;
typedef pair<int, int> Pii;
typedef pair<LL, LL> PLL;
const ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,041,307 | 1,041,308 | u964392356 | cpp |
p03252 | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
static int imin = std::numeric_limits<int>::min();
static int imax = std::numeric_limits<int>::max();
#define ll long long
#define rep(i, n)... | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
static int imin = std::numeric_limits<int>::min();
static int imax = std::numeric_limits<int>::max();
#define ll long long
#define rep(i, n)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,041,318 | 1,041,319 | u068362919 | cpp |
p03252 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int idx1, idx2;
map<char, int> map1, map2;
string s, t;
cin >> s;
cin >> t;
for (int i = 0; i < s.length(); i++) {
auto it = map1.find(s[i]);
if (it == map1.end()) {
... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int idx1 = 0, idx2 = 0;
map<char, int> map1, map2;
string s, t;
cin >> s;
cin >> t;
for (int i = 0; i < s.length(); i++) {
auto it = map1.find(s[i]);
if (it == map1.end(... | [
"variable_declaration.value.change"
] | 1,041,322 | 1,041,323 | u507408564 | cpp |
p03252 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,041,327 | 1,041,328 | u559823804 | cpp |
p03252 | // Template
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1000000007;
#define v_exists(elem, v) find(v.begin(), v.end(), elem) ... | // Template
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int MOD = 1000000007;
#define v_exists(elem, v) find(v.begin(), v.end(), elem) ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,041,331 | 1,041,332 | u604896914 | cpp |
p03252 | #include <fstream>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
map<char, char> mpSConv;
map<char, char> mpTConv;
int main() {
#ifdef FOR_IDE
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
string strS, strT;
int max_loop;
bool judge = true;
cin ... | #include <fstream>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
map<char, char> mpSConv;
map<char, char> mpTConv;
int main() {
#ifdef FOR_IDE
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
string strS, strT;
int max_loop;
bool judge = true;
cin ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,041,335 | 1,041,336 | u717315282 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
con... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
con... | [
"assignment.variable.change",
"identifier.change"
] | 1,041,342 | 1,041,343 | u406158207 | cpp |
p03252 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
con... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
con... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,041,344 | 1,041,345 | u406158207 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,041,346 | 1,041,347 | u895971408 | cpp |
p03252 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0}... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0}... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,041,348 | 1,041,349 | u181039779 | cpp |
p03252 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
int b = t[i] - 'a';
if (start[a] != -1 || goal[b] != -1) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<int> start(26, -1);
vector<int> goal(26, -1);
for (int i = 0; i < s.size(); i++) {
int a = s[i] - 'a';
int b = t[i] - 'a';
if (start[a] != -1 || goal[... | [
"import.add",
"assignment.variable.change",
"identifier.change"
] | 1,041,375 | 1,041,376 | u904097134 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string x, y;
int z[256] = {};
int zz[256] = {};
cin >> x >> y;
for (int a = 0; a < (int)x.size(); a++) {
if (z[(int)x[a]] == 0)
z[(int)x[a]] = (int)y[a];
else if (z[(int)x[a]] != (int)y[a]) {
cout << "No" <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string x, y;
int z[256] = {};
int zz[256] = {};
cin >> x >> y;
for (int a = 0; a < (int)x.size(); a++) {
if (z[(int)x[a]] == 0)
z[(int)x[a]] = (int)y[a];
else if (z[(int)x[a]] != (int)y[a]) {
cout << "No" <... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,041,417 | 1,041,418 | u036561304 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string x, y;
int z[256] = {};
int zz[256] = {};
cin >> x >> y;
for (int a = 0; a < (int)x.size(); a++) {
if (z[(int)x[a]] == 0)
z[(int)x[a]] = (int)y[a];
else if (z[(int)x[a]] != (int)y[a]) {
cout << "No" <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string x, y;
int z[256] = {};
int zz[256] = {};
cin >> x >> y;
for (int a = 0; a < (int)x.size(); a++) {
if (z[(int)x[a]] == 0)
z[(int)x[a]] = (int)y[a];
else if (z[(int)x[a]] != (int)y[a]) {
cout << "No" <... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,041,419 | 1,041,418 | u036561304 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
int a[10005];
int b[10005];
int main() {
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
a[s[i]]++;
b[t[i]]++;
}
for (int i = 0; i < 200; i++) {
for (int j = 0; j < 200; j++) {
if (a[i] == b[j]) {
a[i] = b[j] = 0;
}... | #include <bits/stdc++.h>
using namespace std;
int a[10005];
int b[10005];
int main() {
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
a[s[i]]++;
b[t[i]]++;
}
for (int i = 0; i < 200; i++) {
for (int j = 0; j < 200; j++) {
if (a[i] == b[j]) {
a[i] = b[j] = 0;
}... | [
"control_flow.branch.if.condition.change"
] | 1,041,429 | 1,041,430 | u940054416 | cpp |
p03252 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using veci = vector<int>;
using vecll = vector<ll>;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using veci = vector<int>;
using vecll = vector<ll>;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#d... | [
"assignment.value.change",
"identifier.change",
"assignment.variable.change",
"assignment.change",
"assignment.add"
] | 1,041,453 | 1,041,454 | u799441268 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.