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;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll sum = 0;
for (auto it : mp) {
sum += (it.second) * (it.second - 1) / 2;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, long> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll sum = 0;
for (auto it : mp) {
sum += (it.second) * (it.second - 1) / 2;
... | [
"variable_declaration.type.primitive.change"
] | 748,066 | 748,065 | u374190629 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<int> vll;
typedef vector<pii> vpii;
typedef vector<p... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pl... | [
"variable_declaration.type.change"
] | 748,067 | 748,068 | u998980702 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<int> vll;
typedef vector<pii> vpii;
typedef vector<p... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pl... | [
"variable_declaration.type.change",
"call.add"
] | 748,069 | 748,068 | u998980702 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
map<string, int> m;
for (int i = 0; i < n; i++)
m[s[i]]++;
long long ans... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
map<string, long> m;
for (int i = 0; i < n; i++)
m[s[i]]++;
long long an... | [
"variable_declaration.type.primitive.change"
] | 748,070 | 748,071 | u978141770 | cpp |
p02947 | #include <iostream>
#include <map>
#include <string>
using namespace std;
void ReplaceStr(char str[]) {
for (int i = 0; str[i] != 0; i++) {
for (int j = i + 1; str[j] != 0; j++) {
if (str[i] > str[j]) {
char tmp = str[i];
str[i] = str[j];
str[j] = tmp;
}
}
}
}
int main(... | #include <iostream>
#include <map>
#include <string>
using namespace std;
void ReplaceStr(char str[]) {
for (int i = 0; str[i] != 0; i++) {
for (int j = i + 1; str[j] != 0; j++) {
if (str[i] > str[j]) {
char tmp = str[i];
str[i] = str[j];
str[j] = tmp;
}
}
}
}
int main(... | [
"variable_declaration.type.primitive.change"
] | 748,072 | 748,073 | u340267240 | cpp |
p02947 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author TM
*/
#include <bits/stdc++.h>
using namespace std;
class CGreenBin {
public:
void solve(std::istream &cin, std::ostream &cout) {
int n;
cin >> n;
vector<string> s_vec(n);
for (int i = 0; i < n; ++i... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author TM
*/
#include <bits/stdc++.h>
using namespace std;
class CGreenBin {
public:
void solve(std::istream &cin, std::ostream &cout) {
int n;
cin >> n;
vector<string> s_vec(n);
for (int i = 0; i < n; ++i... | [] | 748,074 | 748,075 | u136090046 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string strlist[n];
string tmp_str;
for (int i = 0; i < n; i++) {
cin >> tmp_str;
sort(tmp_str.begin(), tmp_str.end());
strlist[i] = tmp_str;
}
sort(strlist, strlist... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string strlist[n];
string tmp_str;
for (int i = 0; i < n; i++) {
cin >> tmp_str;
sort(tmp_str.begin(), tmp_str.end());
strlist[i] = tmp_str;
}
sort(strlist, strlist... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,080 | 748,081 | u524142273 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long long ans = 0LL;
int l = 1;
string ss = s[0];
for (int i = 1; i < n; ++i) {
if (s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long long ans = 0LL;
long long l = 1LL;
string ss = s[0];
for (int i = 1; i < n; ++i) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 748,084 | 748,085 | u640800420 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1E9 + 9;
const int INF = 1 << 29;
int main() {
int ans = 0;
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s[i];
map<string, int> cnt;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1E9 + 9;
const int INF = 1 << 29;
int main() {
int64_t ans = 0;
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s[i];
map<string, int> c... | [
"variable_declaration.type.primitive.change"
] | 748,086 | 748,087 | u994910167 | cpp |
p02947 | #include <algorithm>.
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1E9 + 9;
const int INF = 1 << 29;
int main() {
int ans = 0;
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s[i];
map<string, int> cnt;... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1E9 + 9;
const int INF = 1 << 29;
int main() {
int64_t ans = 0;
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s[i];
map<string, int> c... | [
"variable_declaration.type.primitive.change"
] | 748,088 | 748,087 | u994910167 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
map<string, ll> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int cnt = 0;
for (auto x : mp) {
cnt += x.second * (x.s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
map<string, ll> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll cnt = 0;
for (auto x : mp) {
cnt += x.second * (x.se... | [
"variable_declaration.type.change"
] | 748,089 | 748,090 | u591779169 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
while (!s.size()) {
cin >> s;
}
sort(s.begin(), s.end());
if (mp.find(s) != mp.end()) {
// cout<<"incrementing ="... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
long long int n;
cin >> n;
map<string, long long int> mp;
for (long long int i = 0; i < n; i++) {
string s;
while (!s.size()) {
cin >> s;
}
sort(s.begin(), s.end());
if (mp.find(s) != mp.end()) {
... | [
"control_flow.loop.for.initializer.change"
] | 748,093 | 748,094 | u119271498 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n;
x = n;
map<string, int> mp;
cin.ignore();
int cnt = 0;
while (n--) {
string s;
getline(cin, s);
sort(s.begin(), s.end());
cnt += mp[s];
mp[s]++;
}
cout << cnt;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, x;
cin >> n;
x = n;
map<string, int> mp;
cin.ignore();
ll cnt = 0;
while (n--) {
string s;
getline(cin, s);
sort(s.begin(), s.end());
cnt += mp[s];
mp[s]++;
}
cout << cnt;
return 0;
}
| [
"variable_declaration.type.change"
] | 748,095 | 748,096 | u324706690 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
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]++;
}
long long ans = 0;
for (auto i : m) {
int j = i.second;
if (j <= 1)
ans += 0;
else if (j =... | #include <bits/stdc++.h>
using namespace std;
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]++;
}
long long ans = 0;
for (auto i : m) {
// cout << i.first << " " << i.second << "\n";
long long j = i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,097 | 748,098 | u742437982 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int count = 0;
long long int ans = 0;
//
for (int i = 0; i < n; i++) {
if (s[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int count = 0;
long long int ans = 0;
//
for (int i = 1; i < n; i++) {
if (s[... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 748,101 | 748,102 | u843292252 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int p[26] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
int n;
cin >> n;
long long product[n];
char temp;
for (int ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int p[26] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
int n;
cin >> n;
long long product[n];
char temp;
for (int ... | [
"variable_declaration.type.primitive.change"
] | 748,108 | 748,109 | u694243276 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int p[26] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
int n;
cin >> n;
long product[n];
char temp;
for (int i = 0... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int p[26] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
int n;
cin >> n;
long long product[n];
char temp;
for (int ... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 748,110 | 748,109 | u694243276 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,111 | 748,112 | u342051078 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int num = 0;
vector<string> str(100001);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str.at(i);
sort(str.at(i).begin(), str.at(i).end());
}
map<string... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int num = 0;
vector<string> str(100001);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str.at(i);
sort(str.at(i).begin(), str.at(i).end());
}
map<string... | [
"variable_declaration.type.widen.change"
] | 748,115 | 748,116 | u755310927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string st;
typedef vector<int> vi;
typedef vector<st> vs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fogg(i, a, b) for (int i = (a); i <= (b); i++)
#define ford(i, a, b) for (int i = (a); i >= (b); i--)
#define test ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string st;
typedef vector<int> vi;
typedef vector<st> vs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fogg(i, a, b) for (int i = (a); i <= (b); i++)
#define ford(i, a, b) for (int i = (a); i >= (b); i--)
#define test ... | [
"type_conversion.add"
] | 748,117 | 748,118 | u391494739 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<string> s;
int main() {
int N, tmp;
ll sum, count;
string ss;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> ss;
sort(ss.begin(), ss.end());
s.push_back(ss);
}
sort(s.begin(), s.end... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<string> s;
int main() {
int N, tmp;
ll sum, count;
string ss;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> ss;
sort(ss.begin(), ss.end());
s.push_back(ss);
}
sort(s.begin(), s.end... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 748,121 | 748,122 | u235231201 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
using T = tuple<... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
using T = tuple<... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 748,123 | 748,124 | u168621426 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
map<string, int> m;
rep(i, N) { //比較の部分はVectorだとTLEになる。メモリ節約でmapを使う！
m[s[i]]++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
map<string, int> m;
rep(i, N) { //比較の部分はVectorだとTLEになる。メモリ節約でmapを使う！
m[s[i]]++;
}
... | [
"variable_declaration.type.primitive.change"
] | 748,127 | 748,128 | u319179101 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long count = 0;
set<string> v;
map<string, int> map;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
v.insert(str);
map[str]++;
}
for (auto x : v) {
int y = ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long count = 0;
set<string> v;
map<string, int> map;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
v.insert(str);
map[str]++;
}
for (auto x : v) {
long long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,129 | 748,130 | u859209662 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t count = 0;
set<string> v;
map<string, int> map;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
v.insert(str);
map[str]++;
}
for (auto x : v) {
int y = map[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long count = 0;
set<string> v;
map<string, int> map;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
v.insert(str);
map[str]++;
}
for (auto x : v) {
long long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,131 | 748,130 | u859209662 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> strings;
for (int idx = 1; idx <= N; ++idx) {
string s;
cin >> s;
sort(s.begin(), s.end());
strings[s] += 1;
}
long long int ans = 0LL;
for (aut... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> strings;
for (int idx = 1; idx <= N; ++idx) {
string s;
cin >> s;
sort(s.begin(), s.end());
strings[s] += 1;
}
long long int ans = 0LL;
for (aut... | [
"literal.number.type.widen.change"
] | 748,134 | 748,135 | u737840172 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
long long sum, part;
string s[100001];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> s[i];
for (int i = 0; i < N; ++i)
sort(s[i].begin(), s[i].end());
sort(s, s + N);
sum = 0;
{
int i = 1;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
long sum, part;
string s[100001];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> s[i];
for (int i = 0; i < N; ++i)
sort(s[i].begin(), s[i].end());
sort(s, s + N);
sum = 0;
{
int i = 1;
wh... | [
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.change"
] | 748,140 | 748,141 | u205975249 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
long sum, part;
string s[100001];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> s[i];
for (int i = 0; i < N; ++i)
sort(s[i].begin(), s[i].end());
sort(s, s + N);
sum = 0;
{
int i = 1;
wh... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
long sum, part;
string s[100001];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> s[i];
for (int i = 0; i < N; ++i)
sort(s[i].begin(), s[i].end());
sort(s, s + N);
sum = 0;
{
int i = 1;
wh... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.change"
] | 748,142 | 748,141 | u205975249 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i > -1; --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
const long long INF = 1000000000;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<int,... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i > -1; --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
const long long INF = 1000000000;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<int,... | [
"variable_declaration.type.change"
] | 748,143 | 748,144 | u655975843 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<string> S(N);
string s;
for (int n = 0; n < N; n++) {
cin >> s;
sort(s.begin(), s.end());
S[n] = s;
}
sort(S.begin(), S.end());
int count = 0;
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<string> S(N);
string s;
for (int n = 0; n < N; n++) {
cin >> s;
sort(s.begin(), s.end());
S[n] = s;
}
sort(S.begin(), S.end());
int count = 0;
long ans = 0;
... | [
"variable_declaration.type.primitive.change"
] | 748,145 | 748,146 | u518623219 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long n;
map<string, int> mm;
string s[500000];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long n;
map<string, long long> mm;
string s[500000];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
f... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,147 | 748,148 | u798339690 | cpp |
p02947 | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = a; i < (b); i++)
#define sz(t) int(t.size())
using namespace std;
typedef long long ll;
vector<string> s;
map<string, int> m;
int main(void) {
i... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = a; i < (b); i++)
#define sz(t) int(t.size())
using namespace std;
typedef long long ll;
vector<string> s;
map<string, ll> m;
int main(void) {
in... | [] | 748,149 | 748,150 | u036104576 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
using namespace st... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
using namespace st... | [
"variable_declaration.type.change"
] | 748,153 | 748,154 | u527486806 | cpp |
p02947 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
o... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,161 | 748,162 | u933476247 | cpp |
p02947 | //*137_C問題
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
long long int sum = 0;
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp[s]++;
}
for (a... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
long long int sum = 0;
int n;
std::cin >> n;
std::map<std::string, long long int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp[s]++;
}
for (au... | [
"variable_declaration.type.widen.change"
] | 748,163 | 748,164 | u210398438 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
long long int sum = 0;
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp[s]++;
}
for (auto itr = m... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
long long int sum = 0;
int n;
std::cin >> n;
std::map<std::string, long long int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp[s]++;
}
for (au... | [
"variable_declaration.type.widen.change"
] | 748,165 | 748,164 | u210398438 | cpp |
p02947 | //*137_C問題
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
long long int sum = 0;
int n;
std::cin >> n;
std::map<std::string, int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp[s]++;
}
for (a... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
long long int sum = 0;
int n;
std::cin >> n;
std::map<std::string, long long int> mp;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
mp[s]++;
}
for (au... | [
"variable_declaration.type.widen.change"
] | 748,166 | 748,164 | u210398438 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int> m;
rep(i, N) {
string t;
cin >> t;
sort(t.begin(), t.end());
s.at(i) = t;
m[t]++;
}
int64_t ans = 0;
for (auto va... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int64_t> m;
rep(i, N) {
string t;
cin >> t;
sort(t.begin(), t.end());
s.at(i) = t;
m[t]++;
}
int64_t ans = 0;
for (aut... | [
"variable_declaration.type.primitive.change"
] | 748,167 | 748,168 | u073486874 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
typedef long long int lld;
using namespace std;
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << ... | #include <bits/stdc++.h>
typedef long long ll;
typedef long long int lld;
using namespace std;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << "... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 748,171 | 748,172 | u592686932 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long int lld;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(15);
cout << fixed;
int n = 0;
cin >> n;
map<multiset<char>, int> mp;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long int lld;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(15);
cout << fixed;
int n = 0;
cin >> n;
map<multiset<char>, lld> mp;
for (int i = 0; i ... | [
"variable_declaration.type.change"
] | 748,177 | 748,178 | u835820697 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin()... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define rep(i, x, y) for (int i = x; i < y; i++)
#define rel(i, x, y) for (int i = x - 1; i >= y; i--)
#define all(x) x.begin()... | [
"call.arguments.change",
"call.add"
] | 748,183 | 748,184 | u352200121 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
unordered_map<string, int> mp;
int cnt = 0;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int i = 0; i < n; i++) {
so... | #include <bits/stdc++.h>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
unordered_map<string, int> mp;
long long cnt = 0;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 748,185 | 748,186 | u571364079 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
unordered_map<string, int> mp;
long long cnt = 0;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
unordered_map<string, long long> mp;
long long cnt = 0;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int i = 0; i < n; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,188 | 748,189 | u571364079 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
unordered_map<string, int> mp;
long long cnt = 0;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
unordered_map<string, long long> mp;
long long cnt = 0;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
}
for (int i = 0; i < n; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 748,190 | 748,189 | u571364079 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define ws(x) cerr << #x << " is " << x << endl;
#define pb(x) push_back(x)
#define ats(x) ... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define ws(x) cerr << #x << " is " << x << endl;
#define pb(x) push_back(x)
#define ats(x) ... | [
"variable_declaration.type.change"
] | 748,191 | 748,192 | u404338281 | cpp |
p02947 | /*****************Bismillahir Rahmanir Rahim***********************/
#include <bits/stdc++.h>
using namespace std;
/************************Start Of Template*************************/
/******** Mahin Shefat - GhOstMan *************/
#define pb push_back
#define popb pop_back
#define ll long long int
#define ull uns... | /*****************Bismillahir Rahmanir Rahim***********************/
#include <bits/stdc++.h>
using namespace std;
/************************Start Of Template*************************/
/******** Mahin Shefat - GhOstMan *************/
#define pb push_back
#define popb pop_back
#define ll long long int
#define ull uns... | [
"variable_declaration.type.change"
] | 748,197 | 748,198 | u429120546 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vec... | [
"variable_declaration.type.widen.change"
] | 748,199 | 748,200 | u419330815 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,205 | 748,206 | u776056110 | cpp |
p02947 | #include <bits/stdc++.h>
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 ans = 0;
for (auto ch : mp) {
if (ch.second > 1) {
int s = ch.second;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
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 ch : mp) {
if (ch.second > 1) {
long long s = ch.se... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,209 | 748,210 | u345631412 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> X(N);
for (int i = 0; i < N; ++i) {
cin >> X[i];
sort(X[i].begin(), X[i].end());
}
int cnt = 1;
int ans = 0;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long long N;
cin >> N;
vector<string> X(N);
for (int i = 0; i < N; ++i) {
cin >> X[i];
sort(X[i].begin(), X[i].end());
}
long long cnt = 1;
lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,211 | 748,212 | u431929942 | 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 - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i != n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ... | [] | 748,213 | 748,214 | u127348287 | 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 - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i != n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i != b; ++i)
#define RBF(i, n) for (auto &i : n)
#define ABS(n) (n < 0 ? -n : n)
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ... | [] | 748,213 | 748,215 | u127348287 | cpp |
p02947 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 748,216 | 748,217 | u209713918 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
map<string, int> mp;
... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
map<string, int> mp;
... | [
"variable_declaration.type.change"
] | 748,223 | 748,224 | u272105488 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define loop(i, a, b) for (int i = ... | [
"variable_declaration.type.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 748,225 | 748,226 | u614063956 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<vector<char>> vvcStr;
multimap<vector<char>, int> mapvStr;
long long cnt = 0;
for (int i = 0; i != N; i++) {
string strin;
c... | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<vector<char>> vvcStr;
multimap<vector<char>, int> mapvStr;
long long cnt = 0;
for (int i = 0; i != N; i++) {
string strin;
c... | [
"variable_declaration.type.primitive.change"
] | 748,227 | 748,228 | u468440945 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<vector<char>> vvcStr;
multimap<vector<char>, int> mapvStr;
long cnt = 0;
for (int i = 0; i != N; i++) {
string strin;
cin >>... | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<vector<char>> vvcStr;
multimap<vector<char>, int> mapvStr;
long long cnt = 0;
for (int i = 0; i != N; i++) {
string strin;
c... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 748,229 | 748,228 | u468440945 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main(void) {
int n;
long int count = 0;
string s;
unordered_map<string, int> um;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
um[s]++;
}
for (auto &a ... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main(void) {
int n;
long int count = 0;
string s;
unordered_map<string, int> um;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
um[s]++;
}
for (auto &a ... | [
"type_conversion.add"
] | 748,230 | 748,231 | u282366139 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string *s = new string[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
int j = 0;
lo... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string *s = new string[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
long long j = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,237 | 748,238 | u475008359 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string *s = new string[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
int j = 0, num ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string *s = new string[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
long long j = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,239 | 748,238 | u475008359 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
using namespace std;
void solve(map<string, int> m) {
long long ans = 0;
for (auto item : m) {
ans += item.second * (item.second - 1) / 2;
}
p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
using namespace std;
void solve(map<string, long long> m) {
long long ans = 0;
for (auto item : m) {
ans += item.second * (item.second - 1) / 2;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,240 | 748,241 | u910756197 | cpp |
p02947 |
#include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define REP(i, n) for (i = 0; i < (n); ++i)
#define FOR(i, l, h) for (i = (l); i <= (h); ++i)
#define FORD(i, h, l) for (i = (h); i >= (l); --i)
#define max(a, b) a > b ? a : b
#define min(a, b) a > b ? b : a
using namespace std;... | #include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define REP(i, n) for (i = 0; i < (n); ++i)
#define FOR(i, l, h) for (i = (l); i <= (h); ++i)
#define FORD(i, h, l) for (i = (h); i >= (l); --i)
#define max(a, b) a > b ? a : b
#define min(a, b) a > b ? b : a
using namespace std;
... | [] | 748,246 | 748,247 | u172654033 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define INPUT_OUTPUT \
{ \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w"... | #include <bits/stdc++.h>
using namespace std;
#define INPUT_OUTPUT \
{ \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w"... | [
"variable_declaration.type.change"
] | 748,259 | 748,260 | u808454282 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int ans = 0;
int n;
map<string, int> table;
cin >> n;
for (int i = 0;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
long long int ans = 0;
int n;
map<string, int> table;
cin >> n;
for (... | [
"variable_declaration.type.widen.change"
] | 748,268 | 748,269 | u294829559 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int ans = 0;
int n;
map<string, int> table;
cin >> n;
for (int i = 0;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
long long int ans = 0;
int n;
map<string, int> table;
cin >> n;
for (... | [
"control_flow.branch.else.add"
] | 748,270 | 748,269 | u294829559 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin... | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin... | [] | 748,271 | 748,272 | u653807637 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin... | #include <bits/stdc++.h>
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin... | [
"variable_declaration.type.change"
] | 748,273 | 748,272 | u653807637 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
mp[s.at(i)]++;
}
long long pattern = 0;
for (auto x : mp) {
pattern += x.second * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
mp[s.at(i)]++;
}
long long pattern = 0;
for (auto x : mp) {
pattern += x.second * ... | [
"type_conversion.add"
] | 748,274 | 748,275 | u752904037 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<string> S(N);
unordered_map<string... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<string> S(N);
unordered_map<string... | [] | 748,276 | 748,277 | u137747137 | 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[s]++;
}
long long ans = 0;
for (auto &p : mp) {
int s = p.second;
/* cout << "p.second = " << s << endl;... | #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) {
int s = p.second;
/* cout << "p.second = " << s << endl;... | [
"type_conversion.add"
] | 748,278 | 748,279 | u214547877 | cpp |
p02947 | #include "algorithm"
#include "cstdio"
#include "iostream"
using namespace std;
const int maxm = 1e5 + 10;
int N;
string S[maxm];
int main() {
register int i, Now, Ans;
scanf("%d", &N);
for (i = 1; i <= N; i++)
cin >> S[i], sort(S[i].begin(), S[i].end());
sort(S + 1, S + 1 + N);
Now = 1, Ans = 0;
fo... | #include "algorithm"
#include "cstdio"
#include "iostream"
using namespace std;
const int maxm = 1e5 + 10;
int N;
string S[maxm];
int main() {
register int i;
register long long Now, Ans;
scanf("%d", &N);
for (i = 1; i <= N; i++)
cin >> S[i], sort(S[i].begin(), S[i].end());
sort(S + 1, S + 1 + N);
N... | [
"variable_declaration.add",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 748,284 | 748,285 | u733133434 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <assert.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <array>
#include <assert.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 748,288 | 748,289 | u651764969 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_... | [] | 748,290 | 748,291 | u149453212 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
unordered_map<string, int> MP;
for (int i = 0; i < N; i++)
cin >> S[i];
for (int i = 0; i < N; i++) {
sort(S[i].begin(), S[i].end());
MP[S[i]]++;
}
long long ans = 0;
for (auto e : MP) {
a... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<string> S(N);
unordered_map<string, long long> MP;
for (int i = 0; i < N; i++)
cin >> S[i];
for (int i = 0; i < N; i++) {
sort(S[i].begin(), S[i].end());
MP[S[i]]++;
}
long long ans = 0;
for (auto e :... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,292 | 748,293 | u839397805 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define LD long double
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
map<string, int> mapa;
int w = 0;
for (int i = 0; i < n; i++) {
cin >> s;
s... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define LD long double
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
map<string, LL> mapa;
LL w = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sor... | [
"variable_declaration.type.change"
] | 748,296 | 748,297 | u321786655 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define watch(x) cout << #x << " is " << x << endl;
#define print(a, l, r) \
for (int i = l; i < r; i++) \
cout << a[i] << (i == (r - 1) ? endl :... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define watch(x) cout << #x << " is " << x << endl;
#define print(a, l, r) \
for (int i = l; i < r; i++) \
cout << a[i] << (i == (r - 1) ? endl :... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,298 | 748,299 | u089783041 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool sortAsc(char c, char d) { return c < d; }
int main() {
long int N;
cin >> N;
vector<string> words(N);
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
words[i] = str;
}
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool sortAsc(char c, char d) { return c < d; }
int main() {
long int N;
cin >> N;
vector<string> words(N);
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
words[i] = str;
}
for (int i = 0; i ... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 748,300 | 748,301 | u077117247 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define popb pop_back
#define mem(a, b) memset(a, b, sizeof(a))
#define i first
#define j second
#define inf 2e9
#define MOD 1000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define popb pop_back
#define mem(a, b) memset(a, b, sizeof(a))
#define i first
#define j second
#define inf 2e9
#define MOD 1000... | [
"call.arguments.change"
] | 748,302 | 748,303 | u040711752 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define popb pop_back
#define mem(a, b) memset(a, b, sizeof(a))
#define i first
#define j second
#define inf 2e9
#define MOD 1000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define popb pop_back
#define mem(a, b) memset(a, b, sizeof(a))
#define i first
#define j second
#define inf 2e9
#define MOD 1000... | [
"call.arguments.change",
"assignment.change"
] | 748,304 | 748,303 | u040711752 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
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];
}
int ans = 0;
for (auto x : mp) {
ans += x.se... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
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 x : mp) {
ans +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 748,305 | 748,306 | u617619153 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
fast();
int n, i, ans = 0, cnt = 0, j;
cin >> n;
string s;
vector<string> v;
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.push_back(s)... | #include <bits/stdc++.h>
using namespace std;
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
fast();
long long int n, i, ans = 0, cnt = 0, j;
cin >> n;
string s;
vector<string> v;
for (i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.pu... | [
"variable_declaration.type.widen.change"
] | 748,307 | 748,308 | u301397468 | 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;
map<string, int> map;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
map[s]++;
}
int sum = 0;
for (auto x : map)
sum += x.second * (x.second - 1) /... | #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;
map<string, long> map;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
map[s]++;
}
long sum = 0;
for (auto x : map)
sum += x.second * (x.second - 1)... | [
"variable_declaration.type.primitive.change"
] | 748,309 | 748,310 | u207048881 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, int> cnt;
REP(i, N) {
string s;
cin >> s;
sort(ALL(s));
cnt[s]++;
}
ll ans = 0;
for (auto v :... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, ll> cnt;
REP(i, N) {
string s;
cin >> s;
sort(ALL(s));
cnt[s]++;
}
ll ans = 0;
for (auto v : ... | [] | 748,311 | 748,312 | u318727472 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n;
... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.change"
] | 748,315 | 748,316 | u016189984 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n;
... | [
"variable_declaration.type.change"
] | 748,317 | 748,316 | u016189984 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i, n) {
string s;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i, n) {
string s;
... | [
"variable_declaration.type.change"
] | 748,319 | 748,320 | u339937125 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i, n) {
string s;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<string> v(n);
rep(i, n) {
string s;
... | [
"variable_declaration.type.change",
"expression.unary.arithmetic.remove"
] | 748,321 | 748,320 | u339937125 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
typedef long long ll;
typedef vector<string> vec;
typedef vector<vec> mat;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vec s(N);
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
typedef long long ll;
typedef vector<string> vec;
typedef vector<vec> mat;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vec s(N);
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[... | [
"variable_declaration.type.change"
] | 748,328 | 748,329 | u782219335 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int ans = 0;
int N;
cin >> N;
map<string, int> counts;
for (int n = 0; n < N; n++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += counts[s];
counts[s]++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll ans = 0;
int N;
cin >> N;
map<string, int> counts;
for (int n = 0; n < N; n++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += counts[s];
counts[s]++;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 748,332 | 748,333 | u419255487 | cpp |
p02947 | // Green Bin
#include <algorithm>
#include <initializer_list>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; i++) {
string s;
c... | // Green Bin
#include <algorithm>
#include <initializer_list>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long> m;
for (int i = 0; i < N; i++) {
string s;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,334 | 748,335 | u362209280 | cpp |
p02947 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [] | 748,338 | 748,339 | u468700753 | cpp |
p02947 | /*----------------------|
/ Author : Ashraf Tasin |
/ Date : 08.08.19 |
/----------------------*/
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define all v.begin(), v.end()
#define flash \
ios ::sync_wi... | /*----------------------|
/ Author : Ashraf Tasin |
/ Date : 08.08.19 |
/----------------------*/
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define all v.begin(), v.end()
#define flash \
ios ::sync_wi... | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 748,340 | 748,341 | u478656065 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
map<string, int> m;
int ans = 0;
for (int i = 0; i < n; i++) {
string h;
cin >> h;
sort(h.begin(), h.end());
if (m.count(h)) {
m[h]++;
ans += m[h];
} else {
m[h] = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
map<string, int> m;
long long ans = 0;
for (int i = 0; i < n; i++) {
string h;
cin >> h;
sort(h.begin(), h.end());
if (m.count(h)) {
m[h]++;
ans += m[h];
} else {
m[h] = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,342 | 748,343 | u671556593 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
char a[100010][12];
bool camp(char x[], char y[]) {
for (int i = 0; i < 10; i++)
if (x[i] != y[i])
return x[i] < y[i];
return 0;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%s", a[i]), sort(a[i], a[i] + 10);
char **re... | #include <bits/stdc++.h>
using namespace std;
char a[100010][12];
bool camp(char x[], char y[]) {
for (int i = 0; i < 10; i++)
if (x[i] != y[i])
return x[i] < y[i];
return 0;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%s", a[i]), sort(a[i], a[i] + 10);
char **re... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 748,344 | 748,345 | u623737228 | cpp |
p02947 | //#include<bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int q;
cin >> q;
unordered_map<string, int> d;
for (int i = 0; i < q; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (d.find(s) == d.end()) {
... | //#include<bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int q;
cin >> q;
unordered_map<string, int> d;
for (int i = 0; i < q; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (d.find(s) == d.end()) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,353 | 748,354 | u111686122 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> strs;
string curStr;
int total;
cin >> total;
for (int i = 0; i < total; ++i) {
cin >> curStr;
sort(curStr.begin(), curStr.end());
strs.push_back(curStr);
}
sort(strs... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> strs;
string curStr;
int total;
cin >> total;
for (int i = 0; i < total; ++i) {
cin >> curStr;
sort(curStr.begin(), curStr.end());
strs.push_back(curStr);
}
sort(strs... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,355 | 748,356 | u121604126 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> num;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (num.count(str)) {
num[str]++;
} else {
num[str] = 1;
}
}
int64_t result = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> num;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (num.count(str)) {
num[str]++;
} else {
num[str] = 1;
}
}
int64_t result = 0;
... | [
"variable_declaration.type.primitive.change"
] | 748,357 | 748,358 | u408053928 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define db "knapsack"
#define fi first
#define se second
#define endl '\n'
const int INF = 1e9 + 1;
const int maxN = 1e5 + 2;
const int mod = 1e9 + 7;
typedef long long ll;
ty... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define db "knapsack"
#define fi first
#define se second
#define endl '\n'
const int INF = 1e9 + 1;
const int maxN = 1e5 + 2;
const int mod = 1e9 + 7;
typedef long long ll;
ty... | [
"variable_declaration.type.change"
] | 748,359 | 748,360 | u162854028 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> mp;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> mp;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
... | [
"type_conversion.add"
] | 748,367 | 748,368 | u138597672 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> mp;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> mp;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
... | [
"type_conversion.add"
] | 748,369 | 748,368 | u138597672 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.