problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 1001001001;
int combination(int x, int y) {
if (x < y)
return 0;
int a = 1;
int b = 1;
rep(i, y) {
a *= i + 1;
b *= x - i;
}
return b / a;
}
int main() {
int n;
cin >... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int INF = 1001001001;
ll combination(int x, int y) {
if (x < y)
return 0;
ll a = 1;
ll b = 1;
rep(i, y) {
a *= i + 1;
b *= x - i;
}
return b / a;
}
int main() {
int n;
cin >> ... | [
"variable_declaration.type.change"
] | 747,756 | 747,755 | u405620865 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int N;
cin >> N;
map<string, int> all;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
all[s]++;
}
ll total = 0;
for (auto const &p : all) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int N;
cin >> N;
map<string, int> all;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
all[s]++;
}
ll total = 0;
for (auto const &p : all) {
... | [
"variable_declaration.type.change"
] | 747,757 | 747,758 | u148425972 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000
#define ll int64_t
#define all(v) (v).begin(), (v).end()
#define P pair<int, int>
using namespace std;
int main() {
int n, count = 0, ren = 0;
cin >> n;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000
#define ll int64_t
#define all(v) (v).begin(), (v).end()
#define P pair<int, int>
using namespace std;
int main() {
ll n, count = 0, ren = 0;
cin >> n;
... | [
"variable_declaration.type.change"
] | 747,761 | 747,762 | u532401120 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s;
char cha[11];
vector<string> str(n);
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < 11; j++) {
cha[j] = s[j];
}
sort(cha, cha + 10);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s;
char cha[11];
vector<string> str(n);
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < 11; j++) {
cha[j] = s[j];
}
sort(cha, cha + 10);
... | [
"variable_declaration.type.widen.change"
] | 747,763 | 747,764 | u992779443 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
REP(i, n) {
cin >> s[i];
sor... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
REP(i, n) {
cin >> s[i];
sor... | [
"variable_declaration.type.change"
] | 747,769 | 747,770 | u291873788 | cpp |
p02947 | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
//#include <functional>
int main() {
int32_t N;
std::cin >> N;
// naiive approach
// reorder N strings O(NlogN * 10)
// check every combination nC2 = N^2
// to avoid N^2, hash_map can ... | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
//#include <functional>
int main() {
int32_t N;
std::cin >> N;
// naiive approach
// reorder N strings O(NlogN * 10)
// check every combination nC2 = N^2
// to avoid N^2, hash_map can ... | [
"variable_declaration.type.primitive.change"
] | 747,771 | 747,772 | u775900747 | cpp |
p02947 | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mp make_pair
#define for1(i, n) for (int i = 1; i <= n; ++i)
#define for0(i, n) for (int i = 0; i < n; ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#de... | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mp make_pair
#define for1(i, n) for (int i = 1; i <= n; ++i)
#define for0(i, n) for (int i = 0; i < n; ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#de... | [
"variable_declaration.type.change"
] | 747,773 | 747,774 | u190848148 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using S = set<long long>;
using D = deque<long long>;
using L = vector<long long>;
using M = map<int, long long>;
using A = vector<vector<long long>>;
using Q = priority_queue<long long>;
using U =
unordered_map<int, long long>; // mapとの違いはkeyの順番を保持していない
#define sorte... | #include <bits/stdc++.h>
using namespace std;
using S = set<long long>;
using D = deque<long long>;
using L = vector<long long>;
using M = map<int, long long>;
using A = vector<vector<long long>>;
using Q = priority_queue<long long>;
using U =
unordered_map<int, long long>; // mapとの違いはkeyの順番を保持していない
#define sorte... | [
"assignment.change"
] | 747,777 | 747,778 | u367130284 | cpp |
p02947 | #pragma GCC optimize(3)
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
string s;
int n;
map<string, int> m;
long long ans, tmp;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (register int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
fo... | #pragma GCC optimize(3)
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
string s;
int n;
map<string, int> m;
long long ans, tmp;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (register int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
fo... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 747,779 | 747,780 | u131977721 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int N, ans = 0;
cin >> N;
map<string, ll> s;
for (int i = 0; i < N; i++) {
string ss;
cin >> ss;
sort(ss.begin(), ss.end());
ans += s[ss]++;
}
cout << ans << endl... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int N;
long long ans = 0;
cin >> N;
map<string, ll> s;
for (int i = 0; i < N; i++) {
string ss;
cin >> ss;
sort(ss.begin(), ss.end());
ans += s[ss]++;
}
cout <<... | [
"variable_declaration.type.widen.change"
] | 747,781 | 747,782 | u001858868 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(int argc, char const *argv[]) {
int n;
cin >> n;
map<string, int> ma;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
ma[s]++;
}
ll ans = 0;
for (auto u ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(int argc, char const *argv[]) {
int n;
cin >> n;
map<string, ll> ma;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
ma[s]++;
}
ll ans = 0;
for (auto u :... | [] | 747,785 | 747,786 | u029876051 | cpp |
p02947 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... | [
"variable_declaration.type.change"
] | 747,787 | 747,788 | u510383220 | cpp |
p02947 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... | [
"variable_declaration.type.change"
] | 747,789 | 747,788 | u510383220 | cpp |
p02947 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... | [
"type_conversion.add"
] | 747,787 | 747,790 | u510383220 | cpp |
p02947 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define ll long long
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
const int INF = 1001001001;
// int 2×10の9乗
// vector<vec... | [
"variable_declaration.type.change"
] | 747,789 | 747,790 | u510383220 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define all(x) x.begin(), x.end()
#define VI vector<int>
#define VS vector<string>
#define ll long long
#define INF 2e9
#define fir first
#define sec second
using namespace std;
void Main() {
int n;
cin >> n;
map<string, int> S;
int ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define all(x) x.begin(), x.end()
#define VI vector<int>
#define VS vector<string>
#define ll long long
#define INF 2e9
#define fir first
#define sec second
using namespace std;
void Main() {
int n;
cin >> n;
map<string, int> S;
ll a... | [
"variable_declaration.type.change"
] | 747,791 | 747,792 | u075520262 | cpp |
p02947 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"io.output.change"
] | 747,793 | 747,794 | u900727536 | 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; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
... | #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; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
... | [
"variable_declaration.value.change"
] | 747,795 | 747,796 | u718774863 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int k, x;
string s;
map<string, int> mp;
cin >> k;
while (k--) {
cin >> s;
sort(s.begin(), s.end());
mp[s] += 1;
}
ll ans = 0;
for (auto it : mp) {
ans += (it.second) * (it.second - 1) / 2;
}
cout <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int k, x;
string s;
map<string, ll> mp;
cin >> k;
while (k--) {
cin >> s;
sort(s.begin(), s.end());
mp[s] += 1;
}
ll ans = 0;
for (auto it : mp) {
ans += (it.second) * (it.second - 1) / 2;
}
cout <<... | [] | 747,798 | 747,799 | u038410216 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 0; i <= n; i++)
#define repr(i, n) for (int i = n; i > 0; i--)
#define REPR(i, n) for (int i = n; i >= 0; i--)
const ll INF = 1e18;
const int INT_INF = 1e9;
const ll MOD = 1e9 + 7;
template <class ... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 0; i <= n; i++)
#define repr(i, n) for (int i = n; i > 0; i--)
#define REPR(i, n) for (int i = n; i >= 0; i--)
const ll INF = 1e18;
const int INT_INF = 1e9;
const ll MOD = 1e9 + 7;
template <class ... | [] | 747,800 | 747,801 | u864667985 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> MAP;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
MAP[s]++;
}
long long ans = 0;
for (auto p : MAP) {
int a = p.second;
ans += a * (a - 1) / 2;
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long> MAP;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
MAP[s]++;
}
long long ans = 0;
for (auto p : MAP) {
long long a = p.second;
ans += a * (a - 1) /... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,808 | 747,809 | u688422725 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define SZ(i) int(i.size())
#ifdef tmd
#define IOS()
#define debug(...) \
fprintf(stderr, "%s - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define SZ(i) int(i.size())
#ifdef tmd
#define IOS()
#define debug(...) \
fprintf(stderr, "%s - ... | [
"call.add"
] | 747,810 | 747,811 | u825429292 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int calc(int n) {}
int main() {
int N;
std::unordered_map<std::string, int> ss;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
ss[s] ... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int calc(int n) {}
int main() {
int N;
std::unordered_map<std::string, int> ss;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
ss[s] ... | [
"variable_declaration.type.primitive.change"
] | 747,812 | 747,813 | u321149875 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int calc(int n) {}
int main() {
int N;
std::unordered_map<std::string, int> ss;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
ss[s] ... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int calc(int n) {}
int main() {
int N;
std::unordered_map<std::string, int> ss;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
ss[s] ... | [
"variable_declaration.type.primitive.change",
"literal.number.type.widen.change"
] | 747,814 | 747,813 | u321149875 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
string s;
unordered_map<string, int> map;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
map[s]++;
}
long int ... | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
string s;
unordered_map<string, int> map;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
map[s]++;
}
long int ... | [
"type_conversion.add"
] | 747,815 | 747,816 | u493846037 | cpp |
p02947 | #include <bits/stdc++.h>
// # define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
int ans = 0;
for (auto x : m) {
int v = x.second;
ans += (v - 1) * v / 2;
}
... | #include <bits/stdc++.h>
// # define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long> m;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long long ans = 0;
for (auto x : m) {
long long v = x.second;
ans += (v -... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,823 | 747,824 | u116002573 | cpp |
p02947 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
int ans = 0;
auto begin = m.begin(), end = m.end();
for (auto iter = begin; iter != end;... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long> m;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long long ans = 0;
auto begin = m.begin(), end = m.end();
for (auto iter = begin; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,825 | 747,826 | u116002573 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
bool ard(string a, string b) {
int c = 0;
for (int i = 0; i < a.length(); i++) {
int f = b.find(a[i]);
if (f != string::npos) {
c++;
b.erase(f, 1);
}
}
return (c == 10);
}
int main() {
int n;
cin >> n;
vector<string> v;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
bool ard(string a, string b) {
int c = 0;
for (int i = 0; i < a.length(); i++) {
int f = b.find(a[i]);
if (f != string::npos) {
c++;
b.erase(f, 1);
}
}
return (c == 10);
}
int main() {
int n;
cin >> n;
vector<string> v;
for (int i = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,827 | 747,828 | u129611452 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s.at(i);
for (int i = 0; i < N; i++)
sort(s.at(i).begin(), s.at(i).end());
sort(s.begin(), s.end(... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s.at(i);
for (int i = 0; i < N; i++)
sort(s.at(i).begin(), s.at(i).end());
sort(s.begin(), s.end(... | [
"variable_declaration.type.primitive.change"
] | 747,832 | 747,833 | u152315108 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
mp[s.at(i)]++;
}
long long cnt = 0;
for (auto s : mp) {
cnt += s.second * (s.second... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
mp[s.at(i)]++;
}
long long cnt = 0;
for (auto s : mp) {
cnt += (long long)s.second ... | [
"type_conversion.add"
] | 747,834 | 747,835 | u215743476 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main(int argc, char const *argv[]) {
int d = 1000000;
map<string, int> arl;
int ans = 0;
cin >> d;
for (int i = 0; i < d; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
arl[S]++;
ans += arl[S] - 1;
... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main(int argc, char const *argv[]) {
int d = 1000000;
map<string, int> arl;
long long ans = 0;
cin >> d;
for (int i = 0; i < d; i++) {
string S;
cin >> S;
sort(S.begin(), S.end());
arl[S]++;
ans += arl[S]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,836 | 747,837 | u498467508 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double n, cnt = 0, num = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, cnt = 0, num = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,838 | 747,839 | u816935184 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> data; //文字列→個数
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (data.count(s))
data.at(s)++;
else
data[s] = 1;
}
long long sum = 0;
for (pair<string, ... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> data; //文字列→個数
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (data.count(s))
data.at(s)++;
else
data[s] = 1;
}
long long sum = 0;
for (pair<string, ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,840 | 747,841 | u938841444 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int N;
int cnt = 0;
cin >> N;
vector<string> s(N);
unordered_map<string, int> table;
rep(i, N) {
cin >> s[... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
long N;
long cnt = 0;
cin >> N;
vector<string> s(N);
unordered_map<string, long> table;
rep(i, N) {
cin >>... | [
"variable_declaration.type.primitive.change"
] | 747,844 | 747,845 | u145179061 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
long long GCD(long long a, long long b) {
if (b == 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
long long GCD(long long a, long long b) {
if (b == 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,846 | 747,847 | u183971632 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int main() {
int n, ans = 0;
std::unordered_map<std::string, int> string_map;
std::cin >> n;
std::string s;
for (int i = 0; i < n; i++) {
std::cin >> s;
std::sort(s.begin(), s.end());
if (string_... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int main() {
int n;
long ans = 0;
std::unordered_map<std::string, int> string_map;
std::cin >> n;
std::string s;
for (int i = 0; i < n; i++) {
std::cin >> s;
std::sort(s.begin(), s.end());
if (... | [
"variable_declaration.type.widen.change"
] | 747,853 | 747,854 | u911828387 | cpp |
p02947 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define MIN(a, b) (a) > (b) ? (b) : (a)
using namespace std;
int main() {
int N;
cin >> N;
long ans = 0;
unordered_map<string, int> S;
for (int i = 0; i < N; i++) {
s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define MIN(a, b) (a) > (b) ? (b) : (a)
using namespace std;
int main() {
int N;
cin >> N;
long ans = 0;
unordered_map<string, int> S;
for (int i = 0; i < N; i++) {
st... | [
"variable_declaration.type.primitive.change"
] | 747,855 | 747,856 | u598273654 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> A;
for (int i = 0; i ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
map<string, ll> A;
for (int i = 0; i <... | [] | 747,857 | 747,858 | u569272329 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int n;
cin >> n;
typedef long long ll;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++; //同じ文字列が存在した場合その文字列を++する
}
ll ans = 0;
for (au... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int n;
cin >> n;
typedef long long ll;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++; //同じ文字列が存在した場合その文字列を++する
}
ll ans = 0;
for (aut... | [
"expression.operator.change"
] | 747,859 | 747,860 | u905170328 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define maxn (1000 + 10)
#define mod 10000003
#define lnode node * 2, start, mid
#define rnode node * 2 + 1, mid + 1, end
using namespace std;
map<string, int> m;
string s[100010];
long long num = 0;
int main() {
ios::sync_with_stdio(false);
#define int ll
int n;
char... | #include <bits/stdc++.h>
#define ll long long
#define maxn (1000 + 10)
#define mod 10000003
#define lnode node * 2, start, mid
#define rnode node * 2 + 1, mid + 1, end
using namespace std;
map<string, long long> m;
string s[100010];
long long num = 0;
int main() {
ios::sync_with_stdio(false);
#define int ll
int n;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,861 | 747,862 | u455823625 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define maxn (1000 + 10)
#define mod 10000003
#define lnode node * 2, start, mid
#define rnode node * 2 + 1, mid + 1, end
using namespace std;
map<string, int> m;
string s[100010];
int num = 0;
int main() {
ios::sync_with_stdio(false);
#define int ll
int n;
char t[100... | #include <bits/stdc++.h>
#define ll long long
#define maxn (1000 + 10)
#define mod 10000003
#define lnode node * 2, start, mid
#define rnode node * 2 + 1, mid + 1, end
using namespace std;
map<string, long long> m;
string s[100010];
long long num = 0;
int main() {
ios::sync_with_stdio(false);
#define int ll
int n;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,863 | 747,862 | u455823625 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
#define maxn (1000 + 10)
#define mod 10000003
#define lnode node * 2, start, mid
#define rnode node * 2 + 1, mid + 1, end
using namespace std;
map<string, int> m;
string s[100001];
int num = 0;
int main() {
ios::sync_with_stdio(false);
#define int ll
int n;
char t[11]... | #include <bits/stdc++.h>
#define ll long long
#define maxn (1000 + 10)
#define mod 10000003
#define lnode node * 2, start, mid
#define rnode node * 2 + 1, mid + 1, end
using namespace std;
map<string, long long> m;
string s[100010];
long long num = 0;
int main() {
ios::sync_with_stdio(false);
#define int ll
int n;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 747,864 | 747,862 | u455823625 | 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());
}
map<string, int> mp;
for (int i = 0; i < n; i++) {
if (mp.find(s[i]) != mp.end()) {
mp[s[i]]++;
} else {
... | #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());
}
map<string, long long> mp;
for (int i = 0; i < n; i++) {
if (mp.find(s[i]) != mp.end()) {
mp[s[i]]++;
} else {... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,865 | 747,866 | u526708273 | cpp |
p02947 | #include <bits/stdc++.h>
#include <map>
using namespace std;
// typedef long long long long;
int main() {
long long n = 3;
cin >> n;
// map<string, long long> m;
// long n = 3;
// map<string, long long> m = {{"acornistnt", 1}, {"peanutbomb", 2}
// ,{"constraint", 3}};
map<string, long long> m;
// v... | #include <bits/stdc++.h>
#include <map>
using namespace std;
// typedef long long long long;
int main() {
long long n = 3;
cin >> n;
// map<string, long long> m;
// long n = 3;
// map<string, long long> m = {{"acornistnt", 1}, {"peanutbomb", 2}
// ,{"constraint", 3}};
map<string, long long> m;
// v... | [] | 747,867 | 747,868 | u891807037 | cpp |
p02947 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N + 1);
for (int i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
long long ans = 0;
S[N] = ("zzzzzzzzzzz");
sort(S.begin(), S.en... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N + 1);
for (int i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
long long ans = 0;
S[N] = ("zzzzzzzzzzz");
sort(S.begin(), S.en... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,871 | 747,870 | u184929210 | cpp |
p02947 | #include <bits/stdc++.h>
#define SEKAI_NO_OWARI return 0;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
void solve() {
int n;
cin >> n;
vector<string> s(n);
unordered_map<string, int> um(n);
rep(i, n) cin >> s[i];
int res = 0;
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[... | #include <bits/stdc++.h>
#define SEKAI_NO_OWARI return 0;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
void solve() {
int n;
cin >> n;
vector<string> s(n);
unordered_map<string, long long> um(n);
rep(i, n) cin >> s[i];
long long res = 0;
for (int i = 0; i < n; i++) {
sort(s[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,874 | 747,875 | u863957421 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int> m;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
m[s[i]]++;
}
long long ans = 0;... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
map<string, int> m;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
m[s[i]]++;
}
long long ans = 0;... | [
"type_conversion.add"
] | 747,876 | 747,877 | u528523331 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
// Macros
#define f(i, a, b) for (int i = a; i < b; i++)
#define f_(i, a, b) for (int i = a; i >= b; i++)
#define F first
#define S second
#define PB push_back
#define endl '\n'
// Debuging
#define deb(x) cout << #x << " " << x << '\n'
// Shortcuts
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
// Macros
#define f(i, a, b) for (int i = a; i < b; i++)
#define f_(i, a, b) for (int i = a; i >= b; i++)
#define F first
#define S second
#define PB push_back
#define endl '\n'
// Debuging
#define deb(x) cout << #x << " " << x << '\n'
// Shortcuts
typedef long long ll;
t... | [
"type_conversion.add"
] | 747,878 | 747,879 | u359384375 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p : mp) {
int i = p.second;
ans += i * (i - 1) / 2;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto p : mp) {
int i = p.second;
ans += (long long)i * (i - 1) / 2;
... | [
"type_conversion.add"
] | 747,880 | 747,881 | u806149832 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto p : mp) {
int i = p.second;
ans += i * (i - 1) / 2;
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto p : mp) {
int i = p.second;
ans += (long long)i * (i - 1) / 2;
... | [
"type_conversion.add"
] | 747,882 | 747,881 | u806149832 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long int comb(int);
int main(void) {
int n;
cin >> n;
vector<string> sv(n);
for (int i = 0; i < n; i++)
cin >> sv.at(i);
unordered_map<string, int> hash;
for (auto s : sv) {
sort(s.begin(), s.end());
if (hash[s] == 0) {
hash[s]++;
} else ... | #include <bits/stdc++.h>
using namespace std;
long int comb(long int);
int main(void) {
int n;
cin >> n;
vector<string> sv(n);
for (int i = 0; i < n; i++)
cin >> sv.at(i);
unordered_map<string, int> hash;
for (auto s : sv) {
sort(s.begin(), s.end());
if (hash[s] == 0) {
hash[s]++;
} ... | [
"variable_declaration.type.widen.change"
] | 747,883 | 747,884 | u720447689 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int comb(int);
int main(void) {
int n;
cin >> n;
vector<string> sv(n);
for (int i = 0; i < n; i++)
cin >> sv.at(i);
unordered_map<string, int> hash;
for (auto s : sv) {
sort(s.begin(), s.end());
if (hash[s] == 0) {
hash[s]++;
} else {
... | #include <bits/stdc++.h>
using namespace std;
long int comb(long int);
int main(void) {
int n;
cin >> n;
vector<string> sv(n);
for (int i = 0; i < n; i++)
cin >> sv.at(i);
unordered_map<string, int> hash;
for (auto s : sv) {
sort(s.begin(), s.end());
if (hash[s] == 0) {
hash[s]++;
} ... | [
"variable_declaration.type.widen.change"
] | 747,885 | 747,884 | u720447689 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, ans = 0;
cin >> n;
string s[n];
priority_queue<char> que;
priority_queue<string> que2;
for (i = 0; i < n; i++) {
cin >> s[i];
for (j = 0; j < 10; j++) {
que.push(s[i][j]);
}
for (j = 0; j < 10; j++) {
s[i][j... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j, ans = 0;
cin >> n;
string s[n];
priority_queue<char> que;
priority_queue<string> que2;
for (i = 0; i < n; i++) {
cin >> s[i];
for (j = 0; j < 10; j++) {
que.push(s[i][j]);
}
for (j = 0; j < 10; j++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,892 | 747,893 | u122874387 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
vector<string> sorted;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
vector<char> temp;
for (int j = 0; j < 10; j++) {
char c;
cin >> c;
temp.push_back(c);
}
sort(temp.begin(), temp.end());
st... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
vector<string> sorted;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
vector<char> temp;
for (int j = 0; j < 10; j++) {
char c;
cin >> c;
temp.push_back(c);
}
sort(temp.begin(), temp.end());
st... | [
"variable_declaration.type.change"
] | 747,894 | 747,895 | u466568754 | cpp |
p02947 | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | [
"assignment.change"
] | 747,896 | 747,897 | u784072785 | cpp |
p02947 | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | [] | 747,898 | 747,899 | u784072785 | cpp |
p02947 | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | [] | 747,901 | 747,899 | u784072785 | cpp |
p02947 | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
... | [
"literal.number.type.widen.change"
] | 747,901 | 747,903 | u784072785 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, cnt = 0;
string tmp;
vector<char> s;
map<string, int> m;
cin >> n;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long cnt = 0;
string tmp;
vector<char> s;
map<string, int> m;
cin >> n;
for (i... | [
"variable_declaration.type.widen.change"
] | 747,909 | 747,910 | u026620445 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#define ll long long
using namespace std;
int main() {
ll N;
cin >> N;
string str[N];
ll i;
for (i = 0; i < N; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str, str + N);
ll tmp = 1;
ll ans = 0;
for (i = 1; i < N;... | #include <algorithm>
#include <iostream>
#include <string>
#define ll long long
using namespace std;
int main() {
ll N;
cin >> N;
string str[N];
ll i;
for (i = 0; i < N; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str, str + N);
ll tmp = 1;
ll ans = 0;
for (i = 1; i < N;... | [] | 747,915 | 747,916 | u770161743 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
unsigned nChoosek(unsigned n, unsigned k) {
if (k > n)
return 0;
if (k * 2 > n)
k ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
unsigned nChoosek(unsigned n, unsigned k) {
if (k > n)
return 0;
if (k * 2 > n)
k ... | [
"variable_declaration.type.change"
] | 747,917 | 747,918 | u391340825 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
string tmp;
map<string, int> mp;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
cnt += mp[tmp];
mp[tmp]++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
string tmp;
map<string, int> mp;
long long cnt = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
cnt += mp[tmp];
mp[tmp]++;
}
cout << cnt << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,919 | 747,920 | u760628894 | cpp |
p02947 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
vector<char> c(10);
for (int j = 0; j < 10; j++) {
cin >> c[j];
}
... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
vector<char> c(10);
for (int j = 0; j < 10; j++) {
cin >> c[j];
}
... | [
"variable_declaration.type.widen.change"
] | 747,921 | 747,922 | u987591601 | cpp |
p02947 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
vector<char> c(10);
for (int j = 0; j < 10; j++) {
cin >> c[j];
}
so... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
vector<char> c(10);
for (int j = 0; j < 10; j++) {
cin >> c[j];
}
... | [
"variable_declaration.type.widen.change"
] | 747,923 | 747,922 | u987591601 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int binominalCoeff(int n, int k) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
ll binominalCoeff(ll n, ll k) {
l... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 747,924 | 747,925 | u239023686 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
int main() {
#ifdef MYLOCAL
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int N;
cin >> N;
vector<string> s(N);
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
int main() {
#ifdef MYLOCAL
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int N;
cin >> N;
vector<string> s(N);
for (int... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 747,926 | 747,927 | u335667012 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, x) for (int i = 0; i < x.size(); i++)
#define RREPALL(i, x) for (int i = x.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, x) for (int i = 0; i < x.size(); i++)
#define RREPALL(i, x) for (int i = x.size() - 1; i... | [] | 747,933 | 747,934 | u007637377 | cpp |
p02947 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define input_code \
ifstream in("input.txt"); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define input_code \
ifstream in("input.txt"); ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,937 | 747,938 | u895382169 | cpp |
p02947 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <random... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <random... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 747,939 | 747,940 | u917972976 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int64_t ans = 0;
for (auto p : mp) {
int64_t s = p.second;
ans = s * (s - 1) / 2;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int64_t ans = 0;
for (auto p : mp) {
int64_t s = p.second;
ans += s * (s - 1) / 2;
}
cout... | [
"assignment.value.change"
] | 747,941 | 747,942 | u009870106 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int N;
char t[12];
long long ans;
string ts;
map<string, int> s;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", t);
ts = string(t);
sort(ts.begin(), ts.end());
s[ts]++;
}
for (au... | #include <algorithm>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int N;
char t[12];
long long ans;
string ts;
map<string, long long> s;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%s", t);
ts = string(t);
sort(ts.begin(), ts.end());
s[ts]++;
}
f... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,943 | 747,944 | u923285281 | cpp |
p02947 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0;... | [
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 747,950 | 747,951 | u190907730 | cpp |
p02947 | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | [] | 747,956 | 747,957 | u010004797 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> arr;
for (int i = 0; i < n; i++) {
string a;
cin >> a;
sort(a.begin(), a.end());
arr.push_back(a);
}
sort(arr.begin(), arr.end());
int cnt = 0;
int value = 0;
for (int i = 0; i < arr.size(); i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> arr;
for (int i = 0; i < n; i++) {
string a;
cin >> a;
sort(a.begin(), a.end());
arr.push_back(a);
}
sort(arr.begin(), arr.end());
long long cnt = 0;
long long value = 0;
for (int i = 0; i < arr.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 747,958 | 747,959 | u201678045 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> arr;
for (int i = 0; i < n; i++) {
string a;
cin >> a;
sort(a.begin(), a.end());
arr.push_back(a);
}
sort(arr.begin(), arr.end());
int cnt = 0;
int value = 0;
for (int i = 0; i < arr.size(); i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> arr;
for (int i = 0; i < n; i++) {
string a;
cin >> a;
sort(a.begin(), a.end());
arr.push_back(a);
}
sort(arr.begin(), arr.end());
long long cnt = 0;
long long value = 0;
for (int i = 0; i < arr.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,960 | 747,959 | u201678045 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <... | [
"variable_declaration.type.change"
] | 747,967 | 747,968 | u170650966 | 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());
}
long long ans = 0;
sort(s.begin(), s.end());
int count = 1;
vector<int> n;
for (int i = 0; i < N - 1; i++) {
if... | #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());
}
long long ans = 0;
sort(s.begin(), s.end());
long long count = 1;
vector<int> n;
for (int i = 0; i < N - 1; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,971 | 747,972 | u654055742 | 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());
}
int ans = 0;
sort(s.begin(), s.end());
int count = 1;
vector<int> n;
for (int i = 0; i < N - 1; i++) {
if (s.at... | #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());
}
long long ans = 0;
sort(s.begin(), s.end());
long long count = 1;
vector<int> n;
for (int i = 0; i < N - 1; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,973 | 747,972 | u654055742 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespac... | [] | 747,974 | 747,975 | u199371251 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int binomialCoeff(int n, int k) {
int C[k + 1];
memset(C, 0, sizeof(C));
C[0] = 1; // nC0 is 1
for (int i = 1; i <= n; i++) {
// Compute next row of pascal triangle using
// the previous row
for (int j = min(i, k); j > 0; j--)
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll int binomialCoeff(ll int n, ll int k) {
ll int C[k + 1];
memset(C, 0, sizeof(C));
C[0] = 1; // nC0 is 1
for (ll int i = 1; i <= n; i++) {
for (ll int j = min(i, k); j > 0; j--)
C[j] = C[j] + C[j - 1];
}
return C[k];
}
int mai... | [
"function.parameters.parameter.add"
] | 747,976 | 747,977 | u603457443 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
uintmax_t combination(u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
uintmax_t combination(u... | [
"variable_declaration.type.change"
] | 747,980 | 747,981 | u110681742 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define long long int
signed main() {
int n;
cin >> n;
string a[n];
map<string, int> ma;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sort(a[i].begin(), a[i].end());
}
int tot = 0;
for (int i = 0; i < n; ++i) {
tot +=... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
string a[n];
map<string, int> ma;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sort(a[i].begin(), a[i].end());
}
int tot = 0;
for (int i = 0; i < n; ++i) {
tot +=... | [] | 747,996 | 747,997 | u146240825 | cpp |
p02947 | #include <bits/stdc++.h>
#define SIZE 100005
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
auto itr = mp.find(str);
if (itr == mp.end())
mp.insert(m... | #include <bits/stdc++.h>
#define SIZE 100005
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
auto itr = mp.find(str);
if (itr == mp.end())
mp.insert(ma... | [] | 747,998 | 747,999 | u175426149 | cpp |
p02947 | #include <bits/stdc++.h>
#define SIZE 100005
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
ll sum = 0;
for (auto &e : mp) {
sum += e.s... | #include <bits/stdc++.h>
#define SIZE 100005
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
map<string, uint64_t> mp;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
ll sum = 0;
for (auto &e : mp) {
sum +... | [
"variable_declaration.type.primitive.change"
] | 748,000 | 748,001 | u175426149 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int ans = 0;
int i = 0;
for (int j = 1; j < n; ++j) {
if (s[i] == s[j]) {
ans += (j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
long long int ans = 0;
int i = 0;
for (int j = 1; j < n; ++j) {
if (s[i] == s[j]) {
... | [
"variable_declaration.type.widen.change"
] | 748,002 | 748,003 | u567252408 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
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());
vector<int> cut;
for (int i = 0; i < (n - 1); ++i) {
if (a[i] != a[i + 1]) {
cut.push... | #include <bits/stdc++.h>
using namespace std;
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());
vector<int> cut;
for (int i = 0; i < (n - 1); ++i) {
if (a[i] != a[i + 1]) {
cut.push... | [
"variable_declaration.type.widen.change"
] | 748,004 | 748,005 | u567252408 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
map<string, int> m;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s] += 1;
}
for (auto it = m.begin(); it != m.end(); it++) {
ans += it->... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
map<string, long long> m;
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s] += 1;
}
for (auto it = m.begin(); it != m.end(); it++) {
ans +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,006 | 748,007 | u527293637 | cpp |
p02947 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | [
"literal.number.type.widen.change"
] | 748,008 | 748,009 | u917944707 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FORE(i, a, b) for (int i = (int)(a); i <= (int)(b... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FORE(i, a, b) for (int i = (int)(a); i <= (int)(b... | [
"variable_declaration.type.change"
] | 748,013 | 748,014 | u476383383 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n;
long long ans, num;
string s[100010];
char c[20];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
cin >> s[i];
for (int j = 0; j < 10; ++j)
c[j] = s[i][j];
sort(c, c + 10);
for (int j = 0; j < 10; ++j)
s[i][j] = c[j];
}
... | #include <bits/stdc++.h>
using namespace std;
int n;
long long ans, num;
string s[100010];
char c[20];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
cin >> s[i];
for (int j = 0; j < 10; ++j)
c[j] = s[i][j];
sort(c, c + 10);
for (int j = 0; j < 10; ++j)
s[i][j] = c[j];
}
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 748,015 | 748,016 | u573810484 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
string temp;
cin >> temp;
int c[10];
for (int k = 0; k < 10; k++) {
c[k] = (int)temp.at(k);
}
sort(c, c + 10);
string s = "";
for (int k = 0; k < 10; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
string temp;
cin >> temp;
int c[10];
for (int k = 0; k < 10; k++) {
c[k] = (int)temp.at(k);
}
sort(c, c + 10);
string s = "";
for (int k = 0; k < 10; ... | [
"variable_declaration.type.primitive.change"
] | 748,019 | 748,020 | u090223455 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [] | 748,031 | 748,032 | u043443359 | cpp |
p02947 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,033 | 748,034 | u016572066 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
int main() {
int n;
cin >> n;
string s;
map<string, int> d;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
++d[... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
int main() {
int n;
cin >> n;
string s;
map<string, int> d;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
++d[... | [
"type_conversion.add"
] | 748,035 | 748,036 | u887207211 | cpp |
p02947 | #pragma GCC optimize "03"
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | #pragma GCC optimize "03"
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | [
"identifier.change"
] | 748,044 | 748,045 | u995439034 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
#define EPS 10e-8
using namespace std;
typedef pair<... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
#define EPS 10e-8
using namespace std;
typedef pair<... | [
"control_flow.loop.for.initializer.change"
] | 748,046 | 748,047 | u777137418 | cpp |
p02947 | #include <bits/stdc++.h>
#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()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n;
ll cnt = 0;
cin >> n;
string s;
map<string, int... | #include <bits/stdc++.h>
#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()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n;
ll cnt = 0;
cin >> n;
string s;
map<string, ll>... | [] | 748,048 | 748,049 | u538125576 | cpp |
p02947 | #include <bits/stdc++.h>
#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()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n, cnt = 0;
cin >> n;
string s;
map<string, int> mp;... | #include <bits/stdc++.h>
#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()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int n;
ll cnt = 0;
cin >> n;
string s;
map<string, ll>... | [] | 748,050 | 748,049 | u538125576 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define roop(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n, m, count = 0;
map<string, int> mp;
cin >> n;
m = n;
while (m--) {
string x;
cin >> x;
sort(x.begin(), x.end());
mp[x]++;
}... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#define roop(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n, m, count = 0;
map<string, long> mp;
cin >> n;
m = n;
while (m--) {
string x;
cin >> x;
sort(x.begin(), x.end());
mp[x]++;
... | [
"variable_declaration.type.primitive.change"
] | 748,062 | 748,063 | u749089333 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll sum = 0;
for (auto it : mp) {
sum += (it.second) * (it.second - 1) / 2;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, long> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll sum = 0;
for (auto it : mp) {
sum += (it.second) * (it.second - 1) / 2;
... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change"
] | 748,064 | 748,065 | u374190629 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.