problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (1000000007);
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto x : m) {
ll buf = (x.se... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (1000000007);
int main() {
ll n;
cin >> n;
unordered_map<string, ll> m;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto x : m) {
ll buf = (x.secon... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,578 | 749,579 | u493491082 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100001];
int n, cnt = 1, ans;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i], sort(s[i].begin(), s[i].end());
sort(s, s + n);
// for (int i=0;i<n;++i) cout<<s[i]<<endl;
for (i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
string s[100001];
ll n, cnt = 1, ans;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i], sort(s[i].begin(), s[i].end());
sort(s, s + n);
// for (int i=0;i<n;++i) cout<<... | [
"variable_declaration.type.change"
] | 749,580 | 749,581 | u878056971 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k = 0, l, n, m;
cin >> m;
string s[m];
for (i = 0; i < m; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
map<string, int> mymap;
for (i = 0; i < m; i++) {
if (mymap.find(s[i]) == mymap.end()) {
// initialize it e... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k = 0, l, n, m;
cin >> m;
string s[m];
for (i = 0; i < m; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
map<string, long long> mymap;
for (i = 0; i < m; i++) {
if (mymap.find(s[i]) == mymap.end()) {
// ini... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,582 | 749,583 | u390437117 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int num = 1;
long ans = 0;
for (int i = 1; i < N; i++) {
if (s[i] == s[i - 1])
num+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long num = 1;
long ans = 0;
for (int i = 1; i < N; i++) {
if (s[i] == s[i - 1])
num... | [
"variable_declaration.type.primitive.change"
] | 749,584 | 749,585 | u689245321 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long ans;
char c[100010][13];
vector<string> v;
int main() {
int n;
string tmp;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> c[i];
sort(c[i], c[i] + 10);
for (int j = 0; j < 10; j++) {
tmp.append(1, c[i][j]);
}
// cout<<tmp<<endl;
... | #include <bits/stdc++.h>
using namespace std;
unsigned long long ans;
char c[100010][13];
vector<string> v;
int main() {
int n;
string tmp;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> c[i];
sort(c[i], c[i] + 10);
for (int j = 0; j < 10; j++) {
tmp.append(1, c[i][j]);
}
// cout<<tm... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 749,586 | 749,587 | u866828359 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<vector<char>> ss(n, vector<char>(10));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++) {
ss[i][j] = s[i][j];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<vector<char>> ss(n, vector<char>(10));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++) {
ss[i][j] = s[i][j];
... | [
"variable_declaration.type.change"
] | 749,590 | 749,591 | u794565416 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<string> v;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
v.push_back(S);
}
sort(v.begin(), v.end());
ll ans = 0;
int tmp = 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<string> v;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
v.push_back(S);
}
sort(v.begin(), v.end());
ll ans = 0;
ll tmp = 1;... | [
"variable_declaration.type.change"
] | 749,592 | 749,593 | u872581897 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
const int MAX_N = 1e3 + 10;
int N;
string S[MAX_N];
cin >> N;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
int a[10];
for (int j = 0; j < 10; ++j) {
a[j] = s[j] - 0;
}
sort(a, a + 1... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
const int MAX_N = 1e5 + 10;
int N;
string S[MAX_N];
cin >> N;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
int a[10];
for (int j = 0; j < 10; ++j) {
a[j] = s[j] - 0;
}
sort(a, a + 1... | [
"literal.number.change",
"expression.operation.binary.change"
] | 749,594 | 749,595 | u128142352 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
string s[maxn];
int m, n;
map<string, int> ma;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end())... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
string s[maxn];
int m, n;
map<string, int> ma;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end())... | [
"variable_declaration.type.change"
] | 749,596 | 749,597 | u914135866 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#define foreach(c, itr) \
for (__typeof((c).begin(), (c).end()) itr = c.begin(); itr != c.end(); itr++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#define foreach(c, itr) \
for (__typeof((c).begin(), (c).end()) itr = c.begin(); itr != c.end(); itr++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long long> mp;
for (int i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,598 | 749,599 | u811897616 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
char s[11];
string ss[200001];
bool issame(string a, string b) {
for (int i = 1; i <= 10; ++i) {
if (a[i] != b[i])
return false;
}
return true;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s + 1);
sort(s + 1... | #include <bits/stdc++.h>
using namespace std;
char s[11];
string ss[200001];
bool issame(string a, string b) {
for (int i = 0; i < 10; ++i) {
if (a[i] != b[i])
return false;
}
return true;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s + 1);
sort(s + 1,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 749,600 | 749,601 | u910114570 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
char s[11];
string ss[200001];
bool issame(string a, string b) {
for (int i = 1; i <= 10; ++i) {
if (a[i] != b[i])
return false;
}
return true;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s + 1);
sort(s + 1... | #include <bits/stdc++.h>
using namespace std;
char s[11];
string ss[200001];
bool issame(string a, string b) {
for (int i = 0; i < 10; ++i) {
if (a[i] != b[i])
return false;
}
return true;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s + 1);
sort(s + 1,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 749,602 | 749,601 | u910114570 | cpp |
p02947 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#define ll long long
#define il inline
#define rgi register int
using namespace std;
const int N = 100000 + 10;
int n, cnt, ans;
set<string> s;
map<string, int> vis;
il i... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#define ll long long
#define il inline
#define rgi register ll
using namespace std;
const int N = 100000 + 10;
ll n, cnt, ans;
set<string> s;
map<string, ll> vis;
il ll r... | [
"preprocessor.define.value.change",
"variable_declaration.type.change",
"identifier.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,603 | 749,604 | u469810874 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> m;
int n, sum = 0;
cin >> n;
while (n--) {
char a[11];
string s1;
cin >> a;
sort(a, a + 10);
for (int i = 0; i < 10; i++) {
s1 += a[i];
}
m[s1]++;
}
map<string, int>::iterator it;
for (it = m.beg... | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> m;
long long n, sum = 0;
cin >> n;
while (n--) {
char a[11];
string s1;
cin >> a;
sort(a, a + 10);
for (int i = 0; i < 10; i++) {
s1 += a[i];
}
m[s1]++;
}
map<string, int>::iterator it;
for (it =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,605 | 749,606 | u333991119 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N_MAX = 100000;
int main() {
int n, i, j, t;
long long res = 0;
string s[N_MAX];
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
for (i = 1, j = 0; i < n; i++)
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N_MAX = 100000;
int main() {
int n, i, j;
long long t, res = 0;
string s[N_MAX];
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
for (i = 1, j = 0; i < n; i++)
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 749,610 | 749,611 | u784283302 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.... | [
"variable_declaration.type.change"
] | 749,615 | 749,616 | u008582165 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
vector<char> vc;
for (size_t j = 0; j < 10; j++) {
vc.push_back(s[i][j]);
}
sort(vc.begin(), vc.end());
s[i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
vector<char> vc;
for (size_t j = 0; j < 10; j++) {
vc.push_back(s[i][j]);
}
sort(vc.begin(), vc.end());
s[i... | [
"variable_declaration.type.primitive.change"
] | 749,617 | 749,618 | u737252485 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
S[i] = tmp;
}
sort(S.begin(), S.end());
S.push_back("");
lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
S[i] = tmp;
}
sort(S.begin(), S.end());
S.push_back("");
lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,628 | 749,629 | u570018655 | cpp |
p02947 | /*Author: Gautam*/
#include <bits/stdc++.h>
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace s... | /*Author: Gautam*/
#include <bits/stdc++.h>
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace s... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,630 | 749,631 | u689000653 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
map<map<char, int>, int> pairs;
int main() {
int n;
string str;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> str;
map<char, int> m;
for (char c : str) {
m[c]++;
}
pairs[m]++;
}
int result = 0;
for (auto ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
map<map<char, int>, int> pairs;
int main() {
int n;
string str;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> str;
map<char, int> m;
for (char c : str) {
m[c]++;
}
pairs[m]++;
}
long long result = 0;
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,632 | 749,633 | u427073088 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long lo... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,636 | 749,637 | u269278772 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL long long unsigned
#define LD long double
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FLR(i, n) for (LL i = 0; i < n; i++)
#define RFOR(i, n) for (int i = n - 1; i >= 0; i--)
#define RFLR(i, n) for (LL i = n - 1; i >= 0; i--)
#de... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL long long unsigned
#define LD long double
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FLR(i, n) for (LL i = 0; i < n; i++)
#define RFOR(i, n) for (int i = n - 1; i >= 0; i--)
#define RFLR(i, n) for (LL i = n - 1; i >= 0; i--)
#de... | [
"variable_declaration.type.change"
] | 749,638 | 749,639 | u939474202 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const ll MOD = 1e9 + 7;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const ll MOD = 1e9 + 7;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", ... | [] | 749,645 | 749,646 | u123276241 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << e... | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << e... | [
"variable_declaration.type.primitive.change",
"variable_declaration.remove"
] | 749,652 | 749,653 | u977554186 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
vector<string> s;
string str;
int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> str;
sort(begin(str), end(str));
s.push_back(str);
}
sort(begin(... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
vector<string> s;
string str;
long long int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> str;
sort(begin(str), end(str));
s.push_back(str);
}
s... | [
"variable_declaration.type.widen.change"
] | 749,654 | 749,655 | u426462442 | cpp |
p02947 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
class CGreenBin {
public:
void solve(std::istream &cin, std::ostream &cout) {
int n;
cin >> n;
vector<string> S(n... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
class CGreenBin {
public:
void solve(std::istream &cin, std::ostream &cout) {
int n;
cin >> n;
vector<string> S(n... | [
"literal.number.type.widen.change"
] | 749,656 | 749,657 | u268793453 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++)
sort(s[i].begin(), s[i].end());
// cout <<s[0]<<endl;
map<string, int> card; // 名前→成績
for (int i = 0; i < N; i++) {
if (card.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++)
sort(s[i].begin(), s[i].end());
// cout <<s[0]<<endl;
map<string, long> card; // 名前→成績
for (int i = 0; i < N; i++) {
if (card... | [
"variable_declaration.type.primitive.change"
] | 749,658 | 749,659 | u223172354 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int i, j;
for (i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int equre = 0;
long long result = 0;
for (i = 1; i ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int i, j;
for (i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long long equre = 0;
long long result = 0;
for (i =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,667 | 749,668 | u883104091 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int N;
map<string, int> m;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
string si;
cin >> si;
sort(si.begin(), si.end());
m[si]++;
}
long long sum = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) {
sum += it->... | #include <bits/stdc++.h>
using namespace std;
int N;
map<string, int> m;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
string si;
cin >> si;
sort(si.begin(), si.end());
m[si]++;
}
long long sum = 0;
for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) {
sum += it->... | [
"assignment.change"
] | 749,669 | 749,670 | u740650265 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length(); j++) {
for (int k = j + 1; k < s[i].length(); k++) {
if (s[i][k] < s[i][j])
swap(s[i][k], s[i][j]);
}
... | #include <bits/stdc++.h>
using namespace std;
string s[100001];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
for (int j = 0; j < s[i].length(); j++) {
for (int k = j + 1; k < s[i].length(); k++) {
if (s[i][k] < s[i][j])
swap(s[i][k], s[i][j]);
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,673 | 749,674 | u718954939 | cpp |
p02947 | // AtCoder
// Beginner Contest 137
// C - Green Bin
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll, int> PLI;
typedef pair<int, int> ... | // AtCoder
// Beginner Contest 137
// C - Green Bin
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll, int> PLI;
typedef pair<int, int> ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"call.remove"
] | 749,675 | 749,676 | u576105797 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
string s[N];
map<string, int> mp;
int main() {
int n;
int t;
scanf("%d", &n);
mp.clear();
for (int i = 0; i < n; ++i) {
cin >> s[i];
// cout<<s[i]<<endl;
sort(s[i].begin(), s[i].end());
// cout<<s[i]<<endl;
mp[s[i]]++;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
string s[N];
map<string, long long> mp;
int main() {
int n;
int t;
scanf("%d", &n);
mp.clear();
for (int i = 0; i < n; ++i) {
cin >> s[i];
// cout<<s[i]<<endl;
sort(s[i].begin(), s[i].end());
// cout<<s[i]<<endl;
mp[s[i]]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,677 | 749,678 | u812942729 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
string s[N];
map<string, int> mp;
int main() {
int n;
int t;
scanf("%d", &n);
mp.clear();
for (int i = 0; i < n; ++i) {
cin >> s[i];
// cout<<s[i]<<endl;
sort(s[i].begin(), s[i].end());
// cout<<s[i]<<endl;
mp[s[i]]++;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
string s[N];
map<string, long long> mp;
int main() {
int n;
int t;
scanf("%d", &n);
mp.clear();
for (int i = 0; i < n; ++i) {
cin >> s[i];
// cout<<s[i]<<endl;
sort(s[i].begin(), s[i].end());
// cout<<s[i]<<endl;
mp[s[i]]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,679 | 749,678 | u812942729 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss[n];
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ss[i] = s;
}
sort(ss, ss + n);
long long idx1 = 0;
long long idx2 = 1;
long long ans = 0;
while (idx1 < n) {
whi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss[n];
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ss[i] = s;
}
sort(ss, ss + n);
long long idx1 = 0;
long long idx2 = 1;
long long ans = 0;
while (idx1 < n) {
whi... | [
"assignment.value.change"
] | 749,680 | 749,681 | u313766957 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss[n];
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ss[i] = s;
}
sort(ss, ss + n);
int idx1 = 0;
int idx2 = 1;
long long ans = 0;
while (idx1 < n) {
while (idx2 < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string ss[n];
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ss[i] = s;
}
sort(ss, ss + n);
long long idx1 = 0;
long long idx2 = 1;
long long ans = 0;
while (idx1 < n) {
whi... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change"
] | 749,682 | 749,681 | u313766957 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
map<string, int> mp;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto item : mp) {
// cout<<item... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
map<string, ll> mp;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto item : mp) {
// cout<<item.... | [] | 749,683 | 749,684 | u781659997 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
// vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 998244353;
const int INF = 0x3f3f3f3f;
const ... | #include "bits/stdc++.h"
using namespace std;
// vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 998244353;
const int INF = 0x3f3f3f3f;
const ... | [
"assignment.change"
] | 749,687 | 749,688 | u559507546 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<vector<int>> vvi;
#define clr(a, b) memset(a, b, sizeof(a))
#define pb push_back
#define frpn(x) ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<vector<int>> vvi;
#define clr(a, b) memset(a, b, sizeof(a))
#define pb push_back
#define frpn(x) ... | [
"variable_declaration.type.change"
] | 749,689 | 749,690 | u882821419 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
map<string, int> m;
int n, ans;
string s, s1[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
for (int j = 0; j < 10; j++)
for (int k = 1; k < 10; k++)
if (s[j] > s[k])
swap(s[j], s[k]);
m[s]++;
s1[i] = s;
... | #include <bits/stdc++.h>
using namespace std;
map<string, long long> m;
long long n, ans;
string s, s1[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
for (int j = 0; j < 10; j++)
for (int k = 1; k < 10; k++)
if (s[j] > s[k])
swap(s[j], s[k]);
m[s]++;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,691 | 749,692 | u051670389 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
ll ans = 0;
string str;
map<string, int> mp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.b... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
ll ans = 0;
string str;
map<string, ll> mp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.beg... | [
"variable_declaration.type.change"
] | 749,699 | 749,700 | u525363585 | cpp |
p02947 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
string s;
map<string, int> m{};
rep(i, N) {
cin >> s;
sort(s.begin(), s.end());
// cout << s << endl;
m[s]++;
}
ll ans = 0;
for (auto itr = m.... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
string s;
map<string, int> m{};
rep(i, N) {
cin >> s;
sort(s.begin(), s.end());
// cout << s << endl;
m[s]++;
}
ll ans = 0;
for (auto itr = m.... | [
"variable_declaration.type.change"
] | 749,701 | 749,702 | u555962250 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<string> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
sort(v[i].begin(), v[i].end());
map<string, i... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long n;
cin >> n;
vector<string> v(n);
for (long i = 0; i < n; i++)
cin >> v[i];
for (long i = 0; i < n; i++)
sort(v[i].begin(), v[i].end());
map<string... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 749,703 | 749,704 | u874258059 | cpp |
p02947 | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
const long long mod = 998244353;
int main() {
int N;
scanf("%d", &N);
std::string *s = new std::string[N];
for (int i = 0; i < N; i++) {
char q[11];
scanf("%s", q);
std::sort(q, q + 10);
... | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
const long long mod = 998244353;
int main() {
int N;
scanf("%d", &N);
std::string *s = new std::string[N];
for (int i = 0; i < N; i++) {
char q[11];
scanf("%s", q);
std::sort(q, q + 10);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,705 | 749,706 | u617987447 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define per(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define debug(x) cerr << #x << ' ' << x << endl;
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 7;
int main() {
int n;
cin >> n;
map<string, int> mp;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define per(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define debug(x) cerr << #x << ' ' << x << endl;
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 7;
int main() {
int n;
cin >> n;
map<string, ll> mp;
... | [
"assignment.change"
] | 749,707 | 749,708 | u613520453 | cpp |
p02947 | #include <algorithm>
#include <stdio.h>
int n, x;
char s[100000][15];
long long a[100000];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
std::sort(s[i], s[i] + 10);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++) {
a[i] *= 26;
... | #include <algorithm>
#include <stdio.h>
int n;
long long x;
char s[100000][15];
long long a[100000];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
std::sort(s[i], s[i] + 10);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++) {
a[i] *= ... | [
"variable_declaration.type.widen.change"
] | 749,709 | 749,710 | u546925116 | cpp |
p02947 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
string s[100000];
cin >> N;
for (int i(0); i < N; i++)
cin >> s[i];
for (int i(0); i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
int ans(0);
int cnt(1);
for (int i(0);... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
string s[100000];
cin >> N;
for (int i(0); i < N; i++)
cin >> s[i];
for (int i(0); i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
ll ans(0);
ll cnt(1);
for (int i(0); i... | [
"variable_declaration.type.change"
] | 749,711 | 749,712 | u991846372 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e+9;
typedef pair<ll, ll> P;
#define fi first
#define se second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sort(a.at(i).... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e+9;
typedef pair<ll, ll> P;
#define fi first
#define se second
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sort(a.at(i).b... | [
"variable_declaration.type.change"
] | 749,713 | 749,714 | u822169805 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int num;
cin >> num;
vector<string> v;
for (int i = 0; i < ... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int num;
cin >> num;
vector<string> v;
for (int i = 0; i < ... | [
"variable_declaration.type.primitive.change"
] | 749,717 | 749,718 | u881705752 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 100005
int main() {
map<string, int> m;
int t, re = 0;
cin >> t;
while (t--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto it : m) {
re += (it.second * (it.second - 1)) / 2;
}
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mx 100005
int main() {
map<string, ll> m;
ll t, re = 0;
cin >> t;
while (t--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto it : m) {
re += (it.second * (it.second - 1)) / 2;
}
cou... | [
"variable_declaration.type.change"
] | 749,719 | 749,720 | u802094864 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
map<string, long long> str;
int main() {
long long n;
cin >> n;
long long a[n] = {0};
string x;
long long s = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
sort(x.begin(), x.end());
if (str[x] == 0) {
s++;
str[x] = s;
a[s]++;
} el... | #include <bits/stdc++.h>
using namespace std;
map<string, long long> str;
int main() {
long long n;
cin >> n;
long long a[n + 1] = {0};
string x;
long long s = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
sort(x.begin(), x.end());
if (str[x] == 0) {
s++;
str[x] = s;
a[s]++;
... | [
"variable_declaration.array_dimensions.change",
"assignment.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 749,723 | 749,724 | u837133513 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int64_t C(int64_t x) {
int ret = (x * (x - 1)) / 2;
return ret;
}
int main() {
int N;
cin >> N;
vector<char> a(10);
vector<string> b(N);
string k = "abcdefghij";
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> a.at(j);
}
... | #include <bits/stdc++.h>
using namespace std;
int64_t C(int64_t x) {
int64_t ret = (x * (x - 1)) / 2;
return ret;
}
int main() {
int N;
cin >> N;
vector<char> a(10);
vector<string> b(N);
string k = "abcdefghij";
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> a.at(j);
... | [
"variable_declaration.type.primitive.change"
] | 749,725 | 749,726 | u983062344 | cpp |
p02947 | /*
author: diradon
10-Aug-19
17:39:36
*/
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
void count(vector<string> v) {
ll ans = 0;
map<string, int> m;
for (int i = 0; i < v.size(); i++) {
m[v[i]]++;
}
for (auto it = m.begin(); it != m.end(); it++) {
int count = it->second;
... | /*
author: diradon
10-Aug-19
17:39:36
*/
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
void count(vector<string> v) {
ll ans = 0;
map<string, ll> m;
for (ll i = 0; i < v.size(); i++) {
m[v[i]]++;
}
for (auto it = m.begin(); it != m.end(); it++) {
ll count = it->second;
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 749,727 | 749,728 | u837495281 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define fileio fr... | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define fileio fr... | [
"variable_declaration.type.change"
] | 749,729 | 749,730 | u831027829 | cpp |
p02947 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [] | 749,731 | 749,732 | u303039933 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long Cn2(int x) {
if (x % 2 == 0)
return (x / 2) * (x - 1);
else
return ((x - 1) / 2) * x;
}
int main() {
int n;
cin >> n;
map<string, int> mp;
string s;
for (int i = 0; i < n; ++i) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
... | #include <bits/stdc++.h>
using namespace std;
long long Cn2(long long x) {
if (x % 2 == 0)
return (x / 2) * (x - 1);
else
return ((x - 1) / 2) * x;
}
int main() {
long long n;
cin >> n;
map<string, long long> mp;
string s;
for (int i = 0; i < n; ++i) {
cin >> s;
sort(s.begin(), s.end());
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,733 | 749,734 | u878838754 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long ans = 0;
cin >> N;
vector<string> S(N);
for (auto &i : S)
cin >> i;
for (auto &i : S)
sort(i.begin(), i.end());
sort(S.begin(), S.end());
int c = 1;
for (int i = 0; i < N; i++) {
if (i == N - 1) {
ans += c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long ans = 0;
cin >> N;
vector<string> S(N);
for (auto &i : S)
cin >> i;
for (auto &i : S)
sort(i.begin(), i.end());
sort(S.begin(), S.end());
long long c = 1;
for (int i = 0; i < N; i++) {
if (i == N - 1) {
an... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,735 | 749,736 | u573082373 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> ss(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ss[i] = s;
}
sort(ss.... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> ss(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ss[i] = s;
}
sort(ss.... | [
"variable_declaration.type.primitive.change"
] | 749,737 | 749,738 | u538188080 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 100010;
int n, ans;
string str[N];
signed main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> str[i];
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 100010;
int n, ans;
string str[N];
signed main() {
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
cin >> str[i];
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,739 | 749,740 | u287323477 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
s[i] = t;
}
sort(s.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
s[i] = t;
}
sort(s.... | [
"variable_declaration.type.change"
] | 749,747 | 749,748 | u129667379 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int N;
vector<string> S;
long long C2(int suc) { return suc * (suc - 1) / 2; }
int main() {
cin >> N;
string s;
rep(i, N) {
cin >> s;
sort(s.begin(), s.end());
S.push_back(s);
}
sort(S.begin(), S.... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int N;
vector<string> S;
long long C2(long long suc) { return suc * (suc - 1) / 2; }
int main() {
cin >> N;
string s;
rep(i, N) {
cin >> s;
sort(s.begin(), s.end());
S.push_back(s);
}
sort(S.begin... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,749 | 749,750 | u499824662 | cpp |
p02947 | #include <bits/stdc++.h>
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
const int inf = ... | #include <bits/stdc++.h>
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
const int inf = ... | [
"variable_declaration.type.widen.change"
] | 749,751 | 749,752 | u377947781 | cpp |
p02947 | #define rep(i, a, b) for (int i = a; i < b; ++i)
#define repr(i, a, b) for (int i = a; i > b; --i)
#define mm(lamb, tttt) memset(lamb, tttt, sizeof lamb)
#define null NULL
#define eps 0.000000001
#define mod 1000000007
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#d... | #define rep(i, a, b) for (int i = a; i < b; ++i)
#define repr(i, a, b) for (int i = a; i > b; --i)
#define mm(lamb, tttt) memset(lamb, tttt, sizeof lamb)
#define null NULL
#define eps 0.000000001
#define mod 1000000007
#define PI 3.14159265358979323846
#define pb push_back
#define pf push_front
#define mp make_pair
#d... | [] | 749,755 | 749,756 | u853795518 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (ll a = b; a <= c; a++)
#define per(a, b, c) for (ll a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, s... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (ll a = b; a <= c; a++)
#define per(a, b, c) for (ll a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, s... | [
"variable_declaration.type.change"
] | 749,757 | 749,758 | u493249745 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, start, end) for (int i = start; i < end; i++)
#define ll long long
const ll N = 4e3 + 200;
const ll INF = 0x3f3f3f3f;
int main() {
int n;
cin >> n;
std::vector<string> v;
map<string, int> mp;
rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, start, end) for (int i = start; i < end; i++)
#define ll long long
const ll N = 4e3 + 200;
const ll INF = 0x3f3f3f3f;
int main() {
ll n;
cin >> n;
std::vector<string> v;
map<string, ll> mp;
rep(i, n) {... | [
"variable_declaration.type.change"
] | 749,759 | 749,760 | u624688258 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string buf;
map<string, int> t;
for (int i = 0; i < n; i++) {
cin >> buf;
sort(buf.begin(), buf.end());
if (t.count(buf) == 0)
t.insert(make_pair(buf, 1));
else
t.at(buf)++;
}
long long a = 0;
for (a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string buf;
map<string, int> t;
for (int i = 0; i < n; i++) {
cin >> buf;
sort(buf.begin(), buf.end());
if (t.count(buf) == 0)
t.insert(make_pair(buf, 1));
else
t.at(buf)++;
}
long long a = 0;
for (a... | [
"type_conversion.add"
] | 749,761 | 749,762 | u331948661 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
template <typename T> T load() {
T r;
cin >> r;
return r;
}
template <typename T> vector<T> loadMany(int n) {
vector<T> rs(n);
generate(rs.begin(), rs.end(), &load<T>);
return rs;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
auto n = loa... | #include <bits/stdc++.h>
using namespace std;
template <typename T> T load() {
T r;
cin >> r;
return r;
}
template <typename T> vector<T> loadMany(int n) {
vector<T> rs(n);
generate(rs.begin(), rs.end(), &load<T>);
return rs;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
auto n = loa... | [
"type_conversion.add"
] | 749,763 | 749,764 | u870233611 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e5 + 10;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N;
string s[MAX];
int main() {
cin >> N;
rep(i, N) cin >> s[i];
rep(i, N) { sort(s[i].begin()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e5 + 10;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N;
string s[MAX];
int main() {
cin >> N;
rep(i, N) cin >> s[i];
rep(i, N) { sort(s[i].begin()... | [
"type_conversion.add"
] | 749,765 | 749,766 | u992875223 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int n;
map<string, int> mp;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto e : mp) {
int cnt = e.second;
ans += cnt * (cnt - 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int n;
map<string, ll> mp;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto e : mp) {
ll cnt = e.second;
ans += cnt * (cnt - 1) /... | [
"variable_declaration.type.change"
] | 749,767 | 749,768 | u194268736 | cpp |
p02947 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, s, n) for (int i = s; i < n; i++)
#... | [] | 749,771 | 749,772 | u741556152 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"control_flow.loop.for.initializer.change"
] | 749,775 | 749,776 | u514114987 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | [
"variable_declaration.type.change"
] | 749,777 | 749,778 | u239375815 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long fs = 0, n;
string s;
map<string, int> mp;
vector<string> ans;
int main() {
int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
if (mp[s] == 1) {
ans.push_back(s);
}
}
for (i = 0; i < ans.size(... | #include <bits/stdc++.h>
using namespace std;
long long fs = 0, n;
string s;
map<string, long long> mp;
vector<string> ans;
int main() {
long long i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
if (mp[s] == 1) {
ans.push_back(s);
}
}
for (i = 0; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,779 | 749,780 | u038054933 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
#define testin freopen("1.txt", "r", stdin);
#define testout freopen("out.txt", "w", stdout);
#define ll long long
using namespace std;
const int maxn = (int)1e5 + 10;
struct node {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
#define testin freopen("1.txt", "r", stdin);
#define testout freopen("out.txt", "w", stdout);
#define ll long long
using namespace std;
const int maxn = (int)1e5 + 10;
struct node {
... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 749,781 | 749,782 | u558099842 | cpp |
p02947 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> v(N);
for (int i = 0; i... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> v(N);
for (int i = 0; i... | [
"variable_declaration.type.change"
] | 749,785 | 749,786 | u045679746 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ... | [] | 749,787 | 749,788 | u898749314 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.... | [
"expression.operation.binary.remove"
] | 749,793 | 749,794 | u508729896 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
int main(int argc, const char *argv[]) {
int N;
cin >> N;
map<string, int> words;
for (int i = 0; i < N; i++) {
string S;
cin >> ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
int main(int argc, const char *argv[]) {
int N;
cin >> N;
map<string, ll> words;
for (int i = 0; i < N; i++) {
string S;
cin >> S... | [] | 749,795 | 749,796 | u505025747 | cpp |
p02947 | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0])... | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0])... | [
"variable_declaration.type.change"
] | 749,799 | 749,800 | u869595612 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"variable_declaration.type.change"
] | 749,803 | 749,804 | u155416173 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
map<string, int> m;
ll sol;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.count(s))
m[s]++;
else
m.insert({s, 1});
}
for (auto kv : m)
sol... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
map<string, int> m;
ll sol;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.count(s))
m[s]++;
else
m.insert({s, 1});
}
for (auto kv : m)
sol... | [] | 749,809 | 749,810 | u905164447 | cpp |
p02947 | /*
*
* Author : Amit Kumar
* Date : August 10
*
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <mem... | /*
*
* Author : Amit Kumar
* Date : August 10
*
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <mem... | [
"literal.number.type.widen.change"
] | 749,815 | 749,816 | u896543512 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
map<string, int> m;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s] += 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
map<string, int> m;
cin >> n;
long long int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s] += 1;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 749,817 | 749,818 | u225181923 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
long ans = 0;
unordered_map<string, long> mp;
for (int i = 0; i < n; i++) {
char str_s[11];
cin >> str_s;
sort(str_s, str_s + 10);
s[i] = string(str_s);
}
for (int i = 0; i < n; i++) {
mp[s[i]]+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
long ans = 0;
unordered_map<string, long> mp;
for (int i = 0; i < n; i++) {
char str_s[11];
cin >> str_s;
sort(str_s, str_s + 10);
s[i] = string(str_s);
}
for (int i = 0; i < n; i++) {
mp[s[i]]+... | [
"variable_declaration.type.primitive.change"
] | 749,827 | 749,828 | u280512618 | cpp |
p02947 | /*Alohomora*/
#include <bits/stdc++.h>
#define ll long long
#define fl(i, n) for (i = 0; i < n; i++)
#define fld(i, a, b) for (i = a; i > b; i--)
#define fli(i, a, n) for (i = a; i < n; i++)
#define inp(i, a, n) \
for (i = 0; i < n; i++) { ... | /*Alohomora*/
#include <bits/stdc++.h>
#define ll long long
#define fl(i, n) for (i = 0; i < n; i++)
#define fld(i, a, b) for (i = a; i > b; i--)
#define fli(i, a, n) for (i = a; i < n; i++)
#define inp(i, a, n) \
for (i = 0; i < n; i++) { ... | [] | 749,829 | 749,830 | u037844054 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using lint = int64_t;
using namespace std;
int main() {
lint N;
string s[100010] = {};
map<string, lint> m;
cin >> N;
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
m[s[i]]++;
}
... | #include <algorithm>
#include <iostream>
#include <map>
using lint = int64_t;
using namespace std;
int main() {
lint N;
string s[100010] = {};
map<string, lint> m;
cin >> N;
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
m[s[i]]++;
}
... | [
"variable_declaration.type.change"
] | 749,831 | 749,832 | u021423660 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long a[234234], ans;
int b[234], n;
char s[123];
int main() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", s + 1);
for (j = 1; j <= 10; j++)
b[j] = s[j] - 'a';
sort(b + 1, b + 1 + 10);
for (j = 1; j <= 10; j++)
a[... | #include <bits/stdc++.h>
using namespace std;
long long a[234234], ans;
int b[234], n;
char s[123];
int main() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", s + 1);
for (j = 1; j <= 10; j++)
b[j] = s[j] - 'a';
sort(b + 1, b + 1 + 10);
for (j = 1; j <= 10; j++)
a[... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 749,833 | 749,834 | u437187732 | cpp |
p02947 | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int n;
string s;
... | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int n;
string s;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,837 | 749,838 | u172288782 | cpp |
p02947 | // by Himanshu Shukla
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define v32 vector<int>
#define v64 vector<ll>
#define s32 set<int>
#define s64 set<ll>
#define graph vector<s32>
#define p32 pair<... | // by Himanshu Shukla
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define v32 vector<int>
#define v64 vector<ll>
#define s32 set<int>
#define s64 set<ll>
#define graph vector<s32>
#define p32 pair<... | [
"assignment.change"
] | 749,839 | 749,840 | u257192613 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
ll MOD = 1000000007;
int inf = 1000000000;
ll INF = 10000000000000000;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
string u;
cin >> u;
... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
ll MOD = 1000000007;
int inf = 1000000000;
ll INF = 10000000000000000;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
string u;
cin >> u;
... | [
"variable_declaration.type.change"
] | 749,841 | 749,842 | u112775098 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n, ans;
string s;
map<string, int> mp;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s, sort(s.begin(), s.end());
ans += mp[s];
mp[s]++;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, ans;
string s;
map<string, long long> mp;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s, sort(s.begin(), s.end());
ans += mp[s];
mp[s]++;
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,847 | 749,848 | u789439610 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100005];
int n;
map<string, int> mp;
int main() {
int ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
ans += mp[s[i]];
mp[s[i]]++;
}
printf("%d", ans);
} | #include <bits/stdc++.h>
using namespace std;
string s[100005];
int n;
map<string, long> mp;
int main() {
long long ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
ans += mp[s[i]];
mp[s[i]]++;
}
printf("%lld", ans);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,849 | 749,850 | u543848816 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n, ans;
char a[12];
map<string, int> mp;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", a);
sort(a, a + 10);
ans += mp[a];
mp[a]++;
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
long long ans;
char a[12];
map<string, int> mp;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", a);
sort(a, a + 10);
ans += mp[a];
mp[a]++;
}
printf("%lld\n", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,852 | 749,853 | u196341564 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(begin(str), end(str));
mp[str]++;
}
int ans = 0;
for (auto &&i : mp) {
ans += i... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
map<string, long long> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(begin(str), end(str));
mp[str]++;
}
long long ans = 0;
for (auto &&i : mp) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,858 | 749,857 | u752074356 | cpp |
p02947 | #include <bits/stdc++.h>
#define el "\n"
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define M 1000000007
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
in... | #include <bits/stdc++.h>
#define el "\n"
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define M 1000000007
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll... | [
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 749,859 | 749,860 | u245531500 | cpp |
p02947 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define all(x) x.begin(), x.en... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define all(x) x.begin(), x.en... | [
"variable_declaration.type.change"
] | 749,861 | 749,862 | u700986952 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} ... | [] | 749,865 | 749,866 | u366644013 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | [
"variable_declaration.type.change"
] | 749,867 | 749,868 | u004424779 | cpp |
p02947 | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ii pair<int, int>
#define iill pair<ii, ll>
#define ill pair<int, ll>
#define MAXN
#define EPS 1e-9
#define MAXLOG
#define MOD
#define prt(a) printf("%d\n", a)
#define prt2(a, b) printf("%d %d\n", a, b)
#define prt3(a, b, c) printf("%d %d %d\n", a, b, ... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ii pair<int, int>
#define iill pair<ii, ll>
#define ill pair<int, ll>
#define MAXN
#define EPS 1e-9
#define MAXLOG
#define MOD
#define prt(a) printf("%d\n", a)
#define prt2(a, b) printf("%d %d\n", a, b)
#define prt3(a, b, c) printf("%d %d %d\n", a, b, ... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,869 | 749,870 | u934308457 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | [] | 749,871 | 749,872 | u069450081 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unistd.h>
#include <v... | #include <algorithm>
#include <array>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unistd.h>
#include <v... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,873 | 749,874 | u334656323 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.