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 8
values |
|---|---|---|---|---|---|---|---|
p03095 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int N;
string S;
cin >> N >> S;
vector<int> cnt(26, 1);
for (int i = 0; i < N; i++) {
cnt[S[i] - 'a']++;
}
int res = 1;
for (int i = 0; i < 26; i++) {
res *= cnt[i];
res = res % INF;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int N;
string S;
cin >> N >> S;
vector<int> cnt(26, 1);
for (int i = 0; i < N; i++) {
cnt[S[i] - 'a']++;
}
int res = 1;
for (int i = 0; i < 26; i++) {
res *= cnt[i];
res = res % INF;
}
... | [
"expression.operation.binary.add"
] | 905,244 | 905,245 | u237390401 | cpp |
p03095 | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
typedef... | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
typedef... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 905,251 | 905,252 | u564182781 | cpp |
p03095 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long co[30] = {0};
long lon... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long co[30] = {0};
long lon... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,264 | 905,265 | u003026289 | cpp |
p03095 | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ve... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ve... | [
"literal.number.change",
"variable_declaration.value.change"
] | 905,293 | 905,294 | u798339690 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<ll> num(30, 0);
for (auto c : s) {
num[c - 'a']++;
}
ll ans = 1;
for (int i = 0; i < 26; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<ll> num(30, 0);
for (auto c : s) {
num[c - 'a']++;
}
ll ans = 1;
for (int i = 0; i < 26; ++i) {
... | [
"assignment.add"
] | 905,297 | 905,298 | u701556979 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#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 REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REP... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#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 REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REP... | [
"assignment.variable.change",
"call.arguments.change",
"call.arguments.add"
] | 905,305 | 905,306 | u540491484 | cpp |
p03095 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#... | [
"assignment.change"
] | 905,307 | 905,308 | u491256431 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 905,309 | 905,310 | u184335045 | cpp |
p03095 | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | [] | 905,315 | 905,316 | u632527507 | cpp |
p03095 | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | [
"variable_declaration.type.change"
] | 905,317 | 905,316 | u632527507 | cpp |
p03095 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 1e9 + 7;
int n;
string s;
string a = "abcdefghijklmnopqrstuvwxyz";
cin >> n >> s;
ll ans = 1;
ll vec[26] = {};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 26; j++) {
if (s[i] == a[j]) {
vec[... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 1e9 + 7;
int n;
string s;
string a = "abcdefghijklmnopqrstuvwxyz";
cin >> n >> s;
ll ans = 1;
ll vec[26] = {};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 26; j++) {
if (s[i] == a[j]) {
vec[... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,319 | 905,320 | u363369454 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 905,321 | 905,322 | u889915625 | cpp |
p03095 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | [
"assignment.value.change",
"expression.operation.binary.remove"
] | 905,341 | 905,342 | u498607746 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
vector<int64_t> A(26, 1);
for (int i = 0; i < N; i++) {
char x = s.at(i);
int y = x - 'a';
A.at(y)++;
}
int64_t ans = 1;
for (int i = 0; i < 26; i++) {
ans = (ans * A.at(i)) % 1000000007;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
vector<int64_t> A(26, 1);
for (int i = 0; i < N; i++) {
char x = s.at(i);
int y = x - 'a';
A.at(y)++;
}
int64_t ans = 1;
for (int i = 0; i < 26; i++) {
ans = (ans * A.at(i)) % 1000000007;
... | [
"expression.unary.arithmetic.add"
] | 905,361 | 905,362 | u101018317 | cpp |
p03095 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"expression.operation.binary.add"
] | 905,372 | 905,373 | u103850114 | cpp |
p03095 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD int(1e9 + 7)
#define INF (long long)(1e18)
int main() {
long long N;
vector<long long> c(26, 1... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD int(1e9 + 7)
#define INF (long long)(1e18)
int main() {
long long N;
vector<long long> c(26, 1... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,376 | 905,377 | u528005130 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
map<int, int> cnt;
char c;
for (int i = 0; i < n; ++i) {
cin >> c;
++cnt[c - 'a'];
}
int ans = 1, mod = 1e9 + 7;
for (auto &i : cnt)
ans = (ans * i.second + 1) / mod;
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
map<int, int> cnt;
char c;
for (int i = 0; i < n; ++i) {
cin >> c;
++cnt[c - 'a'];
}
int64_t ans = 1, mod = 1e9 + 7;
for (auto &i : cnt)
ans = (ans * (i.second + 1)) % mod;... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 905,410 | 905,409 | u104613587 | cpp |
p03095 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS ... | [] | 905,437 | 905,438 | u264265458 | cpp |
p03095 | #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 rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | #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 rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | [
"expression.operation.binary.add"
] | 905,441 | 905,442 | u853721692 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll ans = 1;
vector<int> count(2... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll ans = 1;
vector<int> count(2... | [
"call.arguments.change",
"call.add"
] | 905,465 | 905,466 | u465669072 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> count(26);
for (int i = 0; i < N; i++) {
count.at((int)(S.at(i) - 'a'))++;
}
ll ans = 1;
int div = 1000000007;
for (int i = 0; i < N; i++) {
ans *= count.at(i) + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> count(26);
for (int i = 0; i < N; i++) {
count.at((int)(S.at(i) - 'a'))++;
}
ll ans = 1;
int div = 1000000007;
for (int i = 0; i < 26; i++) {
ans *= count.at(i) +... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,474 | 905,475 | u433189059 | cpp |
p03095 | #include <bits/stdc++.h>
#define llong long long
#define mkpr make_pair
#define riterator reverse_iterator
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) {
if (ch == '-')
f = -1;
}
for (; isdigit(ch); ch = getchar()) {
x = x ... | #include <bits/stdc++.h>
#define llong long long
#define mkpr make_pair
#define riterator reverse_iterator
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) {
if (ch == '-')
f = -1;
}
for (; isdigit(ch); ch = getchar()) {
x = x ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,505 | 905,506 | u396278429 | cpp |
p03095 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int64_t n, mod = 1000000007, a = 0;
string s;
cin >> n >> s;
map<char, int64_t> m;
rep(i, n) {
if (!m.count(s[i]))
m[s[i]] = 1;
else
++m[s[i]];
}
for (auto p : m)... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int64_t n, mod = 1000000007, a = 1;
string s;
cin >> n >> s;
map<char, int64_t> m;
rep(i, n) {
if (!m.count(s[i]))
m[s[i]] = 1;
else
++m[s[i]];
}
for (auto p : m)... | [
"literal.number.change",
"variable_declaration.value.change"
] | 905,507 | 905,508 | u757584836 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, ans = 1;
string S;
cin >> N >> S;
vector<int64_t> A(26);
for (int i = 0; i < N; i++) {
A.at... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, ans = 1;
string S;
cin >> N >> S;
vector<int64_t> A(26);
for (int i = 0; i < N; i++) {
A.at... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,537 | 905,538 | u028572059 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
string s;
cin >> n >> s;
vector<ll> a(26);
for (ll i = 0; i < n; i++) {
a[s[i] - 'a']++;
}
ll ans = 1;
for (ll i = 0; i < 26; i++) {
ans *= a[i] + 1;
ans /= 100000007;
}
cout << ans - 1;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
string s;
cin >> n >> s;
vector<ll> a(26);
for (ll i = 0; i < n; i++) {
a[s[i] - 'a']++;
}
ll ans = 1;
for (ll i = 0; i < 26; i++) {
ans *= a[i] + 1;
ans %= 1000000007;
}
cout << ans - 1;
re... | [
"assignment.change"
] | 905,549 | 905,548 | u125051909 | cpp |
p03095 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | [] | 905,553 | 905,554 | u888094685 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (... | [
"expression.operation.binary.add"
] | 905,576 | 905,577 | u386769326 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"assignment.change"
] | 905,578 | 905,579 | u322177979 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
ll ans = 1;
vector<ll> al(26, 0);
for (int i = 0; i < n; i++) {
al[s[i] - 'a']++;
}
for (int i = 0; i < n; i++) {
ans *= (al[i] + 1);
ans %= MOD;
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
ll ans = 1;
vector<ll> al(26, 0);
for (int i = 0; i < n; i++) {
al[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
ans *= (al[i] + 1);
ans %= MOD;
}
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,600 | 905,601 | u003019316 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
typedef pair<int, int> P;
typedef priority_queue<int> Pr;
typedef vector<int> V;
typedef vector<P> Vp;
typedef map<int, int> MP;
const int mod = 1000000007;
const Int INF = 1145141919810893931;
#define END ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
typedef pair<int, int> P;
typedef priority_queue<int> Pr;
typedef vector<int> V;
typedef vector<P> Vp;
typedef map<int, int> MP;
const int mod = 1000000007;
const Int INF = 1145141919810893931;
#define END ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,618 | 905,619 | u735089337 | cpp |
p03095 | #include <iostream>
#include <map>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long n, result = 1;
string s;
cin >> n >> s;
map<char, long long> count;
for (char c : s) {
count[c]++;
}
for (auto &p : count) {
result = result * p.second % MOD;
}
cout << (result - ... | #include <iostream>
#include <map>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long n, result = 1;
string s;
cin >> n >> s;
map<char, long long> count;
for (char c : s) {
count[c]++;
}
for (auto &p : count) {
result = result * (p.second + 1) % MOD;
}
cout << (res... | [] | 905,628 | 905,629 | u085367022 | cpp |
p03095 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | [] | 905,630 | 905,631 | u222293734 | cpp |
p03095 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | [
"literal.number.change",
"call.arguments.change"
] | 905,638 | 905,639 | u311671153 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int mod = 1'000'000'007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> num(26, 0);
for (int i = 0; i < n; i++)
num[s[i] - 'a']++;
long long ans = 1;
for (int i = 0; i < n; i++) {
ans *= num[i] + 1;
ans %= mod;
}
cout << (ans... | #include <bits/stdc++.h>
using namespace std;
int mod = 1'000'000'007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> num(26, 0);
for (int i = 0; i < n; i++)
num[s[i] - 'a']++;
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= num[i] + 1;
ans %= mod;
}
cout << (an... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,640 | 905,641 | u013408661 | cpp |
p03095 | #include <iostream>
#include <vector>
using namespace std;
int alphabet[26];
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int N;
cin >> N;
for (int i = 0; i < 26; i++) {
alphabet[i] = 1;
}
string S;
cin >> S;
for (int i = 0; i < N; i++) {
int c = S[i] - 'a';
alphabet[c]++;... | #include <iostream>
#include <vector>
using namespace std;
int alphabet[26];
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int N;
cin >> N;
for (int i = 0; i < 26; i++) {
alphabet[i] = 1;
}
string S;
cin >> S;
for (int i = 0; i < N; i++) {
int c = S[i] - 'a';
alphabet[c]++;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 905,654 | 905,655 | u904123392 | cpp |
p03095 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
string s;
cin >> s;
vector<int> check(26, 1);
long ans = 0;
for (int j = 0; j < N; j++) {
check[s[j] - 'a']++;
}
for (int i = 0; i < 26; i++) {
ans *= check[i];
ans %= 1000000... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
string s;
cin >> s;
vector<int> check(26, 1);
long ans = 1;
for (int j = 0; j < N; j++) {
check[s[j] - 'a']++;
}
for (int i = 0; i < 26; i++) {
ans *= check[i];
ans %= 1000000... | [
"literal.number.change",
"variable_declaration.value.change"
] | 905,672 | 905,673 | u407416173 | cpp |
p03095 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<ll>()) // descend
// sort(a, a+N) // ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i >= ll(b); i--)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<ll>()) // descend
// sort(a, a+N) // ... | [
"assignment.value.change"
] | 905,676 | 905,677 | u499009346 | cpp |
p03095 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | [] | 905,685 | 905,684 | u649915042 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> alph(25, 1);
int N;
char x;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x;
int k = x - 97;
alph[k]++;
}
long long ans = 1;
for (int k : alph) {
ans *= k;
ans %= 1000000007;
}
cout << ans - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> alph(26, 1);
int N;
char x;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x;
int k = x - 97;
alph[k]++;
}
long long ans = 1;
for (int k : alph) {
ans *= k;
ans %= 1000000007;
}
cout << ans - 1 << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 905,728 | 905,729 | u507188501 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
templ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
templ... | [
"expression.operation.binary.change",
"assignment.change"
] | 905,746 | 905,747 | u127844950 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1... | [
"expression.operation.binary.add"
] | 905,776 | 905,777 | u342051078 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define lPair pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define lPair pair<ll, ll>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
int dx[4] = {-1,... | [
"expression.operation.binary.add"
] | 905,778 | 905,779 | u342051078 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
map<char, int> m;
for (int i = 0; i < n; i++) {
m[s[i]]++;
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
map<char, int> m;
for (int i = 0; i < n; i++) {
m[s[i]]++;
}
... | [] | 905,800 | 905,801 | u713830790 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n;
int lim = 'z' - 'a' + 1;
ll a[lim] = {};
string s;
ll ans = 1;
cin >> n >> s;
for (int i = 0; i < lim; i++) {
a[s[i] - 'a']++;
}
for (int i = 0; i < lim; i++) {
ans = (ans * (a[i] ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n;
int lim = 'z' - 'a' + 1;
ll a[lim] = {};
string s;
ll ans = 1;
cin >> n >> s;
for (int i = 0; i < n; i++) {
a[s[i] - 'a']++;
}
for (int i = 0; i < lim; i++) {
ans = (ans * (a[i] + ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,808 | 905,809 | u798086274 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int UINT32;
typedef long long SINT64;
typedef unsigned long long UINT64;
typedef double DOUBLE;
#define... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int UINT32;
typedef long long SINT64;
typedef unsigned long long UINT64;
typedef double DOUBLE;
#define... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,815 | 905,813 | u824905100 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int cnt[26];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
char x;
scanf(" %c", &x);
cnt[x - 'a']++;
}
long long prod = 1;
for (int i = 0; i < 26; ++i) {
prod *= cnt[i] + 1;
prod %= (int)(1e9 + 7);
}
printf("%d\n", p... | #include <bits/stdc++.h>
using namespace std;
int cnt[26];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
char x;
scanf(" %c", &x);
cnt[x - 'a']++;
}
long long prod = 1;
for (int i = 0; i < 26; ++i) {
prod *= cnt[i] + 1;
prod %= (int)(1e9 + 7);
}
printf("%d\n", (... | [
"call.arguments.change"
] | 905,824 | 905,825 | u939637096 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll mod = 1000000007;
ll num[26], tot = 1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string S;
int N;
cin >> N >> S;
for (int i = 0; i < S.size(); ++i) {
num[S[i] - 'a']++;
}
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll mod = 1000000007;
ll num[26], tot = 1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string S;
int N;
cin >> N >> S;
for (int i = 0; i < S.size(); ++i) {
num[S[i] - 'a']++;
}
for (i... | [
"expression.operation.binary.add"
] | 905,840 | 905,841 | u496254754 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
int n;
char s[N];
int cnt[666];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 0; i < n; i++) {
cnt[s[i]]++;
}
int res = 1;
for (int i = 'a'; i <= 'z'; i++) {
res = (long long)res * cnt[i]... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
int n;
char s[N];
int cnt[666];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= n; i++) {
cnt[s[i]]++;
}
int res = 1;
for (int i = 'a'; i <= 'z'; i++) {
res = (long long)res * (cnt... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,842 | 905,843 | u353573192 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(26, 1);
for (int i = 0; i < n; i++) {
char c;
cin >> c;
s[c - 97]++;
}
long long ans = 1;
for (int i = 0; i < n; i++) {
ans *= s[i];
ans %= 1000000007;
}
cout << ans - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(26, 1);
for (int i = 0; i < n; i++) {
char c;
cin >> c;
s[c - 97]++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= s[i];
ans %= 1000000007;
}
cout << ans - 1 << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,846 | 905,847 | u640800420 | cpp |
p03095 | #include <iostream>
using namespace std;
int f[26];
#define MOD 1000000007
int main() {
int n;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
f[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans = (ans * (f[i] + 1)) % MOD;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int f[26];
#define MOD 1000000007
int main() {
int n;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
f[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans = (ans * (f[i] + 1)) % MOD;
}
cout << ans - 1 << endl;
} | [
"expression.operation.binary.add"
] | 905,850 | 905,851 | u719290158 | cpp |
p03095 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
//回答が整数の場合
ll ans = 1;
//整数値の入力
int n;
cin >> n;
//行列... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
//回答が整数の場合
ll ans = 1;
//整数値の入力
int n;
cin >> n;
//行列... | [
"expression.operation.binary.add"
] | 905,885 | 905,886 | u419307948 | cpp |
p03095 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 100010, Mod = 1e9 + 7;
char st[N];
int s[N];
int main() {
int n, ans = 1;
cin >> n >> st + 1;
for (int i = 1; i <= n; i++)
s[st[i] - 'a']++;
for (int i = 0; i <= n; i++)
ans = 1ll * ans * (s[i] + 1) % Mod;
cout << (ans + ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 100010, Mod = 1e9 + 7;
char st[N];
int s[N];
int main() {
int n, ans = 1;
cin >> n >> st + 1;
for (int i = 1; i <= n; i++)
s[st[i] - 'a']++;
for (int i = 0; i < 26; i++)
ans = 1ll * ans * (s[i] + 1) % Mod;
cout << (ans + ... | [
"control_flow.loop.for.condition.change"
] | 905,888 | 905,889 | u496601567 | cpp |
p03095 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define r... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 905,892 | 905,891 | u153846982 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
#define f first
#define s second
#define ll long long
#define pb push_back
#define all... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
#define f first
#define s second
#define ll long long
#define pb push_back
#define all... | [
"variable_declaration.add"
] | 905,941 | 905,942 | u372953141 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
const double eps = 1e-4;
typedef long long ll;
typedef pair<int, int> pii;
int a[N];
char s[N];
int vis[N];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
int len = strlen(s);
for (i... | #include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
const double eps = 1e-4;
typedef long long ll;
typedef pair<int, int> pii;
int a[N];
char s[N];
int vis[N];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
int len = strlen(s);
for (i... | [
"expression.operation.binary.add"
] | 905,947 | 905,948 | u935313188 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1;
int Num[26];
// aからzまでの文字の個数を数えるコード
for (int i = 0; i < N; i++) {
Num[S[i] - 'a']++;
}
// range-based for loops
for (int x : Num) {
ans *= (... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1;
int Num[26] = {};
// aからzまでの文字の個数を数えるコード
for (int i = 0; i < N; i++) {
Num[S[i] - 'a']++;
}
// range-based for loops
for (int x : Num) {
ans... | [
"variable_declaration.value.change"
] | 905,951 | 905,952 | u590088474 | cpp |
p03095 | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9 + 10;
const ll LINF = 1LL * INF * INF;
const int MAXN = 1e5 + 10;
const int MAXM = 3e3 ... | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9 + 10;
const ll LINF = 1LL * INF * INF;
const int MAXN = 1e5 + 10;
const int MAXM = 3e3 ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,955 | 905,956 | u114415753 | cpp |
p03095 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll Mod = 1e9 + 7;
ll Cnt[26];
int main() {
ll n;
cin >> n;
string s;
cin >> s;
for (ll i = 0; i < n; i++)
Cnt[s[i] - 'a']++;
ll Ans = 1;
for (ll i = 0; i < n; i++)
Ans = (Ans * (Cnt[i] + 1)) % Mod;
cout << (Ans - 1 ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll Mod = 1e9 + 7;
ll Cnt[26];
int main() {
ll n;
cin >> n;
string s;
cin >> s;
for (ll i = 0; i < n; i++)
Cnt[s[i] - 'a']++;
ll Ans = 1;
for (ll i = 0; i < 26; i++)
Ans = (Ans * (Cnt[i] + 1)) % Mod;
cout << (Ans - 1... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 905,961 | 905,962 | u427083104 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int cnt[26];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (auto i : s)
cnt[i - 'a']++;
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= (cnt[i] + 1);
ans %= (int)(1e9 + 7);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int cnt[26];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (auto i : s)
cnt[i - 'a']++;
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= (cnt[i] + 1);
ans %= (int)(1e9 + 7);
}
cout << ans - 1;
} | [
"expression.operation.binary.add"
] | 905,985 | 905,986 | u840813237 | cpp |
p03095 | #include <iostream>
#include <string>
using namespace std;
int N;
string S;
long long cnt[26] = {};
long long ans = 1;
int main() {
cin >> N >> S;
for (int i = 0; i < N; i++)
cnt[int(S[i] - 'a')]++;
for (int i = 0; i < N; i++)
ans = (long long)(ans * (cnt[i] + 1)) % (long long)(1e9 + 7);
cout << ans - ... | #include <iostream>
#include <string>
using namespace std;
int N;
string S;
long long cnt[26] = {};
long long ans = 1;
int main() {
cin >> N >> S;
for (int i = 0; i < N; i++)
cnt[int(S[i] - 'a')]++;
for (int i = 0; i < 26; i++)
ans = (long long)(ans * (cnt[i] + 1)) % (long long)(1e9 + 7);
cout << ans -... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,007 | 906,008 | u861034552 | cpp |
p03095 | #include <iostream>
#include <string>
using namespace std;
int N;
string S;
long long cnt[26] = {};
long long ans = 1;
int main() {
cin >> N >> S;
for (int i = 0; i < N; i++)
cnt[int(S[i] - 'a')]++;
for (int i = 0; i < N; i++)
ans = (int)(ans * (cnt[i] + 1)) % (int)(1e9 + 7);
cout << ans - 1 << endl;
... | #include <iostream>
#include <string>
using namespace std;
int N;
string S;
long long cnt[26] = {};
long long ans = 1;
int main() {
cin >> N >> S;
for (int i = 0; i < N; i++)
cnt[int(S[i] - 'a')]++;
for (int i = 0; i < 26; i++)
ans = (long long)(ans * (cnt[i] + 1)) % (long long)(1e9 + 7);
cout << ans -... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 906,009 | 906,008 | u861034552 | cpp |
p03095 | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
... | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 906,016 | 906,017 | u224756887 | cpp |
p03095 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1000000007;
int N;
string S;
int n[30] = {};
int main... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1000000007;
int N;
string S;
int n[30] = {};
int main... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 906,040 | 906,041 | u114234520 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int a[30];
int main() {
char c;
int n, i;
long long ans = 1;
scanf("%d", &n);
getchar();
for (i = 1; i <= n; i++) {
scanf("%c", &c);
a[c - 'a']++;
}
for (i = 0; i < 26; i++)
ans = ans * (a[i] + 1) % 1000000007;
printf("%lld", (ans + 1000000006)... | #include <bits/stdc++.h>
using namespace std;
int a[30];
int main() {
char c;
int n, i;
long long ans = 1;
scanf("%d", &n);
getchar();
for (i = 1; i <= n; i++) {
scanf("%c", &c);
a[c - 'a']++;
}
for (i = 0; i < 26; i++)
ans = ans * (a[i] + 1) % 1000000007;
printf("%lld", (ans + 1000000006)... | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 906,050 | 906,051 | u314499126 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int a[30];
int main() {
char c;
int n, i;
long long ans = 1;
scanf("%d", &n);
getchar();
for (i = 1; i <= n; i++) {
scanf("%c", &c);
a[c - 'a']++;
}
for (i = 0; i < 26; i++)
ans = ans * (a[i] + 1) % 1000000007;
printf("%lld", ans);
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int a[30];
int main() {
char c;
int n, i;
long long ans = 1;
scanf("%d", &n);
getchar();
for (i = 1; i <= n; i++) {
scanf("%c", &c);
a[c - 'a']++;
}
for (i = 0; i < 26; i++)
ans = ans * (a[i] + 1) % 1000000007;
printf("%lld", (ans + 1000000006)... | [
"call.arguments.change"
] | 906,052 | 906,051 | u314499126 | cpp |
p03095 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll cnt[30];
ll pow_2(ll x) {
ll ret = 1;
for (int i = 0; i < x; i++) {
ret = ret * 2 % 1000000007;
}
return ret;
}
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
ll cnt2 ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll cnt[30];
ll pow_2(ll x) {
ll ret = 1;
for (int i = 0; i < x; i++) {
ret = ret * 2 % 1000000007;
}
return ret;
}
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
ll cnt2 ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,064 | 906,065 | u620735210 | cpp |
p03095 | #include <iostream>
using namespace std;
int c[26];
const long long MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
c[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < n; i++) {
ans ... | #include <iostream>
using namespace std;
int c[26];
const long long MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
c[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.type.widen.change"
] | 906,068 | 906,069 | u244459371 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef pair<int, int> PII;
//--------
int l[25];
vector<int> pressed;
signed main() {
int N;
string s;
cin >> N;
cin >> s;
REP(i, N) { l[s[i] - 'a']++; }
int ans = 1;
REP(i, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef pair<int, int> PII;
//--------
int l[50];
vector<int> pressed;
signed main() {
int N;
string s;
cin >> N;
cin >> s;
REP(i, N) { l[s[i] - 'a']++; }
int ans = 1;
REP(i, ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 906,072 | 906,073 | u465379376 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef pair<int, int> PII;
//--------
int l[25];
vector<int> pressed;
signed main() {
int N;
string s;
cin >> N;
cin >> s;
REP(i, N) { l[s[i] - 'a']++; }
int ans = 1;
REP(i, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef pair<int, int> PII;
//--------
int l[50];
vector<int> pressed;
signed main() {
int N;
string s;
cin >> N;
cin >> s;
REP(i, N) { l[s[i] - 'a']++; }
int ans = 1;
REP(i, ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"assignment.change"
] | 906,074 | 906,073 | u465379376 | cpp |
p03095 | #include <iostream>
#include <vector>
using namespace std;
long long ans = 1;
vector<int> charas(26, 0);
int main() {
int N;
string str;
cin >> N >> str;
for (int i = 0; i < N; i++) {
charas[str[i] - 'a']++;
}
//文字iを選ぶor選ばない
for (int i = 0; i < 25; i++) {
ans = (ans * (charas[i] + 1)) % ((i... | #include <iostream>
#include <vector>
using namespace std;
long long ans = 1;
vector<int> charas(26, 0);
int main() {
int N;
string str;
cin >> N >> str;
for (int i = 0; i < N; i++) {
charas[str[i] - 'a']++;
}
//文字iを選ぶor選ばない
for (int i = 0; i < 26; i++) {
ans = (ans * (charas[i] + 1)) % ((i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 906,081 | 906,082 | u604023588 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define set0(x) memset(x, 0, sizeof(x))
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
temp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define set0(x) memset(x, 0, sizeof(x))
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
temp... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 906,085 | 906,086 | u054789652 | cpp |
p03095 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
char a[100101];
int sum[1010];
int main() {
int n, i, ans;
scanf("%d", &n);
scanf("%s", a + 1);
for (i = 1; i <= n; i++)
sum[a[i] - 'a']++;
for (i = 0; i < 26; i++)
ans... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
char a[100101];
int sum[1010];
int main() {
int n, i, ans = 1;
scanf("%d", &n);
scanf("%s", a + 1);
for (i = 1; i <= n; i++)
sum[a[i] - 'a']++;
for (i = 0; i < 26; i++)
... | [
"variable_declaration.value.change"
] | 906,120 | 906,121 | u556820423 | cpp |
p03095 | // finish date: 2019/2/28
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | // finish date: 2019/2/28
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | [] | 906,122 | 906,123 | u285660186 | cpp |
p03082 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | [
"expression.operation.binary.remove"
] | 906,124 | 906,125 | u802434195 | cpp |
p03082 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, x;
cin >> n >> x;
vec a(n);
for (ll i = 0; i < n; i++)
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, x;
cin >> n >> x;
vec a(n);
for (ll i = 0; i < n; i++)
cin >> a[i];
... | [] | 906,128 | 906,129 | u718758485 | cpp |
p03082 | #include <bits/stdc++.h>
#define int long long int
using namespace std;
template <typename T, typename U> using P = pair<T, U>;
template <typename T> using V = vector<T>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a,... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
template <typename T, typename U> using P = pair<T, U>;
template <typename T> using V = vector<T>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a,... | [
"io.output.change"
] | 906,170 | 906,171 | u960524878 | cpp |
p03082 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr int P = 1000000007;
int dp[201][10001];
ll f(int n, int *s, int x) {
if (n == 1) {
return x % s[0];
}
if (dp[n][x] != -1)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr int P = 1000000007;
int dp[201][100001];
ll f(int n, int *s, int x) {
if (n == 1) {
return x % s[0];
}
if (dp[n][x] != -1)
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 906,172 | 906,173 | u215860196 | cpp |
p03082 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | [
"type_conversion.add"
] | 906,176 | 906,177 | u834415466 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int cnt[256];
void solve() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
cnt[s[i]]++;
ll ret = 1;
for (int i = 0; i < 256; i++) {
ret *= ++s[i];
ret %= 100... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int cnt[256];
void solve() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
cnt[s[i]]++;
ll ret = 1;
for (int i = 0; i < 256; i++) {
ret *= ++cnt[i];
ret %= 1... | [
"assignment.value.change",
"identifier.change"
] | 906,211 | 906,212 | u109256064 | cpp |
p03095 | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 906,215 | 906,216 | u487476769 | cpp |
p03095 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
string s;
vector<long long> v(26, 1);
cin >> n >> s;
for (long long i = 0; i < n; i++) {
v[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= v[i];
ans %= 1000000007;... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
string s;
vector<long long> v(26, 1);
cin >> n >> s;
for (long long i = 0; i < n; i++) {
v[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= v[i];
ans %= 1000000007;... | [
"expression.operation.binary.add"
] | 906,241 | 906,242 | u285598935 | cpp |
p03095 | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
const int inf = 2e9;
using namespace std;
ll MOD = 1000000007;
typedef pair<int, int> ii;
typedef struct {
int a, b, c;
} iii;
int n;
int L[33];
vector<int> v;
char S[100005];
int main() {
ll ans = 0;
scanf("%d%s", &n, S);
for (int i = 0; i <... | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
const int inf = 2e9;
using namespace std;
ll MOD = 1000000007;
typedef pair<int, int> ii;
typedef struct {
int a, b, c;
} iii;
int n;
int L[33];
vector<int> v;
char S[100005];
int main() {
ll ans = 1;
scanf("%d%s", &n, S);
for (int i = 0; i <... | [
"literal.number.change",
"variable_declaration.value.change"
] | 906,243 | 906,244 | u204082108 | cpp |
p03095 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define reps(i, x) for (int i = 1; i <= (int)(x); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"assignment.change"
] | 906,259 | 906,257 | u150255544 | cpp |
p03095 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int arr['z' - 'a' + 1];
long long ret = 0;
for (char i = 'a'; 'z' >= i; i++)
arr[i - 'a'] = 0;
for (int i = 0; n - 1 > i; i++) {
long long tmp ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int arr['z' - 'a' + 1];
long long ret = 0;
for (char i = 'a'; 'z' >= i; i++)
arr[i - 'a'] = 0;
for (int i = 0; n - 1 > i; i++) {
long long tmp ... | [] | 906,260 | 906,261 | u466161487 | cpp |
p03095 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int arr['z' - 'a' + 1];
long long ret = 0;
for (char i = 'a'; 'z' > i; i++)
arr[i - 'a'] = 0;
for (int i = 0; n - 1 > i; i++) {
long long tmp =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int arr['z' - 'a' + 1];
long long ret = 0;
for (char i = 'a'; 'z' >= i; i++)
arr[i - 'a'] = 0;
for (int i = 0; n - 1 > i; i++) {
long long tmp ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,262 | 906,261 | u466161487 | cpp |
p03095 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int arr['z' - 'a' + 1];
int ret = 0;
for (char i = 'a'; 'z' > i; i++)
arr[i - 'a'] = 0;
for (int i = 0; n - 1 > i; i++) {
int tmp = 1;
arr[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MOD 1000000007
int main() {
int n;
cin >> n;
string s;
cin >> s;
int arr['z' - 'a' + 1];
long long ret = 0;
for (char i = 'a'; 'z' >= i; i++)
arr[i - 'a'] = 0;
for (int i = 0; n - 1 > i; i++) {
long long tmp ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,263 | 906,261 | u466161487 | cpp |
p03095 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0)... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0)... | [
"literal.string.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.add"
] | 906,264 | 906,265 | u317754719 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int cnt[30];
const int MOD = 1e9 + 7;
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < n; i++) {
ans = (ans * (cnt[i] + 1LL)) % MOD;
}
cout << (ans + MOD - 1) % M... | #include <bits/stdc++.h>
using namespace std;
int cnt[30];
const int MOD = 1e9 + 7;
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 28; i++) {
ans = (ans * (cnt[i] + 1LL)) % MOD;
}
cout << (ans + MOD - 1) % ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,274 | 906,275 | u723145084 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll mod = 1000000007;
map<char, ll> alp;
for (char s = 'a'; s <= 'z'; s++) {
for (ll i = 0; i < N; i++) {
if (S.at(i) == s) {
alp[s] += 1; // Sにおける文字毎の出現回数
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll mod = 1000000007;
map<char, ll> alp;
for (char s = 'a'; s <= 'z'; s++) {
for (ll i = 0; i < N; i++) {
if (S.at(i) == s) {
alp[s] += 1; // Sにおける文字毎の出現回数
}
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 906,294 | 906,295 | u083190434 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll mod = 1000000007;
map<char, ll> alp;
for (char s = 'a'; s <= 'z'; s++) {
for (ll i = 0; i < N; i++) {
if (S.at(i) == s) {
alp[s] += 1; // Sにおける文字毎の出現回数
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll mod = 1000000007;
map<char, ll> alp;
for (char s = 'a'; s <= 'z'; s++) {
for (ll i = 0; i < N; i++) {
if (S.at(i) == s) {
alp[s] += 1; // Sにおける文字毎の出現回数
}
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 906,296 | 906,295 | u083190434 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
const ll mod = 1000000007;
map<char, ll> alp;
for (char s = 'a'; s <= 'z'; s++) {
for (ll i = 0; i < N; i++) {
if (S.at(i) == s) {
alp[s] += 1; // Sにおける文字毎の出現回数
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll mod = 1000000007;
map<char, ll> alp;
for (char s = 'a'; s <= 'z'; s++) {
for (ll i = 0; i < N; i++) {
if (S.at(i) == s) {
alp[s] += 1; // Sにおける文字毎の出現回数
}
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 906,297 | 906,295 | u083190434 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
ll n, m;
ll a[30];
using ll = long long;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
(res *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return res;
}
int main() {
string s;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
ll n, m;
ll a[30];
using ll = long long;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
(res *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return res;
}
int main() {
string s;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 906,322 | 906,323 | u394482932 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define rrep(i, n, m) for (int i = n; i >= m; i--)
#define p(a, b) printf(a, b);
#define c(s) cout << (s) << endl;
#define yes cout << "Yes" << endl;
#define no cou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define rrep(i, n, m) for (int i = n; i >= m; i--)
#define p(a, b) printf(a, b);
#define c(s) cout << (s) << endl;
#define yes cout << "Yes" << endl;
#define no cou... | [
"expression.operation.binary.add"
] | 906,331 | 906,332 | u098652914 | cpp |
p03090 | #include <bits/stdc++.h>
#define FR first
#define SE second
using namespace std;
typedef pair<int, int> pr;
vector<pr> ans;
int main() {
int n;
scanf("%d", &n);
int m = ((n & 1) ? n : n + 1);
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
if (i + j != n)
ans.push_back(pr(i, ... | #include <bits/stdc++.h>
#define FR first
#define SE second
using namespace std;
typedef pair<int, int> pr;
vector<pr> ans;
int main() {
int n;
scanf("%d", &n);
int m = ((n & 1) ? n : n + 1);
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
if (i + j != m)
ans.push_back(pr(i, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 906,381 | 906,382 | u966630585 | cpp |
p03090 | #include <bits/stdc++.h>
#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a) = max((a), (b))
#define umin(a, b) (a) = min((a), (b))
#define FOR(i, a, b) for (int i = (a); ... | #include <bits/stdc++.h>
#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a) = max((a), (b))
#define umin(a, b) (a) = min((a), (b))
#define FOR(i, a, b) for (int i = (a); ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 906,383 | 906,384 | u950523274 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 1000000000
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s s... | [
"control_flow.branch.if.condition.change"
] | 906,385 | 906,386 | u396284099 | cpp |
p03091 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
template <typename tn> void read(tn &a) {
tn x = 0, f = 1;
char c = ' ';
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
x = x * 10 + c - '0';
a = x * f;
}
const int N = 1001000;
int hea... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
template <typename tn> void read(tn &a) {
tn x = 0, f = 1;
char c = ' ';
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
x = x * 10 + c - '0';
a = x * f;
}
const int N = 1001000;
int hea... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 906,488 | 906,489 | u684730254 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
int n, m, i, d[1000005], u, v, ans, head[1000005], Next[2000005], adj[2000005],
k, s;
bool flag = true;
void Push(int u, int v) {
Next[++k] = head[u];
head[u] = k;
adj[k] = v;
}
void dfs(int i, int fa) {
if ((i == u && fa != 0) || i == v) {
if (i == v)
... | #include <bits/stdc++.h>
using namespace std;
int n, m, i, d[1000005], u, v, ans, head[1000005], Next[2000005], adj[2000005],
k, s;
bool flag = true;
void Push(int u, int v) {
Next[++k] = head[u];
head[u] = k;
adj[k] = v;
}
void dfs(int i, int fa) {
if ((i == u && fa != 0) || i == v) {
if (i == v)
... | [
"assignment.add"
] | 906,490 | 906,491 | u202904995 | cpp |
p03091 | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template... | [
"literal.string.change",
"io.output.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 906,509 | 906,508 | u901397311 | cpp |
p03091 | #define DEBUG 0
/**
* File : C.cpp
* Author : Kazune Takahashi
* Created : 2019-5-28 15:35:36
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <... | #define DEBUG 0
/**
* File : C.cpp
* Author : Kazune Takahashi
* Created : 2019-5-28 15:35:36
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <... | [] | 906,524 | 906,525 | u521272340 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.