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>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
string s[100005];
map<string, int> mp;
cin >> n;
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
rep(i, n - 1) {
if (s[i] == s[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
string s[100005];
map<string, int> mp;
cin >> n;
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
rep(i, n - 1) {
if (s[i] == s[... | [
"variable_declaration.type.change"
] | 746,198 | 746,199 | u529722835 | cpp |
p02947 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define... | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 746,200 | 746,201 | u526278960 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int resum(int64_t n) {
int64_t t = 0;
for (int64_t i = 1; i <= n; i++) {
t += i;
}
return t;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
}
map<string, long long> v;
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
int resum(int64_t n) {
int64_t t = 0;
for (int64_t i = 1; i <= n; i++) {
t += i;
}
return t;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
}
map<string, long long> v;
for (int i = 0; i < n; ... | [
"literal.number.change",
"call.arguments.change"
] | 746,202 | 746,203 | u690326065 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for (ll i = 0; i < n; i++)
//#define DEBUG(fmt, ...)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main() {
std::cout << std::fix... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for (ll i = 0; i < n; i++)
//#define DEBUG(fmt, ...)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main() {
std::cout << std::fix... | [] | 746,211 | 746,212 | u014854522 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
ll MOD = 1000000007;
ll INF ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
ll MOD = 1000000007;
ll INF ... | [
"variable_declaration.type.change"
] | 746,213 | 746,214 | u937618939 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
string s[n + 1];
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < 10; j++) {
for (int k = 9; k >= j; k--) {
if (s[i][k] < s[i][k - 1]) {
char a;
a = s[i][k];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
string s[n + 1];
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < 10; j++) {
for (int k = 9; k >= j; k--) {
if (s[i][k] < s[i][k - 1]) {
char a;
a = s[i][k];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,221 | 746,222 | u490965711 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
string s[n + 1];
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < 10; j++) {
for (int k = 9; k > j; k--) {
if (s[i][k] < s[i][k - 1]) {
char a;
a = s[i][k];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
string s[n + 1];
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < 10; j++) {
for (int k = 9; k >= j; k--) {
if (s[i][k] < s[i][k - 1]) {
char a;
a = s[i][k];
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,223 | 746,222 | u490965711 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
string s[n + 1];
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < 10; j++) {
for (int k = 10; k > j; k--) {
if (s[i][k] < s[i][k - 1]) {
char a;
a = s[i][k];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
string s[n + 1];
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < 10; j++) {
for (int k = 9; k >= j; k--) {
if (s[i][k] < s[i][k - 1]) {
char a;
a = s[i][k];
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.type.primitive.change",
"vari... | 746,224 | 746,222 | u490965711 | 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 &p : mp) {
int u = p.second;
ans += u * (u - 1) / 2;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p : mp) {
int u = p.second;
ans += (long long)u * (u - 1) / 2;
}
... | [
"variable_declaration.type.change"
] | 746,226 | 746,227 | u834753207 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
void solve(long N, vector<string> s) {
unordered_map<string, int> count;
REP(i, N) {
string si = s[i];
sort(si.begin(), si.end());
count[si]++;
}
long ans(0);
for (const auto &kv : count) {
int v = kv... | #include <bits/stdc++.h>
#define REP(i, n) for (long i = 0; i < n; ++i)
using namespace std;
void solve(long N, vector<string> s) {
unordered_map<string, long> count;
REP(i, N) {
string si = s[i];
sort(si.begin(), si.end());
count[si]++;
}
long ans(0);
for (const auto &kv : count) {
long v =... | [
"preprocessor.define.value.change",
"variable_declaration.type.primitive.change"
] | 746,229 | 746,230 | u280941196 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<string> S(n);
rep(i, n) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S.begin(), S.end());
ll ans = 0, kotae = 0;
rep(i, n - 1) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<string> S(n);
rep(i, n) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S.begin(), S.end());
ll ans = 0, kotae = 0;
rep(i, n - 1) {
... | [
"identifier.change",
"io.output.change"
] | 746,231 | 746,232 | u553123421 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
map<string, ll> s;
rep(i, n) {
string S;
cin >> S;
sort(S.begin(), S.end());
s[S]++;
}
ll ans = 0;
for (auto x : s) {
if (x.second != 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
map<string, ll> s;
rep(i, n) {
string S;
cin >> S;
sort(S.begin(), S.end());
s[S]++;
}
ll ans = 0;
for (auto x : s) {
if (x.second != 1... | [
"assignment.change"
] | 746,233 | 746,234 | u692550512 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<map<char, int>> ana(n);
map<map<char, int>, int> koromo;
rep(i, n) {
string s;
cin >> s;
rep(j, 10) { ana[i][s[j]]++; }
koromo[ana[i]]+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
vector<map<char, ll>> ana(n);
map<map<char, ll>, ll> koromo;
rep(i, n) {
string s;
cin >> s;
rep(j, 10) { ana[i][s[j]]++; }
koromo[ana[i]]++;
... | [
"variable_declaration.type.change"
] | 746,235 | 746,236 | u692550512 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0;
map<string, int> mp;
cin >> N;
rep(i, N) {
string S;
cin >> S;
sort(S.begin(), S.end());
mp[S]++;
}
ll ans = 0;
for (auto p : mp) {
ans += p.sec... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0;
map<string, ll> mp;
cin >> N;
rep(i, N) {
string S;
cin >> S;
sort(S.begin(), S.end());
mp[S]++;
}
ll ans = 0;
for (auto p : mp) {
ans += p.seco... | [] | 746,237 | 746,238 | u213375012 | cpp |
p02947 | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | [
"variable_declaration.type.change"
] | 746,239 | 746,240 | u915716225 | cpp |
p02947 | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | #include <bits/stdc++.h>
// DEEP
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | [] | 746,241 | 746,240 | u915716225 | cpp |
p02947 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstring>
#include <deque> // deque
#include <fl... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstring>
#include <deque> // deque
#include <fl... | [
"variable_declaration.type.change"
] | 746,242 | 746,243 | u830770242 | cpp |
p02947 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstring>
#include <deque> // deque
#include <fl... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstring>
#include <deque> // deque
#include <fl... | [] | 746,244 | 746,243 | u830770242 | cpp |
p02947 | // Green Bin
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | // Green Bin
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | [
"variable_declaration.type.change"
] | 746,245 | 746,246 | u663842230 | cpp |
p02947 | // sort(b.begin(), b.end());//bという配列を小さい方からソート
// reverse(b.begin(), b.end());//bという配列をリターン
// 10桁でdouble出力するパターン１
// printf("%.10f\n", ma);
// 10桁でdouble出力するパターン２
// cout << fixed << setprecision(10);
// cout << ma << endl;
/*01 02 03 12 13 23 と６回見ていくパターン
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
}
}
*... | // sort(b.begin(), b.end());//bという配列を小さい方からソート
// reverse(b.begin(), b.end());//bという配列をリターン
// 10桁でdouble出力するパターン１
// printf("%.10f\n", ma);
// 10桁でdouble出力するパターン２
// cout << fixed << setprecision(10);
// cout << ma << endl;
/*01 02 03 12 13 23 と６回見ていくパターン
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
}
}
*... | [
"type_conversion.add"
] | 746,249 | 746,250 | u037563046 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
re... | [
"variable_declaration.type.change"
] | 746,253 | 746,254 | u332253305 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | [
"assignment.change"
] | 746,255 | 746,256 | u277556971 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / 2)... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / 2)... | [
"variable_declaration.type.change"
] | 746,257 | 746,258 | u577511087 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / 2)... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / 2)... | [
"variable_declaration.type.change"
] | 746,259 | 746,258 | u577511087 | cpp |
p02947 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double ... | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double ... | [
"variable_declaration.type.change",
"variable_declaration.remove"
] | 746,260 | 746,261 | u339430228 | cpp |
p02947 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double ... | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double ... | [
"variable_declaration.type.change",
"variable_declaration.remove"
] | 746,262 | 746,263 | u339430228 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int Ans = 0;
vector<vector<char>> S(N, vector<char>(10));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> S.at(i).at(j);
}
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t Ans = 0;
vector<vector<char>> S(N, vector<char>(10));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> S.at(i).at(j);
}
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end())... | [
"variable_declaration.type.primitive.change"
] | 746,264 | 746,265 | u164730704 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int Ans = 0;
vector<vector<char>> S(N, vector<char>(10));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> S.at(i).at(j);
}
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t Ans = 0;
vector<vector<char>> S(N, vector<char>(10));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> S.at(i).at(j);
}
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end())... | [
"variable_declaration.type.primitive.change"
] | 746,266 | 746,265 | u164730704 | cpp |
p02947 | #include <bits/stdc++.h>
#define repz(i, z, n) for (decltype(n) i = (z); i < (n); i++)
#define rep(i, n) for (decltype(n) i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(v) ((ll)(v).size())
#define MAX(v) (*max_element(ALL(v)))
#define MIN(v) (*min_element(ALL(v)))
#define INF 1000000000000 // 1E+12... | #include <bits/stdc++.h>
#define repz(i, z, n) for (decltype(n) i = (z); i < (n); i++)
#define rep(i, n) for (decltype(n) i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(v) ((ll)(v).size())
#define MAX(v) (*max_element(ALL(v)))
#define MIN(v) (*min_element(ALL(v)))
#define INF 1000000000000 // 1E+12... | [
"variable_declaration.type.change"
] | 746,267 | 746,268 | u354953865 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
template <typename K, typename V, typename A>
void key_count(map<K, V> &mapBuff, A a) {
for (auto c : a) {
if (mapBuff.count(c) == 0) {
mapBuff.insert(make_pair(c, 1));
} else {
auto i... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
template <typename K, typename V, typename A>
void key_count(map<K, V> &mapBuff, A a) {
for (auto c : a) {
if (mapBuff.count(c) == 0) {
mapBuff.insert(make_pair(c, 1));
} else {
auto i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,269 | 746,270 | u048238198 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll INF = 1 << 29;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> map... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll INF = 1 << 29;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> map... | [
"variable_declaration.type.change"
] | 746,271 | 746,272 | u090005176 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 746,275 | 746,276 | u958323734 | cpp |
p02947 | #import <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repp(i, n) for (ll i = 1; i <= (n); ++i)
#define red(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(a) begin(a), end(a)
#define pb(a) push_back(a... | #import <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repp(i, n) for (ll i = 1; i <= (n); ++i)
#define red(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(a) begin(a), end(a)
#define pb(a) push_back(a... | [] | 746,277 | 746,278 | u049191820 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define rush() \
int T; \
scanf("%d", &T); ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define rush() \
int T; \
scanf("%d", &T); ... | [
"variable_declaration.type.change"
] | 746,281 | 746,282 | u827277099 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
#define MP(a, b) make_pair((a), (b))
#define MT(...) make_tuple(__VA_ARGS__)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define RE... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
#define MP(a, b) make_pair((a), (b))
#define MT(...) make_tuple(__VA_ARGS__)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define RE... | [
"variable_declaration.type.change"
] | 746,285 | 746,286 | u556983878 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
int ans = 0;
for ... | //もう一度
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
ll ans = 0;... | [
"variable_declaration.type.change"
] | 746,287 | 746,288 | u876174845 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
const int INF = 1e9;
const int EPS = 1e-9;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; ++i)
cin >> S.at(i), sort(S.at(i).begin(), S.at(i).end());
map<string, int> m;
for (int i = 0; i < N; ++... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
const int INF = 1e9;
const int EPS = 1e-9;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; ++i)
cin >> S.at(i), sort(S.at(i).begin(), S.at(i).end());
map<string, long long int> m;
for (int i = 0;... | [
"variable_declaration.type.widen.change"
] | 746,292 | 746,293 | u107338145 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
int N;
cin >> N;
map<string, int> m{};
int count = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
count += m... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
int N;
cin >> N;
map<string, int> m{};
long long count = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
coun... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,294 | 746,295 | u583701239 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> a;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}
ll ans = 0;
for (auto c : a)
ans += c.second * (c.s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, ll> a;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}
ll ans = 0;
for (auto c : a)
ans += c.second * (c.se... | [] | 746,298 | 746,299 | u907525511 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> a;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}
int ans = 0;
for (auto c : a)
ans += c.second * (c.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, ll> a;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
a[s]++;
}
ll ans = 0;
for (auto c : a)
ans += c.second * (c.se... | [
"variable_declaration.type.change"
] | 746,300 | 746,299 | u907525511 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto s : m) {
if (s.second >= 2)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, ll> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto s : m) {
if (s.second >= 2)
... | [] | 746,301 | 746,302 | u907525511 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
int ans = 0;
for (auto s : m) {
if (s.second > 0)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, ll> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
ll ans = 0;
for (auto s : m) {
if (s.second >= 2)
... | [
"variable_declaration.type.change"
] | 746,303 | 746,302 | u907525511 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> S;
ll ans = 0;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
S[s]++;
}
for (auto s : S) {
if (s.second == 1)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<string, ll> S;
ll ans = 0;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
S[s]++;
}
for (auto s : S) {
if (s.second == 1)
... | [] | 746,304 | 746,305 | u907525511 | 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 count;
for (auto &x : mp) {
long long i = x.second;
count += i * (i - 1) / 2;
}
co... | #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 count = 0;
for (auto &x : mp) {
long long i = x.second;
count += i * (i - 1) / 2;
}
... | [
"variable_declaration.value.change"
] | 746,312 | 746,313 | u495881622 | cpp |
p02947 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"variable_declaration.type.change"
] | 746,314 | 746,315 | u415325136 | cpp |
p02947 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"variable_declaration.type.change"
] | 746,316 | 746,317 | u415325136 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<vector<char>> s(n, vector<char>(10));
rep(i, n) { rep(j, 10) cin >> s.at(i).at(j); }
rep(i, n) sort(s.at(i).begin(), s.at(i).end(... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<vector<char>> s(n, vector<char>(10));
rep(i, n) { rep(j, 10) cin >> s.at(i).at(j); }
rep(i, n) sort(s.at(i).begin(), s.at(i).end(... | [
"variable_declaration.type.primitive.change"
] | 746,318 | 746,319 | u748819456 | cpp |
p02947 | //(・ω・)
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> //setprecis... | //(・ω・)
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> //setprecis... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,320 | 746,321 | u121106629 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
long long comb2(int n) {
long long r;
if (n % 2 & 1) {
r = (n - 1) / 2 * n;
} else {
r = n / 2 * (n - 1);
}
return r;
}
int main() {
int n;
std::cin >> n;
std::vector<std::string> s(n);
for (int i = 0; i < n; i++)... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
long long comb2(long long n) {
long long r;
if (n % 2 & 1) {
r = (n - 1) / 2 * n;
} else {
r = n / 2 * (n - 1);
}
return r;
}
int main() {
int n;
std::cin >> n;
std::vector<std::string> s(n);
for (int i = 0; i < n... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,327 | 746,328 | u825343780 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int> list;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
list[s[i]]++;
}
ll ans = 0;
for (auto x : list) {
if (x.second != 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, ll> list;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
list[s[i]]++;
}
ll ans = 0;
for (auto x : list) {
if (x.second != 1) ... | [] | 746,329 | 746,330 | u721094090 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int> list;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
list[s[i]]++;
}
int ans = 0;
for (auto x : list) {
if (x.second != 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, ll> list;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
list[s[i]]++;
}
ll ans = 0;
for (auto x : list) {
if (x.second != 1) ... | [
"variable_declaration.type.change"
] | 746,331 | 746,330 | u721094090 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [] | 746,332 | 746,333 | u883167571 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n;
cin >> n;
map<string, int> cnt;
ll ans = 0;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
for (auto c : cnt) {
ans += c.se... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int n;
cin >> n;
map<string, int> cnt;
ll ans = 0;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
for (auto c : cnt) {
ans += (ll)... | [
"type_conversion.add"
] | 746,334 | 746,335 | u796273093 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, int> vec;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
vec[s] += 1;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, ll> vec;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
vec[s] += 1;
... | [] | 746,336 | 746,337 | u393658518 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | [
"variable_declaration.type.change"
] | 746,340 | 746,341 | u748757847 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define fs first
#define sc second
#define _GLIBCXX_DEBUG
template <class S> S sum(vector<S> &... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define fs first
#define sc second
#define _GLIBCXX_DEBUG
template <class S> S sum(vector<S> &... | [
"variable_declaration.type.change",
"call.add"
] | 746,344 | 746,345 | u466335531 | cpp |
p02947 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string str;
cin >> str;
sort(str.begin(), s... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string str;
cin >> str;
sort(str.begin(), s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,346 | 746,347 | u289578952 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) {
string ss;
cin >> ss;
sort(ss.begin(), ss.end());
s.at(i) = ss;
}
sort(s.begin(), s.end());
// rep(i, n) cout <<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) {
string ss;
cin >> ss;
sort(ss.begin(), ss.end());
s.at(i) = ss;
}
sort(s.begin(), s.end());
// rep(i, n) cout <<... | [
"variable_declaration.type.change"
] | 746,348 | 746,349 | u695037420 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define repi(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2i(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define repi(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2i(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(... | [
"assignment.change"
] | 746,350 | 746,351 | u994630752 | cpp |
p02947 | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
using namespace std;
using ll = long long;... | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
using namespace std;
using ll = long long;... | [] | 746,352 | 746,353 | u000975152 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
map<string, int> st;
int ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += st[s];
st[s]++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
map<string, int> st;
long long ans = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
ans += st[s];
st[s]++;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,356 | 746,357 | u934469795 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
map<string, int> dict;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
dict[s]++;
}
ll cnum = 0;
for (auto p : dict) {
auto key = p.first;
auto value = p.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
map<string, ll> dict;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
dict[s]++;
}
ll cnum = 0;
for (auto p : dict) {
auto key = p.first;
auto value = p.s... | [] | 746,363 | 746,364 | u118647609 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long int;
ll C(int n) {
if (n == 0 || n == 1)
return 0;
return (n * (n - 1)) / 2;
}
int main(void) {
int n;
cin >> n;
vector<vector<char>> str(n, vector<char>(10... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long int;
ll C(ll n) {
if (n == 0 || n == 1)
return 0;
return (n * (n - 1)) / 2;
}
int main(void) {
int n;
cin >> n;
vector<vector<char>> str(n, vector<char>(10)... | [
"variable_declaration.type.change"
] | 746,365 | 746,366 | u406132951 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#define MOD 1e9 + 7;
#define INF 1e17 + 9;
#define PI acos(-1);
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#define MOD 1e9 + 7;
#define INF 1e17 + 9;
#define PI acos(-1);
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,367 | 746,368 | u198469037 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll binom_two(int n) {
if (n % 2 == 0)
return n / 2 * (n - 1);
else
return (n - 1) / 2 * n;
}
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());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll binom_two(ll n) {
if (n % 2 == 0)
return n / 2 * (n - 1);
else
return (n - 1) / 2 * n;
}
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());
}... | [] | 746,369 | 746,370 | u147808483 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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) {
ans += p.second ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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) {
ans += (ll)p.sec... | [
"type_conversion.add"
] | 746,373 | 746,374 | u754114382 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int x = p.second;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto &p : mp) {
int x = p.second;... | [
"call.arguments.change"
] | 746,375 | 746,376 | u754114382 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
map<map<char, int>, int> index;
cin >> n;
for (i = 0; i < n; i++) {
string input;
map<char, int> cnt;
cin >> input;
for (int j = 0; input[j]; j++) {
cnt[input[j]]++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
map<map<char, long int>, long int> index;
cin >> n;
for (i = 0; i < n; i++) {
string input;
map<char, long int> cnt;
cin >> input;
for (int j = 0; input[j]; j++) {
cnt... | [
"variable_declaration.type.widen.change"
] | 746,379 | 746,380 | u953471422 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
map<map<char, int>, int> index;
cin >> n;
for (i = 0; i < n; i++) {
string input;
map<char, int> cnt;
cin >> input;
for (int j = 0; input[j]; j++) {
cnt[input[j]]++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
map<map<char, long int>, long int> index;
cin >> n;
for (i = 0; i < n; i++) {
string input;
map<char, long int> cnt;
cin >> input;
for (int j = 0; input[j]; j++) {
cnt... | [
"variable_declaration.type.widen.change"
] | 746,381 | 746,380 | u953471422 | 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];
}
unordered_map<string, long long int> ans;
int a = 0;
for (int i = 0; i < N; i++) {
sort(S[i].begin(), S[i].end());
auto itr = ans.find(S[i]);
if (it... | #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];
}
unordered_map<string, long long int> ans;
long long int a = 0;
for (int i = 0; i < N; i++) {
sort(S[i].begin(), S[i].end());
auto itr = ans.find(S[i]);
... | [
"variable_declaration.type.widen.change"
] | 746,386 | 746,387 | u759510609 | cpp |
p02947 | #include <iostream>
#include <map>
#include <set>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
map<char, int> mp[n];
map<map<char, int>, int> a;
string str;
rep(i, n) {
cin >> str;
rep(j, str.length())++ mp[i][str[j... | #include <iostream>
#include <map>
#include <set>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
map<char, int> mp[n];
map<map<char, int>, ll> a;
string str;
rep(i, n) {
cin >> str;
rep(j, str.length()) { ++mp[i][str[... | [] | 746,388 | 746,389 | u075775814 | cpp |
p02947 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
int n;
cin >> n;
map<string, ll> mp;
rep(i, n) {
string s;
cin >> s;
sort(... | [
"variable_declaration.type.change"
] | 746,390 | 746,391 | u168684371 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> map;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
map[str]++;
}
long long ans = 0;
for (auto pair : map) {
ans += (pair.second * ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long> map;
for (int i = 0; i < N; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
map[str]++;
}
long long ans = 0;
for (auto pair : map) {
ans += (pair.sec... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,392 | 746,393 | u526365587 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
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> cnt;
rep(i, N) {
if (cnt.count(s[i]))
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
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> cnt;
rep(i, N) {
if (cnt.count(s[i]))
c... | [
"variable_declaration.type.change"
] | 746,398 | 746,399 | u009414205 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long ans = 0;
unordered_map<string, int> a;
string s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(&s[0], &s[9] + 1);
a[s] += 1;
}
for (auto itr = a.begin(); itr != a.end(); itr = next(itr, 1)) {
if (itr->secon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long ans = 0;
unordered_map<string, long> a;
string s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(&s[0], &s[9] + 1);
a[s] += 1;
}
for (auto itr = a.begin(); itr != a.end(); itr = next(itr, 1)) {
if (itr->seco... | [
"variable_declaration.type.primitive.change"
] | 746,400 | 746,401 | u000770457 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | [] | 746,402 | 746,403 | u942085302 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | [
"variable_declaration.type.change"
] | 746,404 | 746,403 | u942085302 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define sort_(a) sort(a.begin(), a.end())
#define sum(a) accumulate(a.begin(), a.end(), 0)
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen(".testcase", "r", stdin);
#endif
... | #include <bits/stdc++.h>
using namespace std;
#define sort_(a) sort(a.begin(), a.end())
#define sum(a) accumulate(a.begin(), a.end(), 0)
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen(".testcase", "r", stdin);
#endif
... | [
"variable_declaration.type.change"
] | 746,405 | 746,406 | u125205981 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, f) for (int i = (int)s; i < (int)f; i++)
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> dict;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
di... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, f) for (int i = (int)s; i < (int)f; i++)
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
map<string, ll> dict;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
dic... | [] | 746,410 | 746,411 | u415400221 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, f) for (int i = (int)s; i < (int)f; i++)
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> dict;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
dict[s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, f) for (int i = (int)s; i < (int)f; i++)
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
map<string, ll> dict;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
dic... | [
"variable_declaration.type.widen.change"
] | 746,412 | 746,411 | u415400221 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [
"variable_declaration.type.change"
] | 746,413 | 746,414 | u530107518 | cpp |
p02947 | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e18;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W,
x, y, z;
long long max_value = INF, max_index ... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e18;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W,
x, y, z;
long long max_value = INF, max_index ... | [] | 746,415 | 746,416 | u554988565 | cpp |
p02947 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | [
"assignment.change"
] | 746,419 | 746,420 | u764228018 | cpp |
p02947 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | [
"assignment.change"
] | 746,421 | 746,420 | u764228018 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) cin >> S[i];
rep(i, N) sort(S[i].begin(), S[i].end());
ll ans = 0;
map<string, int> mp;
rep(i, N) mp[S[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) cin >> S[i];
rep(i, N) sort(S[i].begin(), S[i].end());
ll ans = 0;
map<string, ll> mp;
rep(i, N) mp[S[i]]... | [
"variable_declaration.type.change"
] | 746,422 | 746,423 | u480938608 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int(i) = (int)(m); (i) < (int)(n); ++(i))
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int(i) = (int)(m); (i) < (int)(n); ++(i))
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y)... | [
"variable_declaration.type.change"
] | 746,424 | 746,425 | u813559924 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int ans = 0;
for (auto p : mp) {
int a = p.second;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto p : mp) {
int a = p.sec... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,426 | 746,427 | u813559924 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int ans = 0;
for (auto p : mp) {
int a = p.second;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto p : mp) {
int a = p.sec... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.change"
] | 746,428 | 746,427 | u813559924 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> s(10);
map<string, int> num;
for (int i = 0; i < n; i++) {
string temp;
cin >> temp;
for (int j = 0; j < 10; j++) {
s.at(j) = temp.at(j);
}
sort(s.begin(), s.end());
temp = "";
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> s(10);
map<string, long long> num;
for (int i = 0; i < n; i++) {
string temp;
cin >> temp;
for (int j = 0; j < 10; j++) {
s.at(j) = temp.at(j);
}
sort(s.begin(), s.end());
temp = "";
fo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,429 | 746,430 | u718758485 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.... | [] | 746,431 | 746,432 | u371149954 | cpp |
p02947 | #include <bits/stdc++.h>
#define MAXN 200100
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x < n and y >= 0 and y < n)
using namespace std;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
map<string, int> st;
int n... | #include <bits/stdc++.h>
#define MAXN 200100
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x < n and y >= 0 and y < n)
using namespace std;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
map<string, ll> st;
ll n;
... | [
"variable_declaration.type.change"
] | 746,439 | 746,440 | u009937643 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int main() {
int N;
cin >> N;
string S;
unordered_map<string, int> list;
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
list[S]++;
}
int ans = 0;
for (auto pair : list) {
ans += pair.second * (pai... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int main() {
int N;
cin >> N;
string S;
unordered_map<string, int64_t> list;
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
list[S]++;
}
int64_t ans = 0;
for (auto pair : list) {
ans += pair.secon... | [
"variable_declaration.type.primitive.change"
] | 746,441 | 746,442 | u058742919 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | [
"variable_declaration.type.change"
] | 746,448 | 746,449 | u835805357 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
#define PI 3.14159265359
#define MOD 1000000007
const int MAX = 510000;
int main() {
int N;
cin >> N;
vector<string> a(N);
map<string, int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
#define PI 3.14159265359
#define MOD 1000000007
const int MAX = 510000;
int main() {
int N;
cin >> N;
vector<string> a(N);
map<string, ll> m... | [] | 746,452 | 746,453 | u763976642 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (... | [
"variable_declaration.type.change"
] | 746,454 | 746,455 | u604329931 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (... | [
"variable_declaration.type.change"
] | 746,454 | 746,456 | u604329931 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
vector<string> s;
void solve() {
map<string, int> mp;
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
ll res = 0;
for (auto p : mp) {
if (p.second >= 2) {
res += p.second * (p.second - 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
vector<string> s;
void solve() {
map<string, ll> mp;
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
ll res = 0;
for (auto p : mp) {
if (p.second >= 2) {
res += p.second * (p.second - 1) ... | [] | 746,459 | 746,460 | u319242216 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,467 | 746,468 | u845300227 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
void solve(int N, std::vector<std::string> S) {
for (auto &s : S) {
std::sort(s.begin(), s.end());
}
std::sort(S.begin(), S.end());
int anagram_count = 1;
long long combination_count = 0;
for (int i = 1; i < S.size(); i++) {
if (S[i] == S[i... | #include <algorithm>
#include <iostream>
#include <vector>
void solve(int N, std::vector<std::string> S) {
for (auto &s : S) {
std::sort(s.begin(), s.end());
}
std::sort(S.begin(), S.end());
long long anagram_count = 1;
long long combination_count = 0;
for (int i = 1; i < S.size(); i++) {
if (S[i] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,471 | 746,472 | u083254278 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
ty... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
ty... | [
"variable_declaration.type.change"
] | 746,477 | 746,478 | u081029414 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.