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 MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
for (auto i : x) { ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
for (auto i : x) { ... | [
"variable_declaration.type.change"
] | 747,222 | 747,223 | u317715099 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
long long ans = 0;
int suc = 1;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
long long ans = 0;
long long suc = 1;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,226 | 747,227 | u057810841 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int main() {
llong N;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.find(s) != m.end()) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long llong;
int main() {
llong N;
cin >> N;
map<string, llong> m;
for (llong i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.find(s) != m.end()... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 747,231 | 747,232 | u684435505 | cpp |
p02947 | #include <bits/stdc++.h>
#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(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#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(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | [
"type_conversion.add"
] | 747,233 | 747,234 | u850516963 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
#define SUM(x) accumulate(ALL(x), 0);
using namespace... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
#define SUM(x) accumulate(ALL(x), 0);
using namespace... | [
"variable_declaration.type.change"
] | 747,235 | 747,236 | u850516963 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | [
"type_conversion.add"
] | 747,237 | 747,238 | u809665051 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[... | [] | 747,239 | 747,240 | u005906204 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i, cont = 0, res = 0;
string s;
vector<string> v;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
// sortString(s);
sort(s.begin(), s.end());
// cout<<s<<endl;
v.push_back(s);
}
sort(v.... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int N, i, cont = 0, res = 0;
string s;
vector<string> v;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
// sortString(s);
sort(s.begin(), s.end());
// cout<<s<<endl;
v.push_back(s);
}
... | [
"control_flow.loop.for.initializer.change"
] | 747,241 | 747,242 | u623599984 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define VIN(v) \
for (int64_t i = 0; i < (v).... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define VIN(v) \
for (int64_t i = 0; i < (v).... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 747,244 | 747,245 | u842917248 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define VIN(v) \
for (int64_t i = 0; i < (v).... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define VIN(v) \
for (int64_t i = 0; i < (v).... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 747,246 | 747,245 | u842917248 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
long n;
cin >> n;
unsigned long ans = 0;
map<string, unsigned long> mp;
string str;
for (long i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
if (mp[str])
ans += mp[str];
mp[str]... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
long n;
cin >> n;
unsigned long ans = 0;
map<string, unsigned long> mp;
string str;
for (long i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
if (mp[str])
ans += mp[str];
mp[str]... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 747,249 | 747,250 | u407630908 | cpp |
p02947 | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 9; j >= 0; j--) {
for (int k = 0; k < j; k++) {
if (s[i][k] > s[i][k + 1]) {
char t = s[i][k... | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 9; j >= 0; j--) {
for (int k = 0; k < j; k++) {
if (s[i][k] > s[i][k + 1]) {
char t = s[i][k... | [
"type_conversion.add"
] | 747,252 | 747,253 | u845608451 | cpp |
p02947 | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 9; j >= 0; j--) {
for (int k = 0; k < j; k++) {
if (s[i][k] > s[i][k + 1]) {
char t = s[i][k... | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
for (int j = 9; j >= 0; j--) {
for (int k = 0; k < j; k++) {
if (s[i][k] > s[i][k + 1]) {
char t = s[i][k... | [
"type_conversion.add"
] | 747,254 | 747,253 | u845608451 | cpp |
p02947 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long ex(int n) { return n * (n - 1) / 2; }
int main() {
int N;
cin >> N;
vector<string> data(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
}
for (int i = 0; i < N; i++) {
sort(data.at(i).begin(), data.at(i).end());
}
sort(dat... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long ex(long n) { return n * (n - 1) / 2; }
int main() {
int N;
cin >> N;
vector<string> data(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i);
}
for (int i = 0; i < N; i++) {
sort(data.at(i).begin(), data.at(i).end());
}
sort(da... | [
"variable_declaration.type.primitive.change"
] | 747,257 | 747,258 | u387371565 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<char, char, char, char, char, char, char, char, char, char> T;
int main() {
int N;
cin >> N;
T t[N];
for (int i = 0; i < N; i++) {
vector<char> s;
for (int j = 0; j < 10; j++) {
char c;
cin >> c;
s.push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<char, char, char, char, char, char, char, char, char, char> T;
int main() {
int N;
cin >> N;
T t[N];
for (int i = 0; i < N; i++) {
vector<char> s;
for (int j = 0; j < 10; j++) {
char c;
cin >> c;
s.push_... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 747,261 | 747,262 | u559578080 | cpp |
p02947 | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll ... | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll ... | [] | 747,263 | 747,264 | u957932627 | cpp |
p02947 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, tmp = 0, s = 0;
cin >> n;
vector<string> v(n), t(n, "");
rep(i, n) cin >> v[i];
vector<vector<char>> r(n, vector<char>(10));
rep(i, n) { rep(j, 10) r[i][j] = v[i][j]; }
rep(i,... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int64_t n, tmp = 0, s = 0;
cin >> n;
vector<string> v(n), t(n, "");
rep(i, n) cin >> v[i];
vector<vector<char>> r(n, vector<char>(10));
rep(i, n) { rep(j, 10) r[i][j] = v[i][j]; }
re... | [
"variable_declaration.type.primitive.change"
] | 747,265 | 747,266 | u757584836 | cpp |
p02947 | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
auto sorted_strings = std::unordered_map<std::string, int>();
for (int i = 0; i < n; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
++sorted_strings[s];
}
uint64_t answer = 0;
for (const auto x : sorted_... | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
auto sorted_strings = std::unordered_map<std::string, uint64_t>();
for (int i = 0; i < n; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
++sorted_strings[s];
}
uint64_t answer = 0;
for (const auto x : so... | [
"variable_declaration.type.primitive.change"
] | 747,267 | 747,268 | u414568024 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ... | [
"variable_declaration.type.change"
] | 747,269 | 747,270 | u647592933 | cpp |
p02947 | #include <bits/stdc++.h>
#define maxn (int)(2e5)
#define i64 long long
#define all(x) x.begin(), x.end()
using namespace std;
unordered_map<string, int> MP;
void init() { MP.clear(); }
int main() {
// your code goes here
int n, k;
string s;
while (scanf("%d", &n) == 1) {
getchar();
init();
for (in... | #include <bits/stdc++.h>
#define maxn (int)(2e5)
#define i64 long long
#define all(x) x.begin(), x.end()
using namespace std;
unordered_map<string, int> MP;
void init() { MP.clear(); }
int main() {
// your code goes here
int n, k;
string s;
while (scanf("%d", &n) == 1) {
getchar();
init();
for (in... | [
"variable_declaration.type.change"
] | 747,271 | 747,272 | u717687462 | cpp |
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;
cin >> n;
map<string, int> mp;
for (int i = 1; i <= (n); ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto p : mp) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 1; i <= (n); ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto p : mp) {
... | [
"type_conversion.add"
] | 747,277 | 747,278 | u139255323 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, count = 0;
string s;
cin >> n;
map<string, int> m;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto x : m) {
if (x.second >= 2) {
count += (x.second * (x.second - 1)) / 2;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, count = 0;
string s;
cin >> n;
map<string, ll> m;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto x : m) {
if (x.second >= 2) {
count += (x.second * (x.second - 1)) / 2;
}... | [] | 747,279 | 747,280 | u738804491 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
using namespace std;
int main(void) {
long N;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
char *c = new char[10];
s.copy(c, 10);
sort(c, c + 10);
s = string(c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
using namespace std;
int main(void) {
long N;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
char *c = new char[10];
s.copy(c, 10);
sort(c, c + 10);
s = string(c... | [
"variable_declaration.type.primitive.change"
] | 747,281 | 747,282 | u710789518 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 100;
const int mod = 3e5;
char s[N][20];
int hashTable[mod], cnt[mod];
void init() {
for (int i = 0; i < mod; i++) {
hashTable[i] = -1;
cnt[i] = 0;
}
return;
}
int Hash(char *x) {
int c, base = 5381, ha = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 100;
const int mod = 3e5;
char s[N][20];
int hashTable[mod];
ll cnt[mod];
void init() {
for (int i = 0; i < mod; i++) {
hashTable[i] = -1;
cnt[i] = 0;
}
return;
}
int Hash(char *x) {
int c, base = 5381, ha = 0;
whi... | [
"call.remove"
] | 747,283 | 747,284 | u013103635 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 6;
const int mod = 1e5 + 3;
char s[N][20];
int hashTable[N], cnt[N];
void init() {
for (int i = 0; i < mod; i++) {
hashTable[i] = -1;
cnt[i] = 0;
}
return;
}
int Hash(char *t) {
int ha = 5381;
int c;
while (c = *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 6;
const int mod = 1e5 + 3;
char s[N][20];
int hashTable[N];
ll cnt[N];
void init() {
for (int i = 0; i < mod; i++) {
hashTable[i] = -1;
cnt[i] = 0;
}
return;
}
int Hash(char *t) {
int ha = 5381;
int c;
while (c ... | [] | 747,285 | 747,286 | u013103635 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
long long int ans = 0;
string t;
t = s.at(0);
int count = 1;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
long long int ans = 0;
string t;
t = s.at(0);
long long int count = 1;
for (int ... | [
"variable_declaration.type.widen.change"
] | 747,291 | 747,292 | u406337986 | cpp |
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;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int ans = 0;
for (auto &p : mp) {
int cnt = p.secon... | #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;
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 cnt = p.second... | [
"variable_declaration.type.change"
] | 747,293 | 747,294 | u430209651 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | [] | 747,295 | 747,296 | u427344224 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define rrep(i, n, m) for (int i = n; i >= (m); i--)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
con... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define rrep(i, n, m) for (int i = n; i >= (m); i--)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
con... | [] | 747,297 | 747,298 | u427344224 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int N;
ll ans = 0;
cin >> N;
map<string, int> nums;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.en... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int N;
ll ans = 0;
cin >> N;
map<string, int> nums;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.en... | [
"call.arguments.change"
] | 747,301 | 747,302 | u841131859 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int N;
ll ans = 0;
cin >> N;
map<string, int> nums;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.en... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int N;
ll ans = 0;
cin >> N;
map<string, int> nums;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.en... | [
"call.arguments.change"
] | 747,303 | 747,302 | u841131859 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
unordered_map<string, int> cnt;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
long long ans = 0;
for (auto it : cnt) {
int tmp = it.second;
ans += tmp * (tmp - 1... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
unordered_map<string, long long> cnt;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
long long ans = 0;
for (auto it : cnt) {
long long tmp = it.second;
ans += tm... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,304 | 747,305 | u931698099 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define all(x) (x).begin(), (x).end()
inline void Main() {
// code
int n;
map<string, int> count;
cin >> n;
rep(i, n) {
string s;
cin >> s;
sort(all(s));
... | #include <bits/stdc++.h>
using namespace std;
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define all(x) (x).begin(), (x).end()
inline void Main() {
// code
long long n;
map<string, long long> count;
cin >> n;
rep(i, n) {
string s;
cin >> s;
so... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,312 | 747,313 | u979605701 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define all(x) (x).begin(), (x).end()
inline void Main() {
// code
int n;
map<string, int> count;
cin >> n;
rep(i, n) {
string s;
cin >> s;
sort(all(s));
... | #include <bits/stdc++.h>
using namespace std;
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) repi(i, 0, n)
#define all(x) (x).begin(), (x).end()
inline void Main() {
// code
long long n;
map<string, long long> count;
cin >> n;
rep(i, n) {
string s;
cin >> s;
so... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,314 | 747,313 | u979605701 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> words(n);
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
words.at(i) = s;
}
sort(words.begin(), words.end());
int cont = 1;
long long ans = 0;
for (int i = 1; i < n; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> words(n);
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
words.at(i) = s;
}
sort(words.begin(), words.end());
long long cont = 1;
long long ans = 0;
for (int i = 1; i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,319 | 747,320 | u771662691 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
unordered_map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto &p : m) {
int b = p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
unordered_map<string, int> m;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto &p : m) {
int b = p... | [
"type_conversion.add"
] | 747,323 | 747,324 | u981304949 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
unordered_map<string, int> anagr... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long res = 0;
unordered_map<string, long... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,329 | 747,330 | u904019018 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define pb push_back
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define pb push_back
... | [
"variable_declaration.type.change"
] | 747,331 | 747,332 | u629521741 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
using ll = long long;
int N;
cin >> N;
queue<string> q;
map<string, int> m;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
if (m.count(S))
m[S]++;
else {
m[S] = 1;
q.push(S);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
using ll = long long;
int N;
cin >> N;
queue<string> q;
map<string, ll> m;
for (int i = 0; i < N; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
if (m.count(S))
m[S]++;
else {
m[S] = 1LL;
q.push(S);
}... | [
"literal.number.type.widen.change"
] | 747,333 | 747,334 | u136342563 | cpp |
p02947 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#defin... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#defin... | [] | 747,337 | 747,338 | u285598935 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
//#include <set>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define max_n 100
int N;
string s[100000];
int main() {
cin >> N;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
//#include <set>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define max_n 100
int N;
string s[100000];
int main() {
cin >> N;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,339 | 747,340 | u069033429 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef unsigned int UINT;
typedef unsigned long long ull;
typedef pair<int, int> pdi;
typedef pair<ll, int> pli;
map<string, int> mp;
int main(void) {
FAST_IO;
int n;
cin >> n... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef unsigned int UINT;
typedef unsigned long long ull;
typedef pair<int, int> pdi;
typedef pair<ll, int> pli;
map<string, int> mp;
int main(void) {
FAST_IO;
int n;
cin >> n... | [
"variable_declaration.type.change"
] | 747,341 | 747,342 | u785795721 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> st(n);
for (int i = 0; i < n; i++) {
cin >> st[i];
sort(st[i].begin(), st[i].end());
}
// set<string> setSt;
map<string, int> mapSt;
for (int i = 0; i < n; i++) {
if (!mapSt.empty()) {
if (map... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> st(n);
for (int i = 0; i < n; i++) {
cin >> st[i];
sort(st[i].begin(), st[i].end());
}
// set<string> setSt;
map<string, long long int> mapSt;
for (int i = 0; i < n; i++) {
if (!mapSt.empty()) {
... | [
"variable_declaration.type.widen.change"
] | 747,343 | 747,344 | u901408472 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define s... | [
"call.arguments.change",
"io.output.change",
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 747,345 | 747,346 | u035566695 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N, count = 0;
long long result = 0;
scanf("%d", &N);
char tmp[11];
vector<string> S(N);
queue<long long> q;
//入力してソート--O(N)
for (int i = 0; i < N; i++) {
scanf("%... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N, count = 0;
long long result = 0;
scanf("%d", &N);
char tmp[11];
vector<string> S(N);
queue<long long> q;
//入力してソート--O(N)
for (int i = 0; i < N; i++) {
scanf("%... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,347 | 747,348 | u405010758 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N, count = 0;
long long result = 0;
scanf("%d", &N);
char tmp[11];
vector<string> S(N);
queue<int> q;
//入力してソート--O(N)
for (int i = 0; i < N; i++) {
scanf("%s", tm... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int N, count = 0;
long long result = 0;
scanf("%d", &N);
char tmp[11];
vector<string> S(N);
queue<long long> q;
//入力してソート--O(N)
for (int i = 0; i < N; i++) {
scanf("%... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,349 | 747,348 | u405010758 | cpp |
p02947 |
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <unordered_map>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
#define rep(i, n) REP(i, 0, n)
#define REP(i, x... |
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <unordered_map>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
#define rep(i, n) REP(i, 0, n)
#define REP(i, x... | [
"variable_declaration.type.change"
] | 747,350 | 747,351 | u542249197 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
typedef long long ll;
//プロトタイプ宣言
int gcd(int, int);
int main() {
int n, ans = 0;
cin >> n;
string s;
unordered_map<string, int> mp;
while (n > 0) {
cin >> s;
so... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
typedef long long ll;
//プロトタイプ宣言
int gcd(int, int);
int main() {
ll n, ans = 0;
cin >> n;
string s;
map<string, ll> mp;
while (n > 0) {
cin >> s;
sort(s.begin()... | [
"variable_declaration.type.change"
] | 747,352 | 747,353 | u060965067 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
typedef long long ll;
//プロトタイプ宣言
int gcd(int, int);
int main() {
int n, ans = 0;
cin >> n;
string s;
unordered_map<string, int> mp;
while (n > 0) {
cin >> s;
so... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, a, b) for (int i = a; i < b; ++i)
typedef long long ll;
//プロトタイプ宣言
int gcd(int, int);
int main() {
ll n, ans = 0;
cin >> n;
string s;
unordered_map<string, ll> mp;
while (n > 0) {
cin >> s;
sort... | [
"variable_declaration.type.change"
] | 747,352 | 747,354 | u060965067 | cpp |
p02947 | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target... | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC target... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,357 | 747,358 | u752949890 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> mp;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long ans = 0;
for (auto &p : mp) {
ans += (p.second * (p.second - 1)) / 2;
}
cout << ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, long> mp;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long ans = 0;
for (auto &p : mp) {
ans += (p.second * (p.second - 1)) / 2;
}
cout << ans... | [
"variable_declaration.type.primitive.change"
] | 747,359 | 747,360 | u033627628 | cpp |
p02947 | #include <bits/stdc++.h>
#define INF 1e18
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
usi... | #include <bits/stdc++.h>
#define INF 1e18
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
usi... | [] | 747,361 | 747,362 | u929199273 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
// vector<string> strs;
string tmp;
map<string, int> mp;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
ans += mp[tmp];
mp[tmp]++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
// vector<string> strs;
string tmp;
map<string, int> mp;
int64_t ans = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
ans += mp[tmp];
mp[tmp]++;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 747,365 | 747,366 | u091552241 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
map<string, int> m;
set<string> t;
for (int i = 0; i < n; i++) {
m[s.at(i)]++;
t.insert(s.at(i));
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
map<string, int> m;
set<string> t;
for (int i = 0; i < n; i++) {
m[s.at(i)]++;
t.insert(s.at(i));
}
... | [
"variable_declaration.type.primitive.change"
] | 747,367 | 747,368 | u482982507 | cpp |
p02947 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define INF 1145141919
#define LLINF 1145148101919
#define PI 3.14159265359
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0,... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define INF 1145141919
#define LLINF 1145148101919
#define PI 3.14159265359
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0,... | [
"assignment.change"
] | 747,369 | 747,370 | u811528179 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int N = 1e5;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
map<string, int> st;
for (int i = 0; i < n; i++) {
string s;
cin ... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int N = 1e5;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
map<string, int> st;
for (int i = 0; i < n; i++) {
string s;
cin ... | [
"assignment.change"
] | 747,371 | 747,372 | u645588943 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int N = 1e5;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
map<string, int> st;
for (int i = 0; i < n; i++) {
string s;
cin ... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int N = 1e5;
const int MOD = 1e9 + 7;
const double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
map<string, int> st;
for (int i = 0; i < n; i++) {
string s;
cin ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 747,373 | 747,372 | u645588943 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<string> v(n);
rep(i, n) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
string tmpstr = v[0];
int ans = 0, tmp... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<string> v(n);
rep(i, n) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
string tmpstr = v[0];
long ans = 0, tm... | [
"variable_declaration.type.primitive.change"
] | 747,378 | 747,379 | u154833883 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n;
string s[100010];
map<string, int> cnt;
void solve() {
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
// cout<<s[i]<<endl;
ans += cnt[s[i]];
cnt[s[i]] += 1;
}
cout << ans << endl;
}
s... | #include <bits/stdc++.h>
using namespace std;
int n;
string s[100010];
map<string, int> cnt;
void solve() {
long long ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
// cout<<s[i]<<endl;
ans += cnt[s[i]];
cnt[s[i]] += 1;
}
cout << ans << endl... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,380 | 747,381 | u134181243 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> vs;
long long n;
string s;
cin >> n;
cin.ignore();
for (long long i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
vs.push_back(s);
}
sort(... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> vs;
long long n;
string s;
cin >> n;
cin.ignore();
for (long long i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
vs.push_back(s);
}
sort(... | [
"assignment.value.change"
] | 747,382 | 747,383 | u116018262 | 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++)
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
string s[n];
map<string, int> m;
REP(i, n) {
cin >> s[i];
... | #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++)
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
string s[n];
map<string, int> m;
REP(i, n) {
cin >> s[i];
... | [
"type_conversion.add"
] | 747,389 | 747,390 | u809690311 | 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++)
using namespace std;
int main() {
int n;
cin >> n;
long ans = 0;
string s[n];
map<string, int> m;
REP(i, n) {
cin >> s[i];
sort... | #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++)
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
string s[n];
map<string, int> m;
REP(i, n) {
cin >> s[i];
... | [
"variable_declaration.type.widen.change"
] | 747,391 | 747,390 | u809690311 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int N;
string s;
long long res = 0;
cin >> N;
unordered_map<string, int> map;
rep(i, N) {
cin >> s;
sort(s.begin(), s.end());
if (map.find(s) != map.end()) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int N;
string s;
long long res = 0;
cin >> N;
unordered_map<string, int> map;
rep(i, N) {
cin >> s;
sort(s.begin(), s.end());
if (map.find(s) != map.end()) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,392 | 747,393 | u411427373 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
map<string, int> ana;
rep(i, N) {
string s;
cin >> s;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N;
cin >> N;
map<string, ll> ana;
rep(i, N) {
string s;
cin >> s;
... | [] | 747,394 | 747,395 | u680707192 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | [
"variable_declaration.type.change"
] | 747,396 | 747,397 | u661738979 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | [
"variable_declaration.type.change"
] | 747,398 | 747,397 | u661738979 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | [
"variable_declaration.type.change"
] | 747,396 | 747,399 | u661738979 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
i... | [
"variable_declaration.type.change"
] | 747,398 | 747,399 | u661738979 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int count = 0;
int result = 0;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
long long count = 0;
long long result = 0;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 747,400 | 747,401 | u890183645 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int co = 0;
int sum = 0;
for (int i = 1; i < N; i++) {
if (s.at(i) == s.at(i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
long long co = 0;
long long sum = 0;
for (int i = 1; i < N; i++) {
if (s.at(i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,402 | 747,403 | u830237447 | cpp |
p02947 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <vector>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <vector>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [] | 747,410 | 747,411 | u542486952 | cpp |
p02947 | #include <bits/stdc++.h>
#define i_love_u_Phuong \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
ll lt(ll x, ll y) {}
int main() {
#ifndef RICARDO... | #include <bits/stdc++.h>
#define i_love_u_Phuong \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
ll lt(ll x, ll y) {}
int main() {
#ifndef RICARDO... | [
"variable_declaration.type.change"
] | 747,412 | 747,413 | u624463308 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long N;
map<string, int> str_count;
int main() {
cin >> N;
for (long long i = 0; i < N; i++) {
string s;
cin >> s;
vector<char> tmp;
for (int j = 0; j < s.size(); j++) {
tmp.push_back(s[j]);
}
sort(tmp.begin(), tmp.end());
string... | #include <bits/stdc++.h>
using namespace std;
long long N;
map<string, long long> str_count;
int main() {
cin >> N;
for (long long i = 0; i < N; i++) {
string s;
cin >> s;
vector<char> tmp;
for (int j = 0; j < s.size(); j++) {
tmp.push_back(s[j]);
}
sort(tmp.begin(), tmp.end());
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,414 | 747,415 | u920254817 | cpp |
p02947 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
// typedef pair<int, int> P... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
// typedef pair<int, int> P... | [
"variable_declaration.type.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 747,421 | 747,422 | u433195318 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long hh(int n) {
int ans;
if (n == 1)
return 0;
return ans = hh(n - 1) + n - 1;
}
int main() {
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sort(a[i].begin(), a[i].end());
}
sort(a.begin(), a.end());
... | #include <bits/stdc++.h>
using namespace std;
long long hh(int n) {
if (n == 1)
return 0;
return hh(n - 1) + n - 1;
}
int main() {
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sort(a[i].begin(), a[i].end());
}
sort(a.begin(), a.end());
a.push_back("####"... | [
"variable_declaration.remove",
"assignment.change"
] | 747,430 | 747,431 | u103850114 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define e... | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define e... | [
"assignment.change"
] | 747,434 | 747,435 | u411771230 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> ma;
int n, aw;
aw = 0;
string a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
aw += ma[a];
ma[a]++;
}
cout << aw << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> ma;
int n;
long long aw = 0;
string a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
aw += ma[a];
ma[a]++;
}
cout << aw << endl;
}
| [
"variable_declaration.remove"
] | 747,436 | 747,437 | u121538479 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#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()... | #include <bits/stdc++.h>
using namespace std;
#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()... | [] | 747,440 | 747,441 | u986276444 | cpp |
p02947 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long lint;
int main() {
map<string, int> ans;
int n;
cin >> n;
rep(i, n) {
char s[11];
scanf("%s", s);
vector<char> moji;
rep(j, 10) { moji.push_back(s[j]); }
sort(m... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long lint;
int main() {
map<string, lint> ans;
int n;
cin >> n;
rep(i, n) {
char s[11];
scanf("%s", s);
vector<char> moji;
rep(j, 10) { moji.push_back(s[j]); }
sort(... | [
"control_flow.loop.for.initializer.change"
] | 747,442 | 747,443 | u239102032 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [] | 747,444 | 747,445 | u861345985 | cpp |
p02947 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
long long MOD = 1e9 + ... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
long long MOD = 1e9 + ... | [
"variable_declaration.type.change"
] | 747,446 | 747,447 | u868702169 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
// vector<int> a(n); sort(a.begin(),a.end());
// cout << "test" << "\n";
cin.tie(0);
ios::sync_with_stdio(false);
// string ans="YES";
ll ans = 0;
ll n;
cin >> n;
vector... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
int main() {
// vector<int> a(n); sort(a.begin(),a.end());
// cout << "test" << "\n";
cin.tie(0);
ios::sync_with_stdio(false);
// string ans="YES";
ll ans = 0;
ll n;
cin >> n;
vector... | [
"variable_declaration.type.change"
] | 747,450 | 747,451 | u429911069 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int a(int x) {
int n = 1;
for (int i = x; i > x - 2; --i) {
n *= i;
}
return n / 2;
}
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 co... | #include <bits/stdc++.h>
using namespace std;
long int a(long int x) {
long int n = 1;
for (long int i = x; i > x - 2; --i) {
n *= i;
}
return n / 2;
}
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)... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.narrow.change"
] | 747,456 | 747,457 | u561007032 | cpp |
p02947 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, count = 0;
string s;
cin >> n;
map<string, int> m;
r(i, n) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto it = m.begin(); it != m.end(); it++) {
if... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, count = 0;
string s;
cin >> n;
map<string, ll> m;
r(i, n) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
for (auto it = m.begin(); it != m.end(); it++) {
if ... | [] | 747,460 | 747,461 | u192280767 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int64_... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
rep(i, N) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int64_... | [
"type_conversion.add"
] | 747,462 | 747,463 | u747087681 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
int n;
std::cin >> n;
std::map<std::string, int> m;
int ans = 0;
for (int i = 0; i < n; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
ans += m[s];
++m[s];
}
std::cout << ans <<... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
int main() {
int n;
std::cin >> n;
std::map<std::string, int> m;
long long ans = 0;
for (int i = 0; i < n; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
ans += m[s];
++m[s];
}
std::cout << ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,464 | 747,465 | u074059053 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
/*
bool checkAnagram(string str1, string str2)
{
int alp1[26] = {0};
int alp2[26] = {0};
for(int i = 0; i < str1.size(); i++){
alp1[str1[i]-'a']++;
alp2[str2[i]-'a']++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = unsigned long long;
/*
bool checkAnagram(string str1, string str2)
{
int alp1[26] = {0};
int alp2[26] = {0};
for(int i = 0; i < str1.size(); i++){
alp1[str1[i]-'a']++;
alp2[str2[i]-'... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 747,469 | 747,470 | u104741254 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
/*
bool checkAnagram(string str1, string str2)
{
int alp1[26] = {0};
int alp2[26] = {0};
for(int i = 0; i < str1.size(); i++){
alp1[str1[i]-'a']++;
alp2[str2[i]-'a']++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = unsigned long long;
/*
bool checkAnagram(string str1, string str2)
{
int alp1[26] = {0};
int alp2[26] = {0};
for(int i = 0; i < str1.size(); i++){
alp1[str1[i]-'a']++;
alp2[str2[i]-'... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 747,471 | 747,470 | u104741254 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long long int ans = 0;
long long int count = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < N; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long long int ans = 0;
long long int count = 1;
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 747,472 | 747,473 | u231455327 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string p;
vector<string> vec(a);
for (int i = 0; i < a; i++) {
cin >> p;
sort(p.begin(), p.end());
vec.at(i) = p;
}
sort(vec.begin(), vec.end());
int y = 1;
long long int answer = 0;
for (int i = 0; i < a; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
string p;
vector<string> vec(a);
for (int i = 0; i < a; i++) {
cin >> p;
sort(p.begin(), p.end());
vec.at(i) = p;
}
sort(vec.begin(), vec.end());
long long int y = 1;
long long int answer = 0;
for (int i = 0;... | [
"variable_declaration.type.widen.change"
] | 747,474 | 747,475 | u363369454 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
typedef long ... | [
"variable_declaration.type.change"
] | 747,476 | 747,477 | u681869152 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
typedef long ... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change"
] | 747,478 | 747,477 | u681869152 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
ll ans = 0;
sort(s.begin(), s.end());
int cnt =... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
ll ans = 0;
sort(s.begin(), s.end());
ll cnt = ... | [
"variable_declaration.type.change"
] | 747,480 | 747,481 | u179970156 | cpp |
p02947 | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | [] | 747,482 | 747,483 | u934402094 | cpp |
p02947 | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | [
"type_conversion.add"
] | 747,482 | 747,484 | u934402094 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout << fixed;
cout.precision(10);
if (fopen("joke.in", "r")) {
freopen("joke.in", "r", stdin);
freopen("joke.out", "w", stdout);
}
int n;
cin >> n;
string s;
map<string, int> mp;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout << fixed;
cout.precision(10);
if (fopen("joke.in", "r")) {
freopen("joke.in", "r", stdin);
freopen("joke.out", "w", stdout);
}
int n;
cin >> n;
string s;
map<string, int> mp;
for (int i = 0; ... | [
"assignment.change"
] | 747,489 | 747,490 | u337959231 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int i, k;
long long sum;
string a;
cin >> n;
map<string, int> mp;
for (i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
mp[a]++;
}
sum = 0;
for (auto &p : mp) {
k = p.second;
sum = (long long)k * (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int i, k;
long long sum;
string a;
cin >> n;
map<string, int> mp;
for (i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
mp[a]++;
}
sum = 0;
for (auto p : mp) {
k = p.second;
sum += (long long)k * (k - 1)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"assignment.value.change"
] | 747,493 | 747,494 | u144029820 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int i, k;
long long sum;
string a;
cin >> n;
map<string, int> mp;
for (i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
mp[a]++;
}
sum = 0;
for (auto &p : mp) {
k = p.second;
sum = (long long)k * (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int i, k;
long long sum;
string a;
cin >> n;
map<string, int> mp;
for (i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
mp[a]++;
}
sum = 0;
for (auto &p : mp) {
k = p.second;
sum += (long long)k * (k - 1... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"assignment.value.change"
] | 747,493 | 747,495 | u144029820 | cpp |
p02947 | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 747,496 | 747,497 | u837233010 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define pp pop_back
#define in insert
#define ff ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define pp pop_back
#define in insert
#define ff ... | [
"variable_declaration.type.change"
] | 747,498 | 747,499 | u190196352 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.