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;
int main() {
int N;
cin >> N;
string S;
map<string, int> count;
int result = 0;
int i = 0;
while (i < N) {
cin >> S;
sort(S.begin(), S.end());
if (count[S] > 0) {
result += count[S];
}
count[S]++;
i++;
}
cout << result << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
unordered_map<string, int> count;
long result = 0;
int i = 0;
while (i < N) {
cin >> S;
sort(S.begin(), S.end());
if (count[S] > 0) {
result += count[S];
}
count[S]++;
i++;
}
cout <<... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change"
] | 748,371 | 748,372 | u639071683 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
map<string, int> count;
int result = 0;
int i = 0;
while (i < N) {
cin >> S;
sort(S.begin(), S.end());
if (count[S] > 0) {
result += count[S];
}
count[S]++;
i++;
}
cout << result << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
map<string, int> count;
long result = 0;
int i = 0;
while (i < N) {
cin >> S;
sort(S.begin(), S.end());
if (count[S] > 0) {
result += count[S];
}
count[S]++;
i++;
}
cout << result <<... | [
"variable_declaration.type.primitive.change"
] | 748,371 | 748,373 | u639071683 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e15;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const ll MAXN = 1e6 + 10;
const ll N = 4000 + 10;
const ll MN = 200 + 10;
const ll mod = 1e6;
ll a[M... | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e15;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const ll MAXN = 1e6 + 10;
const ll N = 4000 + 10;
const ll MN = 200 + 10;
const ll mod = 1e6;
ll a[M... | [
"variable_declaration.type.change"
] | 748,374 | 748,375 | u080245145 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typed... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typed... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 748,384 | 748,385 | u921177152 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typed... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
typed... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 748,386 | 748,385 | u921177152 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
string s[100000];
int main() {
ll N;
cin >> N;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
string s[100000];
int main() {
ll N;
cin >> N;... | [] | 748,390 | 748,391 | u386806796 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
vector<string> anagrams;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, ans = 0;
string temp;
cin >> N;
while (N--) {
cin >> temp;
sort(temp.begin(), temp.end());
anagrams.push_back(temp);
}
sort(anagrams.begin(... | #include <bits/stdc++.h>
using namespace std;
vector<string> anagrams;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long N, ans = 0;
string temp;
cin >> N;
while (N--) {
cin >> temp;
sort(temp.begin(), temp.end());
anagrams.push_back(temp);
}
sort(anagrams.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 748,392 | 748,393 | u030176410 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; ++i) {
cin >> s[i];
}
for (int i = 0; i < N; ++i) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
ll ans = 0;
int streak = 1;
for (i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; ++i) {
cin >> s[i];
}
for (int i = 0; i < N; ++i) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
ll ans = 0;
ll streak = 1;
for (in... | [
"variable_declaration.type.change"
] | 748,396 | 748,397 | u590088474 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
long long factorial(long long a) {
if (a == 0)
return 1;
return a * factorial(a - 1);
}
int main() {
int n;
cin >> n;
string s;
map<string, int> m;
long long res = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
long long factorial(long long a) {
if (a == 0)
return 1;
return a * factorial(a - 1);
}
int main() {
int n;
cin >> n;
string s;
map<string, int> m;
long long res = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort... | [
"assignment.change"
] | 748,398 | 748,399 | u594272051 | cpp |
p02947 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
map<string, int> mp;
int N;
string s;
long long int ans = 0;... | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
map<string, int> mp;
int N;
string s;
long long int ans = 0;... | [
"variable_declaration.type.widen.change"
] | 748,400 | 748,401 | u473116917 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (... | [
"variable_declaration.type.change"
] | 748,402 | 748,403 | u889989471 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (... | [
"variable_declaration.type.change"
] | 748,404 | 748,403 | u889989471 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, ll> m;
ll count = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
count += m[s];
m[s]++;
cout << count << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, ll> m;
ll count = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
count += m[s];
m[s]++;
}
cout << count << endl;
return 0;
}
| [] | 748,405 | 748,406 | u280162245 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s = {};
string x;
for (int i = 0; i < n; i++) {
cin >> x;
s.push_back(x);
}
map<string, int> s_map;
for (auto &x : s) {
sort(x.begin(), x.end());
s_map[x]++;
}
long count = 0;
for (auto ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s = {};
string x;
for (int i = 0; i < n; i++) {
cin >> x;
s.push_back(x);
}
map<string, long> s_map;
for (auto &x : s) {
sort(x.begin(), x.end());
s_map[x]++;
}
long count = 0;
for (auto... | [
"variable_declaration.type.primitive.change"
] | 748,407 | 748,408 | u874414087 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
unordered_map<string, int> strs;
string str;
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
strs[str]++;
}
for (auto str :... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
long sum = 0;
cin >> n;
unordered_map<string, int> strs;
string str;
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
strs[str]++;
}
for (aut... | [
"variable_declaration.type.widen.change"
] | 748,409 | 748,410 | u247407965 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | [] | 748,411 | 748,412 | u186089447 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
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 = 0;
for (i = 0; i < n; ++i) {
int temp = 0;
while (i < n - 1 && s[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
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 = 0;
for (i = 0; i < n; ++i) {
long long temp = 0;
while (i < n - 1 && ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,413 | 748,414 | u592300048 | cpp |
p02947 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 748,415 | 748,416 | u117615163 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
// map<string,int>m;
int n;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sort(a[i].begin(), a[i].end());
}
int br = 0;
int kolku = 1;
sort(a, a + n);
for (int i = 0; i < (n - 1); i++) {
if (a[i] == a[i + 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sort(a[i].begin(), a[i].end());
}
long long int br = 0;
long long int kolku = 1;
sort(a, a + n);
for (int i = 0; i < (n - 1); i++) {
if (a[i] == a[i + 1]) {... | [
"variable_declaration.type.widen.change"
] | 748,417 | 748,418 | u079553980 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int ans = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sor... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int ans = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sor... | [
"variable_declaration.type.widen.change"
] | 748,419 | 748,420 | u045575753 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int ans = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
std::sort(s[i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int ans = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sor... | [
"variable_declaration.type.widen.change"
] | 748,421 | 748,420 | u045575753 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
long N;
int count = 0;
char *str;
string s_str;
char tmp;
int result = 0;
std::unordered_map<std::string, int> mp;
cin >> N;
for (int k = 0; k < N; k++) {
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
long N;
char *str;
string s_str;
char tmp;
long result = 0;
std::unordered_map<std::string, int> mp;
cin >> N;
for (int k = 0; k < N; k++) {
str = new char[... | [
"variable_declaration.remove",
"variable_declaration.type.primitive.change"
] | 748,424 | 748,425 | u755989869 | cpp |
p02947 | #define _USE_MATH_DEFINES
//
#include <bits/stdc++.h>
//
using namespace std;
//
#define krep(i, k, n) for (int i = k; i < n; ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define toupp(s) transform(s.begin(), s.end(), s.begin(), ::toupper) // string
#define tolow(s) transform(s.begin(), s.end(), s.begin(), ::tolo... | #define _USE_MATH_DEFINES
//
#include <bits/stdc++.h>
//
using namespace std;
//
#define krep(i, k, n) for (int i = k; i < n; ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define toupp(s) transform(s.begin(), s.end(), s.begin(), ::toupper) // string
#define tolow(s) transform(s.begin(), s.end(), s.begin(), ::tolo... | [
"call.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change"
] | 748,426 | 748,427 | u387775996 | cpp |
p02947 | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb... | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb... | [] | 748,428 | 748,429 | u006069211 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
unordered_map<string, int> cnt;
int ans = 0;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
ans += cnt[s] - 1;
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
unordered_map<string, int> cnt;
LL ans = 0;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
ans += cnt[s] - 1;
}
cou... | [
"variable_declaration.type.change"
] | 748,437 | 748,438 | u194917097 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s;
int N;
unordered_map<string, int> hash;
ll sum = 0;
cin >> N;
... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string s;
int N;
unordered_map<string, ll> hash;
ll sum = 0;
cin >> N;
... | [] | 748,439 | 748,440 | u577599930 | cpp |
p02947 | #include <bits/stdc++.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int count = 0;
unordered_map<string, int> num;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (num[s[i]]) {
num[s[i]]... | #include <bits/stdc++.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
long count = 0;
unordered_map<string, int> num;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (num[s[i]]) {
num[s[i]... | [
"variable_declaration.type.primitive.change"
] | 748,443 | 748,444 | u413488238 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S;
while (N--) {
string s;
vector<char> s_vec;
cin >> s;
for (int i = 0; i < s.size(); i++) {
s_vec.push_back(s[i]);
}
sort(s_vec.begin(), s_vec.end());
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S;
while (N--) {
string s;
vector<char> s_vec;
cin >> s;
for (int i = 0; i < s.size(); i++) {
s_vec.push_back(s[i]);
}
sort(s_vec.begin(), s_vec.end());
... | [
"variable_declaration.type.widen.change"
] | 748,445 | 748,446 | u074372598 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
int main() {
int N;
std::string s;
std::map<std::string, int> mp;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> s;
// std::cout << i << " " << s << std::endl;
std::sort(s.begin(), s.end());
// std::cout << i << " " <<... | #include <algorithm>
#include <iostream>
#include <map>
int main() {
int N;
std::string s;
std::map<std::string, int> mp;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> s;
// std::cout << i << " " << s << std::endl;
std::sort(s.begin(), s.end());
// std::cout << i << " " <<... | [
"type_conversion.add"
] | 748,447 | 748,448 | u632628124 | cpp |
p02947 | #include <bits/stdc++.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int ans = 0;
vector<string> s(N);
unordered_map<string, int> mp;
//文字列を入力後ソート
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
// mpが設定されていなかっ... | #include <bits/stdc++.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
long long ans = 0;
vector<string> s(N);
unordered_map<string, int> mp;
//文字列を入力後ソート
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
// mpが設定さ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,449 | 748,450 | u281840563 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
typedef long long ll;
map<string, int> mp;
int main() {
int n;
scanf("%d", &n);
string s[N];
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
ll ans = 0;
for (auto it = mp.begin(); it ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
typedef long long ll;
map<string, ll> mp;
int main() {
int n;
scanf("%d", &n);
string s[N];
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
ll ans = 0;
for (auto it = mp.begin(); it !... | [
"assignment.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 748,454 | 748,455 | u936668693 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
// long long ccw(const Point& A, const Point& B, const Point& C) {
// return 1LL * (B.x - A.x)*(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
// long long ccw(const Point& A, const Point& B, const Point& C) {
// return 1LL * (B.x - A.x)*(... | [
"variable_declaration.type.change"
] | 748,456 | 748,457 | u064087840 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long ans = 0, cnt = 1;
for (int i = 1; i < n; ++i)
if (s[i] == s[i - 1]) {
ans += cnt;
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long ans = 0, cnt = 1;
for (int i = 1; i < n; ++i)
if (s[i] == s[i - 1]) {
ans += cnt;
c... | [
"literal.number.change",
"assignment.value.change"
] | 748,458 | 748,459 | u971421535 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 748,460 | 748,461 | u851831516 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 748,462 | 748,461 | u851831516 | cpp |
p02947 | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <vector>
using namespace std;
int mainC() {
string str;
cin >> str;
int n = stoi(str);
map<string, int> strMap;
for (int i = 0; i < n; ++i) {
cin >> str;
sort(str.begin(), str.end());
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <vector>
using namespace std;
int mainC() {
string str;
cin >> str;
int n = stoi(str);
map<string, long long> strMap;
for (int i = 0; i < n; ++i) {
cin >> str;
sort(str.begin(), str.en... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,465 | 748,466 | u227117171 | cpp |
p02947 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | [
"type_conversion.add"
] | 748,468 | 748,469 | u343110708 | cpp |
p02947 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | [
"assignment.change"
] | 748,470 | 748,469 | u343110708 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> str(N);
map<string, int> m;
for (int i = 0; i < N; i++) {
cin >> str.at(i);
sort(str[i].begin(), str[i].en... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> str(N);
map<string, long long> m;
for (int i = 0; i < N; i++) {
cin >> str.at(i);
sort(str[i].begin(), str... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,471 | 748,472 | u803481017 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
using namespace std;
int main(void) {
int N, ans = 0, cnt = 0;
cin >> N;
vector<string> s(N);
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
so... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
using namespace std;
int main(void) {
long N, ans = 0, cnt = 0;
cin >> N;
vector<string> s(N);
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
s... | [
"variable_declaration.type.primitive.change"
] | 748,473 | 748,474 | u144980750 | cpp |
p02947 | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
type... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
type... | [
"variable_declaration.type.widen.change"
] | 748,479 | 748,480 | u655810450 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
int count = 1;
for (int i = 1; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
long count = 1;
for (int i = 1; i < n... | [
"variable_declaration.type.primitive.change"
] | 748,483 | 748,484 | u680087927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
int count = 1;
for (int i = 1; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
long count = 1;
for (int i = 1; i < n... | [
"variable_declaration.type.primitive.change"
] | 748,485 | 748,484 | u680087927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long ans = 0;
int count = 1;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
long count = 1;
for (int i = 1; i < n... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change"
] | 748,486 | 748,484 | u680087927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
int count = 1;
for (int i = 1; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
int count = 1;
for (int i = 1; i < n;... | [
"type_conversion.add"
] | 748,483 | 748,488 | u680087927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
int count = 1;
for (int i = 1; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
int count = 1;
for (int i = 1; i < n;... | [
"type_conversion.add"
] | 748,485 | 748,488 | u680087927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long ans = 0;
int count = 1;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
int count = 1;
for (int i = 1; i < n;... | [
"variable_declaration.type.narrow.change"
] | 748,486 | 748,488 | u680087927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long ans = 0;
int count = 1;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long ans = 0;
long count = 1;
for (int i = 1; i < n... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change"
] | 748,486 | 748,490 | u680087927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " " << x << '\n';
int main() {
int n;
cin >> n;
string s;
vector<string> v(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v[i] = s;
}
long int cnt = 0;
sort(v.begin(), v.end());
int pos = 0,... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << " " << x << '\n';
#define int long long
signed main() {
int n;
cin >> n;
string s;
vector<string> v(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v[i] = s;
}
int cnt = 0;
sort(v.begin(), v.en... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.narrow.change"
] | 748,491 | 748,492 | u502092128 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
ret... | [
"call.remove",
"call.arguments.change"
] | 748,493 | 748,494 | u763881112 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
map<string, int> mp;
int n;
cin >> n;
int cnt = 0;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt += mp[s];
mp[s]++;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
map<string, ll> mp;
ll n;
cin >> n;
ll cnt = 0;
while (n--) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt += mp[s];
mp[s]++;
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 748,499 | 748,500 | u983588973 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long ans = 0;
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 i = 0, j = 0;
while... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long ans = 0;
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 i = 0, j = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,505 | 748,506 | u219041750 | cpp |
p02947 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
const long long MOD = 1000000007LL;
const long long INF = 1e18;
int GCD(int a, int b) { return b == 0 ? a : GC... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
const long long MOD = 1000000007LL;
const long long INF = 1e18;
int GCD(int a, int b) { return b == 0 ? a : GC... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,509 | 748,510 | u276568758 | cpp |
p02947 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long total = 0;
vector<string> s(N);
map<string, int> sM{};
for (int i = 0; i < N; i++) {
string temp;
cin >> temp;
sort(temp.begin(), temp.end());
/* s[i] = temp;*/
sM[temp]++;
}
for (auto val :... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long total = 0;
vector<string> s(N);
map<string, int> sM{};
for (int i = 0; i < N; i++) {
string temp;
cin >> temp;
sort(temp.begin(), temp.end());
/* s[i] = temp;*/
sM[temp]++;
}
for (auto val :... | [
"type_conversion.add"
] | 748,515 | 748,516 | u142253890 | cpp |
p02947 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec(n);
unordered_map<string, int> mp;
int count = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
s... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vec(n);
unordered_map<string, int> mp;
long long count = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,524 | 748,525 | u759162415 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> array(N);
string s;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
array[i] = s;
}
sort(array.begin(), array.end());
long long ans = 0;
int count = 1;
for (int i = 1; i < N; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> array(N);
string s;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
array[i] = s;
}
sort(array.begin(), array.end());
long long ans = 0;
long long count = 1;
for (int i = 1; i < ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,535 | 748,536 | u507188501 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int ans;
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.find(s) == m.end()) {
m[s] = 1;
} else {
ans += m[s];
m[s]+... | #include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.find(s) == m.end()) {
m[s] = 1;
} else {
ans += m[s];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,537 | 748,538 | u058333722 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define MAX_N 100050
int N;
string s[MAX_N];
void solve() {
long long ans = 0;
int count = 1;
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
for (int i = 1; i < N; i++) {
if ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define MAX_N 100050
int N;
string s[MAX_N];
void solve() {
long long ans = 0;
long long count = 1;
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
for (int i = 1; i < N; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,549 | 748,550 | u835561357 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
sort(s[i].begin(), s[i].end());
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
sort(s[i].begin(), s[i].end());
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.type.narrow.change"
] | 748,551 | 748,552 | u100919930 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
sort(s[i].begin(), s[i].end());
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
sort(s[i].begin(), s[i].end());
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,553 | 748,552 | u100919930 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
sort(s[i].begin(), s[i].end());
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
sort(s[i].begin(), s[i].end());
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,554 | 748,552 | u100919930 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long INF = 1000000000000000;
int main() {
long N;
cin >> N;
vector<string> s(N + 1);
s.at(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());
int ans = 0, count;
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
long INF = 1000000000000000;
int main() {
long N;
cin >> N;
vector<string> s(N + 1);
s.at(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());
long ans = 0, count;
for (int i = 1... | [
"variable_declaration.type.primitive.change"
] | 748,555 | 748,556 | u968365254 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string str;
map<string, int> dic;
for (int i = 0; i < N; ++i) {
cin >> str;
sort(str.begin(), str.end());
auto itr = dic.find(str);
if (itr != dic.e... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string str;
map<string, int> dic;
for (int i = 0; i < N; ++i) {
cin >> str;
sort(str.begin(), str.end());
auto itr = dic.find(str);
if (itr != dic.e... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,557 | 748,558 | u774160580 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string str;
map<string, int> dic;
for (int i = 0; i < N; ++i) {
cin >> str;
sort(str.begin(), str.end());
auto itr = dic.find(str);
if (itr != dic.e... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string str;
map<string, int> dic;
for (int i = 0; i < N; ++i) {
cin >> str;
sort(str.begin(), str.end());
auto itr = dic.find(str);
if (itr != dic.e... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,559 | 748,558 | u774160580 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | [
"variable_declaration.type.change"
] | 748,560 | 748,561 | u311671153 | cpp |
p02947 | #include <bits/stdc++.h>
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
int n;
std::cin >> n;
std::vector<std::string> s(n);
for (auto &x : s) {
std::cin >> x;
std::sort(x.begin(), x.end());
}
std::sort(s.begin(), s.end());
s.push_back(std::string{});
auto prv = std::string{}... | #include <bits/stdc++.h>
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
int n;
std::cin >> n;
std::vector<std::string> s(n);
for (auto &x : s) {
std::cin >> x;
std::sort(x.begin(), x.end());
}
std::sort(s.begin(), s.end());
s.push_back(std::string{});
auto prv = std::string{}... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,566 | 748,567 | u846041485 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int n;
string s[MAXN];
void solve() {
map<string, int> m;
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
m[s[i]]++;
}
ll sum = 0;
for (auto x : m) {
sum +... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int n;
string s[MAXN];
void solve() {
map<string, ll> m;
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
m[s[i]]++;
}
ll sum = 0;
for (auto x : m) {
sum +=... | [] | 748,570 | 748,571 | u550178285 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> count;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
count[s]++;
}
int64_t ans = 0;
for (auto x : count) {
ans += x.second * (x.sec... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> count;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
count[s]++;
}
int64_t ans = 0;
for (auto x : count) {
ans += (int64_t)x.second... | [
"type_conversion.add"
] | 748,572 | 748,573 | u716314620 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ct(string) cout << string << endl
int main() {
int n;
int64_t ans = 0;
cin >> n;
map<string, int> data;
rep(i, n) {
string s;
c... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ct(string) cout << string << endl
int main() {
int n;
int64_t ans = 0;
cin >> n;
map<string, int64_t> data;
rep(i, n) {
string s;
... | [
"variable_declaration.type.primitive.change"
] | 748,574 | 748,575 | u716314620 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, cnt = 0;
cin >> n;
unordered_map<string, long long> mp;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
cnt +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, cnt = 0;
cin >> n;
unordered_map<string, long long> mp;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
cnt +=... | [
"variable_declaration.type.change"
] | 748,576 | 748,577 | u952437626 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
long long res = 0;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &p : mp) {
int r = p.second;
res = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
long long res = 0;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (auto &p : mp) {
int r = p.second;
res +=... | [
"assignment.value.change"
] | 748,578 | 748,579 | u779636842 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
vector<string> strings(N);
for (int n = 0; n < N; ++n) {
cin >> strings[n];
sort(strings[n].begin(), strings[n].end());
}
sort(strings.begin(), strings.end());
int previdx = 0;
string prev = strings[0];
long long a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<string> strings(N);
for (int n = 0; n < N; ++n) {
cin >> strings[n];
sort(strings[n].begin(), strings[n].end());
}
sort(strings.begin(), strings.end());
int previdx = 0;
string prev = st... | [] | 748,582 | 748,583 | u071203963 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
map<string, int> vis;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
vis[s]++;
}
long long ans = 0;
for (auto it : vis)
ans += (it.second - 1) * it.secon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
map<string, long long> vis;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
vis[s]++;
}
long long ans = 0;
for (auto it : vis)
ans += (it.second - 1) * it... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,586 | 748,587 | u659003514 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
const ll mod = 1e9 + 9;
ll key(string s) {
ll ans = 0;
for (int i = 0; i < (int)s.length(); i++) {
ans = ((ans * 233LL) + s[i]) % mod;
}
return ans;
}
int main() {
int n;
while (cin >> n) {
string s;
... | #include <bits/stdc++.h>
using namespace std;
// typedef long long ll;
typedef unsigned long long ll;
const int maxn = 1e5 + 5;
const ll mod = 1e9 + 9;
ll key(string s) {
ll ans = 0;
for (int i = 0; i < (int)s.length(); i++) {
ans = ((ans * 233LL) + s[i]);
}
return ans;
}
int main() {
int n;
while (c... | [
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 748,588 | 748,589 | u659003514 | cpp |
p02947 | #include <bits/stdc++.h>
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(s.begin(), s.end());
m[s]++;
}
long long ans = 0;
for (auto n : m)
ans += n.second * (n.second - 1) / 2;
cout << ans << endl;
r... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
map<string, long long> 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 n : m)
ans += n.second * (n.second - 1) / 2;
cout << ans << end... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,590 | 748,591 | u898331860 | cpp |
p02947 | //============================
// ABC137c Green Bin
//
// 2019/08/12
//============================
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define NUM 100000
int main(int argc, char *argv[]) {
int N;
map<string, int> m;
cin >> N;
... | //============================
// ABC137c Green Bin
//
// 2019/08/12
//============================
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int N;
map<string, int> m;
cin >> N;
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change"
] | 748,595 | 748,596 | u235027735 | cpp |
p02947 | //============================
// ABC137c Green Bin
//
// 2019/08/12
//============================
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define NUM 100000
int main(int argc, char *argv[]) {
int N;
map<string, int> m;
cin >> N;
... | //============================
// ABC137c Green Bin
//
// 2019/08/12
//============================
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int N;
map<string, int> m;
cin >> N;
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change"
] | 748,597 | 748,596 | u235027735 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
string s;
int count;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
count += mp[s];
mp[s]++;
}
cout << count;
} | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
string s;
uint64_t count = 0;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
count += mp[s];
mp[s]++;
}
cout << count;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 748,601 | 748,599 | u628597699 | cpp |
p02947 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [
"variable_declaration.type.change"
] | 748,614 | 748,615 | u102602414 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto p : mp) {
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
... | [
"call.arguments.change"
] | 748,620 | 748,621 | u120967809 | cpp |
p02947 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | [
"variable_declaration.type.change"
] | 748,622 | 748,623 | u989928804 | cpp |
p02947 | // this is moxin's code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#ifdef _LOCAL
struct Tester {
Tester() { freopen("sample.in", "r", stdin); }
~Tester() {
fprintf(stderr, "\nTime: %d ms\n", int(1000.0 * clock() / CLOCKS_PER_SEC... | // this is moxin's code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#ifdef _LOCAL
struct Tester {
Tester() { freopen("sample.in", "r", stdin); }
~Tester() {
fprintf(stderr, "\nTime: %d ms\n", int(1000.0 * clock() / CLOCKS_PER_SEC... | [
"literal.number.type.widen.change"
] | 748,626 | 748,627 | u221505564 | cpp |
p02947 | // this is moxin's code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#ifdef _LOCAL
struct Tester {
Tester() { freopen("sample.in", "r", stdin); }
~Tester() {
fprintf(stderr, "\nTime: %d ms\n", int(1000.0 * clock() / CLOCKS_PER_SEC... | // this is moxin's code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#ifdef _LOCAL
struct Tester {
Tester() { freopen("sample.in", "r", stdin); }
~Tester() {
fprintf(stderr, "\nTime: %d ms\n", int(1000.0 * clock() / CLOCKS_PER_SEC... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 748,628 | 748,627 | u221505564 | cpp |
p02947 | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | #include <bits/stdc++.h> // include all standard C++ libraries
using namespace std;
// Loops
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i ... | [
"variable_declaration.type.change"
] | 748,631 | 748,632 | u292813062 | cpp |
p02947 | /*
友利奈緒ぱわーでACしてくれ！！！！！！！！！！！！
Charlotteまだ見てない人は見ような！！！！！！！
／ /:／ ＼:ヽ ＼
/ ／ ＼ ヽ
＼__L 彡 ヽ ',
ﾌ / / / / , ヽ ', ｊ
ﾚ / / / ', ヽ j
//... | /*
友利奈緒ぱわーでACしてくれ！！！！！！！！！！！！
Charlotteまだ見てない人は見ような！！！！！！！
／ /:／ ＼:ヽ ＼
/ ／ ＼ ヽ
＼__L 彡 ヽ ',
ﾌ / / / / , ヽ ', ｊ
ﾚ / / / ', ヽ j
//... | [] | 748,633 | 748,634 | u949798495 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0, sum = 0;
int n;
cin >> n;
// string s;
vector<char> sarray(10);
map<vector<char>, int> sames;
char c;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++) {
cin >> c;
sarray[j] = c;
}
sort(sar... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0, sum = 0;
int n;
cin >> n;
// string s;
vector<char> sarray(10);
map<vector<char>, long long> sames;
char c;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10; j++) {
cin >> c;
sarray[j] = c;
}
so... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,635 | 748,636 | u355424600 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
vector<string> v;
string tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
v.push_back(tmp);
}
sort(v.begin(), v.end());
int cnt = 0, c... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
vector<string> v;
string tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
v.push_back(tmp);
}
sort(v.begin(), v.end());
long lon... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,643 | 748,644 | u112318601 | 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 num = p.second;
ans += (long long)(num * (num - 1) / ... | #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 num = p.second;
ans += (long long)num * (num - 1) / 2... | [] | 748,645 | 748,646 | u460608786 | cpp |
p02947 |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000 + 5
typedef long long ll;
int main() {
int n;
cin >> n;
int a = 0;
int b = 10;
string s;
vector<string> t(n);
map<string, int> mp;
int ans = 0;
for (int i = 0; i < n;... |
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000 + 5
typedef long long ll;
int main() {
int n;
cin >> n;
int a = 0;
int b = 10;
string s;
vector<string> t(n);
map<string, int> mp;
ll ans = 0;
for (int i = 0; i < n; ... | [
"variable_declaration.type.change"
] | 748,651 | 748,652 | u085230936 | cpp |
p02947 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10;
char s[20];
int n, ans, p[maxn];
signed main() {
scanf("%lld", &n);
for (register int i = 1; i <= n; i++) {
scanf("%s", s + 1);
int len = strlen(s + 1);
sort(s + 1, s + len + 1);
for (register int j = 1; j... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10;
char s[20];
int n, ans, p[maxn];
signed main() {
scanf("%lld", &n);
for (register int i = 1; i <= n; i++) {
scanf("%s", s + 1);
int len = strlen(s + 1);
sort(s + 1, s + len + 1);
for (register int j = 1; j... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 748,653 | 748,654 | u038806998 | cpp |
p02947 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10;
char s[20];
int n, ans, p[maxn];
signed main() {
scanf("%lld", &n);
for (register int i = 1; i <= n; i++) {
scanf("%s", s + 1);
int len = strlen(s + 1);
sort(s + 1, s + len + 1);
for (register int j = 1; j... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10;
char s[20];
int n, ans, p[maxn];
signed main() {
scanf("%lld", &n);
for (register int i = 1; i <= n; i++) {
scanf("%s", s + 1);
int len = strlen(s + 1);
sort(s + 1, s + len + 1);
for (register int j = 1; j... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 748,655 | 748,654 | u038806998 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
... | [
"type_conversion.add"
] | 748,656 | 748,657 | u969617556 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
string s;
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int main(... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
string s;
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int main(... | [
"variable_declaration.type.widen.change"
] | 748,664 | 748,665 | u071036035 | cpp |
p02947 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gcd(x, y) __gcd(x, y)
#define PI 3.14159265
#define endl "\n"
#define count_ones __builtin_popcountl
#define piii pair<int, pair<int, int>>
const int N ... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gcd(x, y) __gcd(x, y)
#define PI 3.14159265
#define endl "\n"
#define count_ones __builtin_popcountl
#define piii pair<int, pair<int, int>>
const int N ... | [
"variable_declaration.type.change"
] | 748,675 | 748,674 | u787337234 | cpp |
p02947 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gcd(x, y) __gcd(x, y)
#define PI 3.14159265
#define endl "\n"
#define count_ones __builtin_popcountl
#define piii pair<int, pair<int, int>>
const int N ... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gcd(x, y) __gcd(x, y)
#define PI 3.14159265
#define endl "\n"
#define count_ones __builtin_popcountl
#define piii pair<int, pair<int, int>>
const int N ... | [
"variable_declaration.type.change"
] | 748,676 | 748,674 | u787337234 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll fun(int x) { return (x * (x - 1)) / (2 * 1LL); }
int main() {
ll t, tot = 0;
cin >> t;
map<string, ll> m;
string s;
while (t--) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto i : m)
tot += fun(i.second);
cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll fun(ll x) { return (x * (x - 1)) / (2 * 1LL); }
int main() {
ll t, tot = 0;
cin >> t;
map<string, ll> m;
string s;
while (t--) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto i : m)
tot += fun(i.second);
cout... | [] | 748,677 | 748,678 | u452198080 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
int main() {
int n;
cin >> n;
map<string, int> mp;
// vector<ll> vals(n);
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define MOD (int)1e9 + 7
int main() {
int n;
cin >> n;
map<string, int> mp;
// vector<ll> vals(n);
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
... | [
"type_conversion.add"
] | 748,680 | 748,681 | u263654061 | cpp |
p02947 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, sm = 0;
cin >> n;
map<string, ll> mp;
string s;
for (ll i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
ll n, sm = 0;
cin >> n;
map<string, ll> mp;
string s;
for (ll i = 0; i < n; i++) {
... | [
"assignment.variable.change",
"identifier.change",
"io.output.change"
] | 748,682 | 748,683 | u930561195 | cpp |
p02947 | /*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define vll vector<ll>
#define lb lower_boun... | /*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define vll vector<ll>
#define lb lower_boun... | [
"call.arguments.change"
] | 748,686 | 748,687 | u216557283 | cpp |
p02947 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | [
"function.return_type.change"
] | 748,688 | 748,689 | u775507068 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.