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 rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
ll cnt, sum;
int dp[100000];
int ana_check(string S1, string S2) {
int used[2][10] = {false};
for (int k = 0; k < 10; k++) {
for (int l = 0; l < 10; l++) {
if (S1[k] == S2[l] && used[0][... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
ll cnt, sum;
int dp[100000];
int ana_check(string S1, string S2) {
int used[2][10] = {false};
for (int k = 0; k < 10; k++) {
for (int l = 0; l < 10; l++) {
if (S1[k] == S2[l] && used[0][... | [] | 749,295 | 749,296 | u515328251 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, 0, n) {
st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
map<string, ll> mp;
rep(i, 0, n) {
str... | [] | 749,301 | 749,302 | u214304095 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, 0, n) {
st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
map<string, ll> mp;
rep(i, 0, n) {
str... | [
"literal.number.type.widen.change"
] | 749,301 | 749,303 | u214304095 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, 0, n) {
st... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
map<string, ll> mp;
rep(i, 0, n) {
str... | [
"literal.number.type.widen.change"
] | 749,301 | 749,304 | u214304095 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_r(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define all(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_r(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define all(x) (x).begin(), (x).end()
#define ... | [
"variable_declaration.type.change"
] | 749,305 | 749,306 | u619535866 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
long long ans = 0;
unordered_map<string, int> uo_mp;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (uo_mp.count(s) == 0)
uo_mp[s... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
long long ans = 0;
unordered_map<string, long long> uo_mp;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (uo_mp.count(s) == 0)
u... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,307 | 749,308 | u596101798 | cpp |
p02947 | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | [
"type_conversion.add"
] | 749,309 | 749,310 | u487476769 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
/*vector<int> alphabetContent(string input){
vector<int> arr(26,0);
for(itn i = 0;i < (int)input.size();i++){
arr.at((int)(input.at(i))-96) += 1;
}
return arr;
}*/
int main()... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
/*vector<int> alphabetContent(string input){
vector<int> arr(26,0);
for(itn i = 0;i < (int)input.size();i++){
arr.at((int)(input.at(i))-96) += 1;
}
return arr;
}*/
int main()... | [
"variable_declaration.type.widen.change"
] | 749,311 | 749,312 | u136762671 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> v(n);
for (auto &x : v)
cin >> x;
for (auto &x : v)
sort(x.begin(), x.end());
map<string, int> m;
for (auto &x : v) {
if (m.find(x) == m.end())
m[x] = 1;
else
m[x]++;
}
long r... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> v(n);
for (auto &x : v)
cin >> x;
for (auto &x : v)
sort(x.begin(), x.end());
map<string, long> m;
for (auto &x : v) {
if (m.find(x) == m.end())
m[x] = 1;
else
m[x]++;
}
long ... | [
"variable_declaration.type.primitive.change"
] | 749,313 | 749,314 | u056944756 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<ll> com(100001);
com.at(0) = 0;
com.at(1) = 0;
for (int i = 2; i <= 100000; i++) {
com.at(i) = i * (i - 1) / 2;
}
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
so... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<ll> com(100001);
com.at(0) = 0;
com.at(1) = 0;
for (ll i = 2; i <= 100000; i++) {
com.at(i) = i * (i - 1) / 2;
}
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s.at(i);
sor... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 749,315 | 749,316 | u652009496 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main() {
unsigned long counter = 0;
int N;
cin >> N;
map<string, int> DB;
for (int i = 0; i < N; i++) {
std::vector<char> buf(10);
string hoge = "";
for (int k = 0; k < 10; k++)
cin >> buf.at(k);
sort(buf.begin(), buf.... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main() {
unsigned long counter = 0;
int N;
cin >> N;
map<string, long> DB;
for (int i = 0; i < N; i++) {
std::vector<char> buf(10);
string hoge = "";
for (int k = 0; k < 10; k++)
cin >> buf.at(k);
sort(buf.begin(), buf... | [
"variable_declaration.type.primitive.change"
] | 749,321 | 749,322 | u844703694 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
map<string, ll> cnt;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
str... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
map<string, ll> cnt;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
str... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 749,323 | 749,324 | u508700891 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
using namespace std;
int main() {
ll n, ans = 0;
string s;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> s;
sort(ALL(s));
ans += mp[s]++;
cout << ans;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
using namespace std;
int main() {
ll n, ans = 0;
string s;
cin >> n;
unordered_map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> s;
sort(ALL(s));
ans += mp[s]++;
}
cout << ans <... | [] | 749,329 | 749,330 | u447604786 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
long long count = 0;
for (int i = 0; i < n - 1; i++) {
int k =... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
long long count = 0;
for (int i = 0; i < n - 1; i++) {
long lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,331 | 749,332 | u387480576 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
long long count = 0;
for (int i = 0; i < n - 1; i++) {
int k =... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string str[n];
for (int i = 0; i < n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
long long count = 0;
for (int i = 0; i < n - 1; i++) {
long lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 749,333 | 749,332 | u387480576 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v;
for (int i = 0; i < n; i++) {
string tmp_;
cin >> tmp_;
sort(tmp_.begin(), tmp_.end());
v.push_back(tmp_);
}
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v;
for (int i = 0; i < n; i++) {
string tmp_;
cin >> tmp_;
sort(tmp_.begin(), tmp_.end());
v.push_back(tmp_);
}
... | [
"variable_declaration.type.primitive.change"
] | 749,334 | 749,335 | u855985627 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int f(int n) {
int s = 0;
for (int i = 0; i < n; i++)
s = s + i;
return s;
}
int main() {
int N;
scanf("%d", &N);
map<string, int> kk;
for (int i = 0; i < N; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
kk[t]++;
}
long long ans ... | #include <bits/stdc++.h>
using namespace std;
long long f(int n) {
long long s = 0;
for (int i = 0; i < n; i++)
s = s + i;
return s;
}
int main() {
int N;
scanf("%d", &N);
map<string, int> kk;
for (int i = 0; i < N; i++) {
string t;
cin >> t;
sort(t.begin(), t.end());
kk[t]++;
}
lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,338 | 749,339 | u212789463 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#define int long long
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >=... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#define int long long
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >=... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,340 | 749,341 | u553889304 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int calc(int x) {
long long A = 0;
while (x > 0) {
A += x;
x--;
}
return A;
}
int main() {
int N;
cin >> N;
string S[N];
long long ans = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S, S + N);
... | #include <bits/stdc++.h>
using namespace std;
long long calc(long long x) {
long long A = 0;
while (x > 0) {
A += x;
x--;
}
return A;
}
int main() {
int N;
cin >> N;
string S[N];
long long ans = 0;
for (int i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,344 | 749,345 | u032068406 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
in... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
#define repd(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
in... | [] | 749,346 | 749,347 | u530223066 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
multiset<string> s;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
s.insert(str);
}
long long ans = 0;
while (!s.empty()) {
int num = s.erase(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
multiset<string> s;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
s.insert(str);
}
long long ans = 0;
while (!s.empty()) {
long long num = s.... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,356 | 749,357 | u190679129 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
const int maxn = 100010;
map<string, int> mp;
char name[16];
int pp[maxn];
int main() {
int n, p = 1;
scanf("%d", &n);
long long cnt = 0;
fill(pp, pp + maxn, 1);
while (n--) {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
const int maxn = 100100;
map<string, int> mp;
char name[16];
int pp[maxn];
int main() {
int n, p = 1;
scanf("%d", &n);
long long cnt = 0;
fill(pp, pp + maxn, 1);
while (n--) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 749,360 | 749,361 | u682748256 | cpp |
p02947 | /*@author hussein zayed ;
___ ___
|\ \|\ \
\ \ \_\ \
\ \ ___ \USSEIN
\ \ \\ \ \
\ \__\\ \_\
\|__| \|__|
****************************************
*/
#include <bits/stdc++.h>
using namespace std;
#define fr for (int i = 0; i < n; ++i)
#define fr... | /*@author hussein zayed ;
___ ___
|\ \|\ \
\ \ \_\ \
\ \ ___ \USSEIN
\ \ \\ \ \
\ \__\\ \_\
\|__| \|__|
****************************************
*/
#include <bits/stdc++.h>
using namespace std;
#define fr for (int i = 0; i < n; ++i)
#define fr... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 749,364 | 749,365 | u287821360 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
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());
ll ans = 0;
int count = 1;
for (int i = 0; i < n - 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
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());
ll ans = 0;
ll count = 1;
for (int i = 0; i < n - 1; i++) {
i... | [
"variable_declaration.type.change"
] | 749,366 | 749,367 | u355520191 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[100001][10];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) + n... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[100001][10];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) + n... | [
"variable_declaration.type.widen.change"
] | 749,368 | 749,369 | u570124150 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[100000][1000];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) +... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[100001][10];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) + n... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 749,370 | 749,369 | u570124150 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[10000][10000];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) +... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[100001][10];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) + n... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 749,371 | 749,369 | u570124150 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[100][100];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) + nCr... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long dp[100001][10];
long nCr(int n, int r) {
if (n == r)
return dp[n][r] = 1;
if (r == 0)
return dp[n][r] = 1;
if (r == 1)
return dp[n][r] = n;
if (dp[n][r])
return dp[n][r];
return dp[n][r] = nCr(n - 1, r) + n... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 749,372 | 749,369 | u570124150 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change",
"expression.operator.change"
] | 749,375 | 749,376 | u540491484 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
while (n--) {
char a[11];
string s1;
cin >> a;
sort(a, a + 10);
for (int i = 0; i < 10; i++) {
s1 += a[i];
}
m[s1]++;
}
int ans = 0;
map<string, int>::iterator it;
for (it = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
map<string, int> m;
while (n--) {
char a[11];
string s1;
cin >> a;
sort(a, a + 10);
for (int i = 0; i < 10; i++) {
s1 += a[i];
}
m[s1]++;
}
long long int ans = 0;
map<string, int>::itera... | [
"variable_declaration.type.widen.change"
] | 749,379 | 749,380 | u192744126 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k = 0, p = 0, i, j;
cin >> a;
string s;
vector<string> v;
for (i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
v.push_back(s);
}
sort(v.begin(), v.end());
for (i = 1; i < v.size(); i++) {
if (v[i] == v[i - 1]) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, k = 0, p = 0, i, j;
cin >> a;
string s;
vector<string> v;
for (i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
v.push_back(s);
}
sort(v.begin(), v.end());
for (i = 1; i < v.size(); i++) {
if (v[i] == ... | [
"variable_declaration.type.widen.change"
] | 749,381 | 749,382 | u035712458 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 749,383 | 749,384 | u750836455 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 749,385 | 749,384 | u750836455 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string a;
vector<string> s;
for (int i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
s.push_back(a);
}
sort(s.begin(), s.end());
int b = 0, c = 0;
for (int i = 1; i < n; i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string a;
vector<string> s;
for (int i = 0; i < n; i++) {
cin >> a;
sort(a.begin(), a.end());
s.push_back(a);
}
sort(s.begin(), s.end());
int long long b = 0, c = 0;
for (int i = 1... | [
"variable_declaration.value.change"
] | 749,386 | 749,387 | u568787962 | cpp |
p02947 | #pragma GCC optimize("Ofast", 3, "inline")
#include <bits/stdc++.h>
using namespace std;
int n;
long long ans, cnt;
char c[10];
string s;
map<string, int> mp;
string str[100010];
void input() {
s = "";
for (int i = 0; i < 10; i++)
cin >> c[i];
sort(c, c + 10);
for (int i = 0; i < n; i++)
s += c[i];
}
vo... | #pragma GCC optimize("Ofast", 3, "inline")
#include <bits/stdc++.h>
using namespace std;
int n;
long long ans, cnt;
char c[10];
string s;
map<string, long long> mp;
string str[100010];
void input() {
s = "";
for (int i = 0; i < 10; i++)
cin >> c[i];
sort(c, c + 10);
for (int i = 0; i < 10; i++)
s += c[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 749,388 | 749,389 | u083499110 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,390 | 749,391 | u423848601 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
long long nCr(int n, int r) {
if (r > n)
return 0;
if (r * 2 > n)
r = n - r;
if (r == 0)
return 1;
long long result = n;
for (int i = 2; i <= r; ++i) {
result *= (n - i + 1);
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
long long nCr(int n, int r) {
if (r > n)
return 0;
if (r * 2 > n)
r = n - r;
if (r == 0)
return 1;
long long result = n;
for (int i = 2; i <= r; ++i) {
result *= (n - i + 1);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,392 | 749,393 | u142234618 | 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; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVSORT(v) sort(... | #include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVSORT(v) sort(... | [
"variable_declaration.type.change"
] | 749,396 | 749,397 | u118846704 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long tmp, ans = 0;
cin >> n;
vector<string> stlist;
for (int i = 0; i < n; i++) {
char str[10], a;
cin >> str;
for (int i = 0; i < 10; i++) {
for (int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long tmp = 1, ans = 0;
cin >> n;
vector<string> stlist;
for (int i = 0; i < n; i++) {
char str[10], a;
cin >> str;
for (int i = 0; i < 10; i++) {
for (... | [
"variable_declaration.value.change"
] | 749,398 | 749,399 | u670773128 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, tmp = 1;
long long ans = 0;
cin >> n;
vector<string> stlist;
for (int i = 0; i < n; i++) {
char str[10], a;
cin >> str;
for (int i = 0; i < 10; i++) {
for (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long tmp = 1, ans = 0;
cin >> n;
vector<string> stlist;
for (int i = 0; i < n; i++) {
char str[10], a;
cin >> str;
for (int i = 0; i < 10; i++) {
for (... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 749,400 | 749,399 | u670773128 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int64_t score = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
string pro = "";
int set = 1;
for (int i = 0; i < N; i++) {
if (pro ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
int64_t score = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
string pro = "";
int64_t set = 1;
for (int i = 0; i < N; i++) {
if (... | [
"variable_declaration.type.primitive.change"
] | 749,405 | 749,406 | u731032776 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
string S[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
for ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
string S[100010];
int main(void) {
int N;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,413 | 749,414 | u149583407 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> count;
int n;
cin >> n;
string s;
for (int i = 0; i < n; ++i) {
cin >> s;
sort(s.begin(), s.end());
count[s] += 1;
}
int res = 0;
for (auto &kv : count) {
res += (kv.second * (kv.second - 1) / 2);
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> count;
int n;
cin >> n;
string s;
for (int i = 0; i < n; ++i) {
cin >> s;
sort(s.begin(), s.end());
count[s] += 1;
}
long long res = 0;
for (auto &kv : count) {
res += (1ll * kv.second * (kv.second - 1) / 2);
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 749,416 | 749,417 | u778594851 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long a[100001];
int nt[28] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103};
int n;
cin >> n;
if (n < 2) {
cout << 0;
return 0;
}
for (int i(1... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long a[100001];
int nt[28] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103};
int n;
cin >> n;
if (n < 2) {
cout << 0;
return 0;
}
for (int i(1... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,418 | 749,419 | u432816957 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long a[100001];
int nt[28] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103};
int n;
cin >> n;
if (n <= 2) {
cout << 0;
return 0;
}
for (int i(... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long a[100001];
int nt[28] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103};
int n;
cin >> n;
if (n < 2) {
cout << 0;
return 0;
}
for (int i(1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,420 | 749,419 | u432816957 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 1.0e5 + 100;
string S[MAX_N];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> S[i];
for (int i = 0; i < N; i++) {
sort(begin(S[i]), end(S[i]));
}
sort(S, S + N);
ll ans = 0;
int cnt = 0;
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 1.0e5 + 100;
string S[MAX_N];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> S[i];
for (int i = 0; i < N; i++) {
sort(begin(S[i]), end(S[i]));
}
sort(S, S + N);
ll ans = 0;
ll cnt = 0;
fo... | [
"variable_declaration.type.change"
] | 749,423 | 749,424 | u488352661 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
const int maxn = 1e5 + 10;
string s[maxn];
int n;
long long ans = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
const int maxn = 1e5 + 10;
string s[maxn];
long long n;
long long ans = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,427 | 749,428 | u135952580 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
const int maxn = 1e5 + 10;
string s[maxn];
int n;
int ans = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
const int maxn = 1e5 + 10;
string s[maxn];
long long n;
long long ans = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,429 | 749,428 | u135952580 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return t... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return t... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,432 | 749,433 | u475546258 | 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);
}
for (int i = 0; i < N; i++) {
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
vector<int> t(N, 1);
int u = 0;
for (int i = 0; ... | #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);
}
for (int i = 0; i < N; i++) {
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
vector<long long> t(N, 1);
int u = 0;
for (int i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,434 | 749,435 | u503221936 | cpp |
p02947 | #include <math.h>
#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;
string tmp;
for (int i = 0; i < N; ++i) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
M[tmp]... | #include <math.h>
#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, long long> M;
string tmp;
for (int i = 0; i < N; ++i) {
cin >> tmp;
sort(tmp.begin(), tmp.end());
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,436 | 749,437 | u970109776 | cpp |
p02947 | /***
chauhan176's code
DO WHATEVER IT TAKES!!!
Nothing happens , nothing happens and then everything happens.
But the thing is nothing happens in air:)-
***/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define fi first... | /***
chauhan176's code
DO WHATEVER IT TAKES!!!
Nothing happens , nothing happens and then everything happens.
But the thing is nothing happens in air:)-
***/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define fi first... | [
"variable_declaration.type.change"
] | 749,438 | 749,439 | u673032653 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> mp;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (mp.count(s)) {
mp[s]++;
} else {
mp[s] = 1;
}
}
int64_t num_a = 0;
int n;
for (auto p : mp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> mp;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (mp.count(s)) {
mp[s]++;
} else {
mp[s] = 1;
}
}
int64_t num_a = 0;
int64_t n;
for (auto p ... | [
"variable_declaration.type.primitive.change"
] | 749,440 | 749,441 | u916529101 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
string t, s[100005];
int sum, ans = 0;
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t;
sort(t.begin(), t.end());
s[i] = t;
}
sort(s + 1, s + n + 1);
for (int i = 1; i < n; i++)... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
string t, s[100005];
long long sum, ans = 0;
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t;
sort(t.begin(), t.end());
s[i] = t;
}
sort(s + 1, s + n + 1);
for (int i = 1; i < n... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,442 | 749,443 | u936315673 | cpp |
p02947 | #include <bits/stdc++.h>
#define For(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, ans = 0, num = 1;
cin >> N;
string S[N], T;
For(i, N) {
cin >> T;
sort(T.begin(), T.end());
S[i] = T;
}
sort(S, S + N);
For(i, N) {
int j = i + 1;
while (S[i] == S[j]) {
... | #include <bits/stdc++.h>
#define For(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
long long ans = 0, num = 1;
cin >> N;
string S[N], T;
For(i, N) {
cin >> T;
sort(T.begin(), T.end());
S[i] = T;
}
sort(S, S + N);
For(i, N) {
int j = i + 1;
while (S[i] ... | [
"variable_declaration.type.widen.change"
] | 749,444 | 749,445 | u912533549 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int Nmax = 1e5;
ll X[Nmax];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
for (int k = 0; k < 10; k++) {
X[i] += (s[k] - 'a') << (6 * k);
}
}
map<ll, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int Nmax = 1e5;
ll X[Nmax];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
for (int k = 0; k < 10; k++) {
X[i] += ((ll)(s[k] - 'a')) << (6 * k);
}
}
ma... | [] | 749,446 | 749,447 | u534998883 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
long long ans = 0;
cin >> n;
vector<string> strings(n);
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
strings[i] = s;
}
sort(strings.begin(), strings.end());
int same = 1;
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
long long ans = 0;
cin >> n;
vector<string> strings(n);
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
strings[i] = s;
}
sort(strings.begin(), strings.end());
long long same = 1;
for (int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,448 | 749,449 | u297477387 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> sv;
ll cnt = 0;
for (size_t i = 0; i < n; ++i) {
string s;
cin >> s;
sort(begin(s), end(s));
if (sv.count... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
map<string, ll> sv;
ll cnt = 0;
for (size_t i = 0; i < n; ++i) {
string s;
cin >> s;
sort(begin(s), end(s));
if (sv.count(... | [] | 749,450 | 749,451 | u650868520 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
long 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());
// cout <<... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
long 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());
// cout <<... | [
"variable_declaration.type.widen.change"
] | 749,452 | 749,453 | u465669072 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define gt(n) scanf("%d", &n)
#define gtll(n) scanf("%ld", &n)
#define out(n) printf("%d", n)
#define outll(n) printf("%ld", n)
#define loop(n) for (int i = 0; i < n; i++)
#define MAXX 1001
#define mem(x, y) memset(x, y, sizeof(x))
#define loop1(n) fo... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define gt(n) scanf("%d", &n)
#define gtll(n) scanf("%ld", &n)
#define out(n) printf("%d", n)
#define outll(n) printf("%ld", n)
#define loop(n) for (int i = 0; i < n; i++)
#define MAXX 1001
#define mem(x, y) memset(x, y, sizeof(x))
#define loop1(n) fo... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,454 | 749,455 | u757105418 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ... | [
"variable_declaration.type.change"
] | 749,456 | 749,457 | u450733728 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, j;
cin >> n;
string str[n];
for (i = 0; i < n; i++) {
cin >> str[i];
}
for (i = 0; i < n; i++) {
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
int ans = 0;
int plus = 1;
fo... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, j;
cin >> n;
string str[n];
for (i = 0; i < n; i++) {
cin >> str[i];
}
for (i = 0; i < n; i++) {
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
long long int ans = 0;
int plus... | [
"variable_declaration.type.widen.change"
] | 749,460 | 749,461 | u183768769 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, j;
cin >> n;
string str[n];
for (i = 0; i < n; i++) {
cin >> str[i];
}
for (i = 0; i < n; i++) {
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
int ans = 0;
int plus = 1;
fo... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, j;
cin >> n;
string str[n];
for (i = 0; i < n; i++) {
cin >> str[i];
}
for (i = 0; i < n; i++) {
sort(str[i].begin(), str[i].end());
}
sort(str, str + n);
long long int ans = 0;
int plus... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 749,462 | 749,461 | u183768769 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100010];
map<string, int> mp;
map<string, int>::iterator it;
int main() {
string x, y;
int n, i, c = 0, d, j, k;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
for (it = mp.begin(); it !=... | #include <bits/stdc++.h>
using namespace std;
string s[100010];
map<string, long long int> mp;
map<string, long long int>::iterator it;
int main() {
string x, y;
long long int n, i, c = 0, d, j, k;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
... | [
"variable_declaration.type.widen.change"
] | 749,465 | 749,466 | u984621967 | cpp |
p02947 | // https://atcoder.jp/contests/abcXXX/tasks/abcXXX_x
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
struct C {
vector<string> v_{};
explicit C(vector<string> v) {
v_.reserve(v.size());
for (auto &a : v) {
std::sort(a.begin(), a... | // https://atcoder.jp/contests/abcXXX/tasks/abcXXX_x
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
struct C {
vector<string> v_{};
explicit C(vector<string> v) {
v_.reserve(v.size());
for (auto &a : v) {
std::sort(a.begin(), a... | [
"assignment.add"
] | 749,467 | 749,468 | u410714465 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
unsigned long n, i, j, c = 0;
vector<string> v;
map<string, int> m;
cin >> n;
v.resize(n);
for (i = 0; i < n; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
if (m.count(v[i]) == 0)
m[v[i]] = 1;
else
m[v[i]]++;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
unsigned long n, i, j, c = 0;
vector<string> v;
map<string, unsigned long> m;
cin >> n;
v.resize(n);
for (i = 0; i < n; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
if (m.count(v[i]) == 0)
m[v[i]] = 1;
else
m[v... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,469 | 749,470 | u688509741 | cpp |
p02947 | #include <bits/stdc++.h>
#define maxn 100005
#define ll long long
using namespace std;
const int N = 1e5 + 7;
string str[N];
map<string, int> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
mp[str[i]]++;
}
ll ans = 0;
for (auto ... | #include <bits/stdc++.h>
#define maxn 100005
#define ll long long
using namespace std;
const int N = 1e5 + 7;
string str[N];
map<string, ll> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
mp[str[i]]++;
}
ll ans = 0;
for (auto i... | [] | 749,471 | 749,472 | u216795558 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> p;
string s;
int n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
if (p.count(s))
sum += p[s];
p[s]++;
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
map<string, long long> p;
string s;
long long n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
if (p.count(s))
sum += p[s];
p[s]++;
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,473 | 749,474 | u762152622 | cpp |
p02947 | /**
������������ Author : Avi J Patel ������������
������������ University : DA-IICT ������������
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define N 100000
#define ff first
#define ss sec... | /**
������������ Author : Avi J Patel ������������
������������ University : DA-IICT ������������
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define N 100000
#define ff first
#define ss sec... | [] | 749,475 | 749,476 | u589330060 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
//#define int long long int
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000000
#define MOD 1000000007
#define ll long long int
//#define int long long int
using namespace std;
... | [
"variable_declaration.type.change"
] | 749,477 | 749,478 | u617525345 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
long solve(int n, std::vector<std::string> strings) {
std::unordered_map<std::string, int> s_to_counts;
for (auto &s : strings) {
std::sort(s.begin(), s.end());
auto it = s_to_counts.find(s);
if (it ==... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
long solve(int n, std::vector<std::string> strings) {
std::unordered_map<std::string, long> s_to_counts;
for (auto &s : strings) {
std::sort(s.begin(), s.end());
auto it = s_to_counts.find(s);
if (it =... | [
"variable_declaration.type.primitive.change"
] | 749,483 | 749,484 | u405612058 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, j, num = 0;
cin >> N;
vector<string> str(N);
for (i = 0; i < N; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str.begin(), str.end());
for (i = 0; i < N - 1; i++) {
j = i;
while (j < N - 1) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, i, j, num = 0;
cin >> N;
vector<string> str(N);
for (i = 0; i < N; i++) {
cin >> str[i];
sort(str[i].begin(), str[i].end());
}
sort(str.begin(), str.end());
for (i = 0; i < N - 1; i++) {
j = i;
while (j < N - 1) {
... | [
"variable_declaration.type.primitive.change"
] | 749,485 | 749,486 | u481581904 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n... | [
"variable_declaration.type.change",
"literal.string.change",
"variable_declaration.value.change"
] | 749,487 | 749,488 | u288432959 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility> // pair make_pair
#include <vector>
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
#define fill(x, y) memset(x,... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility> // pair make_pair
#include <vector>
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
#define fill(x, y) memset(x,... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 749,491 | 749,492 | u703205079 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int a[100005];
char ch[20];
map<string, int> m;
map<string, int>::iterator it;
int main(void) {
int n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ch;
sort(ch, ch + 10);
ch[10] = '\0';
if (!m.count(ch)) {
m[ch] = 0;
}
m[ch] +=... | #include <bits/stdc++.h>
using namespace std;
int a[100005];
char ch[20];
map<string, int> m;
map<string, int>::iterator it;
int main(void) {
int n;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ch;
sort(ch, ch + 10);
ch[10] = '\0';
if (!m.count(ch)) {
m[ch] = 0;
}
... | [
"variable_declaration.type.widen.change"
] | 749,493 | 749,494 | u547576401 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<string> q;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
q.push_back(s);
}
sort(q.begin(), q.end());
int c = 0;
int ans = 0;
// for(auto a:q)... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<string> q;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
q.push_back(s);
}
sort(q.begin(), q.end());
ll c = 0;
ll ans = 0;
// for(auto a:q) c... | [
"variable_declaration.type.change"
] | 749,497 | 749,498 | u584976442 | 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 comb(int a, int b) {
int nume = 1, deno = 1;
rep(i, b) nume *= a - i;
rep(i, b) deno *= b - i;
return nume / deno;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
ll comb(int a, int b) {
ll nume = 1, deno = 1;
rep(i, b) nume *= a - i;
rep(i, b) deno *= b - i;
return nume / deno;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) {
... | [
"variable_declaration.type.change"
] | 749,499 | 749,500 | u646792990 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N;
string str;
map<string, int> count;
cin >> N;
str.resize(N);
for (int i = 0; i < N; i++) {
cin >> str;
sort(str.begin(), str.end());
count[str]++;
}
long ans = 0;
auto begin = count.begin()... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N;
string str;
map<string, int> count;
cin >> N;
str.resize(N);
for (int i = 0; i < N; i++) {
cin >> str;
sort(str.begin(), str.end());
count[str]++;
}
long long ans = 0;
auto begin = count.be... | [
"variable_declaration.type.widen.change"
] | 749,501 | 749,502 | u604023588 | cpp |
p02947 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<multiset<char>, int> strMap;
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<multiset<char>, int> strMap;
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
... | [
"variable_declaration.type.primitive.change"
] | 749,503 | 749,504 | u129607134 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | [
"literal.number.type.widen.change"
] | 749,509 | 749,510 | u730476362 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long n, sum[100005], ans, cnt;
char s[11];
map<string, int> m;
int cmp(char x, char y) { return x < y; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", s);
sort(s, s + 10, cmp);
if (m.count(s))
ans += sum[m[s]];
else
... | #include <bits/stdc++.h>
using namespace std;
long long n, sum[100005], ans, cnt;
char s[11];
map<string, int> m;
int cmp(char x, char y) { return x < y; }
int main() {
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", s);
sort(s, s + 10, cmp);
if (m.count(s))
ans += sum[m[s]];
els... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 749,511 | 749,512 | u918731412 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr long lon... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr long lon... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,513 | 749,514 | u824337972 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> m;
string s;
for (int i = 0; i < N; ++i) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
vector<int> tosa(100005);
tosa[0] = 0;
tosa[1] = 0;
for (int i = 2; i < 100005; +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
map<string, int> m;
string s;
for (int i = 0; i < N; ++i) {
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
vector<ll> tosa(100005);
tosa[0] = 0;
tosa[1] = 0;
for (int i = 2; i < 100005; ++... | [] | 749,517 | 749,518 | u159619403 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long ans = 0;
int left = 0;
int right = 0;
int tmp = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
unsigned long long ans = 0;
int left = 0;
int right = 0;
l... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 749,521 | 749,522 | u992134985 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vc;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
vc.push_back(s);
}
for (int i = 0; i < n; i++) {
sort(vc[i].b... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> vc;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
vc.push_back(s);
}
for (int i = 0; i < n; i++) {
sort(vc[i].b... | [
"variable_declaration.type.primitive.change"
] | 749,523 | 749,524 | u397070717 | cpp |
p02947 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1,... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1,... | [] | 749,525 | 749,526 | u845000384 | cpp |
p02947 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1,... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1,... | [
"variable_declaration.type.change"
] | 749,527 | 749,526 | u845000384 | cpp |
p02947 | // https://github.com/PabloMessina/Competitive-Programming-Material/blob/master/Codejam_template.cpp
#pragma GCC optimize("Ofast") // OPTIONAL: for faster execution
#include <bits/stdc++.h> // import everything in one shot
using namespace std;
// defines
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define inv... | // https://github.com/PabloMessina/Competitive-Programming-Material/blob/master/Codejam_template.cpp
#pragma GCC optimize("Ofast") // OPTIONAL: for faster execution
#include <bits/stdc++.h> // import everything in one shot
using namespace std;
// defines
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define inv... | [
"variable_declaration.type.change"
] | 749,534 | 749,535 | u340943117 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, ll> freq;
while (n--) {
string temp;
cin >> temp;
sort(temp.begin(), temp.end());
freq[temp]++;
}
int sum = 0;
for (auto x : freq) {
if (x.second >= 2)
sum... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, ll> freq;
while (n--) {
string temp;
cin >> temp;
sort(temp.begin(), temp.end());
freq[temp]++;
}
ll sum = 0;
for (auto x : freq) {
if (x.second >= 2)
sum ... | [
"variable_declaration.type.change"
] | 749,538 | 749,539 | u590250851 | 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 counter = 0;
int subcount = 0;
int i = 0;
int j = 1;
while (1) {
subcoun... | #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 counter = 0;
int subcount = 0;
int i = 0;
int j = 1;
while (1) {
s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,540 | 749,541 | u229596090 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Fastest \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Fastest \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | [] | 749,546 | 749,547 | u720795206 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned int N;
cin >> N;
vector<string> s(N);
for (unsigned int i = 0; i < N; ++i) {
cin >> s[i];
sort(s... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned int N;
cin >> N;
vector<string> s(N);
for (unsigned int i = 0; i < N; ++i) {
cin >> s[i];
sort(s... | [
"variable_declaration.type.primitive.change"
] | 749,553 | 749,554 | u189738061 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change",
"assignment.change"
] | 749,555 | 749,556 | u364018936 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n, sum;
long long ans;
string s[100010];
char temp;
int calc(int a) {
if (a == 1)
return 0;
else
return a * (a - 1) / 2;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
for (int j = 0; j < 9; j++)
for (int k = j + 1;... | #include <bits/stdc++.h>
using namespace std;
long long n, sum;
long long ans;
string s[100010];
char temp;
long long calc(long long a) {
if (a == 1)
return 0;
else
return a * (a - 1) / 2;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
for (int j = 0; j < 9; j++)
f... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 749,557 | 749,558 | u855459404 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
map<string, int> p;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (p.find(s) != p.end()) {
p[s]++;
} else {
p[s] = 1;
}
}
ll count = 0;
for... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
main() {
int n;
cin >> n;
map<string, ll> p;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (p.find(s) != p.end()) {
p[s]++;
} else {
p[s] = 1;
}
}
ll count = 0;
for ... | [] | 749,563 | 749,564 | u040700157 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
union x_t {
long x[3];
char y[12];
bool operator<(const x_t &rhs) cons... | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
union x_t {
long x[3];
char y[12];
bool operator<(const x_t &rhs) cons... | [
"type_conversion.add"
] | 749,565 | 749,566 | u565795452 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main() {
int n;
cin >> n;
ull count = 0;
vector<string> s;
map<string, int> m;
map<string, int>::iterator it;
string si;
for (int i = 0; i < n; i++) {
cin >> si;
sort(si.begin(), si.end());
it = m.find(si... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main() {
int n;
cin >> n;
ull count = 0;
vector<string> s;
map<string, ull> m;
map<string, ull>::iterator it;
string si;
for (int i = 0; i < n; i++) {
cin >> si;
sort(si.begin(), si.end());
it = m.find(si... | [
"variable_declaration.type.change"
] | 749,567 | 749,568 | u117783424 | cpp |
p02947 | /**
* @author Mustafa Khaled.
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define FastInputOutput ... | /**
* @author Mustafa Khaled.
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define FastInputOutput ... | [
"variable_declaration.type.change"
] | 749,569 | 749,570 | u496241491 | cpp |
p02947 | /**
* @author Mustafa Khaled.
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define FastInputOutput ... | /**
* @author Mustafa Khaled.
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define FastInputOutput ... | [
"variable_declaration.type.change"
] | 749,571 | 749,570 | u496241491 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long ll;
#define FOR(i, n) for (int i = 0; i < n; i++)
// map<key,value>
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
sort(ALL(s[i... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long ll;
#define FOR(i, n) for (int i = 0; i < n; i++)
// map<key,value>
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
sort(ALL(s[i... | [
"variable_declaration.type.change"
] | 749,572 | 749,573 | u662665711 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.