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 | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
typedef long long ll;
vector<int> ve[maxn];
int as[maxn];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
map<string, int> mp;
for (int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin()... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
typedef long long ll;
vector<int> ve[maxn];
int as[maxn];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
map<string, int> mp;
for (int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin()... | [
"variable_declaration.type.change"
] | 748,690 | 748,691 | u337233447 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, count = 1, kotae = 0;
cin >> n;
string s[n];
char x[10];
for (i = 0; i < n; i++) {
cin >> s[i];
for (j = 0; j < 10; j++) {
x[j] = s[i][j];
}
sort(x, x + 10);
for (j = 0; j < 10; j++) {
s[i][j] = x[j];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
long int count = 1, kotae = 0;
cin >> n;
string s[n];
char x[10];
for (i = 0; i < n; i++) {
cin >> s[i];
for (j = 0; j < 10; j++) {
x[j] = s[i][j];
}
sort(x, x + 10);
for (j = 0; j < 10; j++) {
s[i][j] =... | [
"variable_declaration.type.widen.change"
] | 748,692 | 748,693 | u016726316 | cpp |
p02947 | // JSD
#include <algorithm>
#include <iostream>
#include <map>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 1;
return 0;
}
ll ans = 0;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[... | // JSD
#include <algorithm>
#include <iostream>
#include <map>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 1;
return 0;
}
ll ans = 0;
map<string, ll> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s... | [] | 748,696 | 748,697 | u436019023 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int sum;
int n;
string a;
map<string, int> p;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
sort(a.begin(), a.end());
sum += p[a];
p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
long long sum;
int n;
string a;
map<string, int> p;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
sort(a.begin(), a.end());
sum += p[a];... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,702 | 748,703 | u275358946 | cpp |
p02947 | // abc.cpp :
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
#define MOD 1000000007
#define rp(i, n) for (int i = 0; i < (n); i++)
#define irp(i, n) for (int i = (n); i >= 0; i--)
#define up(i, s, e, d) for (int i = (s); i < (e); i += (d))
#define dw(... | // abc.cpp :
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
#define MOD 1000000007
#define rp(i, n) for (int i = 0; i < (n); i++)
#define irp(i, n) for (int i = (n); i >= 0; i--)
#define up(i, s, e, d) for (int i = (s); i < (e); i += (d))
#define dw(... | [] | 748,706 | 748,707 | u525065967 | cpp |
p02947 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | [] | 748,708 | 748,709 | u302539304 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long a, b = 0;
cin >> a;
map<string, int> mp;
for (int i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
b += ((it->second ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long a, b = 0;
cin >> a;
map<string, int> mp;
for (int i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
b += (((long long)... | [
"type_conversion.add"
] | 748,710 | 748,711 | u858440663 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long double a, b = 0;
cin >> a;
map<string, int> mp;
for (int i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
b += ((it->secon... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long a, b = 0;
cin >> a;
map<string, int> mp;
for (int i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
b += (((long long)... | [
"variable_declaration.type.primitive.change"
] | 748,712 | 748,711 | u858440663 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a, b = 0;
cin >> a;
map<string, int> mp;
for (int i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
b += ((it->second * (it-... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long a, b = 0;
cin >> a;
map<string, int> mp;
for (int i = 0; i < a; i++) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); ++it) {
b += (((long long)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,713 | 748,711 | u858440663 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int j = 0; j < N; j++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p :... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int j = 0; j < N; j++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p :... | [
"type_conversion.add"
] | 748,717 | 748,718 | u964726243 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int j = 0; j < N; j++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int ans = 0;
for (auto &p : mp) {... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int j = 0; j < N; j++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p :... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,719 | 748,718 | u964726243 | cpp |
p02947 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> cnt;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
cnt[s]++;
}
long long ans = 0;
for (auto p : cnt) {
ans += p.second * (p.second - 1) / 2;
}
cout << ans <<... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> cnt;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(begin(s), end(s));
cnt[s]++;
}
long long ans = 0;
for (auto p : cnt) {
ans += 1ll * p.second * (p.second - 1) / 2;
}
cout << ... | [
"assignment.change"
] | 748,720 | 748,721 | u443010331 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> vi... | [
"variable_declaration.type.change"
] | 748,722 | 748,723 | u791593901 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin... | [
"type_conversion.add"
] | 748,724 | 748,725 | u174509352 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[100005], now;
int sum[100005];
int main() {
int N, c = 1;
cin >> N;
long long p = 0;
for (int i = 1; i <= N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s + 1, s + N + 1);
for (int i = 1; i <= N... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[100005], now;
long long sum[100005];
int main() {
int N, c = 1;
cin >> N;
long long p = 0;
for (int i = 1; i <= N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s + 1, s + N + 1);
for (int i = 1; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,726 | 748,727 | u528036644 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[100005], now;
int sum[100005];
int main() {
int N, c = 1;
cin >> N;
long long p = 0;
for (int i = 1; i <= N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s + 1, s + N + 1);
for (int i = 1; i <= N... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[100005], now;
long long sum[100005];
int main() {
int N, c = 1;
cin >> N;
long long p = 0;
for (int i = 1; i <= N; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s + 1, s + N + 1);
for (int i = 1; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 748,728 | 748,727 | u528036644 | cpp |
p02947 | //==================================================================================================
// Name : WinryRockbell.cpp
// Author : lotus.eater086
// Copyright : If you're reading this then this warning is for you. Every word
// you read of this
// useless fine print is another seco... | //==================================================================================================
// Name : WinryRockbell.cpp
// Author : lotus.eater086
// Copyright : If you're reading this then this warning is for you. Every word
// you read of this
// useless fine print is another seco... | [
"variable_declaration.type.change"
] | 748,733 | 748,734 | u507591519 | cpp |
p02947 | //==================================================================================================
// Name : WinryRockbell.cpp
// Author : lotus.eater086
// Copyright : If you're reading this then this warning is for you. Every word
// you read of this
// useless fine print is another seco... | //==================================================================================================
// Name : WinryRockbell.cpp
// Author : lotus.eater086
// Copyright : If you're reading this then this warning is for you. Every word
// you read of this
// useless fine print is another seco... | [
"variable_declaration.type.change"
] | 748,735 | 748,734 | u507591519 | cpp |
p02947 | //==================================================================================================
// Name : WinryRockbell.cpp
// Author : lotus.eater086
// Copyright : If you're reading this then this warning is for you. Every word
// you read of this
// useless fine print is another seco... | //==================================================================================================
// Name : WinryRockbell.cpp
// Author : lotus.eater086
// Copyright : If you're reading this then this warning is for you. Every word
// you read of this
// useless fine print is another seco... | [
"variable_declaration.type.change"
] | 748,736 | 748,734 | u507591519 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<string> words(N);
for (int i = 0; i < N; i++) {
cin >> words.at(i);
}
std::map<std::string, int> counter;
string tmp_str;
long cnt = 0;
for (int i = 0; i < N; i++) {
tmp_str = words.at(i);
sort(tmp_st... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<string> words(N);
for (int i = 0; i < N; i++) {
cin >> words.at(i);
}
std::map<std::string, long> counter;
string tmp_str;
long long cnt = 0;
for (int i = 0; i < N; i++) {
tmp_str = words.at(i);
sort(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,737 | 748,738 | u578276786 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<string> words(N);
for (int i = 0; i < N; i++) {
cin >> words.at(i);
}
std::map<std::string, int> counter;
string tmp_str;
int cnt = 0;
for (int i = 0; i < N; i++) {
tmp_str = words.at(i);
sort(tmp_str... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<string> words(N);
for (int i = 0; i < N; i++) {
cin >> words.at(i);
}
std::map<std::string, long> counter;
string tmp_str;
long long cnt = 0;
for (int i = 0; i < N; i++) {
tmp_str = words.at(i);
sort(... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,739 | 748,738 | u578276786 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> words(N);
for (int i = 0; i < N; ++i) {
cin >> words[i];
}
map<string, int> counter;
string tmp_str;
long long cnt = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> words(N);
for (int i = 0; i < N; ++i) {
cin >> words[i];
}
map<string, long> counter;
string tmp_str;
long long cnt = 0;
... | [
"variable_declaration.type.primitive.change"
] | 748,742 | 748,743 | u002386242 | cpp |
p02947 | //#pragma GCC optimize(3)
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#in... | //#pragma GCC optimize(3)
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#in... | [
"literal.number.change",
"variable_declaration.value.change"
] | 748,744 | 748,745 | u930838529 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi pair<int, int>
#define pl pair<ll, ll>
#define pb push_back
#define vl vector<long long int>
#define vi vector<int>
#define mod 1000000007
#define eps 1e-9
#define fi first
#define se second
#define _ << " " <<
#define forn(x, n) for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi pair<int, int>
#define pl pair<ll, ll>
#define pb push_back
#define vl vector<long long int>
#define vi vector<int>
#define mod 1000000007
#define eps 1e-9
#define fi first
#define se second
#define _ << " " <<
#define forn(x, n) for (int... | [
"variable_declaration.type.change"
] | 748,746 | 748,747 | u678053360 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
string s[100010];
int tab[100000][26] = {};
int skip[100000] = {};
int main() {
int N;
cin >> N;
rep(i, N) {
cin >> s[i];
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
string s[100010];
int tab[100000][26] = {};
int skip[100000] = {};
int main() {
int N;
cin >> N;
rep(i, N) {
cin >> s[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,750 | 748,751 | u601256797 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
string s[100000];
int tab[100000][26] = {};
int skip[100000] = {};
int main() {
int N;
cin >> N;
rep(i, N) {
cin >> s[i];
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
string s[100010];
int tab[100000][26] = {};
int skip[100000] = {};
int main() {
int N;
cin >> N;
rep(i, N) {
cin >> s[i];
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,752 | 748,751 | u601256797 | cpp |
p02947 | //#include "SaveFuncs.cpp"
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define re... | //#include "SaveFuncs.cpp"
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define re... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 748,756 | 748,757 | u588369531 | cpp |
p02947 | //#include "SaveFuncs.cpp"
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define re... | //#include "SaveFuncs.cpp"
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define re... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 748,758 | 748,757 | u588369531 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, sum = 0;
string str;
map<string, int> mp;
cin >> n;
while (n--) {
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
map<string, int>::iterator it;
for (it = mp.begin(); it != mp.end(); it++) {
x = (it->second) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, x, y, sum = 0;
string str;
map<string, long long int> mp;
cin >> n;
while (n--) {
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
}
map<string, long long int>::iterator it;
for (it = mp.begin(); it != mp.end();... | [
"variable_declaration.type.widen.change"
] | 748,759 | 748,760 | u052071180 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <string>
#include <vector>
#include <map>
#include <set>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using names... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <string>
#include <vector>
#include <map>
#include <set>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using names... | [
"type_conversion.add"
] | 748,761 | 748,762 | u667375816 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
int N;
string s[100000];
int main(void) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
int N;
string s[100000];
int main(void) {
... | [
"variable_declaration.type.change"
] | 748,763 | 748,764 | u097408484 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for... | [
"variable_declaration.type.primitive.change"
] | 748,772 | 748,773 | u539914590 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int cnt = 0;
for (auto... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,774 | 748,773 | u539914590 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int cnt = 0;
for (auto... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,775 | 748,773 | u539914590 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int cnt = 0;
for (auto... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,774 | 748,776 | u539914590 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
int cnt = 0;
for (auto... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
map<string, long> mp;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,775 | 748,776 | u539914590 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int calcNumOfCombination(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int calcNumOfCombination(long n, long r) {
long num = 1;
for (long i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 748,777 | 748,778 | u539914590 | cpp |
p02947 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
map<string, int> s;
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (s.count(str) == 1) {
s[str] += 1;
} else {
s[str] = ... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
map<string, ll> s;
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (s.count(str) == 1) {
s[str] += 1;
} else {
s[str] = 1... | [] | 748,779 | 748,780 | u701556979 | cpp |
p02947 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
t... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
t... | [
"variable_declaration.type.change"
] | 748,781 | 748,782 | u662614053 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n;
string s[100010];
int main() {
scanf("%d", &n);
cin >> ws;
for (int i = 0; i < n; i++)
getline(cin, s[i]), sort(s[i].begin(), s[i].end());
sort(s, s + n);
long long ans = 0;
int ct = 1;
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1])
... | #include <bits/stdc++.h>
using namespace std;
int n;
string s[100010];
int main() {
scanf("%d", &n);
cin >> ws;
for (int i = 0; i < n; i++)
getline(cin, s[i]), sort(s[i].begin(), s[i].end());
sort(s, s + n);
long long ans = 0;
int ct = 1;
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1])
... | [
"type_conversion.add"
] | 748,783 | 748,784 | u272347605 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | [
"variable_declaration.type.change"
] | 748,785 | 748,786 | u522598953 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 748,787 | 748,786 | u522598953 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 748,788 | 748,786 | u522598953 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll ... | [] | 748,789 | 748,790 | u707524027 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define mm map<ii>
#define ff fir... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define mm map<ii>
#define ff fir... | [
"assignment.value.change"
] | 748,791 | 748,792 | u460819600 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool anagram(string a, string b) {
sort(a.begin(), a.end());
sort(b.begin(), b.end());
return a == b;
}
int main() {
int N;
cin >> N;
vector<st... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool anagram(string a, string b) {
sort(a.begin(), a.end());
sort(b.begin(), b.end());
return a == b;
}
int main() {
int N;
cin >> N;
vector<st... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 748,793 | 748,794 | u119477929 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
s.resize(N);
for (int i = 0; i < N; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
std::string prev = "";
long long ans = 0;
int ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s;
s.resize(N);
for (int i = 0; i < N; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
std::string prev = "";
long long ans = 0;
long... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,797 | 748,798 | u423405217 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100010];
int pd[100010][26];
int c[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
char array[10];
for (int j = 0; j < 10; ++j) {
array[j] = s[i][j];
}
sort(array, array + 10);
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
string s[100010];
int pd[100010][26];
int c[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
char array[10];
for (int j = 0; j < 10; ++j) {
array[j] = s[i][j];
}
sort(array, array + 10);
for (int j = 0; j... | [
"variable_declaration.type.widen.change"
] | 748,799 | 748,800 | u837190376 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
string s[100010];
int pd[100010][26];
int c[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
char array[10];
for (int j = 0; j < 10; ++j) {
array[j] = s[i][j];
}
sort(array, array + 10);
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
string s[100010];
int pd[100010][26];
int c[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
char array[10];
for (int j = 0; j < 10; ++j) {
array[j] = s[i][j];
}
sort(array, array + 10);
for (int j = 0; j... | [
"variable_declaration.type.widen.change"
] | 748,801 | 748,800 | u837190376 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
int N;
const int INT_MAX = 100100;
string s[INT_MAX];
std::set<string> c;
std::map<std::string, int> res;
int main() {
cin >> N;
long long int ans = 0;
for (int i = 0; i < N; i++) {
string s;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
using namespace std;
int N;
const int INT_MAX = 100100;
string s[INT_MAX];
std::set<string> c;
std::map<std::string, long long int> res;
int main() {
cin >> N;
long long int ans = 0;
for (int i = 0; i < N; i++) {
stri... | [
"variable_declaration.type.widen.change"
] | 748,805 | 748,806 | u767785562 | cpp |
p02947 | #include <algorithm>
#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++)
cin >> s[i];
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
// for(int ... | #include <algorithm>
#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++)
cin >> s[i];
for (int i = 0; i < n; i++) {
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
// for(int ... | [
"variable_declaration.type.widen.change"
] | 748,811 | 748,812 | u927804708 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int main() {
int n;
scanf("%d", &n);
vector<string> s(n);
for (int i = 0; i < s.size(); i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int64 cnt = 0;
int a = 0;
size_t size = s.size();... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int main() {
int n;
scanf("%d", &n);
vector<string> s(n);
for (int i = 0; i < s.size(); i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
int64 cnt = 0;
int a = 0;
size_t size = s.size();... | [
"variable_declaration.type.change"
] | 748,818 | 748,819 | u220152525 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int N;
using namespace std;
int main() {
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string s;
vector<char> A(10);
cin >> s;
for (int j = 0; j < 10; j++) {
A[j] = s[j];
}
sort(A.begin(), A.... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int N;
using namespace std;
int main() {
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string s;
vector<char> A(10);
cin >> s;
for (int j = 0; j < 10; j++) {
A[j] = s[j];
}
sort(A.begin(), A.... | [
"variable_declaration.type.widen.change"
] | 748,824 | 748,825 | u238786149 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int N;
using namespace std;
int main() {
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string s;
vector<char> A(10);
cin >> s;
for (int j = 0; j < 10; j++) {
A[j] = s[j];
}
sort(A.begin(), A.... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int N;
using namespace std;
int main() {
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string s;
vector<char> A(10);
cin >> s;
for (int j = 0; j < 10; j++) {
A[j] = s[j];
}
sort(A.begin(), A.... | [
"variable_declaration.type.widen.change"
] | 748,826 | 748,825 | u238786149 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int n;
char s[123456][31];
string ss[123456];
string str;
bool cmp(char a, char b) { return a < b; }
bool cmp1(string a, string b) { return a < b; }
int main() {
cin >> n;
int k = 0, sum = 0, t = 1;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
fo... | #include <bits/stdc++.h>
using namespace std;
int a, b;
int n;
char s[123456][31];
string ss[123456];
string str;
bool cmp(char a, char b) { return a < b; }
bool cmp1(string a, string b) { return a < b; }
int main() {
cin >> n;
long long k = 0, sum = 0, t = 1;
for (int i = 1; i <= n; i++) {
cin >> s[i];
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,827 | 748,828 | u250046233 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int N;
unsigned long num = 0;
string str;
vector<string> s;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> str;
sort(str.begin(), str.end());
s.push_back(str)... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int N;
unsigned long num = 0;
string str;
vector<string> s;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> str;
sort(str.begin(), str.end());
s.push_back(str)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,836 | 748,837 | u868390752 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.type.change"
] | 748,838 | 748,839 | u840105874 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.type.change"
] | 748,840 | 748,839 | u840105874 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
double comb(int n) { return (double)n * (double)(n - 1) / 2.0; }
int main(void) {
int n;
cin >> n;
string key;
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> key;
sort(key.begin(), key.end());
if (mp.find(ke... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
long comb(int n) { return (long)n * (long)(n - 1) / 2.0; }
int main(void) {
int n;
cin >> n;
string key;
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> key;
sort(key.begin(), key.end());
if (mp.find(key) == ... | [
"variable_declaration.type.primitive.change"
] | 748,841 | 748,842 | u469842862 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long int count;
cin >> N;
count = 0;
string S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
// cout << S[i] << endl;
}
sort(S, S + N);
for (int i = 0; i < N; i++) {
if (S[i] == S[i + 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long int count;
cin >> N;
count = 0;
string S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
// cout << S[i] << endl;
}
sort(S, S + N);
for (int i = 0; i < N; i++) {
if (S[i] == S[i + 1]... | [
"expression.operation.binary.remove"
] | 748,845 | 748,846 | u085481334 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define forn(i, n, m) for (int(i) = (n); i <= (int)(m); (i)++)
#define push_back pb
#define make_pair mp
using namespace std;
typedef long long ll;
typedef long double ld;
const i... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define forn(i, n, m) for (int(i) = (n); i <= (int)(m); (i)++)
#define push_back pb
#define make_pair mp
using namespace std;
typedef long long ll;
typedef long double ld;
const i... | [
"variable_declaration.type.change"
] | 748,847 | 748,848 | u730153732 | 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++)
typedef long long ll;
int main() {
int n;
ll ans = 0;
cin >> n;
map<string, int> s;
string str;
REP(i, n) {
cin >>... | #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++)
typedef long long ll;
int main() {
int n;
ll ans = 0;
cin >> n;
map<string, ll> s;
string str;
REP(i, n) {
cin >> ... | [] | 748,849 | 748,850 | u303884911 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
char a[100005][15];
char *p[100005];
int cmp(char c, char b) { return c < b; }
int cmp1(char *c, char *b) {
if (strcmp(c, b) < 0)
return 1;
else
return 0;
}
long long s = 0;
int main() {
int n;
cin >> n;
for (int i = 0; i... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
char a[100005][15];
char *p[100005];
int cmp(char c, char b) { return c < b; }
int cmp1(char *c, char *b) {
if (strcmp(c, b) < 0)
return 1;
else
return 0;
}
long long s = 0;
int main() {
int n;
cin >> n;
for (int i = 0; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,857 | 748,858 | u808738521 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool equal(map<char, int> m1, map<char, int> m2) {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < alphabet.size(); i++) {
if (m1[alphabet[i]] != m2[alphab... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool equal(map<char, int> m1, map<char, int> m2) {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < alphabet.size(); i++) {
if (m1[alphabet[i]] != m2[alphab... | [] | 748,863 | 748,864 | u439303935 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool equal(map<char, int> m1, map<char, int> m2) {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < alphabet.size(); i++) {
if (m1[alphabet[i]] != m2[alphab... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool equal(map<char, int> m1, map<char, int> m2) {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < alphabet.size(); i++) {
if (m1[alphabet[i]] != m2[alphab... | [] | 748,865 | 748,864 | u439303935 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool equal(map<char, int> m1, map<char, int> m2) {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < alphabet.size(); i++) {
if (m1[alphabet[i]] != m2[alphab... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
bool equal(map<char, int> m1, map<char, int> m2) {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < alphabet.size(); i++) {
if (m1[alphabet[i]] != m2[alphab... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 748,866 | 748,864 | u439303935 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long co(int x) {
long long y = 0;
for (int i = 1; i <= x - 1; i++) {
y += i;
}
return y;
}
int main() {
int n;
map<string, int> ma;
string s[10000];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> s[i];
getchar();
sort(s[i].begin... | #include <bits/stdc++.h>
using namespace std;
long long co(int x) {
long long y = 0;
for (int i = 1; i <= x - 1; i++) {
y += i;
}
return y;
}
int main() {
int n;
map<string, int> ma;
string s[100001];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> s[i];
getchar();
sort(s[i].begi... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 748,867 | 748,868 | u058609859 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n + 1);
for (ll i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
s[n] = "wwwwwwwwwww";
sort(s.begin(), s.end());
string memo = s[0];
ll count = 1, ans = 0;
for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n + 1);
for (ll i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
s[n] = "wwwwwwwwww";
sort(s.begin(), s.end());
string memo = s[0];
ll count = 1, ans = 0;
for ... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 748,869 | 748,870 | u330689597 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n + 1);
for (ll i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
s[n] = "wwwwwwwwwww";
sort(s.begin(), s.end());
string memo = s[0];
ll count = 1, ans = 0;
for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n + 1);
for (ll i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
s[n] = "wwwwwwwwww";
sort(s.begin(), s.end());
string memo = s[0];
ll count = 1, ans = 0;
for ... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 748,871 | 748,870 | u330689597 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
v.push_back(s);
sort(s.begin(), s.end());
if (m[s] >= 1)
m[s]++;
else
m[s] = 1;
}
long long sm = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
v.push_back(s);
sort(s.begin(), s.end());
if (m[s] >= 1)
m[s]++;
else
m[s] = 1;
}
long long sm = 0;
for... | [
"assignment.change"
] | 748,873 | 748,874 | u254663986 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define ull unsigned long long
#define pb push_back
const int MAX = 2e5 + 9;
const long long mod = 1e9 + 7;
using namespace std;
vector<int> adj[MAX];
ll dp[MAX][10][13];
int main() {
int n;
cin >> n;
int cnt = 0;
map<string, int> mp;
for (int ... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define ull unsigned long long
#define pb push_back
const int MAX = 2e5 + 9;
const long long mod = 1e9 + 7;
using namespace std;
vector<int> adj[MAX];
ll dp[MAX][10][13];
int main() {
int n;
cin >> n;
ll cnt = 0;
map<string, ll> mp;
for (int i ... | [
"variable_declaration.type.change"
] | 748,875 | 748,876 | u356157756 | cpp |
p02947 | #include <bits/stdc++.h>
#include <map>
using namespace std;
map<string, int> m;
int nb(long long);
long long v[500005];
int main() {
int a;
cin >> a;
for (int i = 0; i < a; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
m[str]++;
// cout << m[str];
}
// cout << m[str]... | #include <bits/stdc++.h>
#include <map>
using namespace std;
map<string, int> m;
long long nb(long long);
long long v[500005];
int main() {
int a;
cin >> a;
for (int i = 0; i < a; i++) {
string str;
cin >> str;
sort(str.begin(), str.end());
m[str]++;
// cout << m[str];
}
// cout << ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,879 | 748,880 | u382002817 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int64_t ans = 0;
int re = 1;
for (int i = 0; i < n - 1; i++) {
if (s.at(i... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int64_t ans = 0;
int64_t re = 1;
for (int i = 0; i < n - 1; i++) {
if (s.... | [
"variable_declaration.type.primitive.change"
] | 748,881 | 748,882 | u621374073 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int ans = 0;
int re = 1;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) ==... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int64_t ans = 0;
int64_t re = 1;
for (int i = 0; i < n - 1; i++) {
if (s.... | [
"variable_declaration.type.primitive.change"
] | 748,883 | 748,882 | u621374073 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"expression.operation.binary.remove"
] | 748,892 | 748,893 | u666394517 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"variable_declaration.type.change"
] | 748,894 | 748,893 | u666394517 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
unordered_map<string, int> mp;
typedef long long lli;
int main() {
int n;
cin >> n;
for (int kase = 1; kase <= n; kase++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
lli ans = 0;
for (auto it : mp) {
ans += (long long)((it.s... | #include <bits/stdc++.h>
using namespace std;
unordered_map<string, int> mp;
typedef long long lli;
int main() {
int n;
cin >> n;
for (int kase = 1; kase <= n; kase++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
lli ans = 0;
for (auto it : mp) {
ans += (long long)((it.s... | [] | 748,897 | 748,898 | u383034220 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <numeric>
#include <stdlib.h>
#include <vector>
using namespace std;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} els... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <numeric>
#include <stdlib.h>
#include <vector>
using namespace std;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} els... | [
"variable_declaration.type.primitive.change"
] | 748,899 | 748,900 | u846796522 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int K;
cin >> K;
vector<string> v(K);
long long ans = 0;
for (int i = 0; i < K; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
int num = 0;
for (in... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int K;
cin >> K;
vector<string> v(K);
long long ans = 0;
for (int i = 0; i < K; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
long long num = 0;
f... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,901 | 748,902 | u570417673 | cpp |
p02947 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(void) {
int n;
long long ans = 0;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
int x = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == s[i]) {
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(void) {
int n;
long long ans = 0;
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 x = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == s[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,905 | 748,906 | u675509234 | cpp |
p02947 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int N;
char str[11];
priority_queue<string> pque;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> str;
sort(str, str + 10);
pque.push(string(str));
}
int cnt = 1;
long long sum = 0;... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int N;
char str[11];
priority_queue<string> pque;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> str;
sort(str, str + 10);
pque.push(string(str));
}
long long cnt = 1;
long long su... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,907 | 748,908 | u979960743 | cpp |
p02947 | #include <algorithm>
#include <iostream>
using namespace std;
string s[50000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long cnt = 1;
long long sum = 0;
for (long long i = 0; i < n; i++) {
if (s[i] !=... | #include <algorithm>
#include <iostream>
using namespace std;
string s[5000000 + 5];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
long long cnt = 1;
long long sum = 0;
for (long long i = 0; i < n; i++) {
if (s[i] ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 748,909 | 748,910 | u191117799 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int wk_ans = 0;
long long ans = 0;
string tmp;
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int64_t ans = 0, wk_ans = 0;
string tmp;
for (int i = 0; i < n;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.add",
"variable_declaration.remove"
] | 748,911 | 748,912 | u282835662 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int wk_ans = 0;
long ans = 0;
string tmp;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int64_t ans = 0, wk_ans = 0;
string tmp;
for (int i = 0; i < n;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.add",
"variable_declaration.remove"
] | 748,913 | 748,912 | u282835662 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int wk_ans = 0;
double ans = 0;
string tmp;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int64_t ans = 0, wk_ans = 0;
string tmp;
for (int i = 0; i < n;... | [
"variable_declaration.type.primitive.change",
"variable_declaration.add",
"variable_declaration.remove"
] | 748,914 | 748,912 | u282835662 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int ans = 0, wk_ans = 0;
string tmp;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> str;
sort(str.begin(), str.end());
s.at(i) = str;
}
sort(s.begin(), s.end());
int64_t ans = 0, wk_ans = 0;
string tmp;
for (int i = 0; i < n;... | [
"variable_declaration.type.primitive.change"
] | 748,915 | 748,912 | u282835662 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 1, ans = 0;
cin >> n;
string s;
vector<string> sv(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
sv[i] = s;
}
sort(sv.begin(), sv.end());
for (int i = 0; i < n - 1; i++) {
if (sv[i] != sv[i + 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, cnt = 1, ans = 0;
cin >> n;
string s;
vector<string> sv(n);
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
sv[i] = s;
}
sort(sv.begin(), sv.end());
for (int i = 0; i < n - 1; i++) {
if (sv[i] != sv... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,918 | 748,919 | u501163846 | cpp |
p02947 | /*
g++ -std=c++14 -O2 -Wall a.cpp -o a && a
*/
// io
#include <iostream>
//#include <fstream> //http://www.cplusplus.com/reference/fstream/fstream/
//#include <cstdio>
//#include <iomanip> //http://www.cplusplus.com/reference/iomanip/
// util
#include <string>
//#include <cstring>
#include <algorithm>
//#include <ut... | /*
g++ -std=c++14 -O2 -Wall a.cpp -o a && a
*/
// io
#include <iostream>
//#include <fstream> //http://www.cplusplus.com/reference/fstream/fstream/
//#include <cstdio>
//#include <iomanip> //http://www.cplusplus.com/reference/iomanip/
// util
#include <string>
//#include <cstring>
#include <algorithm>
//#include <ut... | [
"variable_declaration.type.change"
] | 748,920 | 748,921 | u027395921 | cpp |
p02947 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long fact(int n) {
if... | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long fact(long long n) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,922 | 748,923 | u545206239 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, j, n) for (int i = j; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, j, n) for (int i = j; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i... | [
"variable_declaration.type.change"
] | 748,924 | 748,925 | u806159048 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
map<string, long long> map;
for (int i = 0; i < n; i++) {
cin >> s[i];
vect... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
map<string, long long> map;
for (int i = 0; i < n; i++) {
cin >> s[i];
vect... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 748,926 | 748,927 | u355911860 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int kai(int i) {
if (i == 2)
return 1;
else
return kai(i - 1) + i - 1;
}
int main() {
int N;
cin >> N;
vector<string> s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
ll kai(ll i) {
if (i == 2)
return 1;
else
return kai(i - 1) + i - 1;
}
int main() {
int N;
cin >> N;
vector<string> s(N... | [] | 748,928 | 748,929 | u730271001 | cpp |
p02947 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
const int M = 1000000007;
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
const int M = 1000000007;
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 748,936 | 748,937 | u395707260 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < n; i++)
ll mod = 1e9 + 7;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < n; i++)
ll mod = 1e9 + 7;
... | [] | 748,938 | 748,939 | u807028974 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <math.h>
#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);
}
//ソート
vector<string> S2(N);
for (int i = 0; i < N; i++) {
vector<char> C(S.at(i... | #include <algorithm>
#include <iostream>
#include <math.h>
#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);
}
//ソート
vector<string> S2(N);
for (int i = 0; i < N; i++) {
vector<char> C(S.at(i... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change"
] | 748,943 | 748,944 | u628134373 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <math.h>
#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);
}
//ソート
vector<string> S2(N);
for (int i = 0; i < N; i++) {
vector<char> C(S.at(i... | #include <algorithm>
#include <iostream>
#include <math.h>
#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);
}
//ソート
vector<string> S2(N);
for (int i = 0; i < N; i++) {
vector<char> C(S.at(i... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 748,945 | 748,944 | u628134373 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i <= (n); i++)
#define LL long long int
using namespace std;
LL lcm(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i <= (n); i++)
#define LL long long int
using namespace std;
LL lcm(... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 748,946 | 748,947 | u473092610 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i <= (n); i++)
#define LL long long int
using namespace std;
LL lcm(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i <= (n); i++)
#define LL long long int
using namespace std;
LL lcm(... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 748,948 | 748,947 | u473092610 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int n;
string s;
map<string, int> m;
int main() {
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
string s;
map<string, int> m;
int main() {
cin >> n;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,954 | 748,955 | u471585927 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
string a[N];
map<string, long long> p;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
// getchar();
cin >> a[i];
// int len=a[i].size();
sort(a[i].begin(), a[i].end());
if (!p.count(a[i]))
p[... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
string a[N];
map<string, long long> p;
int main() {
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++) {
// getchar();
cin >> a[i];
// int len=a[i].size();
sort(a[i].begin(), a[i].end());
if (!p.count(a[i]))
p[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 748,956 | 748,957 | u002122093 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.