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 all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; +... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<string, int> m;
for (int i = 0; i < n; +... | [
"assignment.change"
] | 746,979 | 746,980 | u562319622 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> c(1000001);
for (ll i = 1; i < 1000001; i++) {
c.at(i) = i - 1 + c.at(i - 1);
}
int n, ans = 0;
string s;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> c(1000001);
for (ll i = 1; i < 1000001; i++) {
c.at(i) = i - 1 + c.at(i - 1);
}
ll n, ans = 0;
string s;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.change"
] | 746,986 | 746,987 | u573909039 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> c(1000001);
for (int i = 1; i < 1000001; i++) {
c.at(i) = i - 1 + c.at(i - 1);
}
int n, ans = 0;
string s;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> c(1000001);
for (ll i = 1; i < 1000001; i++) {
c.at(i) = i - 1 + c.at(i - 1);
}
ll n, ans = 0;
string s;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 746,988 | 746,987 | u573909039 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> c(100001);
for (int i = 1; i < 100001; i++) {
c.at(i) = i - 1 + c.at(i - 1);
}
int n, ans = 0;
string s;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<ll> c(1000001);
for (ll i = 1; i < 1000001; i++) {
c.at(i) = i - 1 + c.at(i - 1);
}
ll n, ans = 0;
string s;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 746,989 | 746,987 | u573909039 | cpp |
p02947 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数... | [
"variable_declaration.type.change"
] | 746,990 | 746,991 | u545938555 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<vector<char>> A(N, vector<char>(10, ' '));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> A[i][j];
};
}
for (int i = 0; i < N; i++) {
sor... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<vector<char>> A(N, vector<char>(10, ' '));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> A[i][j];
};
}
for (int i = 0; i < N; i++) {
sort... | [
"variable_declaration.type.change"
] | 746,994 | 746,995 | u575802441 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<vector<char>> A(N, vector<char>(10, ' '));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> A[i][j];
};
}
for (int i = 0; i < N; i++) {
sor... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<vector<char>> A(N, vector<char>(10, ' '));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> A[i][j];
};
}
for (int i = 0; i < N; i++) {
sort... | [
"variable_declaration.type.change"
] | 746,996 | 746,995 | u575802441 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
map<string, int> mp;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
ans += mp[str] - 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
map<string, long> mp;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
mp[str]++;
ans += mp[str] - 1;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 746,997 | 746,998 | u675751622 | cpp |
p02947 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 1000000001
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> S;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 1000000001
using ll = long long;
int main() {
int n;
cin >> n;
map<string, int> S;
rep(i, n) {
string s;
cin >> s;
sort(s.begin(... | [
"type_conversion.add"
] | 746,999 | 747,000 | u765815947 | cpp |
p02947 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
ll nC2(int n) {
ll ans = n * (n - 1) / 2;
return ans;
}
int main() {
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
ll nC2(int n) {
ll ans = (ll)n * (n - 1) / 2;
return ans;
}
int main()... | [
"type_conversion.add"
] | 747,003 | 747,004 | u263000123 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
map<map<int, int>, int> mp;
rep(i, n) {
stri... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
map<map<ll, ll>, ll> mp;
rep(i, n) {
string ... | [] | 747,005 | 747,006 | u482770395 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
long long ans;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
long long ans = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans;
} | [
"variable_declaration.value.change"
] | 747,007 | 747,008 | u297195722 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> m;
long long ans;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> m;
long long ans = 0;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans;
} | [
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 747,007 | 747,009 | u297195722 | 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>;
string s[100000];
unordered_map<string, int> wordcnt;
void Main() {
int N;
cin >> N;
rep(i, N) {
cin >> s[i];
/*
rep(j, s[i].size()) {
if (wordcnt[i].fi... | #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>;
string s[100000];
unordered_map<string, int> wordcnt;
void Main() {
int N;
cin >> N;
rep(i, N) {
cin >> s[i];
/*
rep(j, s[i].size()) {
if (wordcnt[i].fi... | [
"type_conversion.add"
] | 747,010 | 747,011 | u900523387 | cpp |
p02947 | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/03/12.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
//
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n),... | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/03/12.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
//
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n),... | [
"variable_declaration.type.change"
] | 747,012 | 747,013 | u671267423 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(j, n) {
cin >> s.at(j);
vector<char> memo(10);
rep(i, 10) memo.at(i) = s.at(j).at(i);
sort(memo.begin(), memo.end());
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(j, n) {
cin >> s.at(j);
vector<char> memo(10);
rep(i, 10) memo.at(i) = s.at(j).at(i);
sort(memo.begin(), memo.end());
... | [] | 747,016 | 747,017 | u297398560 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(j, n) {
cin >> s.at(j);
vector<char> memo(10);
rep(i, 10) memo.at(i) = s.at(j).at(i);
sort(memo.begin(), memo.end());
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(j, n) {
cin >> s.at(j);
vector<char> memo(10);
rep(i, 10) memo.at(i) = s.at(j).at(i);
sort(memo.begin(), memo.end());
... | [
"variable_declaration.type.change"
] | 747,018 | 747,017 | u297398560 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, ans = 0;
cin >> N;
unordered_map<string, int> m(N);
string s;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
ll ans = 0;
cin >> N;
unordered_map<string, int> m(N);
string s;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
ans += m[s];
m[s]++;
}
cout << ans << endl;
} | [] | 747,019 | 747,020 | u115106582 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
int n;
cin >> n;
map<string, int> mp;
for (size_t i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.e... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
int n;
cin >> n;
map<string, ll> mp;
for (size_t i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.en... | [] | 747,021 | 747,022 | u789199225 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#defi... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#defi... | [
"variable_declaration.type.change"
] | 747,023 | 747,024 | u921391957 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string x;
vector<string> c(n + 1);
for (int i = 0; i < n; i++) {
cin >> x;
sort(x.begin(), x.end());
c[i] = x;
}
c[n] = "zzzzzzzzzzz";
sort(c.begin(), c.end());
int ans = 0;
int count = 1;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string x;
vector<string> c(n + 1);
for (int i = 0; i < n; i++) {
cin >> x;
sort(x.begin(), x.end());
c[i] = x;
}
c[n] = "zzzzzzzzzzz";
sort(c.begin(), c.end());
int64_t ans = 0;
int64_t count = 1;
for (int... | [
"variable_declaration.type.primitive.change"
] | 747,025 | 747,026 | u028906014 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans * i;
}
for (int i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int main() {
int n;
cin >> n;
map<string, int> s;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
long nCr(int n, int r) {
long ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans * i;
}
for (int i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int main() {
ll n;
cin >> n;
map<string, ll> s;
for (int i = 0; i ... | [
"variable_declaration.type.change"
] | 747,027 | 747,028 | u998732100 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
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]++;
}
ll ans = 0;
for (auto &r : m) {
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
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]++;
}
ll ans = 0;
for (auto &r : m) {
a... | [
"type_conversion.add"
] | 747,029 | 747,030 | u146594935 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int now = 0;
string nows = s.at(0);
long long ans = 0;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int now = 0;
string nows = s.at(0);
long long ans = 0;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,031 | 747,032 | u412837450 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int now = 0;
string nows = s.at(0);
long long ans = 0;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
int now = 0;
string nows = s.at(0);
long long ans = 0;
for (int i = 0; i < n; i++... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 747,033 | 747,032 | u412837450 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, cnt = 1;
long long ans = 0;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(k, n) sort(s[k].begin(), s[k].end());... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
long long n, cnt = 1;
long long ans = 0;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
rep(k, n) sort(s[k].begin(), s[k].e... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,034 | 747,035 | u088751997 | cpp |
p02947 | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef queue<int> qi;
typedef queue<pair<int, int>> ... | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef queue<int> qi;
typedef queue<pair<int, int>> ... | [] | 747,036 | 747,037 | u640888913 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
int mai... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
int mai... | [
"variable_declaration.type.change"
] | 747,038 | 747,039 | u721082205 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | [
"type_conversion.add"
] | 747,040 | 747,041 | u737491054 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | [
"type_conversion.add"
] | 747,042 | 747,041 | u737491054 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | [] | 747,040 | 747,043 | u737491054 | cpp |
p02947 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// only when b... | [] | 747,042 | 747,043 | u737491054 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
ll ans = 0;
cin >> N;
map<string, int> s;
rep(i, N) {
string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
s[tmp]++;
}
for (auto p : s) {
ans... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
ll ans = 0;
cin >> N;
map<string, ll> s;
rep(i, N) {
string tmp;
cin >> tmp;
sort(tmp.begin(), tmp.end());
s[tmp]++;
}
for (auto p : s) {
ans ... | [] | 747,044 | 747,045 | u433189059 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for... | [] | 747,048 | 747,049 | u190761897 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,052 | 747,053 | u207310767 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
string s[n];
map<string, int> m;
for (int i = 0; i < n; i++) {
vector<char> v;
for (int j = 0; j < 10; j++) {
char c;
cin >> ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
string s[n];
map<string, int> m;
for (int i = 0; i < n; i++) {
vector<char> v;
for (int j = 0; j < 10; j++) {
char c;
cin >> ... | [
"variable_declaration.type.widen.change"
] | 747,054 | 747,055 | u489302942 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | [
"variable_declaration.value.change"
] | 747,056 | 747,057 | u799939777 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | [
"variable_declaration.value.change"
] | 747,058 | 747,057 | u799939777 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
using namespace std;
ll calc(int x) { return x * (x - 1) / 2; }
int main() {
ll n, count = 0;
cin >> n;
vector<string> s(n);... | #include <bits/stdc++.h>
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
using namespace std;
ll calc(ll x) { return x * (x - 1) / 2; }
int main() {
ll n, count = 0;
cin >> n;
vector<string> s(n);
... | [] | 747,061 | 747,062 | u259170411 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
using namespace std;
int calc(int x) { return x * (x - 1) / 2; }
int main() {
ll n, count = 0;
cin >> n;
vector<string> s(n)... | #include <bits/stdc++.h>
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
using namespace std;
ll calc(ll x) { return x * (x - 1) / 2; }
int main() {
ll n, count = 0;
cin >> n;
vector<string> s(n);
... | [] | 747,063 | 747,062 | u259170411 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, X = 0;
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());
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == S.at(i)) {
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, X = 0;
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());
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == S.at(i)) {
lo... | [
"variable_declaration.type.widen.change"
] | 747,064 | 747,065 | u820224016 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, X = 0;
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());
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == S.at(i)) {
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, X = 0;
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());
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == S.at(i)) {
lo... | [
"assignment.change",
"expression.operation.binary.remove"
] | 747,066 | 747,065 | u820224016 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, count = 0;
map<string, int> check;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
coun... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int count = 0;
map<string, int> check;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.... | [
"variable_declaration.type.widen.change"
] | 747,067 | 747,068 | u270272336 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
using namespace std;
int main() {
int n, sum = 0;
map<string, int> m;
map<string, int> m2;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
if (m.find(s) == m.en... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
using namespace std;
int main() {
long long int n, sum = 0;
map<string, int> m;
map<string, long long int> m2;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
i... | [
"variable_declaration.type.widen.change"
] | 747,071 | 747,072 | u964987395 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, K, T, W, H, M, C;
const int MAX = 5100000;
c... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, K, T, W, H, M, C;
const int MAX = 5100000;
c... | [
"variable_declaration.type.change"
] | 747,073 | 747,074 | u178618463 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_l... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_l... | [
"type_conversion.add"
] | 747,077 | 747,078 | u718394671 | cpp |
p02947 | // https://atcoder.jp/contests/abc018/tasks/abc018_4
#include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const int MAX = 10000;
static const l... | // https://atcoder.jp/contests/abc018/tasks/abc018_4
#include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const int MAX = 10000;
static const l... | [
"type_conversion.add"
] | 747,083 | 747,084 | u488878376 | cpp |
p02947 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using large = long long;
int main() {
int n;
cin >> n;
auto s = vector<string>(n);
auto table = map<string, int>();
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end(... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using large = long long;
int main() {
int n;
cin >> n;
auto s = vector<string>(n);
auto table = map<string, int>();
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end(... | [
"call.add",
"call.arguments.change"
] | 747,085 | 747,086 | u723394740 | cpp |
p02947 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> already;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> already;
for (int i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.begin(), s.end());
... | [
"expression.operation.binary.remove"
] | 747,087 | 747,088 | u323542775 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
string s;
map<string, int> mp;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for (auto iter = mp.begin(); iter != mp.end(); iter++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
string s;
map<string, int> mp;
rep(i, n) {
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
long long cnt = 0;
for (auto iter = mp.begin(); iter != mp.end(); iter++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,089 | 747,090 | u928712536 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, i, count, res = 0;
cin >> n;
string mem, s[n];
for (i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
mem = s[0];
count = 0;... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, i, count, res = 0;
cin >> n;
string mem, s[n];
for (i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
mem = s[0];
count = 0;
... | [
"variable_declaration.type.change"
] | 747,091 | 747,092 | u058348416 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i =... | [] | 747,100 | 747,101 | u001566280 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using... | [] | 747,102 | 747,103 | u880221923 | cpp |
p02947 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | [
"variable_declaration.type.primitive.change"
] | 747,109 | 747,110 | u294700660 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<char>> s(N, vector<char>(10));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> s.at(i).at(j);
}
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
long long ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<char>> s(N, vector<char>(10));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 10; j++) {
cin >> s.at(i).at(j);
}
sort(s.at(i).begin(), s.at(i).end());
}
sort(s.begin(), s.end());
long long ans =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,111 | 747,112 | u630211216 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
unordered_map<string, int> MAP;
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (MAP.count(s)) {
MAP[s]++;
ans += MAP[s];
} else {
MAP[s] = 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
unordered_map<string, int> MAP;
long long ans = 0;
for (int i = 0; i < N; i++) {
cin >> s;
sort(s.begin(), s.end());
if (MAP.count(s)) {
MAP[s]++;
ans += MAP[s];
} else {
MAP[s] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,117 | 747,118 | u265359795 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(c, i, n) for (int i = c; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(0, i, N) {
cin >> S.at(i);
sort(all(S.at(i)));
}
sort(all(S));
ll ans = 0;
int cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(c, i, n) for (int i = c; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(0, i, N) {
cin >> S.at(i);
sort(all(S.at(i)));
}
sort(all(S));
ll ans = 0;
ll coun... | [
"variable_declaration.type.change"
] | 747,121 | 747,122 | u124659583 | 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)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define SUM(c) accumulate((c).begin(), (c).end(), 0)
#define ALL(a) (a).begin(), (a).end()
// int gc... | #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)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define SUM(c) accumulate((c).begin(), (c).end(), 0)
#define ALL(a) (a).begin(), (a).end()
// int gc... | [
"variable_declaration.type.change"
] | 747,123 | 747,124 | u335278042 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
signed main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
template <class T = int> T in() {
T x;
cin >> x;
return (x);
}
signed main(... | [
"variable_declaration.type.change"
] | 747,125 | 747,126 | u017078415 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int seqsum(int N) {
int count = 0;
for (int i = 1; i < N; i++) {
count += i;
}
return count;
}
int main() {
int N;
map<string, int> ans;
cin >> N;
ll count = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll seqsum(ll N) {
ll count = 0;
for (int i = 1; i < N; i++) {
count += i;
}
return count;
}
int main() {
ll N;
map<string, ll> ans;
cin >> N;
ll count = 0;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
sort(s.beg... | [
"variable_declaration.type.change"
] | 747,127 | 747,128 | u241312295 | cpp |
p02947 | #include <bits/stdc++.h>-
using namespace std;
int main() {
int n;
cin >> n;
map<string, int> mp;
while (n--) {
string x;
cin >> x;
sort(x.begin(), x.end());
mp[x]++;
}
long long int C = 0;
for (auto i : mp) {
C += ((i.second * (i.second - 1)) / 2);
}
cout << C << endl;
return ... | #include <bits/stdc++.h>-
using namespace std;
int main() {
long long int n;
cin >> n;
map<string, long long int> mp;
while (n--) {
string x;
cin >> x;
sort(x.begin(), x.end());
mp[x]++;
}
long long int C = 0;
for (auto i : mp) {
C += ((i.second * (i.second - 1)) / 2);
}
cout << ... | [
"variable_declaration.type.widen.change"
] | 747,130 | 747,131 | u011250027 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int num, val = 0;
map<string, long long int> mp;
vector<int> vec;
string word;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> word;
sort(word.begin(), word.end());
mp[word]++;
}
for (auto it : mp)
vec.push_back(it.... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int num, val = 0;
map<string, long long int> mp;
vector<long long int> vec;
string word;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> word;
sort(word.begin(), word.end());
mp[word]++;
}
for (auto it : mp)
vec.pus... | [
"variable_declaration.type.widen.change"
] | 747,134 | 747,135 | u461825790 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int num, val = 0;
map<string, int> mp;
vector<int> vec;
string word;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> word;
sort(word.begin(), word.end());
mp[word]++;
}
for (auto it : mp)
vec.push_back(it.second);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int num, val = 0;
map<string, long long int> mp;
vector<long long int> vec;
string word;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> word;
sort(word.begin(), word.end());
mp[word]++;
}
for (auto it : mp)
vec.pus... | [
"variable_declaration.type.widen.change"
] | 747,136 | 747,135 | u461825790 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int num, val = 0;
map<string, int> mp;
vector<int> vec;
string word;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> word;
sort(word.begin(), word.end());
mp[word]++;
}
for (auto it : mp)
vec.push_back(it.second);
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int num, val = 0;
map<string, long long int> mp;
vector<long long int> vec;
string word;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> word;
sort(word.begin(), word.end());
mp[word]++;
}
for (auto it : mp)
vec.pus... | [
"variable_declaration.type.widen.change"
] | 747,137 | 747,135 | u461825790 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
int n;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
string c;
cin >> c;
sort(c.begin(), c.end());
mp[c]++;
}
int ans = 0;
for (auto x : mp) {
if (x.second >= 2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Welcome to my source code!
int main() {
int n;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
string c;
cin >> c;
sort(c.begin(), c.end());
mp[c]++;
}
ll ans = 0;
for (auto x : mp) {
if (x.second >= 2)... | [
"variable_declaration.type.change"
] | 747,138 | 747,139 | u440217234 | cpp |
p02947 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | [] | 747,140 | 747,141 | u412039195 | cpp |
p02947 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string temp;
cin >> temp;
sort(temp.begin(), temp.end());
S[i] = temp;
}
sort(S.begin(), S.end());
long ans = 0;
int n = 1;
string pr... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
string temp;
cin >> temp;
sort(temp.begin(), temp.end());
S[i] = temp;
}
sort(S.begin(), S.end());
long ans = 0;
long n = 1;
string p... | [
"variable_declaration.type.primitive.change"
] | 747,142 | 747,143 | u886569237 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string ss;
cin >> ss;
sort(ss.begin(), ss.end());
mp[ss]++;
}
int ans = 0;
for (auto &i : mp) {
int s = i.second;
ans += s * (s - 1) / 2;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
map<string, int> mp;
for (int i = 0; i < N; i++) {
string ss;
cin >> ss;
sort(ss.begin(), ss.end());
mp[ss]++;
}
long long ans = 0;
for (auto &i : mp) {
int s = i.second;
ans += (long long)s * (s - 1) / 2... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,144 | 747,145 | u770009793 | cpp |
p02947 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll INF = 1e16;
constexpr ll MOD = 1000000007;
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v ... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll INF = 1e16;
constexpr ll MOD = 1000000007;
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v ... | [] | 747,146 | 747,147 | u554843701 | cpp |
p02947 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
int n;
ll ans = 0;
cin >> n;
string s;
map<string, int> mp;
rep(i, 0, n) {
cin >> s;
sort(s.begin(), s.end());... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
int n;
ll ans = 0;
cin >> n;
string s;
map<string, ll> mp;
rep(i, 0, n) {
cin >> s;
sort(s.begin(), s.end());
... | [] | 747,148 | 747,149 | u293156359 | cpp |
p02947 | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
int n, ans = 0;
cin >> n;
string s;
map<string, int> mp;
rep(i, 0, n) {
cin >> s;
sort(s.begin(), s.end());
... | #define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef long long ll;
int main() {
int n;
ll ans = 0;
cin >> n;
string s;
map<string, ll> mp;
rep(i, 0, n) {
cin >> s;
sort(s.begin(), s.end());
... | [] | 747,150 | 747,149 | u293156359 | cpp |
p02947 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define mrep(p, mp) for (auto p : mp)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
map<string, ll> mp;
rep(i, n) {
string a;
cin >> a;
sort(a.begin(), a.end());
mp[a]++;
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define mrep(p, mp) for (auto p : mp)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
map<string, ll> mp;
rep(i, n) {
string a;
cin >> a;
sort(a.begin(), a.end());
mp[a]++;
... | [
"variable_declaration.type.change"
] | 747,151 | 747,152 | u383402878 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | [
"variable_declaration.type.change"
] | 747,153 | 747,154 | u398437835 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s[214514];
int main() {
ll n;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
sort(s, s + n);
vector<string> v;
for (int i = 1; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s[214514];
int main() {
ll n;
cin >> n;
map<string, ll> mp;
for (int i = 0; i < n; i++) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
mp[s[i]]++;
}
sort(s, s + n);
vector<string> v;
for (int i = 1; i < n; i++) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 747,155 | 747,156 | u774202056 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define endk '\n'
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
map<string, int> s;
string entra;
unsigned long long ans = 0;
while (n--) {
cin >> entra;
sort(entra.begin(), entra.end());
if (s.count(entra))
s... | #include <bits/stdc++.h>
using namespace std;
#define endk '\n'
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
map<string, long long> s;
string entra;
unsigned long long ans = 0;
while (n--) {
cin >> entra;
sort(entra.begin(), entra.end());
if (s.count(entra))
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,157 | 747,158 | u842789193 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define endk '\n'
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
unordered_map<string, int> s;
string entra;
unsigned long long ans = 0;
while (n--) {
cin >> entra;
sort(entra.begin(), entra.end());
if (s.count(entra... | #include <bits/stdc++.h>
using namespace std;
#define endk '\n'
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
map<string, long long> s;
string entra;
unsigned long long ans = 0;
while (n--) {
cin >> entra;
sort(entra.begin(), entra.end());
if (s.count(entra))
... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,159 | 747,158 | u842789193 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define endk '\n'
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
unordered_map<string, int> s;
string entra;
unsigned long long ans = 0;
while (n--) {
cin >> entra;
sort(entra.begin(), entra.end());
if (s.count(entra... | #include <bits/stdc++.h>
using namespace std;
#define endk '\n'
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
map<string, long long> s;
string entra;
unsigned long long ans = 0;
while (n--) {
cin >> entra;
sort(entra.begin(), entra.end());
if (s.count(entra))
... | [
"variable_declaration.type.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 747,160 | 747,158 | u842789193 | cpp |
p02947 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
int n;
cin >> n;
map<string, int> m;
string s;
for (int ... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
int n;
cin >> n;
map<string, ll> m;
string s;
for (int i... | [] | 747,161 | 747,162 | u755121033 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int ans = 0;
int N;
cin >> N;
vector<string> s(N);
map<string, int> p;
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++)
sort(s[i].begin(), s[i].end());
for (int i = 0; i < N; i++) {
p[s[i]] += 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int ans = 0;
long int N;
cin >> N;
vector<string> s(N);
map<string, long int> p;
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++)
sort(s[i].begin(), s[i].end());
for (int i = 0; i < N; i++) {
p[s[i]] +=... | [
"variable_declaration.type.widen.change",
"assignment.value.change",
"assignment.change"
] | 747,163 | 747,164 | u109191542 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int ans = 0;
int N;
cin >> N;
vector<string> s(N);
map<string, int> p;
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++)
sort(s[i].begin(), s[i].end());
for (int i = 0; i < N; i++) {
p[s[i]] += 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int ans = 0;
long int N;
cin >> N;
vector<string> s(N);
map<string, long int> p;
for (int i = 0; i < N; i++)
cin >> s[i];
for (int i = 0; i < N; i++)
sort(s[i].begin(), s[i].end());
for (int i = 0; i < N; i++) {
p[s[i]] +=... | [
"variable_declaration.type.widen.change"
] | 747,163 | 747,165 | u109191542 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main() {
int N, same_num;
ull ans = 0;
vector<string> vec;
string si, prev_si;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> si;
sort(si.begin(), si.end());
vec.push_back(si);
}
sort(vec.begin(), vec.end())... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main() {
ull N, same_num;
ull ans = 0;
vector<string> vec;
string si, prev_si;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> si;
sort(si.begin(), si.end());
vec.push_back(si);
}
sort(vec.begin(), vec.end())... | [
"variable_declaration.type.change"
] | 747,166 | 747,167 | u494249944 | cpp |
p02947 | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | [
"variable_declaration.type.change"
] | 747,168 | 747,169 | u401900157 | cpp |
p02947 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (int i = (int)0; i < (int)n; i++)
#define REP(i, m, n) for (int i = (int)m; i < (int)n;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9 + 7;
#define vec vector<int>
#define vecll vector<ll>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define rep(i, n) for (int i = (int)0; i < (int)n; i++)
#define REP(i, m, n) for (int i = (int)m; i < (int)n;... | [
"variable_declaration.type.change"
] | 747,172 | 747,173 | u929977034 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
int count = 1;
long long sum = 0;
for (int i = 1; i < N; i++) {
if (v[i - 1] == v[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
long long count = 1;
long long sum = 0;
for (int i = 1; i < N; i++) {
if (v[i - 1] == v[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,174 | 747,175 | u275786410 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
int count = 1, sum = 0;
for (int i = 1; i < N; i++) {
if (v[i - 1] == v[i]) {
count++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
sort(v[i].begin(), v[i].end());
}
sort(v.begin(), v.end());
long long count = 1;
long long sum = 0;
for (int i = 1; i < N; i++) {
if (v[i - 1] == v[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,176 | 747,175 | u275786410 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
#... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
#... | [
"assignment.change"
] | 747,177 | 747,178 | u858670323 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int64_t cnt = 0;
map<string, int> b;
set<string> a;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<char> t(10);
for (int j = 0; j < 10; j++)
t.at(j) = s.at(j);
sort(t.begin(), t.end());
str... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int64_t cnt = 0;
map<string, int64_t> b;
set<string> a;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<char> t(10);
for (int j = 0; j < 10; j++)
t.at(j) = s.at(j);
sort(t.begin(), t.end());
... | [
"variable_declaration.type.primitive.change"
] | 747,181 | 747,182 | u168860135 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int64_t cnt;
map<string, int> b;
set<string> a;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<char> t(10);
for (int j = 0; j < 10; j++)
t.at(j) = s.at(j);
sort(t.begin(), t.end());
string ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int64_t cnt = 0;
map<string, int64_t> b;
set<string> a;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<char> t(10);
for (int j = 0; j < 10; j++)
t.at(j) = s.at(j);
sort(t.begin(), t.end());
... | [
"variable_declaration.value.change",
"variable_declaration.type.primitive.change"
] | 747,183 | 747,182 | u168860135 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long n, cntr = 0, ans = 0;
string s[N], temp;
vector<long long> v;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
temp = s[0];
cntr = 0;
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long n, cntr = 0, ans = 0;
string s[N], temp;
vector<long long> v;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + n);
temp = s[0];
cntr = 0;
for (int i = 0... | [
"assignment.change"
] | 747,184 | 747,185 | u453901836 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp = {};
signed main() {
int n, ans = 0, a = 0;
string t;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
for (int j = 0; j < t.size() - 1; j++) {
for (int k = j + 1; k < t.size(); k++) {
if (t[k] > t[j]) {
swap(t[... | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp = {};
signed main() {
long long n, ans = 0, a = 0;
string t;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
for (int j = 0; j < t.size() - 1; j++) {
for (int k = j + 1; k < t.size(); k++) {
if (t[k] > t[j]) {
s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,186 | 747,187 | u899084195 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
signed main() {
int n, ans = 0, a = 0;
string t;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
for (int j = 0; j < t.size() - 1; j++) {
for (int k = j + 1; k < t.size(); k++) {
if (t[k] > t[j]) {
swap(t[k], t... | #include <bits/stdc++.h>
using namespace std;
map<string, int> mp = {};
signed main() {
long long n, ans = 0, a = 0;
string t;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
for (int j = 0; j < t.size() - 1; j++) {
for (int k = j + 1; k < t.size(); k++) {
if (t[k] > t[j]) {
s... | [
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,188 | 747,187 | u899084195 | cpp |
p02947 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
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] += 1;
}
int ans = 0;
for (auto itr = m.begin(); itr != m.end(); itr++)... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, ll> m;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
m[s] += 1;
}
ll ans = 0;
for (auto itr = m.begin(); itr != m.end(); itr++) {... | [
"variable_declaration.type.change"
] | 747,189 | 747,190 | u201553784 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, int> strs;
ll ans = 0;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (strs.find(s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, int> strs;
ll ans = 0;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (strs.find(s... | [
"variable_declaration.type.change"
] | 747,191 | 747,192 | u564182781 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
int main() {
int n;
cin >> n;
map<string, int> strs;
ll ans = 0;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (strs.find(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
int main() {
ll n;
cin >> n;
map<string, int> strs;
ll ans = 0;
rep(i, n) {
string str;
cin >> str;
sort(str.begin(), str.end());
if (strs.find(s... | [
"variable_declaration.type.change"
] | 747,193 | 747,192 | u564182781 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
long long com(int i) { return i * (i - 1) / 2; }
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());
}
// cout << endl;for(int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
long long com(long long i) { return i * (i - 1) / 2; }
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());
}
// cout << endl;for(int i = 0... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 747,198 | 747,199 | u613931538 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll... | [] | 747,202 | 747,203 | u222509161 | cpp |
p02947 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll... | [] | 747,204 | 747,203 | u222509161 | cpp |
p02947 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
unordered_map<string, int> mp;
int ans = 0;
for (int i = 0; i < N; i++) {
string S;
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
unordered_map<string, long> mp;
long ans = 0;
for (int i = 0; i < N; i++) {
string S;
... | [
"variable_declaration.type.primitive.change"
] | 747,205 | 747,206 | u845937249 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define tl 1'000'000'007
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
struct pr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define tl 1'000'000'007
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
struct pr... | [] | 747,218 | 747,219 | u852839243 | cpp |
p02947 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<string> S(n);
ll ans = 0;
ll cnt = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<string> S(n);
ll ans = 0;
ll cnt = 1;
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 747,220 | 747,221 | u852839243 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.