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 |
|---|---|---|---|---|---|---|---|
p02946 | #include <iostream>
using namespace std;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = x - 2; i < x + 3; i++) {
cout << i << " ";
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int k, x;
cin >> k >> x;
for (int i = x - (k - 1); i < x + k; i++) {
cout << i << " ";
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change"
] | 745,926 | 745,927 | u876653122 | cpp |
p02946 | #include <algorithm>
#include <array>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace... | #include <algorithm>
#include <array>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 745,928 | 745,929 | u162948713 | cpp |
p02946 | #include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int max, min;
max = K + X - 1;
min = X - K + 1;
int p, i;
if (max == min) {
cout << 1;
} else {
for (i = 0; i < 2 * K - 1; i++) {
p = min + i;
cout << p << " ";
}
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
int max, min;
max = K + X - 1;
min = X - K + 1;
int p, i;
if (max == min) {
cout << X;
} else {
for (i = 0; i < 2 * K - 1; i++) {
p = min + i;
cout << p << " ";
}
}
cout << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 745,935 | 745,936 | u466992080 | cpp |
p02947 |
// Problem : C - Green Bin
// Contest : AtCoder - AtCoder Beginner Contest 137
// URL : https://atcoder.jp/contests/abc137/tasks/abc137_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀⠀⠀⠀
⠀⠀⠀⣴⠿⠏⠀⠀⠀⠀⠀⠀⢳⡀⠀
⠀⠀⢠⣟⣋⡀⢀... |
// Problem : C - Green Bin
// Contest : AtCoder - AtCoder Beginner Contest 137
// URL : https://atcoder.jp/contests/abc137/tasks/abc137_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀⠀⠀⠀
⠀⠀⠀⣴⠿⠏⠀⠀⠀⠀⠀⠀⢳⡀⠀
⠀⠀⢠⣟⣋⡀⢀... | [
"variable_declaration.type.change"
] | 745,937 | 745,938 | u197541395 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
unordered_map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto &itr : m) {
int t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
unordered_map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto &itr : m) {
ll t ... | [
"variable_declaration.type.change"
] | 745,941 | 745,942 | u280175105 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
unordered_map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
int ans = 0;
for (auto &itr : m) {
int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
unordered_map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto &itr : m) {
ll t ... | [
"variable_declaration.type.change"
] | 745,943 | 745,942 | u280175105 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, long long> s;
long long ans = 0;
for (int i = 0; i < n; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
if (s.count(t))
s[t] += 1;
else
s[t] = 1;
}
for (auto p : s) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, long long> s;
long long ans = 0;
for (int i = 0; i < n; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
if (s.count(t))
s[t] += 1;
else
s[t] = 1;
}
for (auto p : s) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 745,948 | 745,949 | u948698924 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> s;
long long ans = 0;
for (int i = 0; i < n; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
if (s.count(t))
s[t] += 1;
else
s[t] = 1;
}
for (auto p : s) {
int x... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, long long> s;
long long ans = 0;
for (int i = 0; i < n; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
if (s.count(t))
s[t] += 1;
else
s[t] = 1;
}
for (auto p : s) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 745,950 | 745,949 | u948698924 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define INF 1000000100
#define rep(i, n) for (int i = 0; i < n; i++)
i... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define INF 1000000100
#define rep(i, n) for (int i = 0; i < n; i++)
i... | [
"type_conversion.add"
] | 745,953 | 745,954 | u991650542 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
int main() {
using namespace std;
int n, cnt = 0;
cin >> n;
std::string si;
map<std::string, int> m;
for (int i = 0; i < n; i++) {
cin >> si;
// cout << "x";
sort(si.begin(), si.end());
// cout << "y";
if (m.count(si))
cnt +=... | #include <algorithm>
#include <iostream>
#include <map>
int main() {
using namespace std;
long long n, cnt = 0;
cin >> n;
std::string si;
map<std::string, long long> m;
for (long long i = 0; i < n; i++) {
cin >> si;
sort(si.begin(), si.end());
if (m.count(si))
cnt += m[si];
m[si]++;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 745,957 | 745,958 | u826103718 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int ans = 0;
for (auto p : mp) {
ans += p.second * (p.second - 1) / 2;
}
cout << ans;... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
unordered_map<string, long long> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto p : mp) {
ans += p.second * (p.second - 1) / 2;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 745,964 | 745,965 | u507114778 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long K = 0;
map<string, int> mp;
cin >> N;
vector<string> v(N);
for (int X = 0; X < N; X++) {
cin >> v[X];
sort(v[X].begin(), v[X].end());
mp[v[X]]++;
}
for (auto p : mp) {
auto V = p.second;
K += V * (V - 1) / 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long K = 0;
map<string, long long> mp;
cin >> N;
vector<string> v(N);
for (int X = 0; X < N; X++) {
cin >> v[X];
sort(v[X].begin(), v[X].end());
mp[v[X]]++;
}
for (auto p : mp) {
auto V = p.second;
K += V * (V - ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 745,966 | 745,967 | u740002394 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s[i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s[i... | [] | 745,968 | 745,969 | u530957410 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
map<string, int> anag;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (anag.find(s) != anag.e... | #include <bits/stdc++.h>
#define int long long
#define pq priority_queue
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
map<string, int> anag;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (anag.find(s) != a... | [
"identifier.change",
"function.return_type.change",
"variable_declaration.type.change"
] | 745,970 | 745,971 | u323819429 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define SORT(s) sort((s).begin(), (s).end())
#define SORTD(s) sort((s).rbegin(), (s).rend())
ll choose(ll a) { // aC2
return (a - 1) * a / 2;
}
int main() {
int n;
cin >> n;
vector<string> s(n);... | //全然分からなかったから見返すとき用
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define SORT(s) sort((s).begin(), (s).end())
#define SORTD(s) sort((s).rbegin(), (s).rend())
ll choose(ll a) { // aC2
return (a - 1) * a / 2; //組み合わせを求める式
... | [
"variable_declaration.type.change"
] | 745,974 | 745,975 | u096030913 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define SORT(s) sort((s).begin(), (s).end())
#define SORTD(s) sort((s).rbegin(), (s).rend())
ll choose(ll a) { // aC2
return (a - 1) * a / 2;
}
int main() {
int n;
cin >> n;
vector<string> s(n);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define SORT(s) sort((s).begin(), (s).end())
#define SORTD(s) sort((s).rbegin(), (s).rend())
ll choose(ll a) { // aC2
return (a - 1) * a / 2;
}
int main() {
ll n;
cin >> n;
vector<string> s(n);
... | [
"variable_declaration.type.change"
] | 745,974 | 745,976 | u096030913 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main() {
int n;
cin >> n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main() {
int n;
cin >> n... | [
"variable_declaration.type.change"
] | 745,979 | 745,980 | u006167882 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main() {
int n;
cin >> n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
int main() {
int n;
cin >> n;
map<s... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.change"
] | 745,979 | 745,982 | u006167882 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<char>> S(N, vector<char>(10));
for (int i = 0; i < N; i++) {
cin >> S.at(i).at(0) >> S.at(i).at(1) >> S.at(i).at(2) >> S.at(i).at(3) >>
S.at(i).at(4) >> S.at(i).at(5) >> S.at(i).at(6) >> S.at(i).at(7) >>
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<char>> S(N, vector<char>(10));
for (int i = 0; i < N; i++) {
cin >> S.at(i).at(0) >> S.at(i).at(1) >> S.at(i).at(2) >> S.at(i).at(3) >>
S.at(i).at(4) >> S.at(i).at(5) >> S.at(i).at(6) >> S.at(i).at(7) >>
... | [
"variable_declaration.type.primitive.change"
] | 745,989 | 745,990 | u453366189 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
#define rep(n) for (int i = 0; i < n; ++i)
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
vector<string> vec(n);
rep(n) {
cin >> vec[i];
sort(vec[i].begin(), vec[i].end());
}
sort(vec.begin... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
#define rep(n) for (int i = 0; i < n; ++i)
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
vector<string> vec(n);
rep(n) {
cin >> vec[i];
sort(vec[i].begin(), vec[i].end());
}
sort(vec.begin... | [
"variable_declaration.type.change"
] | 745,991 | 745,992 | u870415620 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string tmp;
int ans = 0;
map<string, int> s;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
if (s.count(tmp)) {
ans += s.at(tmp);
s.at(tmp)++;
} else
s[tmp] = 1;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string tmp;
int64_t ans = 0;
map<string, int> s;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
if (s.count(tmp)) {
ans += s.at(tmp);
s.at(tmp)++;
} else
s[tmp] = 1;
}
c... | [
"variable_declaration.type.primitive.change"
] | 745,995 | 745,996 | u285486772 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string, int>;
const double PI = acos(-1);
int main() {
ll n;
cin >> n;
map<string, ll> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
... | [
"variable_declaration.type.change"
] | 745,997 | 745,998 | u425086757 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
string S;
map<string, int> M;
int ans = 0;
rep(i, N) {
cin >> S;
sort(S.begin(), S.end());
if (M.count(S))
M[S]++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
string S;
map<string, int> M;
ll ans = 0;
rep(i, N) {
cin >> S;
sort(S.begin(), S.end());
if (M.count(S))
M[S]++;
... | [
"variable_declaration.type.change"
] | 745,999 | 746,000 | u078435079 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
int n;
const int max_n = 1e5;
string s[max_n + 1];
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++) c... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main() {
int n;
const int max_n = 1e5;
string s[max_n + 1];
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++) c... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 746,001 | 746,002 | u906832993 | cpp |
p02947 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | [] | 746,005 | 746,006 | u510989601 | cpp |
p02947 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | [] | 746,007 | 746,006 | u510989601 | cpp |
p02947 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | [] | 746,008 | 746,006 | u510989601 | cpp |
p02947 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = ... | [
"variable_declaration.type.change"
] | 746,009 | 746,006 | u510989601 | cpp |
p02947 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int choose(int i) { return ... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll choose(ll i) { return i ... | [] | 746,010 | 746,011 | u510989601 | cpp |
p02947 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int choose(int i) { return ... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll choose(ll i) { return i ... | [] | 746,012 | 746,011 | u510989601 | cpp |
p02947 | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), ... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), ... | [
"variable_declaration.type.change"
] | 746,013 | 746,014 | u547099897 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
int n;
cin >> n;
vector<string> ss(n);
for (int i = 0; i < n; i++)
cin >> ss[i];
map<string, int> m;
for (int i = 0; i < n; i++) {
auto s = ss[i];
sort(s.begin(), s.end());
if (m.count(s) == 0)
m[s] = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
int n;
cin >> n;
vector<string> ss(n);
for (int i = 0; i < n; i++)
cin >> ss[i];
map<string, ll> m;
for (int i = 0; i < n; i++) {
auto s = ss[i];
sort(s.begin(), s.end());
if (m.count(s) == 0)
m[s] = 0;
... | [] | 746,017 | 746,018 | u619273584 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | [] | 746,019 | 746,020 | u319279308 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int n;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int n;
c... | [
"type_conversion.add"
] | 746,028 | 746,029 | u225642513 | cpp |
p02947 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | [
"variable_declaration.type.widen.change"
] | 746,030 | 746,031 | u264265458 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i;
long long Sum = 0;
string s;
map<string, int> S;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
S[s]++;
}
for (auto p : S) {
Sum += p.second * (p.second - 1) / 2;
}
cout << Sum << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i;
long long Sum = 0;
string s;
map<string, long long> S;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
S[s]++;
}
for (auto p : S) {
Sum += p.second * (p.second - 1) / 2;
}
cout << Sum << ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,036 | 746,037 | u319965179 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, Sum = 0;
string s;
map<string, int> S;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
S[s]++;
}
for (auto p : S) {
Sum += p.second * (p.second - 1) / 2;
}
cout << Sum << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i;
long long Sum = 0;
string s;
map<string, long long> S;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
S[s]++;
}
for (auto p : S) {
Sum += p.second * (p.second - 1) / 2;
}
cout << Sum << ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,038 | 746,037 | u319965179 | cpp |
p02947 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | [
"literal.string.change",
"call.arguments.change",
"variable_declaration.type.change"
] | 746,043 | 746,044 | u950002813 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i,... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i,... | [
"variable_declaration.value.change"
] | 746,048 | 746,049 | u605168157 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | [
"variable_declaration.type.change"
] | 746,050 | 746,051 | u164181205 | cpp |
p02947 | // 6/30 解き直し
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
map<string, int> mp;
rep(i, n) {
sort(s... | // 6/30 解き直し
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
map<string, ll> mp;
rep(i, n) {
sort(s[... | [] | 746,054 | 746,055 | u581094488 | cpp |
p02947 | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
//#define for(i, K, N) for(int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, Ans = 0;
cin >> N;
map<string, int> MAP;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(ALL(s));
... | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
//#define for(i, K, N) for(int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, Ans = 0;
cin >> N;
map<string, ll> MAP;
for (ll i = 0; i < N; i++) {
string s;
cin >> s;
sort(ALL(s));
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 746,056 | 746,057 | u551500493 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0)
return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n;
cin >> n;
vector<string> s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0)
return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n;
cin >> n;
vector<string> s... | [
"variable_declaration.type.change"
] | 746,058 | 746,059 | u608773191 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0)
return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n;
cin >> n;
vector<string> s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0)
return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n;
cin >> n;
vector<string> s... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 746,060 | 746,059 | u608773191 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end())
#define Reverse(ve... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end())
#define Reverse(ve... | [
"variable_declaration.type.change"
] | 746,063 | 746,064 | u906839513 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | [
"variable_declaration.type.change"
] | 746,065 | 746,066 | u184572586 | cpp |
p02947 | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(), (x).end()
#define print... | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric> // accumulate(begin,end,初期値)
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(), (x).end()
#define print... | [
"assignment.value.change",
"assignment.change"
] | 746,067 | 746,068 | u184572586 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | [
"variable_declaration.type.change"
] | 746,071 | 746,072 | u811321379 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | [
"variable_declaration.type.change"
] | 746,073 | 746,072 | u811321379 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | [
"variable_declaration.type.change"
] | 746,074 | 746,075 | u811321379 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end())... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end())... | [
"variable_declaration.type.change"
] | 746,076 | 746,077 | u816145694 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> x;
int ans = 0;
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 2e9;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, ll> x;
ll ans = 0;
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].en... | [
"variable_declaration.type.change"
] | 746,078 | 746,079 | u816145694 | cpp |
p02947 | #include <bits/stdc++.h>
//#define <- プログラムの文字列を置換する
// typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template <class TYPE> struct edge {
TYPE to, cost;
edge(TYPE t, TYPE c... | #include <bits/stdc++.h>
//#define <- プログラムの文字列を置換する
// typedef <- 新しい型に名前を付けるためのキーワード
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template <class TYPE> struct edge {
TYPE to, cost;
edge(TYPE t, TYPE c... | [] | 746,080 | 746,081 | u705561278 | cpp |
p02947 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
rep(i, N) { cin >> S[i]; }
rep(i, N) { sort(S[i].begin(), S[i].end()); }
long ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
rep(i, N) { cin >> S[i]; }
rep(i, N) { sort(S[i].begin(), S[i].end()); }
long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,082 | 746,083 | u805392425 | cpp |
p02947 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
rep(i, N) { cin >> S[i]; }
rep(i, N) { sort(S[i].begin(), S[i].end()); }
long ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
rep(i, N) { cin >> S[i]; }
rep(i, N) { sort(S[i].begin(), S[i].end()); }
long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,082 | 746,084 | u805392425 | cpp |
p02947 | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | [
"variable_declaration.type.change"
] | 746,085 | 746,086 | u229582356 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &it : mp) {
ans += (long... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &it : mp) {
ans += (long... | [] | 746,089 | 746,090 | u058720266 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &it : mp) {
ans += it.se... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &it : mp) {
ans += (long... | [
"type_conversion.add"
] | 746,091 | 746,090 | u058720266 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll combi(int x) {
if (x < 2)
return 0;
else {
return x * (x - 1) / 2;
}
}
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll combi(int x) {
if (x < 2)
return 0;
else {
return (ll)x * (x - 1) / 2;
}
}
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {... | [
"type_conversion.add"
] | 746,092 | 746,093 | u058720266 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<map<char, int>, int> m;
while (n--) {
string s;
cin >> s;
map<char... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<map<char, ll>, ll> m;
while (n--) {
string s;
cin >> s;
map<char, ... | [
"variable_declaration.type.change"
] | 746,094 | 746,095 | u528388170 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long nCr(const long long n, long long r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
long long result = 1;
for (long long i = 1; i... | #include <bits/stdc++.h>
using namespace std;
long long nCr(const long long n, long long r) {
if (n == 0) {
return 0;
}
if (r == 0) {
return 1;
}
if (r == 1) {
return n;
}
if (n == r) {
return 1;
}
if (r > n / 2) {
r = n / 2;
}
long long result = 1;
for (long long i = 1; i... | [
"assignment.change"
] | 746,096 | 746,097 | u367131219 | cpp |
p02947 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,098 | 746,099 | u100459591 | cpp |
p02947 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,100 | 746,099 | u100459591 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
// 47
typedef long long ll;
int main() {
int n;
cin >> n;
// vector<string> v(n);
map<string, int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
// sort(v.begin(),v.end());
// int ans = 0;
// map... | #include "bits/stdc++.h"
using namespace std;
// 47
typedef long long ll;
int main() {
int n;
cin >> n;
// vector<string> v(n);
map<string, int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
// sort(v.begin(),v.end());
// int ans = 0;
// map... | [
"assignment.change"
] | 746,104 | 746,105 | u403668916 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
// 47
typedef long long ll;
int main() {
int n;
cin >> n;
// vector<string> v(n);
map<string, int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
// sort(v.begin(),v.end());
// int ans = 0;
// map... | #include "bits/stdc++.h"
using namespace std;
// 47
typedef long long ll;
int main() {
int n;
cin >> n;
// vector<string> v(n);
map<string, int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
// sort(v.begin(),v.end());
// int ans = 0;
// map... | [
"assignment.change"
] | 746,106 | 746,105 | u403668916 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
// 47
typedef long long ll;
int main() {
int n;
cin >> n;
// vector<string> v(n);
map<string, int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
// sort(v.begin(),v.end());
// int ans = 0;
// map... | #include "bits/stdc++.h"
using namespace std;
// 47
typedef long long ll;
int main() {
int n;
cin >> n;
// vector<string> v(n);
map<string, ll> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
// sort(v.begin(),v.end());
// int ans = 0;
// map<... | [] | 746,106 | 746,107 | u403668916 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n;
long long ans;
char s2[10];
string s[123456], h;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++)
cin >> s2[j];
sort(s2, s2 + 10);
s[i] = {s2[0], s2[1], s2[2], s2[3], s2[4],
s2[5], s2[6], s2[7], s2[8]... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n;
long long ans;
char s2[10];
string s[123456], h;
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++)
cin >> s2[j];
sort(s2, s2 + 10);
s[i] = {s2[0], s2[1], s2[2], s2[3], s2[4],
s... | [
"variable_declaration.type.primitive.change"
] | 746,108 | 746,109 | u943070796 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int inf = 100100;
int main() {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll cnt = 0;
for (auto x : m) {
auto value = x.second;
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int inf = 100100;
int main() {
ll n;
cin >> n;
map<string, ll> m;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll cnt = 0;
for (auto x : m) {
auto value = x.second;
if (val... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 746,110 | 746,111 | u282807996 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | [
"variable_declaration.type.primitive.change"
] | 746,112 | 746,113 | u209457657 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long nc2(long long a) { return a * (a - 1) / 2; }
int main() {
long long n;
cin >> n;
vector<string> arr(n);
map<string, long long> mp;
for (long long i = 0; i < n; i++) {
cin >> arr[i];
sort(arr[i].begin(), arr[i].end());
mp[arr[i]]++;
}
... | #include <bits/stdc++.h>
using namespace std;
long long nc2(long long a) { return a * (a - 1) / 2; }
int main() {
long long n;
cin >> n;
vector<string> arr(n);
map<string, long long> mp;
for (long long i = 0; i < n; i++) {
cin >> arr[i];
sort(arr[i].begin(), arr[i].end());
mp[arr[i]]++;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,121 | 746,122 | u814501862 | cpp |
p02947 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // dequef
#includ... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // dequef
#includ... | [] | 746,123 | 746,124 | u396266329 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
map<string, int> mp;
int ans = 0;
rep(i, n) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
map<string, int> mp;
ll ans = 0;
rep(i, n) {... | [
"variable_declaration.type.change"
] | 746,125 | 746,126 | u186506670 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int, int>
int main() {
int N;
cin >> N;
string s... | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int, int>
int main() {
int N;
cin >> N;
string s... | [] | 746,127 | 746,128 | u474180590 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
rep(i, n) {
cin >> s[i];
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
rep(i, n) {
cin >> s[i];
... | [
"variable_declaration.type.change"
] | 746,129 | 746,130 | u789673498 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll res = 0;
map<string, int> table;
rep(i, n) {
string s;
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll res = 0;
map<string, ll> table;
rep(i, n) {
string s;
cin ... | [] | 746,131 | 746,132 | u423665486 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
//************** StrAnge.R *********************
#define ll long long int
#define ull unsigned long l... | #include <bits/stdc++.h>
using namespace std;
/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
//************** StrAnge.R *********************
#define ll long long int
#define ull unsigned long l... | [
"variable_declaration.type.change"
] | 746,133 | 746,134 | u655790107 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, long long int> Map(N);
vector<string> S(N, "");
for (int i = 0; i < N; ++i)
cin >> S[i];
int cnt = 0;
for (int i = 0; i < N; ++i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, long long int> Map(N);
vector<string> S(N, "");
for (int i = 0; i < N; ++i)
cin >> S[i];
long long int cnt = 0;
for (int i = 0; ... | [
"variable_declaration.type.widen.change"
] | 746,139 | 746,140 | u358765098 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | [
"type_conversion.add"
] | 746,141 | 746,142 | u825601908 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
map<string, int> m{};
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
if (m.count(s) == 0) {
m.insert(make_pair(s, 1));
} else {
m[s] = m[s] + 1;
}
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
map<string, long long> m{};
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
if (m.count(s) == 0) {
m.insert(make_pair(s, 1));
} else {
m[s] = m[s] + 1;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,143 | 746,144 | u891945807 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
map<string, int> m{};
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
if (m.count(s) == 0) {
m.insert(make_pair(s, 1));
} else {
m[s] = m[s] + 1;
}
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
map<string, long long> m{};
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
if (m.count(s) == 0) {
m.insert(make_pair(s, 1));
} else {
m[s] = m[s] + 1;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,145 | 746,144 | u891945807 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<string> &rvsStr) {
int nStrSiz;
cin >> nStrSiz;
rvsStr.resize(nStrSiz);
for (string &rsStr : rvsStr)
cin >> rsStr;
}
int64_t fnAnagramCnt(const vector<string> &cnrvsStr) {
vector<string> vsSortStr(cnrvsStr);
for (int i = 0; i < vsSort... | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<string> &rvsStr) {
int nStrSiz;
cin >> nStrSiz;
rvsStr.resize(nStrSiz);
for (string &rsStr : rvsStr)
cin >> rsStr;
}
int64_t fnAnagramCnt(const vector<string> &cnrvsStr) {
vector<string> vsSortStr(cnrvsStr);
for (int i = 0; i < vsSort... | [
"variable_declaration.type.primitive.change"
] | 746,146 | 746,147 | u439912527 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::map<std::string, int> m;
for (int i = 0; i < n; ++i) {
std::string t;
std::cin >> t;
std::sort(t.begin(), t.end());
++m[t];
}
long sum = 0;
for (auto i : m) {
int c = ... | #include <algorithm>
#include <iostream>
#include <map>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::map<std::string, int> m;
for (int i = 0; i < n; ++i) {
std::string t;
std::cin >> t;
std::sort(t.begin(), t.end());
++m[t];
}
long sum = 0;
for (auto i : m) {
long c =... | [
"variable_declaration.type.primitive.change"
] | 746,148 | 746,149 | u089888152 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::map<std::string, int> m;
for (int i = 0; i < n; ++i) {
std::string t;
std::cin >> t;
std::sort(t.begin(), t.end());
++m[t];
}
int sum = 0;
for (auto i : m) {
int c = i... | #include <algorithm>
#include <iostream>
#include <map>
int main(int argc, char *argv[]) {
int n;
std::cin >> n;
std::map<std::string, int> m;
for (int i = 0; i < n; ++i) {
std::string t;
std::cin >> t;
std::sort(t.begin(), t.end());
++m[t];
}
long sum = 0;
for (auto i : m) {
long c =... | [
"variable_declaration.type.primitive.change"
] | 746,150 | 746,149 | u089888152 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
co... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
co... | [
"variable_declaration.type.change"
] | 746,151 | 746,152 | u322110493 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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());
}
sort(s.begin(), s.end());
ll ans = 0;
int streak = 1;
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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());
}
sort(s.begin(), s.end());
ll ans = 0;
ll streak = 1;
for (int i = 1;... | [
"variable_declaration.type.change"
] | 746,155 | 746,156 | u083494782 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n;
cin >> n;
string s[n];
map<string, int> num;
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
num[s[i]]++;
}
ll ans = 0;
f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n;
cin >> n;
string s[n];
map<string, ll> num;
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
num[s[i]]++;
}
ll ans = 0;
fo... | [] | 746,157 | 746,158 | u938028169 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> a;
vector<char> tmp(10);
for (int i = 0; i < N; i++) {
string str;
cin >> str;
for (int j = 0; j < 10; j++) {
tmp[j] = str[j];
}
sort(tmp.begin(), tmp.end());
for (int j = 0; j < 10; j+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long int> a;
vector<char> tmp(10);
for (int i = 0; i < N; i++) {
string str;
cin >> str;
for (int j = 0; j < 10; j++) {
tmp[j] = str[j];
}
sort(tmp.begin(), tmp.end());
for (int j = 0; ... | [
"variable_declaration.type.widen.change"
] | 746,159 | 746,160 | u412408615 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> a;
vector<char> tmp(10);
for (int i = 0; i < N; i++) {
string str;
cin >> str;
for (int j = 0; j < 10; j++) {
tmp[j] = str[j];
}
sort(tmp.begin(), tmp.end());
for (int j = 0; j < 10; j+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long int> a;
vector<char> tmp(10);
for (int i = 0; i < N; i++) {
string str;
cin >> str;
for (int j = 0; j < 10; j++) {
tmp[j] = str[j];
}
sort(tmp.begin(), tmp.end());
for (int j = 0; ... | [
"variable_declaration.type.widen.change"
] | 746,161 | 746,160 | u412408615 | cpp |
p02947 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ... | [] | 746,162 | 746,163 | u817523595 | cpp |
p02947 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll n;
ll ans = 0;
cin >> n;
vector<string> s(n);
map<string, int> m;
rep... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll n;
ll ans = 0;
cin >> n;
vector<string> s(n);
map<string, ll> m;
rep(... | [] | 746,164 | 746,165 | u358388458 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string target;
vector<string> targets;
for (int i = 0; i < n; ++i) {
cin >> target;
sort(target.begin(), target.end());
targets.push_back(target);
}
sort(targets.begin(), targets.e... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string target;
vector<string> targets;
for (int i = 0; i < n; ++i) {
cin >> target;
sort(target.begin(), target.end());
targets.push_back(target);
}
// TODO: map使ってやってみる。
sort(ta... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,166 | 746,167 | u358245944 | 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<int> data(26);
vector<string> data2;
vector<int> data3;
rep(i, N) {
string S;
cin >> S;
sort(S.begin(), S.end());
data2.push_back(S);
}
sort(data2.be... | #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<int> data(26);
vector<string> data2;
vector<int> data3;
rep(i, N) {
string S;
cin >> S;
sort(S.begin(), S.end());
data2.push_back(S);
}
sort(data2.be... | [
"variable_declaration.type.primitive.change"
] | 746,168 | 746,169 | u666490638 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int n;
cin >> n;
unordered_map<string, int> frq;
int ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += frq[s]++;
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int n;
cin >> n;
unordered_map<string, int> frq;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += frq[s]++;
}
cout... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,173 | 746,174 | u845907943 | cpp |
p02947 | #include <bits/stdc++.h>
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());
}
sort(a.begin(), a.end());
int cnt = 0, count = 0;
string copy = a.at(0);
for (int i = 0; i < n; i++) {
if ... | #include <bits/stdc++.h>
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());
}
sort(a.begin(), a.end());
long long cnt = 0, count = 0;
string copy = a.at(0);
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,175 | 746,176 | u191114518 | cpp |
p02947 | #include <bits/stdc++.h>
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());
}
sort(a.begin(), a.end());
int cnt = 0, count = 0;
string copy = a.at(0);
for (int i = 0; i < n; i++) {
if ... | #include <bits/stdc++.h>
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());
}
sort(a.begin(), a.end());
long long cnt = 0, count = 0;
string copy = a.at(0);
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,177 | 746,176 | u191114518 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
unordered_map<string, int> mp;
int ans = 0;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
unordered_map<string, int> mp;
ll ans = 0;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans +=... | [
"variable_declaration.type.change"
] | 746,178 | 746,179 | u433685759 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
typedef long long ll;
int n;
string s;
unordered_set<string> SET;
unordered_map<string, int> byk;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
typedef long long ll;
int n;
string s;
unordered_set<string> SET;
unordered_map<string, ll> byk;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.... | [
"variable_declaration.type.change"
] | 746,180 | 746,181 | u230350277 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
rep(i, n) sort(s.at(i).begin(), s.at(i).end());
sort(s.begin(), s.end());
int cnt = 1;
int ans = 0;
re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
rep(i, n) sort(s.at(i).begin(), s.at(i).end());
sort(s.begin(), s.end());
ll cnt = 1;
ll ans = 0;
rep(i... | [
"variable_declaration.type.change"
] | 746,184 | 746,185 | u442855610 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long res = 0;
string pre = s[0];
for (int i = 0; i < n; i++) {
int j = i + 1;
long long tmp = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long res = 0;
string pre = s[0];
for (int i = 0; i < n;) {
int j = i + 1;
long long tmp = 1;
w... | [
"control_flow.loop.for.update.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 746,186 | 746,187 | u315542000 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll countNum(ll val) { return (val - 1) * val / 2; }
int main() {
int n;
cin >> n;
string str;
map<string, ll> _mp;
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
_mp[str] += 1;
}
map<string, ll>::ite... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll countNum(ll val) { return (val - 1) * val / 2; }
int main() {
int n;
cin >> n;
string str;
map<string, ll> _mp;
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
_mp[str] += 1;
}
map<string, ll>::ite... | [
"variable_declaration.type.change"
] | 746,194 | 746,195 | u914684060 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.