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 |
|---|---|---|---|---|---|---|---|
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> Vec(N);
for (int i = 0; i < N; i++) {
cin >> Vec.at(i);
sort(Vec.at(i).begin(), Vec.at(i).end());
}
sort(Vec.begin(), Vec.end());
/*for(int i=0; i<3; i++){
cout<<Vec.at(i)<<" ";
}*/
int Sum = 0;
int C... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> Vec(N);
for (int i = 0; i < N; i++) {
cin >> Vec.at(i);
sort(Vec.at(i).begin(), Vec.at(i).end());
}
sort(Vec.begin(), Vec.end());
/*for(int i=0; i<3; i++){
cout<<Vec.at(i)<<" ";
}*/
long long Sum = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,500 | 747,501 | u196629968 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> Words;
int Sum = 0;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
Sum += Words[S];
Words[S]++;
}
cout << Sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> Words;
long long Sum = 0;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
Sum += Words[S];
Words[S]++;
}
cout << Sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,502 | 747,503 | u196629968 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stri... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stri... | [
"variable_declaration.type.change"
] | 747,504 | 747,505 | u788461451 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
... | [
"type_conversion.add"
] | 747,508 | 747,509 | u652150585 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
string strings[N];
string input;
getline(cin, input);
for (int i = 0; i < N; i++) {
getline(cin, input);
strings[i] = input;
sort(strings[i].begin(), strings[i].end());
}
sort(strings, strings + N);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
string strings[N];
string input;
getline(cin, input);
for (int i = 0; i < N; i++) {
getline(cin, input);
strings[i] = input;
sort(strings[i].begin(), strings[i].end());
}
sort(strings, strings + N);
... | [
"variable_declaration.type.widen.change"
] | 747,510 | 747,511 | u837542104 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
string strings[N];
string input;
getline(cin, input);
for (int i = 0; i < N; i++) {
getline(cin, input);
strings[i] = input;
sort(strings[i].begin(), strings[i].end());
}
sort(strings, strings + N);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
string strings[N];
string input;
getline(cin, input);
for (int i = 0; i < N; i++) {
getline(cin, input);
strings[i] = input;
sort(strings[i].begin(), strings[i].end());
}
sort(strings, strings + N);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"cont... | 747,512 | 747,511 | u837542104 | cpp |
p02947 | #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string array[n];
REPI(i, n) cin >> array[i];
REPI(i, n) sort(array[i... | #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string array[n];
REPI(i, n) cin >> array[i];
REPI(i, n) sort(array[i... | [
"variable_declaration.type.change"
] | 747,515 | 747,516 | u505466816 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<string> pq;
REP(i, n) {
string x;
cin >> x;
sort(x.begin(), x.end());
pq.pu... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<string> pq;
REP(i, n) {
string x;
cin >> x;
sort(x.begin(), x.end());
pq.pu... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,517 | 747,518 | u505466816 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
ci... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
ci... | [
"variable_declaration.type.change"
] | 747,523 | 747,524 | u732817215 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define int long long
signed main() {
int N, ans, tv;
std::cin >> N;
std::string temp;
std::map<std::string, int> dictionary;
for (int i = 0; i < N; i++) {
std::cin >> temp;
std::sort(temp.begin(), temp.end());
dictionary[te... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define int long long
signed main() {
int N, ans = 0, tv;
std::cin >> N;
std::string temp;
std::map<std::string, int> dictionary;
for (int i = 0; i < N; i++) {
std::cin >> temp;
std::sort(temp.begin(), temp.end());
dictionar... | [
"variable_declaration.value.change"
] | 747,525 | 747,526 | u425830382 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(void) {
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp.at(s)++;
}
long long ans = 0;
for (auto &p : mp)... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(void) {
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p : mp) {
in... | [
"call.remove",
"call.arguments.change"
] | 747,531 | 747,532 | u477343425 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(void) {
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp.at(s)++;
}
long long ans = 0;
for (auto &p : mp)... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(void) {
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p : mp) {
... | [
"call.remove",
"call.arguments.change"
] | 747,531 | 747,533 | u477343425 | cpp |
p02947 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
typedef long long int ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
typedef long long int ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
... | [
"variable_declaration.type.change"
] | 747,534 | 747,535 | u438265890 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string tmp;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
vec.at(i) = tmp;
// cout << vec.at(i) << endl;
}
sort(vec.begin(), vec.end());
vec.push_back("-1");
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string tmp;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
vec.at(i) = tmp;
// cout << vec.at(i) << endl;
}
sort(vec.begin(), vec.end());
vec.push_back("-1");
s... | [
"variable_declaration.type.widen.change"
] | 747,542 | 747,543 | u190875453 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
using itn = int;
using namespace std;
using Graph = vector<vector<int>>;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
cin >> N;
... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
#define REP(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
using itn = int;
using namespace std;
using Graph = vector<vector<int>>;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
cin >> N;
... | [
"variable_declaration.type.change"
] | 747,546 | 747,547 | u089885969 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <stack>
#include <unordered_map>
#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];
}
unordered_map<string, int> ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <stack>
#include <unordered_map>
#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];
}
unordered_map<string, long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,552 | 747,553 | u762677575 | cpp |
p02947 | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "... | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i <= (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "... | [
"variable_declaration.type.change"
] | 747,554 | 747,555 | u952289831 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, int> ns;
string s;
for (int i = 0; i < N; ++i) {
cin >> s;
sort(s.begin(), s.end());
ns[s]++;
}
ll ans = 0;
for (auto n : ns) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, ll> ns;
string s;
for (int i = 0; i < N; ++i) {
cin >> s;
sort(s.begin(), s.end());
ns[s]++;
}
ll ans = 0;
for (auto n : ns) {
a... | [] | 747,556 | 747,557 | u231541008 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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());
}
map<string, int> num{};
for (int i = 0; i < n; i++) {
num[s[i]]++;
}
ll ans = 0;
for (aut... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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());
}
map<string, ll> num{};
for (int i = 0; i < n; i++) {
num[s[i]]++;
}
ll ans = 0;
for (auto... | [] | 747,558 | 747,559 | u893584578 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vs(n);
for (int i = 0; i < n; i++)
cin >> vs[i];
map<string, int> mp;
for (int i = 0; i < n; i++) {
sort(vs[i].begin(), vs[i].end());
mp[vs[i]]++;
}
long long ans = 0;
for (auto i : mp)
ans += (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vs(n);
for (int i = 0; i < n; i++)
cin >> vs[i];
map<string, long long> mp;
for (int i = 0; i < n; i++) {
sort(vs[i].begin(), vs[i].end());
mp[vs[i]]++;
}
long long ans = 0;
for (auto i : mp)
an... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,560 | 747,561 | u150376070 | cpp |
p02947 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#d... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#d... | [
"variable_declaration.type.change"
] | 747,566 | 747,567 | u452512115 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 747,568 | 747,569 | u115838990 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
in... | [
"call.arguments.change"
] | 747,570 | 747,569 | u115838990 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
co... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
co... | [
"variable_declaration.type.change"
] | 747,573 | 747,574 | u571173211 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i,... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i,... | [
"variable_declaration.type.change"
] | 747,579 | 747,580 | u374929478 | cpp |
p02947 | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
ll mySigma(ll n) {
int result = 0;
for (int i = 0; i < n; i++) {
result += (i + 1);
}
return result;
}
int s[100000][10];
int main() {
int N;
ll ss[100000];
scanf("%d", &N);
f... | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
ll mySigma(ll n) {
ll result = 0;
for (int i = 0; i < n; i++) {
result += (i + 1);
}
return result;
}
int s[100000][10];
int main() {
int N;
ll ss[100000];
scanf("%d", &N);
fo... | [
"variable_declaration.type.change"
] | 747,583 | 747,584 | u915389871 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | [
"variable_declaration.type.change"
] | 747,585 | 747,586 | u118340517 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------... | [
"variable_declaration.type.change"
] | 747,585 | 747,587 | u118340517 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a;
string s;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a;
string s;
cin >> n;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a * 1... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 747,588 | 747,589 | u983711104 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a;
string s;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a * 26LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a;
string s;
cin >> n;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a * 1... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 747,590 | 747,589 | u983711104 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a;
string s;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a;
string s;
cin >> n;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a * 2... | [] | 747,588 | 747,591 | u983711104 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a;
string s;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a * 26LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a;
string s;
cin >> n;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
int tmp[26] = {};
cin >> s;
for (char c : s) {
tmp[c - 'a']++;
}
a = 0;
for (int j = 0; j < 26; j++) {
a = a * 2... | [] | 747,590 | 747,591 | u983711104 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [
"function.return_type.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,592 | 747,593 | u876386943 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,594 | 747,593 | u876386943 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 747,595 | 747,596 | u184335045 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.add"
] | 747,597 | 747,596 | u184335045 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define veci(x, n) vector<int> x((int)(n))
#define vecs(x, n) vector<string> x((int)(n))
#define vecbf(x, n) vector<bool> x((int)(n), false)
long comb(int a) { return (a * (a - 1)) / 2; }
int main() {
int n;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define veci(x, n) vector<int> x((int)(n))
#define vecs(x, n) vector<string> x((int)(n))
#define vecbf(x, n) vector<bool> x((int)(n), false)
long comb(long a) { return (a * (a - 1)) / 2; }
int main() {
int n;
cin >>... | [
"variable_declaration.type.primitive.change"
] | 747,598 | 747,599 | u184335045 | cpp |
p02947 | // C
#include <cassert>
//#include <cctype>
#include <ccomplex>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <... | // C
#include <cassert>
//#include <cctype>
#include <ccomplex>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <... | [
"variable_declaration.type.primitive.change"
] | 747,602 | 747,603 | u685346012 | cpp |
p02947 | // C
#include <cassert>
//#include <cctype>
#include <ccomplex>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <... | // C
#include <cassert>
//#include <cctype>
#include <ccomplex>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <... | [
"assignment.value.change",
"variable_declaration.type.primitive.change"
] | 747,604 | 747,603 | u685346012 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
#define revall(v) v.rbegin(), v.rend... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
#define revall(v) v.rbegin(), v.rend... | [] | 747,605 | 747,606 | u480831358 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
ll N, sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
ll N, sum = 0;
... | [] | 747,607 | 747,608 | u579754454 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sort(A.at(i).begin(), A.at(i).end());
}
map<string, int> mp;
for (int i = 0; i < N;... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sort(A.at(i).begin(), A.at(i).end());
}
map<string, long long> mp;
for (int i = 0; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,611 | 747,612 | u868205915 | cpp |
p02947 | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#include <bits/stdc++.h>
using ll = long long;
using pii = std::p... | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#include <bits/stdc++.h>
using ll = long long;
using pii = std::p... | [] | 747,613 | 747,614 | u954176652 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int s = p.second;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto p : mp) {
int s = p.second;
... | [
"type_conversion.add"
] | 747,615 | 747,616 | u147556624 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int s = p.second;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto p : mp) {
int s = p.second;
... | [
"assignment.value.change"
] | 747,617 | 747,616 | u147556624 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int s = p.second;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int s = p.second;... | [
"assignment.value.change"
] | 747,617 | 747,618 | u147556624 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <fstream>
#include <iterator>
#include <map>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <cct... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
//#include <stdio.h>
//#include <stack>
//#include <queue>
//#include <cstdio>
#include <cmath>
#include <fstream>
#include <iterator>
#include <map>
//#include <list>
#include <iomanip>
//#include <stdlib.h>
//#include <cct... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 747,619 | 747,620 | u565624841 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
using ll = long long;
int main() {
int n, ans = 0;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &e : mp) {
ans... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll n, ans = 0;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &e : mp) {
ans ... | [
"variable_declaration.type.change"
] | 747,621 | 747,622 | u720483676 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
l... | [
"variable_declaration.type.change"
] | 747,633 | 747,634 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
l... | [
"variable_declaration.type.change"
] | 747,635 | 747,634 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
l... | [
"variable_declaration.type.change",
"call.remove",
"call.arguments.change"
] | 747,636 | 747,634 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
l... | [
"variable_declaration.type.change",
"call.remove",
"call.arguments.change"
] | 747,637 | 747,634 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
int count = p.se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
l... | [
"variable_declaration.type.change",
"call.remove",
"call.arguments.change"
] | 747,638 | 747,634 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
int count = p.se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
l... | [
"variable_declaration.type.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 747,639 | 747,634 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
l... | [
"variable_declaration.type.change"
] | 747,633 | 747,641 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"type_conversion.add"
] | 747,633 | 747,642 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [] | 747,635 | 747,642 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"call.arguments.change"
] | 747,636 | 747,642 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"call.arguments.change"
] | 747,643 | 747,642 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"call.arguments.change"
] | 747,637 | 747,642 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
int count = p.se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"call.arguments.change"
] | 747,638 | 747,642 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
int count = p.se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"type_conversion.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 747,639 | 747,642 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
int count = p.se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"call.arguments.change"
] | 747,638 | 747,647 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
int count = p.se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"call.arguments.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 747,644 | 747,647 | u021755470 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
int count = p.se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
// string w;
map<string, int> mp;
rep(i, N) {
string w;
cin >> w;
sort(w.begin(), w.end());
mp[w]++;
}
ll ans = 0;
for (auto &p : mp) {
i... | [
"type_conversion.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 747,639 | 747,647 | u021755470 | cpp |
p02947 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | [
"variable_declaration.type.change"
] | 747,648 | 747,649 | u899220667 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
unordered_map<string, int> T;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
T[s]++;
}
for (const auto &p : T) {
sum += p.second * (p.second - 1) / 2;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
unordered_map<string, long> T;
long sum = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
T[s]++;
}
for (const auto &p : T) {
sum += p.second * (p.second - 1) / 2;
}
cout << s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 747,650 | 747,651 | u423656246 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
unordered_map<string, int> T;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
T[s] += 1;
}
for (const auto &p : T) {
sum += p.second * (p.second - 1) / 2;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
unordered_map<string, long> T;
long sum = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
T[s]++;
}
for (const auto &p : T) {
sum += p.second * (p.second - 1) / 2;
}
cout << s... | [
"variable_declaration.type.primitive.change"
] | 747,652 | 747,651 | u423656246 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | [
"variable_declaration.type.change"
] | 747,653 | 747,654 | u471212175 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) fo... | [] | 747,657 | 747,658 | u410506856 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int64_t comb2(int n) { return n * (n - 1) / 2; }
int main() {
int n;
cin >> n;
vector<vector<char>> character(n, vector<char>(10));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 10; ++j) {
cin >> character.at(i).at(j);
}
sort(character.at(i)... | #include <bits/stdc++.h>
using namespace std;
int64_t comb2(int64_t n) { return n * (n - 1) / 2; }
int main() {
int n;
cin >> n;
vector<vector<char>> character(n, vector<char>(10));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 10; ++j) {
cin >> character.at(i).at(j);
}
sort(character.a... | [
"variable_declaration.type.primitive.change"
] | 747,659 | 747,660 | u294683729 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
map<string, ll> A; // map<キー型,値型> 変数名
rep(i, N) {
string a;
cin >> a;
sort(a.begin(), a.end());
A[a]++;
}
ll ans = 0;
for (auto i : A) { //キー値を... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, ll> A;
rep(i, N) {
string a;
cin >> a;
sort(a.begin(), a.end());
A[a]++;
}
ll ans = 0;
for (auto i : A) {
ll x = i.second;
... | [
"variable_declaration.type.change"
] | 747,663 | 747,664 | u764860452 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
map<string, ll> A; // map<キー型,値型> 変数名
rep(i, N) {
string a;
cin >> a;
sort(a.begin(), a.end());
A[a]++;
}
ll ans = 0;
for (auto i : A) { //キー値を... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
map<string, ll> A; // map<キー型,値型> 変数名
rep(i, N) {
string a;
cin >> a;
sort(a.begin(), a.end());
A[a]++;
}
ll ans = 0;
for (auto i : A) { //キー値を文... | [
"variable_declaration.type.change"
] | 747,663 | 747,665 | u764860452 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int s = p.second... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int s = p.second... | [
"assignment.value.change"
] | 747,668 | 747,669 | u681559222 | cpp |
p02947 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 747,676 | 747,677 | u519883882 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [
"variable_declaration.type.primitive.change"
] | 747,678 | 747,679 | u518883877 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
sort(p.at(i).begin(), p.at(i).end());
}
sort(p.begin(), p.end());
long long int c = 0;
int t = 0;
while (t < N - 1) {
int a = 1;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
sort(p.at(i).begin(), p.at(i).end());
}
sort(p.begin(), p.end());
long long int c = 0;
int t = 0;
while (t < N - 1) {
long long int a = 1;
for... | [
"variable_declaration.type.widen.change"
] | 747,680 | 747,681 | u985686845 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
sort(p.at(i).begin(), p.at(i).end());
}
sort(p.begin(), p.end());
long long int c = 0;
int t = 0;
while (t < N - 1) {
int a = 1;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
sort(p.at(i).begin(), p.at(i).end());
}
sort(p.begin(), p.end());
long long int c = 0;
long long int t = 0;
while (t < N - 1) {
long long int a = ... | [
"variable_declaration.type.widen.change"
] | 747,680 | 747,682 | u985686845 | cpp |
p02947 | #include <bits/stdc++.h>
#define __dist_rep(a1, a2, a3, f, ...) f
#define __rep2(i, n) for (int i = 0; i < n; ++i)
#define __rep3(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) __dist_rep(__VA_ARGS__, __rep3, __rep2)(__VA_ARGS__)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fore(a, x) for (aut... | #include <bits/stdc++.h>
#define __dist_rep(a1, a2, a3, f, ...) f
#define __rep2(i, n) for (int i = 0; i < n; ++i)
#define __rep3(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) __dist_rep(__VA_ARGS__, __rep3, __rep2)(__VA_ARGS__)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fore(a, x) for (aut... | [] | 747,683 | 747,684 | u936392950 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<char>> a(n, vector<char>(10));
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < 10; j++) {
a.at(i).at(j) = s.at(j);
}
sort(a.at(i).begin(), a.at(i).end());
}
sort(a.begin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<char>> a(n, vector<char>(10));
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < 10; j++) {
a.at(i).at(j) = s.at(j);
}
sort(a.at(i).begin(), a.at(i).end());
}
sort(a.begin... | [
"variable_declaration.type.widen.change"
] | 747,685 | 747,686 | u356701928 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using std::cin;
using std::cout;
int main(int argc, char *argv[]) {
int n;
cin >> n;
std::vector<std::string> s(n);
for (int i = 0; i < n; ++i) {
std::string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
s[i] = tmp;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using std::cin;
using std::cout;
int main(int argc, char *argv[]) {
int n;
cin >> n;
std::vector<std::string> s(n);
for (int i = 0; i < n; ++i) {
std::string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
s[i] = tmp;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,687 | 747,688 | u494904204 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long ans;
int n;
unordered_map<string, int> m;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.find(s) != m.end()) {
m[s]++;
} else {
m.emplace(s, 1);
}
}
for (auto ... | #include <bits/stdc++.h>
using namespace std;
long long ans;
int n;
unordered_map<string, int> m;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.find(s) != m.end()) {
m[s]++;
} else {
m.emplace(s, 1);
}
}
for (auto ... | [
"assignment.change"
] | 747,689 | 747,690 | u694951525 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
sort(vec[i].begin(), vec[i].end... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
sort(vec[i].begin(), vec[i].end... | [
"type_conversion.add"
] | 747,691 | 747,692 | u428132025 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
sort(vec[i].begin(), vec[i].end... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
sort(vec[i].begin(), vec[i].end... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 747,693 | 747,692 | u428132025 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed <... | [] | 747,696 | 747,697 | u774417629 | 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++) {
string s;
cin >> s;
sort(s.begin(), s.end());
S[i] = s;
}
sort(S.begin(), S.end());
int res = 0, cnt = 0;
string prev;
for ... | #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++) {
string s;
cin >> s;
sort(s.begin(), s.end());
S[i] = s;
}
sort(S.begin(), S.end());
long long res = 0, cnt = 0;
string pre;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 747,698 | 747,699 | u188117876 | 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[i] << endl;
}
unordered_map<string, long long int> table;
int answer ... | #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[i] << endl;
}
unordered_map<string, long long int> table;
long long i... | [
"variable_declaration.type.widen.change"
] | 747,700 | 747,701 | u180716041 | cpp |
p02947 | #include <iostream>
using namespace std;
#include <algorithm>
#include <string>
#include <unordered_map>
unordered_map<string, int> m;
int main() {
int i, j, n, k, l, count = 0;
cin >> n;
string s;
// sort(s[0].begin(),s[0].end());
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
coun... | #include <iostream>
using namespace std;
#include <algorithm>
#include <string>
#include <unordered_map>
unordered_map<string, long long int> m;
int main() {
long long int i, j, n, k, l, count = 0;
cin >> n;
string s;
// sort(s[0].begin(),s[0].end());
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin()... | [
"variable_declaration.type.widen.change"
] | 747,713 | 747,714 | u476054945 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> m;
unsigned long long ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
auto itr = m.find(s);
if (itr == m.end())
m[s] = 1;
else
m[s] += 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, unsigned long long> m;
unsigned long long ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
auto itr = m.find(s);
if (itr == m.end())
m[s] = 1;
else
... | [
"variable_declaration.type.primitive.change"
] | 747,715 | 747,716 | u068586753 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n;
cin >> n;
char c[n][10];
for (i = 0; i < n; i++) {
for (j = 0; j < 10; j++)
cin >> c[i][j];
}
for (i = 0; i < n; i++)
sort(c[i], c[i] + 10);
string s[n];
for (i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n;
cin >> n;
char c[n][10];
for (i = 0; i < n; i++) {
for (j = 0; j < 10; j++)
cin >> c[i][j];
}
for (i = 0; i < n; i++)
sort(c[i], c[i] + 10);
string s[n];
for (i = 0; i < n; i++) {
... | [
"variable_declaration.type.change"
] | 747,717 | 747,718 | u952130512 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, ans = 0;
cin >> N;
vector<vector<char>> s(N, vector<char>(10));
map<vector<char>, int> M;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> s... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, ans = 0;
cin >> N;
vector<vector<char>> s(N, vector<char>(10));
map<vector<char>, long long> M;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
ci... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,724 | 747,725 | u987913144 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"variable_declaration.type.change"
] | 747,726 | 747,727 | u298620933 | cpp |
p02947 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"variable_declaration.type.change"
] | 747,728 | 747,729 | u378419207 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
map<string, int> mp;
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
auto itr = mp.find(s);
if (itr != mp.end()) {
mp[s]++;
ans += mp[s];
} else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
map<string, long int> mp;
long int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
auto itr = mp.find(s);
if (itr != mp.end()) {
mp[s]++;
ans += mp[s];
}... | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 747,732 | 747,733 | u224590796 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
long long n;
std::cin >> n;
std::map<string, int> ma;
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
std::cin >> s;
sort(s.begin(), s.end());
if (ma[s] != 0) {
ans += ma[s];... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
long long n;
std::cin >> n;
std::map<string, int> ma;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
std::cin >> s;
sort(s.begin(), s.end());
if (ma[s] != 0) {
ans += ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,734 | 747,735 | u280097533 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) {
cin >> S.at(i);
sort(S.at(i).begin(), S.at(i).end());
}
long long ans = 0;
sort(S.begin(), S.end());
int i = 1, sum = 0;
rep(i, N - ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) {
cin >> S.at(i);
sort(S.at(i).begin(), S.at(i).end());
}
long long ans = 0;
sort(S.begin(), S.end());
int i = 1;
long long sum = 0;
... | [
"variable_declaration.type.widen.change"
] | 747,736 | 747,737 | u347057617 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
ll ans = 0;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) { sort(s[i].begin(), s[i].end()); }
s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
ll ans = 0;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) { sort(s[i].begin(), s[i].end()); }
s... | [
"variable_declaration.type.change"
] | 747,740 | 747,741 | u199343957 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
ll ans = 0;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) { sort(s[i].begin(), s[i].end()); }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
ll ans = 0;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) { sort(s[i].begin(), s[i].end()); }
s... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 747,743 | 747,741 | u199343957 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
map<string, int> p;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += p[s];
p[s]++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
map<string, int> p;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += p[s];
p[s]++;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,744 | 747,745 | u305141544 | cpp |
p02947 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 1001001001;
ll combination(int x, int y) {
if (x < y)
return 0;
ll a = 1;
ll b = 1;
rep(i, y) {
a *= i + 1;
b *= x - i;
}
return b / a;
}
int main() {
int n;
cin >> ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 1001001001;
ll combination(int x, int y) {
if (x < y)
return 0;
ll a = 1;
ll b = 1;
rep(i, y) {
a *= i + 1;
b *= x - i;
}
return b / a;
}
int main() {
int n;
cin >> ... | [
"variable_declaration.type.change"
] | 747,754 | 747,755 | u405620865 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.