problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k โ | fixed_code stringlengths 12 526k โ | labels listlengths 0 15 โ | buggy_submission_id int64 1 1.54M โ | fixed_submission_id int64 2 1.54M โ | user_id stringlengths 10 10 โ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define yesno(flg) \
if (flg) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define yesno(flg) \
if (flg) { ... | [
"variable_declaration.type.change"
] | 746,479 | 746,480 | u707053380 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); ... | [
"type_conversion.add"
] | 746,481 | 746,482 | u998008108 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define lld long long int
#define M 1000000007
#define fors(i, n) for (int i = 0; i < n; ++i)
#define fore(i, a, b) for (int i = a; i <= b; ++i)
#define fastio \
ios_base::sync_with_stdio(0); ... | [
"variable_declaration.type.widen.change"
] | 746,483 | 746,482 | u998008108 | cpp |
p02947 | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
int main() {
std::map<std::string, int> m;
int N;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::string... | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
int main() {
std::map<std::string, int> m;
int N;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::string... | [
"type_conversion.add"
] | 746,484 | 746,485 | u294638337 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(false);
int n;
string str;
int count = 0;
map<string, int> mp;
cin >> n;
vector<string> a(n);
for (int i = 1; i <= n; i++) {
cin >> str;
sor... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(false);
int n;
string str;
ll count = 0;
map<string, int> mp;
cin >> n;
vector<string> a(n);
for (int i = 1; i <= n; i++) {
cin >> str;
sort... | [
"variable_declaration.type.change"
] | 746,486 | 746,487 | u415671616 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> dic;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
dic[s]++;
}
long long ans = 0;
for (auto val : dic) {
int value = val.second;
ans += (value * (value - 1) /... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, long long int> dic;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
dic[s]++;
}
long long ans = 0;
for (auto val : dic) {
long long int value = val.second;
ans += (v... | [
"variable_declaration.type.widen.change"
] | 746,488 | 746,489 | u384300282 | cpp |
p02947 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(a, b, m) for (ll a = (ll)(b); a < (ll)(m); a++)
int main() {
ll n;
cin >> n;
vector<string> v(n);
ll ans = 0;
rep(i, n) {
cin >> v[i];
sort(v[i].... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REP(a, b, m) for (ll a = (ll)(b); a < (ll)(m); a++)
int main() {
ll n;
cin >> n;
vector<string> v(n);
ll ans = 0;
rep(i, n) {
cin >> v[i];
sort(v[i].... | [] | 746,490 | 746,491 | u831954260 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long long ans = 0;
for (auto p : m) {
if (p.second > ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
map<string, long long> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long long ans = 0;
for (auto p : m) {
if (p.sec... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,492 | 746,493 | u936558609 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long long ans = 0;
for (auto p : m) {
ans += p.second * (p.second - 1) ... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
map<string, long long> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s]++;
}
long long ans = 0;
for (auto p : m) {
ans += p.second * (p.second... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,494 | 746,495 | u936558609 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p : mp) ... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p : mp) ... | [
"type_conversion.add"
] | 746,496 | 746,497 | u936558609 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long ans = 0;
for (auto &p : mp) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long ans = 0;
for (auto &p : mp) ... | [
"variable_declaration.type.widen.change"
] | 746,498 | 746,497 | u936558609 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//ใขใใฐใฉใ ใซใชใฃใฆใใใชใใใฝใผใใใใๅใๆๅญใซใชใ
int main() {
//ๅ
ฅๅ
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
//ๅฆ็
rep(i, n) sort(s.at(i).begin(), s.at(i).end()); //ๅๆๅญๅใซใคใใฆใฝใผใ
sort(s.begin(), s.end());... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//ใขใใฐใฉใ ใซใชใฃใฆใใใชใใใฝใผใใใใๅใๆๅญใซใชใ
int main() {
//ๅ
ฅๅ
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
//ๅฆ็
rep(i, n) sort(s.at(i).begin(), s.at(i).end()); //ๅๆๅญๅใซใคใใฆใฝใผใ
sort(s.begin(), s.end());... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,499 | 746,500 | u474760662 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int res = 0;
unordered_map<string, int> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
res += mp[s]++;
}
cout << res << '\n';
return... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int64_t res = 0;
unordered_map<string, int64_t> mp;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
res += mp[s]++;
}
cout << res << '\n';
... | [
"variable_declaration.type.primitive.change"
] | 746,501 | 746,502 | u782098901 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, ll> cnt;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
ll ans = 0;
for (pair<string, ll> p : cnt) {
ans += p.second * (p.second - 1);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, ll> cnt;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
ll ans = 0;
for (pair<string, ll> p : cnt) {
ans += p.second * (p.second - 1) ... | [
"assignment.change"
] | 746,503 | 746,504 | u656771711 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, ll> cnt;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
ll ans = 0;
for (pair<string, int> p : cnt) {
ans += p.second * (p.second - 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, ll> cnt;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
cnt[s]++;
}
ll ans = 0;
for (pair<string, ll> p : cnt) {
ans += p.second * (p.second - 1) ... | [
"assignment.change"
] | 746,505 | 746,504 | u656771711 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(all(s));
m... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<string, int> mp;
rep(i, n) {
string s;
cin >> s;
sort(all(s));
m... | [
"type_conversion.add"
] | 746,508 | 746,509 | u074488832 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | [
"variable_declaration.type.change"
] | 746,510 | 746,511 | u919867411 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define sc(x) scanf("%d", &x)
#define scll(x) scanf("%lld", &x)
int main() {
ll n, ans = 0;
scll(n);
map<string, int> mp;
string s;
rep(i, 0, n) {
cin >> s;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define sc(x) scanf("%d", &x)
#define scll(x) scanf("%lld", &x)
int main() {
ll n, ans = 0;
scll(n);
map<string, ll> mp;
string s;
rep(i, 0, n) {
cin >> s;
... | [] | 746,512 | 746,513 | u920543723 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 746,514 | 746,515 | u093973314 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
int main() {
map<string, int> m;
int n;
cin >> n;
string s;
rep(i, n) {
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
int main() {
map<string, ll> m;
int n;
cin >> n;
string s;
rep(i, n) {
cin ... | [] | 746,516 | 746,517 | u789075914 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<str... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
vector<stri... | [
"variable_declaration.type.change"
] | 746,518 | 746,519 | u225474226 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp... | [
"variable_declaration.type.change"
] | 746,522 | 746,523 | u167755809 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; ++i) {
string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
if (m.find(tmp) == m.end())
m[tmp] =... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
map<string, long long> m;
for (int i = 0; i < N; ++i) {
string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
if (m.find(tmp) == m.end())
m[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.initializer.change"
] | 746,524 | 746,525 | u894471318 | cpp |
p02947 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | [
"call.remove"
] | 746,526 | 746,527 | u553461888 | cpp |
p02947 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#... | [] | 746,526 | 746,528 | u553461888 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexedๆ้
int main() {
int N;
cin >> N;
map<string, int> MAP;
rep(i, N) {
string s;
cin >> s;
sort(begin(s), end(s));
MAP[s]++;
}
ll cnt = 0;
f... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexedๆ้
int main() {
int N;
cin >> N;
map<string, int> MAP;
rep(i, N) {
string s;
cin >> s;
sort(begin(s), end(s));
MAP[s]++;
}
ll cnt = 0;
f... | [
"type_conversion.add"
] | 746,531 | 746,532 | u823855263 | cpp |
p02947 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"variable_declaration.type.change"
] | 746,535 | 746,536 | u914047482 | cpp |
p02947 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"variable_declaration.type.change"
] | 746,537 | 746,536 | u914047482 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
unordered_map<string, int> count;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
res += count[s];
count[s]++;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
long res = 0;
unordered_map<string, int> count;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
res += count[s];
count[s]++;
... | [
"variable_declaration.type.primitive.change"
] | 746,538 | 746,539 | u213143275 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
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());
for (int i = 0; i < N; i++) {
// cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
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());
for (int i = 0; i < N; i++) {
// cout <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,544 | 746,545 | u603067482 | cpp |
p02947 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int n;
c... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
int n;
c... | [
"variable_declaration.type.change"
] | 746,546 | 746,547 | u870074807 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 746,548 | 746,549 | u967963596 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PB push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
multiset<map<char, int>> fs;
set<map<char, int>> unq;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
map<char, int> f;
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PB push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
multiset<map<char, int>> fs;
set<map<char, int>> unq;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
map<char, int> f;
f... | [
"variable_declaration.type.change"
] | 746,553 | 746,554 | u393879608 | cpp |
p02947 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#i... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#i... | [] | 746,555 | 746,556 | u114137758 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
using namespace std;
/*
https://atcoder.jp/contests/abc137/tasks/abc137_c
ๆๅญๅใฝใผใใใฆใ้
ๅใใจใฝใผใใใฆใๆฏในใฆใใ
*/
int main() {
int N, count = 0;
string temp;
map<string, long long> mp;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> temp;
s... | #include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
using namespace std;
/*
https://atcoder.jp/contests/abc137/tasks/abc137_c
ๆๅญๅใฝใผใใใฆใ้
ๅใใจใฝใผใใใฆใๆฏในใฆใใ
*/
int main() {
long int N, count = 0;
string temp;
map<string, long long> mp;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> temp;
... | [
"variable_declaration.type.widen.change"
] | 746,563 | 746,564 | u568426505 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end());
vector<int> A;
int count = 1;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == S.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end());
vector<long long> A;
long long count = 1;
for (int i = 0; i < N - 1; i++) {
if (S... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,565 | 746,566 | u028061225 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end());
vector<long long> A;
long long count = 1;
for (int i = 0; i < N - 1; i++) {
if (S... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
sort(S.at(i).begin(), S.at(i).end());
}
sort(S.begin(), S.end());
vector<long long> A;
long long count = 1;
for (int i = 0; i < N - 1; i++) {
if (S... | [
"variable_declaration.value.change"
] | 746,567 | 746,566 | u028061225 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0;
string s;
map<string, int> m;
cin >> n;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
a += m[s]++;
}
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a = 0;
string s;
map<string, int> m;
cin >> n;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
a += m[s]++;
}
cout << a;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,571 | 746,572 | u232429509 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
string s;
map<string, int> m;
cin >> n;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
a += m[s]++;
}
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a = 0;
string s;
map<string, int> m;
cin >> n;
while (n--) {
cin >> s;
sort(s.begin(), s.end());
a += m[s]++;
}
cout << a;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.value.change"
] | 746,573 | 746,572 | u232429509 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
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());
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
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());
... | [
"literal.number.type.widen.change"
] | 746,574 | 746,575 | u852770206 | cpp |
p02947 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ARB \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ARB \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | [
"variable_declaration.type.change",
"assignment.change"
] | 746,576 | 746,577 | u973466769 | cpp |
p02947 | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, i... | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, i... | [] | 746,580 | 746,581 | u539826121 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s] += 1;
}
ll ans = 0;
for (auto x : mp)
ans += x.second * (x.second - 1) / 2;
cout <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s] += 1;
}
ll ans = 0;
for (auto x : mp)
ans += x.second * (x.second - 1) / 2;
cout << ... | [] | 746,582 | 746,583 | u050087249 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll x) {
if (x == 1)
return 1;
return x * f(x - 1);
}
int main() {
ll n;
cin >> n;
vector<vector<char>> alpha(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size(); j++)
alpha.at(i).p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll x) {
if (x == 1)
return 1;
return x * f(x - 1);
}
int main() {
ll n;
cin >> n;
vector<vector<char>> alpha(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size(); j++)
alpha.at(i).p... | [
"variable_declaration.type.change"
] | 746,584 | 746,585 | u050087249 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = std::vector<T>;
using vvi = std::vector<vt<int>>;
int main() {
int N;
std::cin >> N;
vt<std::string> s(N);
vt<int> tl(N);
rep(i, N) {
std::string moji;
std::cin >> moji;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = std::vector<T>;
using vvi = std::vector<vt<int>>;
int main() {
int N;
std::cin >> N;
vt<std::string> s(N);
vt<ll> tl(N);
rep(i, N) {
std::string moji;
std::cin >> moji;
... | [] | 746,586 | 746,587 | u228943017 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = std::vector<T>;
using vvi = std::vector<vt<int>>;
int main() {
int N;
std::cin >> N;
vt<std::string> s(N);
vt<int> tl(N);
rep(i, N) {
std::string moji;
std::cin >> moji;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = std::vector<T>;
using vvi = std::vector<vt<int>>;
int main() {
int N;
std::cin >> N;
vt<std::string> s(N);
vt<ll> tl(N);
rep(i, N) {
std::string moji;
std::cin >> moji;
... | [
"variable_declaration.value.change"
] | 746,588 | 746,587 | u228943017 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
map<string, int> msi... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
map<string, ll> msi;... | [] | 746,589 | 746,590 | u418810472 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n)... | [
"variable_declaration.type.change"
] | 746,591 | 746,592 | u950174376 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n)... | [
"variable_declaration.type.change"
] | 746,593 | 746,592 | u950174376 | 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 all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 100000... | #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 all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 100000... | [
"variable_declaration.type.change"
] | 746,594 | 746,595 | u274883254 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<string> s(n);
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
//*rep(i, n) cout << s[i] <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
//*rep(i, n) cout << s[i] << ... | [
"variable_declaration.type.change"
] | 746,596 | 746,597 | u274883254 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using V = vector<int>;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using V = vector<int>;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
v... | [
"variable_declaration.type.change"
] | 746,598 | 746,599 | u525008368 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, cnt = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
for (int i = 0; i < n - 1; i++) {
int a = 0, b = 0;
if (s[i] == s[i + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, ans = 0, cnt = 0;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s.begin(), s.end());
for (int i = 0; i < n - 1; i++) {
long long int a = 0, b = 0;
... | [
"variable_declaration.type.widen.change"
] | 746,602 | 746,603 | u125051909 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> smap;
ll ans = 0;
rep(i, n) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
smap[s.at(i)]++;
}
f... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, ll> smap;
ll ans = 0;
rep(i, n) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
smap[s.at(i)]++;
}
fo... | [
"call.remove",
"call.arguments.change"
] | 746,604 | 746,605 | u915797797 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | [
"type_conversion.add"
] | 746,606 | 746,607 | u276588887 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
int n;
cin >> n;
vector<string> arr(n + 1, "");
for (int i = 0; i < n; i++) {
cin >> arr[i];
sort(arr[i].begin(), arr[i].end());
}
sort(arr.begin(), arr.end() - 1)... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ll n;
cin >> n;
vector<string> arr(n + 1, "");
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sort(arr[i].begin(), arr[i].end());
}
sort(arr.begin(), arr.end() - 1);
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 746,608 | 746,609 | u764378605 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
int n;
cin >> n;
vector<string> arr(n + 1, "");
for (int i = 0; i < n; i++) {
cin >> arr[i];
sort(arr[i].begin(), arr[i].end());
}
sort(arr.begin(), arr.end());
... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ll n;
cin >> n;
vector<string> arr(n + 1, "");
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sort(arr[i].begin(), arr[i].end());
}
sort(arr.begin(), arr.end() - 1);
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 746,610 | 746,609 | u764378605 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.... | [
"variable_declaration.type.change"
] | 746,611 | 746,612 | u021108615 | cpp |
p02947 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int64_t sub(int64_t n) {
int a = (n + 1) * n / 2;
return a;
}
int main() {
int64_t N;
cin >> N;
map<string, int64_t> m;
for (int64_t i = 0; i... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int64_t sub(int64_t n) {
int64_t a = (n + 1) * n / 2;
return a;
}
int main() {
int64_t N;
cin >> N;
map<string, int64_t> m;
for (int64_t i = ... | [
"variable_declaration.type.primitive.change"
] | 746,614 | 746,615 | u295279251 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
double min_double(double a, double b) {
if (a < b)
return a;
else
return b;
}
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
double min_double(double a, double b) {
if (a < b)
return a;
else
return b;
}
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
... | [
"variable_declaration.type.primitive.change"
] | 746,618 | 746,619 | u389834932 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define Rep(i, s, n) for (ll i = (ll)s; i < (ll)n; i++)
typedef long long ll;
using namespace std;
int main(void) {
int n;
cin >> n;
string s;
set<string> set;
unordered_map<string, int> map;
ll res = 0;
rep(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define Rep(i, s, n) for (ll i = (ll)s; i < (ll)n; i++)
typedef long long ll;
using namespace std;
int main(void) {
int n;
cin >> n;
string s;
set<string> set;
unordered_map<string, int> map;
ll res = 0;
rep(i,... | [
"variable_declaration.type.change"
] | 746,620 | 746,621 | u154465766 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define Rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
typedef long long ll;
using namespace std;
int main(void) {
int n;
cin >> n;
string s;
set<string> set;
unordered_map<string, int> map;
ll res = 0;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define Rep(i, s, n) for (ll i = (ll)s; i < (ll)n; i++)
typedef long long ll;
using namespace std;
int main(void) {
int n;
cin >> n;
string s;
set<string> set;
unordered_map<string, int> map;
ll res = 0;
rep(i,... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 746,622 | 746,621 | u154465766 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>... | [
"type_conversion.add"
] | 746,623 | 746,624 | u743124029 | cpp |
p02947 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Vec = vector<int>;
bool Isprime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // ๅถๆฐใฏใใใใใ้คใ
double sqrtNum = sqrt(num);
for (int i = 3;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Vec = vector<int>;
bool Isprime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // ๅถๆฐใฏใใใใใ้คใ
double sqrtNum = sqrt(num);
for (int i = 3; ... | [
"variable_declaration.type.change"
] | 746,627 | 746,628 | u275409294 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using pp = pair<int, int>;
using ll = long long;
int main() {
int N, m = 0;
cin >> N;
vector<string> S(N);
set<string> ss;
map<string, int> M;
for (int i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
ss.insert(S[i]);
M[S[i]]++;... | #include <bits/stdc++.h>
using namespace std;
using pp = pair<int, int>;
using ll = long long;
int main() {
ll N, m = 0;
cin >> N;
vector<string> S(N);
set<string> ss;
map<string, ll> M;
for (ll i = 0; i < N; i++) {
cin >> S[i];
sort(S[i].begin(), S[i].end());
ss.insert(S[i]);
M[S[i]]++;
... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 746,629 | 746,630 | u927463074 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
int main() {
int n;
cin >> n;
multimap<string, int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
int main() {
int n;
cin >> n;
multimap<string, ll>... | [] | 746,631 | 746,632 | u010415482 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
string s[n];
map<string, long double> ma;
int cnt = 0;
for (int i = 0; i < n; i++) {
string x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
string s[n];
map<string, ll> ma;
int cnt = 0;
for (int i = 0; i < n; i++) {
string x;
cin... | [
"variable_declaration.type.narrow.change"
] | 746,633 | 746,634 | u010415482 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) {
rep(j, 10) { sort(s[i].begin(), s[i].end()); }
}
map<string, ll> cnt;
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) {
rep(j, 10) { sort(s[i].begin(), s[i].end()); }
}
map<string, ll> cnt;
r... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 746,635 | 746,636 | u052656528 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) {
rep(j, 10) { sort(s[i].begin(), s[i].end()); }
}
map<string, int> cnt;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(i, n) {
rep(j, 10) { sort(s[i].begin(), s[i].end()); }
}
map<string, ll> cnt;
r... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 746,637 | 746,636 | u052656528 | cpp |
p02947 | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define irrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define irrep2(i, n, a) for (int i = (int)(... | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define irrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define irrep2(i, n, a) for (int i = (int)(... | [
"variable_declaration.type.change"
] | 746,640 | 746,641 | u829260400 | cpp |
p02947 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
//#include <queue>
using namespace std;
#define n_max 10000
#define INF 10001000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep2(i, a, n) for (int i = a; i <= n; i++)
#define rrep(i, a, n) fo... | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
//#include <queue>
using namespace std;
#define n_max 10000
#define INF 10001000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep2(i, a, n) for (int i = a; i <= n; i++)
#define rrep(i, a, n) fo... | [
"variable_declaration.type.widen.change"
] | 746,642 | 746,643 | u829260400 | cpp |
p02947 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
//#include <queue>
using namespace std;
#define n_max 10000
#define INF 10001000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep2(i, a, n) for (int i = a; i <= n; i++)
#define rrep(i, a, n) fo... | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
//#include <queue>
using namespace std;
#define n_max 10000
#define INF 10001000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep2(i, a, n) for (int i = a; i <= n; i++)
#define rrep(i, a, n) fo... | [
"variable_declaration.type.widen.change"
] | 746,644 | 746,643 | u829260400 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
//#include<set>
//#include<vector>
//#include<iomanip>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
map<string, long long> arr;
char x[11];
for (int i = 0; i < n; i++) {
cin >> x;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
//#include<set>
//#include<vector>
//#include<iomanip>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
map<string, long long> arr;
char x[11];
for (int i = 0; i < n; i++) {
cin ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,645 | 746,646 | u200320655 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
//#include<set>
//#include<vector>
//#include<iomanip>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
map<string, int> arr;
char x[11];
for (int i = 0; i < n; i++) {
cin >> x;
so... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
//#include<set>
//#include<vector>
//#include<iomanip>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
map<string, long long> arr;
char x[11];
for (int i = 0; i < n; i++) {
cin ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,647 | 746,646 | u200320655 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
string s[N];
set<string> st;
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
st.insert(s[i]);
}
map<string, int> mp;
for (string p : st... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
string s[N];
set<string> st;
rep(i, N) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
st.insert(s[i]);
}
map<string, int> mp;
for (string p : st... | [
"type_conversion.add"
] | 746,648 | 746,649 | u499062271 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, int> mp;
int ans = 0;
for (int i = 0; i < n; i++) {
string foo;
cin >> foo;
sort(foo.begin(), foo.end());
ans += mp[foo];
mp[foo]++;
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, long long> mp;
long long ans = 0;
for (int i = 0; i < n; i++) {
string foo;
cin >> foo;
sort(foo.begin(), foo.end());
ans += mp[foo];
mp[foo]++;
}
cout... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,650 | 746,651 | u279033107 | cpp |
p02947 | #include <bits/stdc++.h>
#include <stdio.h>
#include <string.h>
using namespace std;
using std::cout;
#include <algorithm>
#include <map>
int main() {
long long n, m = 0;
cin >> n;
map<string, int> freq;
string x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
sort(x[i].begin(), x[i].end());
}
for ... | #include <bits/stdc++.h>
#include <stdio.h>
#include <string.h>
using namespace std;
using std::cout;
#include <algorithm>
#include <map>
int main() {
long long n, m = 0;
cin >> n;
map<string, long long> freq;
string x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
sort(x[i].begin(), x[i].end());
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,652 | 746,653 | u474448122 | cpp |
p02947 | #include <bits/stdc++.h>
#include <stdio.h>
#include <string.h>
using namespace std;
using std::cout;
#include <algorithm>
#include <map>
int main() {
int n, m = 0;
cin >> n;
map<string, int> freq;
string x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
sort(x[i].begin(), x[i].end());
}
for (int i... | #include <bits/stdc++.h>
#include <stdio.h>
#include <string.h>
using namespace std;
using std::cout;
#include <algorithm>
#include <map>
int main() {
long long n, m = 0;
cin >> n;
map<string, long long> freq;
string x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
sort(x[i].begin(), x[i].end());
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,655 | 746,653 | u474448122 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define UNIQUE(v) \
v.erase(unique(v.begin(), v.end()), v.end()) // sortใใฆใใไฝฟใ
#define INF 2147483647
#define LLINF... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define UNIQUE(v) \
v.erase(unique(v.begin(), v.end()), v.end()) // sortใใฆใใไฝฟใ
#define INF 2147483647
#define LLINF... | [] | 746,656 | 746,657 | u166553470 | cpp |
p02947 | // Author: howso
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ti... | // Author: howso
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ti... | [] | 746,658 | 746,659 | u652423305 | 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++) {
string s;
cin >> s;
sort(s.begin(), s.end());
S.at(i) = s;
}
sort(S.begin(), S.end());
int cnt = 1, ans = 0;
for (int i = 1; i < n; i++) {
if (S.at(i) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> S(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
S.at(i) = s;
}
sort(S.begin(), S.end());
long cnt = 1, ans = 0;
for (int i = 1; i < n; i++) {
if (S.at(i)... | [
"variable_declaration.type.primitive.change"
] | 746,662 | 746,663 | u367958900 | cpp |
p02947 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
#define maxs(x, y) x = max(x, y)
#define mins(x... | [
"variable_declaration.type.change"
] | 746,664 | 746,665 | u818755983 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
#define ll long long int
#define CON 100010
const long long mod = 1e9 + 7;
const int INF = 1001001001;
const int inf = 100000;
// const ll inf=1e9+7;
// const ll ful=1e18;
using namespace std;
// namespace mp = ... | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
#define ll long long int
#define CON 100010
const long long mod = 1e9 + 7;
const int INF = 1001001001;
const int inf = 100000;
// const ll inf=1e9+7;
// const ll ful=1e18;
using namespace std;
// namespace mp = ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 746,666 | 746,667 | u363550661 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
#define ll long long int
#define CON 100010
const long long mod = 1e9 + 7;
const int INF = 1001001001;
const int inf = 100000;
// const ll inf=1e9+7;
// const ll ful=1e18;
using namespace std;
// namespace mp = ... | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
#define ll long long int
#define CON 100010
const long long mod = 1e9 + 7;
const int INF = 1001001001;
const int inf = 100000;
// const ll inf=1e9+7;
// const ll ful=1e18;
using namespace std;
// namespace mp = ... | [
"variable_declaration.type.change"
] | 746,668 | 746,667 | u363550661 | cpp |
p02947 | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
#define ll long long int
#define CON 100010
const long long mod = 1e9 + 7;
const int INF = 1001001001;
const int inf = 100000;
// const ll inf=1e9+7;
// const ll ful=1e18;
using namespace std;
// namespace mp = ... | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
//#include <boost/multiprecision/cpp_int.hpp>
#define ll long long int
#define CON 100010
const long long mod = 1e9 + 7;
const int INF = 1001001001;
const int inf = 100000;
// const ll inf=1e9+7;
// const ll ful=1e18;
using namespace std;
// namespace mp = ... | [
"variable_declaration.type.change"
] | 746,669 | 746,667 | u363550661 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int combination(int n, int r) {
if (r == 0 || r == n)
return 1;
else if (r == 1)
return n;
return (combination(n - 1, r - 1) + combination(n - 1, r));
}
int main() {
int n;
cin >> n;
map<string, int> moji;
for (int i = 0; i < n; i++) {
string s;
... | #include <bits/stdc++.h>
using namespace std;
long long combination(int n, int r) {
if (r == 0 || r == n)
return 1;
else if (r == 1)
return n;
return (combination(n - 1, r - 1) + combination(n - 1, r));
}
int main() {
int n;
cin >> n;
map<string, int> moji;
for (int i = 0; i < n; i++) {
string... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,670 | 746,671 | u550374978 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(100000);
map<string, int> mp;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (mp.count(s[i])) {
ans += mp[s[i]];
mp[s[i]]++;
} else {
mp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(100000);
map<string, int> mp;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (mp.count(s[i])) {
ans += mp[s[i]];
mp[s[i]]++;
} else {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,674 | 746,675 | u277318398 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
map<string, int> mp;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (mp.count(s[i])) {
ans += mp[s[i]];
mp[s[i]]++;
} else {
mp[s[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(100000);
map<string, int> mp;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
if (mp.count(s[i])) {
ans += mp[s[i]];
mp[s[i]]++;
} else {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,676 | 746,675 | u277318398 | cpp |
p02947 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"variable_declaration.type.change"
] | 746,679 | 746,680 | u151236434 | cpp |
p02947 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"variable_declaration.type.change"
] | 746,681 | 746,680 | u151236434 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s;
for (int i = 0; i < n; i++) {
string _s;
cin >> _s;
sort(_s.begin(), _s.end());
s.push_back(_s);
}
sort(s.begin(), s.end());
// for (auto c: s) cout << c << endl;
int b = 0;
int e = b + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s;
for (int i = 0; i < n; i++) {
string _s;
cin >> _s;
sort(_s.begin(), _s.end());
s.push_back(_s);
}
sort(s.begin(), s.end());
// for (auto c: s) cout << c << endl;
int b = 0;
int e = b + 1;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,682 | 746,683 | u619557935 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
template <typename T, typename Q>
istream &operator>>(istream &is, pair<T, Q> &p) {
return is >> p.first >> p.second;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
template <typename T, typename Q>
istream &operator>>(istream &is, pair<T, Q> &p) {
return is >> p.first >> p.second;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> ... | [
"type_conversion.add"
] | 746,684 | 746,685 | u070211042 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
sort(str.begin(), str.end());
m[str]++;
}
long long ans = 0;
for (pair<string, int> e : m)
ans += ((e.second * (e.second - 1)) / 2);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, long long> m;
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
sort(str.begin(), str.end());
m[str]++;
}
long long ans = 0;
for (pair<string, long long> e : m)
ans += ((e.second * (e.second ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,686 | 746,687 | u574392068 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, ans = 0;
;
cin >> N;
vector<string> S(N + 1);
unordered_map<string, int> UM;
for (int i = 1; i <= N; ++i)
cin >> S[i];
for (int i = 1; i <= N; ++i) {
sort(S[i].begin(), S[i].end());
++UM[S[i]];
}
for (auto itr = UM.be... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, ans = 0;
;
cin >> N;
vector<string> S(N + 1);
unordered_map<string, long long> UM;
for (int i = 1; i <= N; ++i)
cin >> S[i];
for (int i = 1; i <= N; ++i) {
sort(S[i].begin(), S[i].end());
++UM[S[i]];
}
for (auto itr =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 746,690 | 746,691 | u402717316 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
i... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
i... | [
"variable_declaration.type.change"
] | 746,692 | 746,693 | u475843109 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
string s;
map<string, int> mp;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto x... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
string s;
map<string, ll> mp;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto x ... | [
"variable_declaration.type.change"
] | 746,694 | 746,695 | u747602774 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // ๆ้ ใฝใผใ
#define rall(v) (v).rbegin(), (v).rend() // ้้ ใฝใผใ
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // ๆ้ ใฝใผใ
#define rall(v) (v).rbegin(), (v).rend() // ้้ ใฝใผใ
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | [] | 746,696 | 746,697 | u084949493 | 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 = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll n... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll n... | [] | 746,698 | 746,699 | u730499268 | cpp |
p02947 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | [
"variable_declaration.type.primitive.change"
] | 746,700 | 746,701 | u262646906 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
string s;
multiset<string> ms;
for (int i = 0; i < N; ++i) {
cin >> s;
sort(s.begin(), s.end());
ms.insert(s);
}
int cnt = 0, c = 0;
for (auto itr = ms.begin(); itr != ms.end();) {
c = m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
string s;
multiset<string> ms;
for (int i = 0; i < N; ++i) {
cin >> s;
sort(s.begin(), s.end());
ms.insert(s);
}
ll cnt = 0, c = 0;
for (auto itr = ms.begin(); itr != ms.end();) {
c = ms... | [
"variable_declaration.type.change"
] | 746,702 | 746,703 | u768347697 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.