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;
#define ll long long
int main() {
ll n, i, count = 0;
cin >> n;
vector<string> v1(n);
map<string, int> map1;
for (i = 0; i < n; i++) {
cin >> v1[i];
sort(v1[i].begin(), v1[i].end());
map1[v1[i]]++;
}
for (auto x : map1) {
if (x.second) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i, count = 0;
cin >> n;
vector<string> v1(n);
map<string, ll> map1;
for (i = 0; i < n; i++) {
cin >> v1[i];
sort(v1[i].begin(), v1[i].end());
map1[v1[i]]++;
}
for (auto x : map1) {
if (x.second) {
... | [] | 746,704 | 746,705 | u863370423 | cpp |
p02947 | #include "bits/stdc++.h"
#include "sstream"
#define quick \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
const int N = 1e5 + 1;
map<string, int> mp;
int main() {
quick int n;
ci... | #include "bits/stdc++.h"
#include "sstream"
#define quick \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
const int N = 1e5 + 1;
map<string, long long> mp;
int main() {
quick int n... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,706 | 746,707 | u863370423 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [] | 746,708 | 746,709 | u832995587 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() en... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() en... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 746,710 | 746,711 | u832995587 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() en... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() en... | [
"variable_declaration.type.change"
] | 746,712 | 746,711 | u832995587 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
string str[1000000];
int main() {
int n;
int count = 0;
int tmp = 1;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(s... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
string str[1000000];
int main() {
int n;
ll count = 0;
ll tmp = 1;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(st... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 746,713 | 746,714 | u816631826 | cpp |
p02947 | // Green bin.cpp : This file contains the 'main' function. Program execution
// begins and ends there.
//
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 1e5;
string arr[N];
int main() {
int n;
long long ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sor... | // Green bin.cpp : This file contains the 'main' function. Program execution
// begins and ends there.
//
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 1e5;
string arr[N];
int main() {
int n;
long long ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sor... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,715 | 746,716 | u089230684 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
#include <set>
#define ll long long
using namespace std;
int main() {
ll t;
cin >> t;
int num = 0;
map<string, int> a;
while (t--) {
string s;
cin >> s;
sort(s.begin(), s.end());
num += a[s]++;
}
cout << num << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <set>
#define ll long long
using namespace std;
int main() {
ll t;
cin >> t;
ll num = 0;
map<string, int> a;
while (t--) {
string s;
cin >> s;
sort(s.begin(), s.end());
num += a[s]++;
}
cout << num << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 746,717 | 746,718 | u353919145 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/////////////////////////////////
int main() {
int 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 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/////////////////////////////////
int main() {
int 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 ... | [
"variable_declaration.type.change"
] | 746,720 | 746,721 | u019359540 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, ll> anagram;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
anagram[s]++;
}
int ans = 0;
for (auto itr = anagram.begin(); itr != anagram.end(); itr++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, ll> anagram;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
anagram[s]++;
}
ll ans = 0;
for (auto itr = anagram.begin(); itr != anagram.end(); itr++) {
... | [
"variable_declaration.type.change"
] | 746,722 | 746,723 | u850165979 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, ll> anagram;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
anagram[s]++;
}
int ans = 0;
for (auto itr = anagram.begin(); itr != anagram.end(); itr++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, ll> anagram;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
anagram[s]++;
}
ll ans = 0;
for (auto itr = anagram.begin(); itr != anagram.end(); itr++) {
... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 746,724 | 746,723 | u850165979 | 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;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) sort(s[i].begin(), s[i].end());
map<string, int> mp;
rep(i, n)++ mp[s[i]];
l... | #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;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) sort(s[i].begin(), s[i].end());
map<string, int> mp;
rep(i, n)++ mp[s[i]];
l... | [] | 746,727 | 746,728 | u714642046 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
string S[n];
for (i = 0; i < n; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S, S + n);
int count = 0, ans = 0;
for (i = 0; i < n; i++) {
if (S[i] == S[i + 1])
count++;
else {
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
string S[n];
for (i = 0; i < n; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S, S + n);
long long int count = 0, ans = 0;
for (i = 0; i < n - 1; i++) {
if (S[i] == S[i + 1])
coun... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 746,729 | 746,730 | u028218659 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
string S[n];
for (i = 0; i < n; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S, S + n);
int count = 0, ans = 0;
for (i = 0; i < n - 1; i++) {
if (S[i] == S[i + 1])
count++;
else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
string S[n];
for (i = 0; i < n; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S, S + n);
long long int count = 0, ans = 0;
for (i = 0; i < n - 1; i++) {
if (S[i] == S[i + 1])
coun... | [
"variable_declaration.type.widen.change"
] | 746,731 | 746,730 | u028218659 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll factorial(ll n) {
if (n == 0)
return 1;
else
return n * factorial(n - 1);
}
vector<int> make_map(string s) {
vector<int> c(26);
for (int i = 0; i < s.size(); i++) {
int n = s.at(i) - 'a';
c.at(n)++;
}
return c;
}
int m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll factorial(ll n) {
if (n == 0)
return 1;
else
return n * factorial(n - 1);
}
vector<int> make_map(string s) {
vector<int> c(26);
for (int i = 0; i < s.size(); i++) {
int n = s.at(i) - 'a';
c.at(n)++;
}
return c;
}
int m... | [] | 746,736 | 746,737 | u959813156 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) \
for (int i = 0; i < (int)in.size(); i++) \
cin >> in[i]
#define forout(out) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) \
for (int i = 0; i < (int)in.size(); i++) \
cin >> in[i]
#define forout(out) ... | [
"variable_declaration.type.change"
] | 746,740 | 746,741 | u060116081 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &... | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &... | [] | 746,742 | 746,743 | u093681822 | cpp |
p02947 | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
long long int i, n, p = 0, j;
map<string, int> cnt;
map<string, int>::iterator itr;
cin >> n;
// string s[n];
// for(i=0;i<n;i++)
// cin>>s[i];
for (i = 0; i < n; i++) {
int sum = 0;
string s;
cin >> s;
sort(s... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
long long int i, n, p = 0, j;
map<string, long long int> cnt;
map<string, long long int>::iterator itr;
cin >> n;
// string s[n];
// for(i=0;i<n;i++)
// cin>>s[i];
for (i = 0; i < n; i++) {
int sum = 0;
string s;
... | [
"variable_declaration.type.widen.change"
] | 746,744 | 746,745 | u246218976 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
map<string, int> a;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
// cout << s << endl;
if (a.count(s)) {
cnt += a[s];
a[s]++;
} else
a[s] = 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long cnt = 0;
map<string, long> a;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
// cout << s << endl;
if (a.count(s)) {
cnt += a[s];
a[s]++;
} else
a[s] = 1;
}... | [
"variable_declaration.type.primitive.change"
] | 746,750 | 746,751 | u600480888 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;... | [
"variable_declaration.type.change"
] | 746,754 | 746,755 | u633967774 | 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;
using P = pair<int, int>;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
set<string> st;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
set<string> st;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 746,758 | 746,759 | u188332959 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
long long N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
map<string, int> um;
// まずは要素ごとにソートする
int result ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
int main() {
long long N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
map<string, long long> um;
// まずは要素ごとにソートする
long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,762 | 746,763 | u308463793 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int cou = 1;
long long int ans = 0;
vector<string> v(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.at(i) = s;
}
sort(v.begin(), v.end());
for (int j = 0; j < n - 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
long long int cou = 1;
long long int ans = 0;
vector<string> v(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.at(i) = s;
}
sort(v.begin(), v.end());
for (int j = 0; j < n - 1; ... | [
"variable_declaration.type.widen.change"
] | 746,764 | 746,765 | u031450170 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int cou = 1;
int ans = 0;
vector<string> v(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.at(i) = s;
}
sort(v.begin(), v.end());
for (int j = 0; j < n - 1; j++) {
if (v.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
long long int cou = 1;
long long int ans = 0;
vector<string> v(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
v.at(i) = s;
}
sort(v.begin(), v.end());
for (int j = 0; j < n - 1; ... | [
"variable_declaration.type.widen.change"
] | 746,766 | 746,765 | u031450170 | cpp |
p02947 | #include <bits/stdc++.h>
/* #define int long long */
/* #define double long double */
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep... | #include <bits/stdc++.h>
/* #define int long long */
/* #define double long double */
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep... | [
"identifier.change",
"io.output.change"
] | 746,767 | 746,768 | u510749912 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
scanf("%d", &n);
vector<string> s(n);
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int cnt = 0;
// for (int i = 0; i < n - 1; i++) {
// f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
scanf("%d", &n);
vector<string> s(n);
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long cnt = 0;
// for (int i = 0; i < n - 1; i++) {
// ... | [
"variable_declaration.type.primitive.change"
] | 746,769 | 746,770 | u915582296 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
string t;
cin >> t;
sort(t.begin(), t.end());
s[i] = t;
}
m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
string t;
cin >> t;
sort(t.begin(), t.end());
s[i] = t;
}
m... | [] | 746,777 | 746,778 | u016334391 | cpp |
p02947 | #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("tree-vectorize")
#pragma GCC diagnostic ignored "-Wunused-result"
#define here
#define cprint(vec)
#define com(msg)
#define obs(...)
#define local(x)
#define alter(x, y) y
#else
#define here cerr << __func__ << '/' << __LINE__ ... | #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("tree-vectorize")
#pragma GCC diagnostic ignored "-Wunused-result"
#define here
#define cprint(vec)
#define com(msg)
#define obs(...)
#define local(x)
#define alter(x, y) y
#else
#define here cerr << __func__ << '/' << __LINE__ ... | [] | 746,779 | 746,780 | u368735320 | cpp |
p02947 | #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("tree-vectorize")
#pragma GCC diagnostic ignored "-Wunused-result"
#define here
#define cprint(vec)
#define com(msg)
#define obs(...)
#define local(x)
#define alter(x, y) y
#else
#define here cerr << __func__ << '/' << __LINE__ ... | #pragma region template
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("tree-vectorize")
#pragma GCC diagnostic ignored "-Wunused-result"
#define here
#define cprint(vec)
#define com(msg)
#define obs(...)
#define local(x)
#define alter(x, y) y
#else
#define here cerr << __func__ << '/' << __LINE__ ... | [
"variable_declaration.type.change"
] | 746,781 | 746,780 | u368735320 | cpp |
p02947 | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (ll i = (a), i##_len = (b); i <= i##_len; i++)
#define rrep(i, n) ... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (ll i = (a), i##_len = (b); i <= i##_len; i++)
#define rrep(i, n) ... | [] | 746,782 | 746,783 | u368735320 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
using ll = long long;
usin... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
using ll = long long;
usin... | [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 746,784 | 746,785 | u651197500 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
using ll = long long;
usin... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
using ll = long long;
usin... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 746,786 | 746,785 | u651197500 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
using ll = long long;
usin... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = 1; i <= (n); i++)
#define drep(i, n) for (int i = (n)-1; i >= 0; i--)
#define srep(i, s, t) for (int i = s; i < t; i++)
#define rng(a) a.begin(), a.end()
using ll = long long;
usin... | [
"variable_declaration.type.change"
] | 746,787 | 746,785 | u651197500 | cpp |
p02947 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
ll tmp = b;
b =... |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
while (b != 0) {
ll tmp = b;
b =... | [] | 746,792 | 746,793 | u111653921 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
int N;
cin >> N;
ll ans = 0;
vector<string> s... | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
int N;
cin >> N;
ll ans = 0;
vector<string> ss... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 746,796 | 746,797 | u941353203 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
int N;
cin >> N;
int ans = 0;
vector<string> ... | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
int N;
cin >> N;
ll ans = 0;
vector<string> ss... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 746,798 | 746,797 | u941353203 | cpp |
p02947 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
rep(i, n... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
rep(i, n... | [
"variable_declaration.type.change"
] | 746,799 | 746,800 | u446766335 | cpp |
p02947 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
rep(i, n... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) { cin >> s[i]; }
rep(i, n... | [
"variable_declaration.type.change"
] | 746,801 | 746,800 | u446766335 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t ans = 0;
map<string, int> memo;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
memo[s]++;
}
for (auto x : memo) {
int tmp = x.second;
ans += tmp * (tmp - 1) / ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t ans = 0;
map<string, int64_t> memo;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
memo[s]++;
}
for (auto x : memo) {
int64_t tmp = x.second;
ans += tmp * (tmp... | [
"variable_declaration.type.primitive.change"
] | 746,803 | 746,804 | u735528230 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
unordered_map<string, int> num;
int ans = 0;
for (int i = 0; i < n; i++) {
ans += num[s[i]];
num[s[i]]++;
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
unordered_map<string, long long> num;
long long ans = 0;
for (int i = 0; i < n; i++) {
ans += num[s[i]];
num[s[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,816 | 746,817 | u105533331 | 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 s = p.second;
ans += s * (s - 1) / 2;
}
... | #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 s = p.second;
ans += (long long)s * (s - 1) ... | [
"type_conversion.add"
] | 746,818 | 746,819 | u550014122 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int> count;
for (int i = 0; i < N; ++i) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
++count[s.at(i)];
}
int64_t sum = 0;
for (auto s : count) {
int t = s.second;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int> count;
for (int i = 0; i < N; ++i) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
++count[s.at(i)];
}
int64_t sum = 0;
for (auto s : count) {
int64_t t = s.second;... | [
"variable_declaration.type.primitive.change"
] | 746,820 | 746,821 | u304862095 | cpp |
p02947 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [] | 746,822 | 746,823 | u700484101 | cpp |
p02947 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
t... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
t... | [
"variable_declaration.type.change"
] | 746,824 | 746,825 | u883323885 | 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 < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #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 < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"type_conversion.add"
] | 746,826 | 746,827 | u989306199 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
string S;
map<string, int> T;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
T[S]++;
}
ll ans = 0;
for (auto &b : T) {
int a = b.second;
ans += ll((a) * (a - 1) / 2);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
string S;
map<string, ll> T;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
T[S]++;
}
ll ans = 0;
for (auto &b : T) {
ll a = b.second;
ans += (a) * (a - 1) / 2;
}
... | [
"variable_declaration.type.change",
"call.remove",
"call.arguments.change"
] | 746,830 | 746,831 | u699600793 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
string S;
map<string, int> T;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
T[S]++;
}
ll ans = 0;
for (auto &b : T) {
int a = b.second;
ans += (a) * (a - 1) / 2;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
string S;
map<string, ll> T;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
T[S]++;
}
ll ans = 0;
for (auto &b : T) {
ll a = b.second;
ans += (a) * (a - 1) / 2;
}
... | [
"variable_declaration.type.change"
] | 746,832 | 746,831 | u699600793 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100005];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
map<string, int> anagrams;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (anagrams.count(... | #include <bits/stdc++.h>
using namespace std;
string s[100005];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
unordered_map<string, long long> anagrams;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if ... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,842 | 746,843 | u194015723 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100005];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
map<string, int> anagrams;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (anagrams.count(... | #include <bits/stdc++.h>
using namespace std;
string s[100005];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
cin >> n;
map<string, long long> anagrams;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (anagrams.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,842 | 746,844 | u194015723 | cpp |
p02947 | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //s... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,847 | 746,848 | u590927341 | cpp |
p02947 | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //s... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 746,849 | 746,848 | u590927341 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vecl = vector<ll>;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vecl = vector<ll>;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | [
"variable_declaration.type.change"
] | 746,854 | 746,855 | u847969825 | 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 func(int a) {
int sum = 0;
for (int i = 1; i <= a - 1; i++) {
sum += i;
}
return sum;
}
int main() {
int n;
int sum = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
ll func(ll a) {
ll sum = 0;
for (int i = 1; i <= a - 1; i++) {
sum += i;
}
return sum;
}
int main() {
int n;
ll sum = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.change"
] | 746,856 | 746,857 | u489603283 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e18;
ll MOD = 1e9 + 7;
int main() {
ll N;
cin >> N;
map<string, ll> M;
for (ll i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
M[S]++;
}
ll ans = 0;
for (auto m : M) {
if (m.second == 1)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e18;
ll MOD = 1e9 + 7;
int main() {
ll N;
cin >> N;
map<string, ll> M;
for (ll i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
M[S]++;
}
ll ans = 0;
for (auto m : M) {
if (m.second == 1)
... | [] | 746,858 | 746,859 | u521973174 | cpp |
p02947 | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG true
#define LL long long... | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG true
#define LL long long... | [
"variable_declaration.type.widen.change"
] | 746,860 | 746,861 | u393086221 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
map<st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
map<st... | [
"type_conversion.add"
] | 746,869 | 746,870 | u455067221 | cpp |
p02947 | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(all(x), 0)
#define cou(x) cout << x << endl
#define y() ... | // Template //
#include <bits/stdc++.h>
using namespace std;
// マクロ //
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define all(x) x.begin(), x.end()
#define sort(x) sort(all(x))
#define uniq(x) x.erase(unique(all(x)), x.end())
#define vsum(x) accumulate(all(x), 0)
#define cou(x) cout << x << endl
#define y() ... | [
"variable_declaration.type.change"
] | 746,871 | 746,872 | u073983440 | 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) {
ll x = p.second;... | [
"variable_declaration.type.change"
] | 746,873 | 746,874 | u194930818 | cpp |
p02947 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | [] | 746,875 | 746,876 | u955627293 | cpp |
p02947 | #include <iostream>
using namespace std;
#include <iomanip>
void _130() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
cout << (double)w * h / 2 << " " << (2 * x == w && 2 * y == h) << endl;
}
void _131() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long count =... | #include <iostream>
using namespace std;
#include <iomanip>
void _130() {
int w, h, x, y;
cin >> w >> h >> x >> y;
cout << fixed << setprecision(10);
cout << (double)w * h / 2 << " " << (2 * x == w && 2 * y == h) << endl;
}
void _131() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long count =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,877 | 746,878 | u243740419 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
scanf("%d", &n);
char s[n + 1][11];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i], s[i] + 10);
}
string t[n];
for (int i = 0; i < n; i... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
scanf("%d", &n);
char s[n][11];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
sort(s[i], s[i] + 10);
}
string t[n];
for (int i = 0; i < n; i++) ... | [
"expression.operation.binary.remove",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 746,879 | 746,880 | u416773418 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(v) (v.begin(), v.end(... | [
"variable_declaration.type.change"
] | 746,881 | 746,882 | u459105164 | cpp |
p02947 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string anagramize(string s) {
vector<char> v;
for (int i = 0; i <... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string anagramize(string s) {
vector<char> v;
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,883 | 746,884 | u120050685 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (S.count(s)) {
S[s]++;
} else {
S[s] = 1;
}
}
ll ans = 0;
for (auto p :... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (S.count(s)) {
S[s]++;
} else {
S[s] = 1;
}
}
ll ans = 0;
for (auto p :... | [
"variable_declaration.type.change"
] | 746,885 | 746,886 | u115927976 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (S.count(s)) {
S[s]++;
} else {
S[s] = 1;
}
}
int ans = 0;
for (auto p ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (S.count(s)) {
S[s]++;
} else {
S[s] = 1;
}
}
ll ans = 0;
for (auto p :... | [
"variable_declaration.type.change"
] | 746,887 | 746,886 | u115927976 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
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); }
sort(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm = 1000000000;
ll MM = mm + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
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); }
sort(... | [
"variable_declaration.type.change"
] | 746,888 | 746,889 | u927053131 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed combination(int n) { return (n * (n - 1)) / 2; }
signed main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
// fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
long long combination(int n) { return (long long)(n * (n - 1)) / 2; }
signed main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end()... | [
"type_conversion.add"
] | 746,898 | 746,899 | u576375251 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 0;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
c += m[s]++;
}
cout << c;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, c = 0;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
c += m[s]++;
}
cout << c;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 746,900 | 746,901 | u313970998 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size();
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size();
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); ... | [
"variable_declaration.type.change"
] | 746,905 | 746,906 | u002627851 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size();
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size();
#define all(x) (x).begin(), (x).end()
#define Red \
ios_base::sync_with_stdio(0); ... | [
"variable_declaration.type.change"
] | 746,907 | 746,906 | u002627851 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v)... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v)... | [] | 746,908 | 746,909 | u557565572 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define TIMER_S(start) \
chrono::system_clock::time_point start = chrono::system_clock::now();
#define TIMER_E(end) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define TIMER_S(start) \
chrono::system_clock::time_point start = chrono::system_clock::now();
#define TIMER_E(end) ... | [] | 746,910 | 746,911 | u517348254 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
using namespace std;
int main(void) {
long long a;
long long b;
string str;
vector<string> vec;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> str;
sort(str.begin(), str.end());
vec.push_back(str);
}
sort... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
using namespace std;
int main(void) {
long long a;
long long b;
string str;
vector<string> vec;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> str;
sort(str.begin(), str.end());
vec.push_back(str);
}
sort... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,912 | 746,913 | u192307314 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const ll LLINF = 1LL << 60;
/... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const ll LLINF = 1LL << 60;
/... | [] | 746,914 | 746,915 | u275488634 | 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> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmi... | #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> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmi... | [
"variable_declaration.type.change"
] | 746,921 | 746,922 | u045408189 | 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> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmi... | #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> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmi... | [
"variable_declaration.type.change"
] | 746,923 | 746,922 | u045408189 | 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, ll> ans;
rep(i, N) {
string S;
cin >> S;
sort(S.begin(), S.end());
if (ans.count(S)) {
ans[S]++;
} el... | #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, ll> ans;
rep(i, N) {
string S;
cin >> S;
sort(S.begin(), S.end());
if (ans.count(S)) {
ans[S]++;
} el... | [
"variable_declaration.type.change"
] | 746,924 | 746,925 | u446371873 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
... | [
"variable_declaration.type.widen.change"
] | 746,926 | 746,927 | u032437757 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
... | [
"variable_declaration.type.widen.change"
] | 746,928 | 746,927 | u032437757 | cpp |
p02947 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n;
cin >> n;
Int ans = 0;
unordered_map<string, int> pairs;
string in;
fo... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n;
cin >> n;
Int ans = 0;
unordered_map<string, Int> pairs;
string in;
fo... | [] | 746,929 | 746,930 | u261538386 | cpp |
p02947 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n;
cin >> n;
Int ans = 0;
vector<int> pairs;
vector<string> s(n), sp;
str... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int n;
cin >> n;
Int ans = 0;
vector<Int> pairs;
vector<string> s(n), sp;
str... | [] | 746,931 | 746,932 | u261538386 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
map<string, int> k;
rep(i, n) {
string s;
cin >> s;
rep(i, 10) {
rep(j, i) {
if (s[i] < s[j])
swap(s[i], s[j]);
}
}
k[s]++;
}
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
map<string, int64_t> k;
rep(i, n) {
string s;
cin >> s;
rep(i, 10) {
rep(j, i) {
if (s[i] < s[j])
swap(s[i], s[j]);
}
}
k[s]++;
}
... | [
"variable_declaration.type.primitive.change"
] | 746,935 | 746,936 | u525560003 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | [
"type_conversion.add"
] | 746,937 | 746,938 | u924373338 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | [
"variable_declaration.type.change"
] | 746,939 | 746,938 | u924373338 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long C(int x, long long y) {
long long ans = 1;
for (int i = 1; i <= y; i++) {
ans = ans * (x - i + 1) / i;
}
return ans;
}
int main() {
long long N, c = 1, ans = 0;
cin >> N;
vector<string> S(N);
vector<int> cc(N);
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
long long C(int x, long long y) {
long long ans = 1;
for (int i = 1; i <= y; i++) {
ans = ans * (x - i + 1) / i;
}
return ans;
}
int main() {
long long N, c = 1, ans = 0;
cin >> N;
vector<string> S(N);
vector<long long> cc(N);
for (int i = 0; i < N; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,940 | 746,941 | u102070373 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long C(int x, long long y) {
long long ans = 1;
for (int i = 1; i <= y; i++) {
ans = ans * (x - i + 1) / i;
}
return ans;
}
int main() {
long long N, c = 1, ans = 0;
cin >> N;
vector<string> S(N);
vector<int> cc(N);
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
long long C(int x, long long y) {
long long ans = 1;
for (int i = 1; i <= y; i++) {
ans = ans * (x - i + 1) / i;
}
return ans;
}
int main() {
long long N, c = 1, ans = 0;
cin >> N;
vector<string> S(N);
vector<long long> cc(N);
for (int i = 0; i < N; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,942 | 746,941 | u102070373 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long C(int x, long long y) {
long long ans = 1;
for (int i = 1; i <= y; i++) {
ans = ans * (x - i + 1) / i;
}
return ans;
}
int main() {
int N, c = 1, ans = 0;
cin >> N;
vector<string> S(N);
vector<int> cc(N);
for (int i = 0; i < N; i++) {
s... | #include <bits/stdc++.h>
using namespace std;
long long C(int x, long long y) {
long long ans = 1;
for (int i = 1; i <= y; i++) {
ans = ans * (x - i + 1) / i;
}
return ans;
}
int main() {
long long N, c = 1, ans = 0;
cin >> N;
vector<string> S(N);
vector<long long> cc(N);
for (int i = 0; i < N; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,943 | 746,941 | u102070373 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 746,948 | 746,949 | u917049698 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
//組み合わせの数nCrを計算
int calcNumOfCombination(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main(void) {
int N;
cin >> N;
vector<string>... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
//組み合わせの数nCrを計算
long long int calcNumOfCombination(int n, int r) {
long long int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main(void) {
int N;
cin >> ... | [
"variable_declaration.type.widen.change"
] | 746,950 | 746,951 | u823871776 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
//組み合わせの数nCrを計算
int calcNumOfCombination(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main(void) {
int N;
cin >> N;
vector<string>... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
//組み合わせの数nCrを計算
long long int calcNumOfCombination(int n, int r) {
long long int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main(void) {
int N;
cin >> ... | [
"variable_declaration.type.widen.change"
] | 746,952 | 746,951 | u823871776 | cpp |
p02947 |
#include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
// << fixed << setprecision(0) <<
// sort(ALL(),greater<int>())... |
#include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
// << fixed << setprecision(0) <<
// sort(ALL(),greater<int>())... | [
"variable_declaration.type.change"
] | 746,955 | 746,956 | u281876921 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
int main() {
map<string, int> a;
set<string> st;
int n;
cin >> n;
rep(i, 0, n) {
string s;... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
int main() {
map<string, long long> a;
set<string> st;
int n;
cin >> n;
rep(i, 0, n) {
str... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,957 | 746,958 | u407213771 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
map<string, int> MA;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
MA[S]++;
}
int ans = 0;
for (auto ma : MA) {
ans += ma.second * (ma.second - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
map<string, long long> MA;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
MA[S]++;
}
long long ans = 0;
for (auto ma : MA) {
ans += ma.second * (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,959 | 746,960 | u045289115 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
vec.at(i) = S;
}
sort(vec.begin(), vec.end());
int ans = 0;
int ctr = 0;
for (int i = 1; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> S;
sort(S.begin(), S.end());
vec.at(i) = S;
}
sort(vec.begin(), vec.end());
long long ans = 0;
int ctr = 0;
for (int i = 1; i < N; i++)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,961 | 746,962 | u045289115 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | [
"variable_declaration.type.change"
] | 746,965 | 746,966 | u682820318 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
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) {
int s = p.sec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
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) {
int s = p.sec... | [
"type_conversion.add"
] | 746,967 | 746,968 | u862412671 | 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 int sum = 0;
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = i + 1; j < n; j++) {
... | #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 int sum = 0;
for (int i = 0; i < n; i++) {
long long int count = 0;
for (int j = i + 1; j < n; j... | [
"variable_declaration.type.widen.change"
] | 746,969 | 746,970 | u094746828 | 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);
int sum = 0;
for (int i = 0; i < n - 1; i++) {
int count = 0;
for (int j = i + 1; j < n; j++) {
if (... | #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 int sum = 0;
for (int i = 0; i < n; i++) {
long long int count = 0;
for (int j = i + 1; j < n; j... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 746,971 | 746,970 | u094746828 | 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);
int sum = 0;
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = i + 1; j < n; j++) {
if (s[i]... | #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 int sum = 0;
for (int i = 0; i < n; i++) {
long long int count = 0;
for (int j = i + 1; j < n; j... | [
"variable_declaration.type.widen.change"
] | 746,972 | 746,970 | u094746828 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
map<string, int> ma;
int main(void) {
int n;
long long sum = 0;
string s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ma[s]++;
}
for (auto &x : ma) {
// cou... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
map<string, long long> ma;
int main(void) {
long long n;
long long sum = 0;
string s;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ma[s]++;
}
for (auto &x : ma) {... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 746,975 | 746,976 | u959634984 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.