problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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());
}
ll ans = 0;
int count = 1;
sort(s.begin(), s.end());
string s_tmp = s[0];
for (int i = 1; i < ... | #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());
}
ll ans = 0;
ll count = 1;
sort(s.begin(), s.end());
string s_tmp = s[0];
for (int i = 1; i < n... | [
"variable_declaration.type.change"
] | 748,962 | 748,963 | u590000849 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s[n];
rep(i, n) cin >> s[i];
ll ans = 0;
rep(i, n) { s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1e9 + 7
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s[n];
rep(i, n) cin >> s[i];
ll ans = 0;
rep(i, n) { s... | [] | 748,978 | 748,979 | u241908712 | 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());
}
int ans = 0;
unordered_map<string, int> mp;
for (int i = 0; i < N; i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i]] = 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());
}
long long int ans = 0;
unordered_map<string, int> mp;
for (int i = 0; i < N; i++) {
if (mp.find(s[i]) == mp.end()) {
mp... | [
"variable_declaration.type.widen.change"
] | 748,988 | 748,989 | u703472020 | 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());
}
int ans = 0;
unordered_map<string, int> mp;
for (int i = 0; i < N; i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i]] = 0... | #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());
}
long long int ans = 0;
unordered_map<string, int> mp;
for (int i = 0; i < N; i++) {
if (mp.find(s[i]) == mp.end()) {
mp... | [
"literal.number.change",
"assignment.value.change"
] | 748,990 | 748,989 | u703472020 | cpp |
p02947 | #include <algorithm>
#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.at(i);
}
for (int i = 0; i < n; i++) {
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int64_t count = 0;
int sc =... | #include <algorithm>
#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.at(i);
}
for (int i = 0; i < n; i++) {
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int64_t count = 0;
int64_t ... | [
"variable_declaration.type.primitive.change"
] | 748,991 | 748,992 | u507414360 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i... | [
"variable_declaration.type.change"
] | 748,993 | 748,994 | u871841829 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (size_t i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int64_t ans = 0;
int count = 0;
for (size_t i =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (size_t i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int64_t ans = 0;
int count = 0;
for (size_t i =... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 748,995 | 748,996 | u229148215 | 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[i];
map<string, int> m;
int ans = 0;
for (int i = 0; i < n; i++) {
string s = a[i];
sort(s.begin(), s.end());
if (m.count(s)) {
ans += m[s];
m... | #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[i];
map<string, int> m;
long ans = 0;
for (int i = 0; i < n; i++) {
string s = a[i];
sort(s.begin(), s.end());
if (m.count(s)) {
ans += m[s];
... | [
"variable_declaration.type.primitive.change"
] | 748,999 | 748,998 | u868863576 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<str... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<str... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"io.output.change"
] | 749,000 | 749,001 | u503906942 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
set<string> c;
string str;
vector<string> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
s.push_back(str);
int l = str.length();
sort(str.begin(), str.end());
c.insert(str);
}
map<string, int> m;
for (auto ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
set<string> c;
string str;
vector<string> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
s.push_back(str);
int l = str.length();
sort(str.begin(), str.end());
c.insert(str);
}
map<string, int> m;
for (auto ... | [
"type_conversion.add"
] | 749,007 | 749,008 | u471769750 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
set<string> c;
string str;
vector<string> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
s.push_back(str);
int l = str.length();
sort(str.begin(), str.end());
c.insert(str);
}
map<string, int> m;
for (auto ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
set<string> c;
string str;
vector<string> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
s.push_back(str);
int l = str.length();
sort(str.begin(), str.end());
c.insert(str);
}
map<string, int> m;
for (auto ... | [
"variable_declaration.type.widen.change"
] | 749,009 | 749,008 | u471769750 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(int argc, char *argv[]) {
unsigned int N;
std::cin >> N;
std::string string[N];
std::map<std::string, int> map;
for (auto &s : string) {
std::cin >> s;
std::sort(s.begin(), s.end());
map[s]++;
}
int anagrams =... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(int argc, char *argv[]) {
unsigned int N;
std::cin >> N;
std::string string[N];
std::map<std::string, int> map;
for (auto &s : string) {
std::cin >> s;
std::sort(s.begin(), s.end());
map[s]++;
}
long int anagr... | [
"variable_declaration.type.widen.change"
] | 749,010 | 749,011 | u436832975 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(int argc, char *argv[]) {
unsigned int N;
std::cin >> N;
std::string string[N];
std::map<std::string, int> map;
for (auto &s : string) {
std::cin >> s;
std::sort(s.begin(), s.end());
map[s]++;
}
int anagrams =... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(int argc, char *argv[]) {
unsigned int N;
std::cin >> N;
std::string string[N];
std::map<std::string, int> map;
for (auto &s : string) {
std::cin >> s;
std::sort(s.begin(), s.end());
map[s]++;
}
long int anagr... | [
"variable_declaration.type.widen.change"
] | 749,012 | 749,011 | u436832975 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(int argc, char *argv[]) {
unsigned int N;
std::cin >> N;
std::string string[N];
std::map<std::string, int> map;
for (auto &s : string) {
std::cin >> s;
std::sort(s.begin(), s.end());
map[s]++;
}
int anagrams =... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main(int argc, char *argv[]) {
unsigned int N;
std::cin >> N;
std::string string[N];
std::map<std::string, int> map;
for (auto &s : string) {
std::cin >> s;
std::sort(s.begin(), s.end());
map[s]++;
}
long int anagr... | [
"variable_declaration.type.widen.change"
] | 749,012 | 749,013 | u436832975 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define p(x) cout << x << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<string> ss(n);
rep(i, n) {
cin >> ss.at(i);
sort(all(ss.at(i)));
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define p(x) cout << x << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<string> ss(n);
rep(i, n) {
cin >> ss.at(i);
sort(all(ss.at(i)));
}
... | [
"assignment.value.change"
] | 749,016 | 749,017 | u709879360 | cpp |
p02947 | #include <algorithm>
#include <iostream>
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());
}
long long count = 0;
sort(s, s + N);
for (int i = 0; i < N;) {
int j = 0;
while (s[i] == s[i + j]) {
... | #include <algorithm>
#include <iostream>
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());
}
long long count = 0;
sort(s, s + N);
for (int i = 0; i < N;) {
long long j = 0;
while (s[i] == s[i + ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,022 | 749,023 | u879436400 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long times = 0;
int n;
cin >> n;
string s;
vector<string> v;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.emplace_back(s);
}
sort(v.begin(), v.end());
int t = 1;
for (int i = 0; i < n - 1; i++) {
i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
int times = 0;
int n;
cin >> n;
string s;
vector<string> v;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.emplace_back(s);
}
sort(v.begin(), v.end());
int t = 1;
for (int i = 0; i < n - 1; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 749,024 | 749,025 | u240875512 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"variable_declaration.type.change"
] | 749,028 | 749,029 | u127344197 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define FORR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(o) (o).begin(), (o).end()
template <class T> using V = vector<T>;
t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define FORR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(o) (o).begin(), (o).end()
template <class T> using V = vector<T>;
t... | [
"variable_declaration.type.change"
] | 749,034 | 749,035 | u116518875 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for ... | [
"variable_declaration.type.change"
] | 749,040 | 749,041 | u092002408 | cpp |
p02947 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include"fun... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include"fun... | [
"variable_declaration.type.change"
] | 749,042 | 749,043 | u963646695 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ... | [
"variable_declaration.type.change"
] | 749,044 | 749,045 | u050698451 | cpp |
p02947 | #include "bits/stdc++.h"
#define ll long long
#define ALL(x) (x.begin(), x.end())
using namespace std;
int main() {
ll N;
cin >> N;
vector<string> s(N);
for (ll i = 0; i < N; i++) {
cin >> s[i];
}
for (ll i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
ll ans ... | #include "bits/stdc++.h"
#define ll long long
#define ALL(x) (x.begin(), x.end())
using namespace std;
int main() {
ll N;
cin >> N;
vector<string> s(N);
for (ll i = 0; i < N; i++) {
cin >> s[i];
}
for (ll i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
ll ans ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 749,048 | 749,049 | u546736430 | cpp |
p02947 | #include "bits/stdc++.h"
#define ll long long
#define ALL(x) (x.begin(), x.end())
using namespace std;
int main() {
ll N;
cin >> N;
vector<string> s(N);
for (ll i = 0; i < N; i++) {
cin >> s[i];
}
for (ll i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
ll ans ... | #include "bits/stdc++.h"
#define ll long long
#define ALL(x) (x.begin(), x.end())
using namespace std;
int main() {
ll N;
cin >> N;
vector<string> s(N);
for (ll i = 0; i < N; i++) {
cin >> s[i];
}
for (ll i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
ll ans ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.return.add",
"control_flow.return.0.add"
] | 749,050 | 749,049 | u546736430 | 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"
] | 749,053 | 749,054 | u640323045 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<string> s2;
for (int i = 0; i < n; i++) {
char s[10];
scanf("%s", s);
sort(s, s + 10);
s2.push_back(s);
}
int t = 0, sum = 0;
sort(s2.begin(), s2.end());
for (int i = 1; i < s2.size(); i++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<string> s2;
for (int i = 0; i < n; i++) {
char s[10];
scanf("%s", s);
sort(s, s + 10);
s2.push_back(s);
}
int t = 0;
long long sum = 0;
sort(s2.begin(), s2.end());
for (int i = 1; i < s2.size(); i... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,055 | 749,056 | u027057023 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
string s[100005], c;
int main() {
long long n, a, b, i, j, k;
cin >> n;
for (i = 0; i < n; i++) {
cin >> c;
sort(c.begin(), c.end());
s[i] = c;
}
sort(s, s + n);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
string s[100005], c;
int main() {
long long n, a, b, i, j, k;
cin >> n;
for (i = 0; i < n; i++) {
cin >> c;
sort(c.begin(), c.end());
s[i] = c;
}
sort(s, s + n);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,057 | 749,058 | u748042489 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
map<string, int> a;
map<string, int>::iterator it;
string s;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, l = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}
for (it = a.beg... | #include <bits/stdc++.h>
using namespace std;
map<string, long long> a;
map<string, long long>::iterator it;
string s;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long n, l = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,063 | 749,064 | u879241796 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a = 0, t;
cin >> n;
unordered_map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto x : m) {
t = x.second;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, a = 0, t;
cin >> n;
unordered_map<string, long long> m;
for (long long i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto x : m) {... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 749,067 | 749,068 | u796610363 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c;
long long int r = 0;
string s[100005];
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
for (i = 1, c = 0; i < n; i++) {
if (s[i] == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
long long int c, r = 0;
string s[100005];
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
for (i = 1, c = 0; i < n; i++) {
if (s[i] == ... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 749,078 | 749,079 | u926389420 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int nCr(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
strin... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
long long int nCr(int n, int r) {
long long int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i <... | [
"variable_declaration.type.widen.change"
] | 749,080 | 749,081 | u474377871 | 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.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
/* for (int i = 0; i < N; i++) {
cout << s.at(i) << endl;
}
*/
long ans... | #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.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
/* for (int i = 0; i < N; i++) {
cout << s.at(i) << endl;
}
*/
long ans... | [
"variable_declaration.type.primitive.change"
] | 749,086 | 749,087 | u042802884 | 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.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
/* for (int i = 0; i < N; i++) {
cout << s.at(i) << endl;
}
*/
int ans ... | #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.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
/* for (int i = 0; i < N; i++) {
cout << s.at(i) << endl;
}
*/
long ans... | [
"variable_declaration.type.primitive.change"
] | 749,088 | 749,087 | u042802884 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define LPIN(n, a) ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define LPIN(n, a) ... | [
"variable_declaration.type.widen.change"
] | 749,091 | 749,092 | u271153916 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define LPIN(n, a) ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define LPIN(n, a) ... | [
"literal.number.change",
"assignment.value.change"
] | 749,093 | 749,092 | u271153916 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n, m, i, j, k, x, t;
while (cin >> n) {
string s;
map<string, int> mp;
map<string, int>::iterator it;
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, m, i, j, k, x, t;
while (cin >> n) {
string s;
map<string, ll> mp;
map<string, ll>::iterator it;
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
... | [
"variable_declaration.type.change"
] | 749,097 | 749,098 | u586712352 | cpp |
p02947 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#includ... | [
"variable_declaration.type.change"
] | 749,099 | 749,100 | u495699318 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FILL(a, n) memset((a), n, sizeof(a))
#define FILLZ(a) FILL(a, 0)
using namespace std;
typedef... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FILL(a, n) memset((a), n, sizeof(a))
#define FILLZ(a) FILL(a, 0)
using namespace std;
typedef... | [
"variable_declaration.type.change"
] | 749,101 | 749,102 | u684901760 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <unordered_map>
using namespace std;
int main() {
int N;
cin >> N;
string str;
unordered_map<string, int> hash;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> str;
sort(str.begin(), str.end());
if (hash[str] != 0) {
count = count + h... | #include <algorithm>
#include <iostream>
#include <unordered_map>
using namespace std;
int main() {
int N;
cin >> N;
string str;
unordered_map<string, int> hash;
long count = 0;
for (int i = 0; i < N; i++) {
cin >> str;
sort(str.begin(), str.end());
if (hash[str] != 0) {
count = count + ... | [
"variable_declaration.type.primitive.change"
] | 749,103 | 749,104 | u711816529 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | [] | 749,105 | 749,106 | u017271745 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ans = 0;
for (auto p : m) {
int x = p.second;
ans += x * (x - 1) / 2;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ans = 0;
for (auto p : m) {
ll x = p.second;
ans += x * (x - 1) / 2;
}
cou... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,107 | 749,108 | u355724718 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define... | [
"variable_declaration.type.change"
] | 749,116 | 749,117 | u494070244 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define... | [
"variable_declaration.type.change"
] | 749,116 | 749,118 | u494070244 | cpp |
p02947 | // 3_abc137_c
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... | // 3_abc137_c
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... | [
"variable_declaration.type.change"
] | 749,119 | 749,120 | u811561461 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
unordered_map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto it = mp.begin(); it != mp.end(); it++) ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
unordered_map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto it = mp.begin(); it != mp.end(); it++) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,123 | 749,124 | u372299304 | cpp |
p02947 | #include <iostream>
#include <string>
#include <unordered_map>
typedef long long ll;
using namespace std;
string insertion_sort(string str) {
for (int i = 1; i < 10; i++) {
int j = i;
while (j > 0 && str[j - 1] > str[j]) {
char tmp = str[j - 1];
str[j - 1] = str[j];
str[j] = tmp;
j--... | #include <iostream>
#include <string>
#include <unordered_map>
typedef long long ll;
using namespace std;
string insertion_sort(string str) {
for (int i = 1; i < 10; i++) {
int j = i;
while (j > 0 && str[j - 1] > str[j]) {
char tmp = str[j - 1];
str[j - 1] = str[j];
str[j] = tmp;
j--... | [] | 749,125 | 749,126 | u069877747 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define INF (int)1e9
#define MOD (int)1e9 + 7
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<int, int> pii;
int main() {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define INF (int)1e9
#define MOD (int)1e9 + 7
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef pair<int, int> pii;
int main() {
... | [
"variable_declaration.type.change"
] | 749,127 | 749,128 | u209767598 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int... | [
"expression.operation.binary.remove"
] | 749,129 | 749,130 | u209767598 | cpp |
p02947 | #include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
string str[maxn];
ll n;
int main() {
scanf("%lld", &n);
ll ans = 0;
map<string, int> m;
map<string, int>::iterator to;
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin()... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
string str[maxn];
ll n;
int main() {
scanf("%lld", &n);
ll ans = 0;
map<string, ll> m;
map<string, ll>::iterator to;
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), ... | [] | 749,133 | 749,134 | u787202065 | cpp |
p02947 | #include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
string str[maxn];
int n;
int main() {
scanf("%d", &n);
ll ans = 0;
map<string, int> m;
map<string, int>::iterator to;
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(),... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
string str[maxn];
ll n;
int main() {
scanf("%lld", &n);
ll ans = 0;
map<string, ll> m;
map<string, ll>::iterator to;
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), ... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change"
] | 749,135 | 749,134 | u787202065 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = 0; i < (a); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for (int i = 0; i < (a); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#d... | [
"variable_declaration.type.change"
] | 749,138 | 749,139 | u019780057 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED ... | [
"call.remove"
] | 749,145 | 749,146 | u898651494 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typede... | [
"variable_declaration.type.change"
] | 749,149 | 749,150 | u300866293 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
ll INF = 9999999999999999;
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... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
ll INF = 9999999999999999;
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... | [] | 749,151 | 749,152 | u720721463 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
ll INF = 9999999999999999;
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... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
ll INF = 9999999999999999;
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... | [
"call.arguments.change"
] | 749,153 | 749,154 | u720721463 | cpp |
p02947 | #include <bits/stdc++.h>
#define debug(x)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sq(x) ((x) * (x))
#define PRECISION 30
using namespace std;
template <class T> int check_mod(T a, T b) { return (a % b) ? 1 : 0; }
void sieve(vector<char> &prime, int... | #include <bits/stdc++.h>
#define debug(x)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sq(x) ((x) * (x))
#define PRECISION 30
using namespace std;
template <class T> int check_mod(T a, T b) { return (a % b) ? 1 : 0; }
void sieve(vector<char> &prime, int... | [] | 749,160 | 749,161 | u464939155 | cpp |
p02947 | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include <algorithm>
#include <deque>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"variable_declaration.type.change"
] | 749,162 | 749,163 | u561443723 | cpp |
p02947 | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long lon... | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long lon... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 749,164 | 749,165 | u398135166 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
for (auto x : mp) {
int a = x.second;
count += ((a * (a - ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n, count = 0;
cin >> n;
map<string, long long> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
for (auto x : mp) {
long long a = x.second;
co... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,166 | 749,167 | u055711678 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef long double ld;
//ある値がvector内の要素に含まれているか否か判定する
int vector_finder(std::vector<int> vec, int number) {
auto it... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef long double ld;
//ある値がvector内の要素に含まれているか否か判定する
int vector_finder(std::vector<int> vec, int number) {
auto it... | [
"expression.operation.binary.add"
] | 749,168 | 749,169 | u518242261 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef long double ld;
//ある値がvector内の要素に含まれているか否か判定する
int vector_finder(std::vector<int> vec, int number) {
auto it... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef long double ld;
//ある値がvector内の要素に含まれているか否か判定する
int vector_finder(std::vector<int> vec, int number) {
auto it... | [
"expression.operation.binary.add"
] | 749,170 | 749,169 | u518242261 | cpp |
p02947 | /*
*Author - Amarjeet Sinha
*/
#include <bits/stdc++.h>
#define ll long long
#define hell 1000000007
#define F first
#define re 15000000
#define S second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define pi 3.1415926536
#define Mod 998244353
// #def... | /*
*Author - Amarjeet Sinha
*/
#include <bits/stdc++.h>
#define ll long long
#define hell 1000000007
#define F first
#define re 15000000
#define S second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define pi 3.1415926536
#define Mod 998244353
// #def... | [
"variable_declaration.type.change"
] | 749,171 | 749,172 | u069325246 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> data;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
data.push_back(s);
}
s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> data;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
data.push_back(s);
}
s... | [
"type_conversion.add"
] | 749,173 | 749,174 | u639032323 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> anagrams;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
anagrams.push_back(s);
}
sort(anagrams.begin(), anagrams.end());
int power = 0;
int ans = 0;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> anagrams;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
anagrams.push_back(s);
}
sort(anagrams.begin(), anagrams.end());
long long int power = 0;
long long int ans = 0... | [
"variable_declaration.type.widen.change"
] | 749,175 | 749,176 | u240010800 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
long long int result = 0;
cin >> N;
array<string, 100001> s;
for (int i = 0; i < N; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
long long int result = 0;
cin >> N;
array<string, 100001> s;
for (int i = 0; i < N; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
... | [
"variable_declaration.type.widen.change"
] | 749,177 | 749,178 | u643747754 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long ans ... | [
"variable_declaration.type.change"
] | 749,183 | 749,184 | u874723578 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = ... | [
"variable_declaration.type.change"
] | 749,185 | 749,186 | u874723578 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = ... | [
"variable_declaration.type.change"
] | 749,187 | 749,186 | u874723578 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.change"
] | 749,188 | 749,189 | u369980487 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.change"
] | 749,188 | 749,192 | u369980487 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
unordered_map<string, int> c;
int n;
for (cin >> n; n--;) {
string s;
cin >> s;
sort(begin(s), end(s));
c[s]++;
}
int ... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
unordered_map<string, int> c;
int n;
for (cin >> n; n--;) {
string s;
cin >> s;
sort(begin(s), end(s));
c[s]++;
}
long... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,202 | 749,203 | u021019433 | cpp |
p02947 | #include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using ull = unsigned long long;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
map<string, int> freq;
int n;
cin >> n;
in... | #include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using ull = unsigned long long;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
map<string, int> freq;
int n;
cin >> n;
ul... | [
"variable_declaration.type.change"
] | 749,207 | 749,208 | u263351103 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long int32;
typedef unsigned long uint32;
typedef long long int64;
typedef unsigned long long uint64;
typedef pair<int, int> pii;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<vi> graph;
#define st first
#define nd se... | #include <bits/stdc++.h>
using namespace std;
typedef long int32;
typedef unsigned long uint32;
typedef long long int64;
typedef unsigned long long uint64;
typedef pair<int, int> pii;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<vi> graph;
#define st first
#define nd se... | [] | 749,209 | 749,210 | u384539725 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define UN unsigned int
#define mod 1000000007
#define F first
#define S second
#define mk make_pair
#define B(v) v.begin(), v.end()
#define BS binary_search
int main() {
int n;
cin >> n;
vector<string> v[n + 10];
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define UN unsigned int
#define mod 1000000007
#define F first
#define S second
#define mk make_pair
#define B(v) v.begin(), v.end()
#define BS binary_search
#define int ll
main() {
int n;
cin >> n;
vector<string> v[n + 10];
... | [] | 749,211 | 749,212 | u003209891 | cpp |
p02947 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
unordered_map<string, int> p;
vector<string> k;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
for (int i = 0; i < N; i++) {
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
unordered_map<string, ll> p;
vector<string> k;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.change"
] | 749,216 | 749,217 | u854904794 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
string a[10001];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
// char b[12];
sort(a[i].begin(), a[i].end());
}
sort(a + 1, a + n + 1);
long long ans = 0;
l... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
string a[500001];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
sort(a[i].begin(), a[i].end());
}
sort(a + 1, a + n + 1);
long long ans = 0;
long long length = ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 749,220 | 749,219 | u289216945 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
map<string, int> mp;
int main... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
map<string, ll> mp;
int main(... | [] | 749,221 | 749,222 | u453071216 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
map<string, int> mp;
int main... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
map<string, ll> mp;
int main(... | [
"variable_declaration.type.change"
] | 749,223 | 749,222 | u453071216 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
map<string, int> mp;
int main(... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
map<string, ll> mp;
int main(... | [
"variable_declaration.type.change"
] | 749,224 | 749,222 | u453071216 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,232 | 749,233 | u275934251 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, c = 0;
// c is count of pairs before taking new input
// map second value is occurence of that string previously
cin >> n;
unordered_map<string, int> m;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.b... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, c = 0;
// c is count of pairs before taking new input
// map second value is occurence of that string previously
cin >> n;
unordered_map<string, ll> m;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.be... | [] | 749,234 | 749,235 | u758145613 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, c = 0;
// c is count of pairs before taking new input
// map second value is occurence of that string previously
cin >> n;
unordered_map<string, int> m;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.b... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n, c = 0;
// c is count of pairs before taking new input
// map second value is occurence of that string previously
cin >> n;
unordered_map<string, ll> m;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.be... | [
"io.output.newline.add"
] | 749,236 | 749,235 | u758145613 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp.at(s)++;
}
long long ans = 0;
for (auto p : mp) {
long long s = p.second;
ans += s * (s + 1) / 2;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> 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) {
long long s = p.second;
ans += s * (s - 1) / 2;
}
c... | [
"call.remove",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 749,238 | 749,239 | u522993719 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long result = 0;
for (auto &... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long result = 0;
for (auto &... | [] | 749,242 | 749,241 | u295651044 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long result = 0;
for (auto &... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long result = 0;
for (auto &... | [] | 749,243 | 749,241 | u295651044 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec;
for (int i = 0; i < n; i++) {
string tmp;
cin >> tmp;
vector<char> chars;
for (int i = 0; i < tmp.length(); i++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec;
for (int i = 0; i < n; i++) {
string tmp;
cin >> tmp;
vector<char> chars;
for (int i = 0; i < tmp.length(); i++) {
... | [
"variable_declaration.type.primitive.change"
] | 749,246 | 749,247 | u275316733 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string sortString(string s) {
// 文字列s をソートして返す
int len = s.size();
vector<char> v(len);
for (int i = 0; i < len; ++i) {
v[i] = s[i];
}
sort(v.begin(), v.end());
string ret = "";
for (int i = 0; i < len; ++i) {
ret += v[i];
}
return ret;
}
i... | #include <bits/stdc++.h>
using namespace std;
string sortString(string s) {
// 文字列s をソートして返す
int len = s.size();
vector<char> v(len);
for (int i = 0; i < len; ++i) {
v[i] = s[i];
}
sort(v.begin(), v.end());
string ret = "";
for (int i = 0; i < len; ++i) {
ret += v[i];
}
return ret;
}
i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,250 | 749,251 | u960524878 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#in... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#in... | [
"literal.number.change"
] | 749,254 | 749,255 | u370768058 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
unordered_map<string, ll> mp;
rep(i, n) {
string s;
cin >> s;
... | [
"variable_declaration.type.change"
] | 749,256 | 749,257 | u292106243 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
unordered_map<string, ll> mp;
rep(i, n) {
string s;
cin >> s;
... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 749,258 | 749,257 | u292106243 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int count = 0;
unordered_map<string, int> hash;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (hash[s[i]] != NULL) {
count += hash[s[i]];
hash[s[i]]++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
long long int count = 0;
unordered_map<string, int> hash;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (hash[s[i]] != NULL) {
count += hash[s[i]];
hash[s... | [
"variable_declaration.type.widen.change"
] | 749,259 | 749,260 | u321094662 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
int count = 0;
unordered_map<string, int> hash;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (hash[s[i]] > 0) {
count += hash[s[i]];
hash[s[i]]++;
} ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
long long int count = 0;
unordered_map<string, int> hash;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (hash[s[i]] != NULL) {
count += hash[s[i]];
hash[s... | [
"control_flow.loop.for.condition.change"
] | 749,261 | 749,260 | u321094662 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int n;
int co;
string V[100005];
map<string, long long> m;
void input() {
cin >> n;
string t;
for (int i = 0; i < n; i++) {
cin >> V[i];
sort(V[i].begin(), V[i].end());
m[V[i]]++;
}... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int n;
long long co = 0;
string V[100005];
map<string, long long> m;
void input() {
cin >> n;
string t;
for (int i = 0; i < n; i++) {
cin >> V[i];
sort(V[i].begin(), V[i].end());
m[V[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.value.change"
] | 749,266 | 749,267 | u588044503 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <unordered_map>
using namespace std;
const int MAX_N = 100001;
int N;
string s[MAX_N];
unordered_map<string, int> dic;
void solve() {
int ans = 0;
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
dic[s[i]] += 1;
if (dic[s[i]] >= 2) {
... | #include <algorithm>
#include <iostream>
#include <unordered_map>
using namespace std;
const int MAX_N = 100001;
int N;
string s[MAX_N];
unordered_map<string, int> dic;
void solve() {
long ans = 0;
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
dic[s[i]] += 1;
if (dic[s[i]] >= 2) {
... | [
"variable_declaration.type.primitive.change"
] | 749,268 | 749,269 | u036744414 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
if (m.count(s) != 0)
m[s] += 1;
else
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
if (m.count(s) != 0)
m[s] += 1;
else
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,270 | 749,271 | u520409849 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
if (m.count(s) != 0)
m[s] += 1;
else
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
if (m.count(s) != 0)
m[s] += 1;
else
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,272 | 749,271 | u520409849 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define pii pair<int, int>
vector<string> all;
void func(string... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define pii pair<int, int>
vector<string> all;
void func(string... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"assignment.change"
] | 749,279 | 749,280 | u894836225 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define N (1000000000 + 7)
#define INF (ll)1e16
typedef pair<int, int> P... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define N (1000000000 + 7)
#define INF (ll)1e16
typedef pair<int, int> P... | [
"variable_declaration.type.change"
] | 749,281 | 749,282 | u744305661 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
/* main */
int main() {
ll n, ans = 0;
map<string, int> mp;
cin >> n;
string s;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &p : mp) {
int s = p.seco... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
/* main */
int main() {
ll n, ans = 0;
map<string, int> mp;
cin >> n;
string s;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &p : mp) {
int s = p.seco... | [
"type_conversion.add"
] | 749,283 | 749,284 | u855016901 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long int ans = 0;
for (auto &p : mp) {
int k =... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long int ans = 0;
for (auto &p : mp) {
... | [
"variable_declaration.type.widen.change"
] | 749,287 | 749,288 | u523303964 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.