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 |
|---|---|---|---|---|---|---|---|
p03091 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define... | [] | 906,537 | 906,538 | u120305309 | cpp |
p03095 | #include <iostream>
#include <string>
#define MOD 1000000007
using namespace std;
long long ans;
int cnt[30], n;
string s;
void dfs(int here, long long ansHere) {
if (here == 'z' - 'a') {
ans = (ans + ansHere) % MOD;
return;
}
dfs(here + 1, ansHere);
if (cnt[here] > 0)
dfs(here + 1, (ansHere * c... | #include <iostream>
#include <string>
#define MOD 1000000007
using namespace std;
long long ans;
int cnt[30], n;
string s;
void dfs(int here, long long ansHere) {
if (here == 'z' - 'a' + 1) {
ans = (ans + ansHere) % MOD;
return;
}
dfs(here + 1, ansHere);
if (cnt[here] > 0)
dfs(here + 1, (ansHere... | [
"control_flow.branch.if.condition.change"
] | 906,543 | 906,544 | u894126219 | cpp |
p03095 | #include <iostream>
#include <string>
#define MOD 1000000007
using namespace std;
long long ans;
int cnt[30], n;
string s;
void dfs(int here, int ansHere) {
if (here == 'z' - 'a') {
ans = (ans + ansHere) % MOD;
return;
}
dfs(here + 1, ansHere);
if (cnt[here] > 0)
dfs(here + 1, (ansHere * cnt[he... | #include <iostream>
#include <string>
#define MOD 1000000007
using namespace std;
long long ans;
int cnt[30], n;
string s;
void dfs(int here, long long ansHere) {
if (here == 'z' - 'a' + 1) {
ans = (ans + ansHere) % MOD;
return;
}
dfs(here + 1, ansHere);
if (cnt[here] > 0)
dfs(here + 1, (ansHere... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 906,545 | 906,544 | u894126219 | cpp |
p03095 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
typedef long long ll;
using namespace std;
int n;
string s;
long long int a[26] = {0};
int main() {
cin >> n;
cin >> s;
long long int ans = 0;
for (int i = 0; i < n; i++) {
a[s[i] - 'a']+... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
typedef long long ll;
using namespace std;
int n;
string s;
long long int a[26] = {0};
int main() {
cin >> n;
cin >> s;
long long int ans = 0;
for (int i = 0; i < n; i++) {
a[s[i] - 'a']+... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 906,562 | 906,561 | u629194491 | cpp |
p03095 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
typedef long long ll;
using namespace std;
int n;
string s;
int a[26] = {0};
int main() {
cin >> n;
cin >> s;
int ans = 0;
for (int i = 0; i < n; i++) {
a[s[i] - 'a']++;
}
for (int i ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
typedef long long ll;
using namespace std;
int n;
string s;
long long int a[26] = {0};
int main() {
cin >> n;
cin >> s;
long long int ans = 0;
for (int i = 0; i < n; i++) {
a[s[i] - 'a']+... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.value.change"
] | 906,563 | 906,561 | u629194491 | cpp |
p03095 | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | [
"expression.operation.binary.add"
] | 906,572 | 906,573 | u088893297 | cpp |
p03095 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
int sum[30], Ans;
char s[... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
int sum[30], Ans = 1;
cha... | [
"variable_declaration.value.change",
"literal.string.change",
"call.arguments.change"
] | 906,609 | 906,610 | u964391729 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n;
cin >> n;
string str;
cin >> str;
ll cnt[26];
for (int i = 0; i < 26; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n;
cin >> n;
string str;
cin >> str;
ll cnt[26];
for (int i = 0; i < 26; i... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,615 | 906,616 | u637771514 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
#define forw(i, a, n) for (int i = a; i < n; i++)
#define ford(i, a, n) for (int i = n - 1; i >= a; i--)
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
const ll mod = 1000000007... | #include <bits/stdc++.h>
using namespace std;
#define forw(i, a, n) for (int i = a; i < n; i++)
#define ford(i, a, n) for (int i = n - 1; i >= a; i--)
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
const ll mod = 1000000007... | [
"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"
] | 906,619 | 906,620 | u600000692 | cpp |
p03095 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int count[26] = {};
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
count[S[i] - 'a']++;
}
int ans = 1;
for (int i = 0; i < N; i++) {
ans *= count[i] + 1;
ans %= 1000000007;
}
cout << ans - 1 << endl;
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int count[26] = {};
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
count[S[i] - 'a']++;
}
long long int ans = 1;
for (int i = 0; i < 26; i++) {
ans *= count[i] + 1;
ans %= 1000000007;
}
cout << ans - 1 <... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,647 | 906,646 | u506320030 | cpp |
p03095 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
#define F first
#define S second
int n;
string s;
int a[28];
unordered_set<int> st;
signed main() {
cin >> n;
cin >> s;
r(i, n) { a[s[i] - 'a']++; }
int ans = 1, S = 0, sum... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
#define F first
#define S second
int n;
string s;
int a[28];
unordered_set<int> st;
signed main() {
cin >> n;
cin >> s;
r(i, n) { a[s[i] - 'a']++; }
int ans = 1, S = 0, sum... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 906,648 | 906,649 | u777468981 | cpp |
p03095 | /*
* @Author: wxyww
* @Date: 2019-03-16 20:09:11
* @Last Modified time: 2019-03-16 20:12:01
*/
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll read() {
ll x = 0, f ... | /*
* @Author: wxyww
* @Date: 2019-03-16 20:09:11
* @Last Modified time: 2019-03-16 20:13:41
*/
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll read() {
ll x = 0, f ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 906,650 | 906,651 | u541541158 | cpp |
p03095 | #include <algorithm>
#include <cctype>
#include <cstdio>
namespace fast_IO {
const int IN_LEN = 1000000, OUT_LEN = 1000000;
char ibuf[IN_LEN], obuf[OUT_LEN], *ih = ibuf + IN_LEN, *oh = obuf,
*lastin = ibuf + IN_LEN,
*lastout = obuf + OUT_LEN - 1;
inlin... | #include <algorithm>
#include <cctype>
#include <cstdio>
namespace fast_IO {
const int IN_LEN = 1000000, OUT_LEN = 1000000;
char ibuf[IN_LEN], obuf[OUT_LEN], *ih = ibuf + IN_LEN, *oh = obuf,
*lastin = ibuf + IN_LEN,
*lastout = obuf + OUT_LEN - 1;
inlin... | [
"expression.operation.binary.add"
] | 906,652 | 906,653 | u303645731 | cpp |
p03095 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | [
"literal.number.change",
"call.arguments.change"
] | 906,666 | 906,667 | u152129372 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, N - 1, 0)
#define RREPS(i, n) RFOR(i, N, 1)
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, N - 1, 0)
#define RREPS(i, n) RFOR(i, N, 1)
#define int long... | [
"assignment.change"
] | 906,672 | 906,673 | u342075214 | cpp |
p03090 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 906,679 | 906,680 | u128572736 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using f64 = double;
constexpr i64 INF = INT_FAST64_MAX / 2;
constexpr f64 EPS = DBL_EPSILON;
void solve() {
i64 n;
cin >> n;
cout << n * (n - 1) / 2 - (n - 1) / 2 << endl;
for (i64 a = 1; a + 1 <= n; a++) {
for (i64 b = a + 1; b <= ... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using f64 = double;
constexpr i64 INF = INT_FAST64_MAX / 2;
constexpr f64 EPS = DBL_EPSILON;
void solve() {
i64 n;
cin >> n;
cout << n * (n - 1) / 2 - n / 2 << endl;
for (i64 a = 1; a + 1 <= n; a++) {
for (i64 b = a + 1; b <= n; b++... | [] | 906,683 | 906,684 | u820225607 | cpp |
p03090 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.operation.binary.remove"
] | 906,691 | 906,692 | u828388155 | cpp |
p03090 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)... | [] | 906,693 | 906,694 | u828388155 | cpp |
p03090 | #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
#define rep1(i, n)... | #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
#define rep1(i, n)... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 906,701 | 906,702 | u457985479 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (int i = (int)(init); i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<vector<int>> G(N);
int cnt = 0;
REP(i, 1, N + 1) REP(j, i, N + 1) {
if (i == j)
continue;
if (i + j != N + 1) {
G[i - 1].emplace_back(j)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (int i = (int)(init); i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<vector<int>> G(N);
int cnt = 0;
REP(i, 1, N + 1) REP(j, i, N + 1) {
if (i == j)
continue;
if (i + j != N + (N + 1) % 2) {
G[i - 1].emplac... | [
"control_flow.branch.if.condition.change"
] | 906,703 | 906,704 | u559424030 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 100000000000000
int main() {
int N;
cin >> N;
if (N % 2 == 0) {
cout << N * (N - 2) / 2 << endl;
for (int i = 1; i <= N; i++) {
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 100000000000000
int main() {
int N;
cin >> N;
if (N % 2 == 0) {
cout << N * (N - 2) / 2 << endl;
for (int i = 1; i <= N; i++) {
for (int j = ... | [
"control_flow.loop.for.initializer.change"
] | 906,707 | 906,708 | u630211216 | cpp |
p03090 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num = N + (N + 1) % 2;
int M = (N * (N + 1)) / 2 - num;
cout << M << endl;
for (int i = 1; i <= N; i++) {
for (int j = i + 1; j <= N; j++) {
if (i + j != num) {
cout << i << " " << j << endl;
}
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num = N + (N + 1) % 2;
int M = (N * (N - 1)) / 2 - N / 2;
cout << M << endl;
for (int i = 1; i <= N; i++) {
for (int j = i + 1; j <= N; j++) {
if (i + j != num) {
cout << i << " " << j << endl;
}
}
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"identifier.change"
] | 906,711 | 906,712 | u943966256 | cpp |
p03090 | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200][200];
long long B... | //#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, long long> pl;
long long N, M, k, a, b, c, d, e, H, W, X;
long long A[200][200];
long long B... | [
"io.output.change"
] | 906,715 | 906,716 | u058317639 | cpp |
p03090 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(k, m, n) for (ll(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define WAITING(str) \... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(k, m, n) for (ll(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define WAITING(str) \... | [
"expression.operation.binary.remove"
] | 906,721 | 906,722 | u692632484 | cpp |
p03090 | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >>... | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >>... | [
"expression.operation.binary.remove"
] | 906,723 | 906,724 | u192903163 | cpp |
p03090 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#de... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#de... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 906,730 | 906,731 | u774652316 | cpp |
p03090 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using... | [] | 906,757 | 906,758 | u017271745 | cpp |
p03090 | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | [
"literal.number.change",
"io.output.change"
] | 906,761 | 906,762 | u509674552 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long dp[200000];
long long sum[200000];
map<long long, long long> m;
void solve(long long N, vector<long long> C) {
dp[0] = 1;
sum[0] = 1;
for (int i = 1; i < N; i++)
m[C[i]] = -1;
m[C[0]] = 0;
for (int i = 1; i < N; i++) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long dp[200000];
long long sum[200000];
map<long long, long long> m;
void solve(long long N, vector<long long> C) {
dp[0] = 1;
sum[0] = 1;
for (int i = 1; i < N; i++)
m[C[i]] = -1;
m[C[0]] = 0;
for (int i = 1; i < N; i++) {
if ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 906,773 | 906,774 | u709604332 | cpp |
p03096 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
int c[n];
for (int i = 0; i < n; i++) {
scanf("%d", c + i);
}
int d[200005];
long long f[n];
f[0] = 1;
int e[200005];
for (int i = 0; i < n; i++)
e[i] = 0;
long long p = 1000000007;
e[c[0]]++;
d[c[0]] = 0;
for (int i = 1; i ... | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
int c[n];
for (int i = 0; i < n; i++) {
scanf("%d", c + i);
}
int d[200005];
long long f[n];
f[0] = 1;
int e[200005];
for (int i = 0; i < 200005; i++)
e[i] = 0;
long long p = 1000000007;
e[c[0]]++;
d[c[0]] = 0;
for (int i = ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,779 | 906,780 | u546925116 | cpp |
p03096 | #include <bits/stdc++.h>
#define M 200005
#define ll long long
#define P 1000000007
using namespace std;
int n;
int col[M], nw[M];
ll dp[M], res[M]; // i结尾方案(必取) 前缀 上个位置
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &col[i]);
int sz = 0;
for (int i = 1; i <= n; i++)
if (col[i] !... | #include <bits/stdc++.h>
#define M 200005
#define ll long long
#define P 1000000007
using namespace std;
int n;
int col[M], nw[M];
ll dp[M], res[M]; // i结尾方案(必取) 前缀 上个位置
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &col[i]);
int sz = 0;
for (int i = 1; i <= n; i++)
if (col[i] !... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 906,782 | 906,783 | u543409245 | cpp |
p03096 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
int c[200005];
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
ll memo[200005]{1};
int last[200005];
for (int i = 0; i <= n; i++) {
last[i] = -1;
}
int pre = -1;
for (i... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
int c[200005];
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
ll memo[200005]{1};
int last[200005];
for (int i = 0; i <= 200000; i++) {
last[i] = -1;
}
int pre = -1;
f... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 906,801 | 906,802 | u681557252 | cpp |
p03096 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
int c[200005];
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
ll memo[200005]{1};
int last[200005];
for (int i = 0; i <= n; i++) {
last[i] = -1;
}
int pre = -1;
for (i... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
int c[200005];
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
ll memo[200005]{1};
int last[200005];
for (int i = 0; i <= 200000; i++) {
last[i] = -1;
}
int pre = -1;
f... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,803 | 906,802 | u681557252 | cpp |
p03096 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
int c[200001];
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
ll memo[200001]{1};
int last[200001];
for (int i = 0; i <= n; i++) {
last[i] = -1;
}
int pre = -1;
for (i... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
int c[200005];
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
ll memo[200005]{1};
int last[200005];
for (int i = 0; i <= 200000; i++) {
last[i] = -1;
}
int pre = -1;
f... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,804 | 906,802 | u681557252 | cpp |
p03096 | #include <cstdio>
#include <cstring>
using namespace std;
using ll = long long;
const static int MOD = 1000000007;
int main() {
int N;
scanf("%d", &N);
int C[N];
scanf("%d", C);
int id = 0;
for (int i = 0; i < N - 1; ++i) {
int tmp;
scanf("%d", &tmp);
if (tmp != C[id])
C[++id] = tmp;
}
... | #include <cstdio>
#include <cstring>
using namespace std;
using ll = long long;
const static int MOD = 1000000007;
int main() {
int N;
scanf("%d", &N);
int C[N];
scanf("%d", C);
int id = 0;
for (int i = 0; i < N - 1; ++i) {
int tmp;
scanf("%d", &tmp);
if (tmp != C[id])
C[++id] = tmp;
}
... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,809 | 906,810 | u642912410 | cpp |
p03096 | #include <bits/stdc++.h>
#define file(a) \
freopen(a ".in", "r", stdin); \
freopen(a ".out", "w", stdout)
using namespace std;
typedef long long ll;
long long f[200001][2]; //到i位置选还是不选的方案数
int a[200011];
co... | #include <bits/stdc++.h>
#define file(a) \
freopen(a ".in", "r", stdin); \
freopen(a ".out", "w", stdout)
using namespace std;
typedef long long ll;
long long f[200001][2]; //到i位置选还是不选的方案数
int a[200011];
co... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change"
] | 906,811 | 906,812 | u699008937 | cpp |
p03096 | #if 1
#include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
constexpr int MOD = 1000000007;
constexpr int INF =... | #if 1
#include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
constexpr int MOD = 1000000007;
constexpr int INF =... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 906,816 | 906,817 | u154068540 | cpp |
p03096 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PL;
const LL INF = 1e18;
const LL MOD = 1e9 + 7;
LL N, i, j;
LL cnt, ans;
LL C[200010], D[200010];
vector<LL> V[200010], Q[200010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullpt... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PL;
const LL INF = 1e18;
const LL MOD = 1e9 + 7;
LL N, i, j;
LL cnt, ans;
LL C[200010], D[200010];
vector<LL> V[200010], Q[200010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullpt... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,818 | 906,819 | u079142199 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define lop(c, l) for (int c = 1; c <= (l); ++c)
#define loop(c, l) for (int c = 0; c < (l); ++c)
using namespace std;
#define int long long
const int mod = 1000000007;
int n, pre;
int arr[200001], dp[200001], cnt[200001];
i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define lop(c, l) for (int c = 1; c <= (l); ++c)
#define loop(c, l) for (int c = 0; c < (l); ++c)
using namespace std;
#define int long long
const int mod = 1000000007;
int n, pre;
int arr[200001], dp[200001], cnt[200001];
i... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,826 | 906,827 | u388600627 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A[400010];
int bef[400010];
ll bit[400010];
ll mod = 1000000007;
int tmp[400010];
void add(int i, ll x) {
i++;
while (i <= N) {
bit[i] += x;
bit[i] %= mod;
i += i & -i;
}
}
ll sum(int i) {
i++;
ll sum = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A[400010];
int bef[400010];
ll bit[400010];
ll mod = 1000000007;
int tmp[200010];
void add(int i, ll x) {
i++;
while (i <= N) {
bit[i] += x;
bit[i] %= mod;
i += i & -i;
}
}
ll sum(int i) {
i++;
ll sum = 0;
while ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,828 | 906,829 | u205655980 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A[400010];
int bef[400010];
ll bit[200010];
ll mod = 100000007;
int tmp[400010];
void add(int i, ll x) {
i++;
while (i <= N) {
bit[i] += x;
bit[i] %= mod;
i += i & -i;
}
}
ll sum(int i) {
i++;
ll sum = 0;
while (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
int A[400010];
int bef[400010];
ll bit[400010];
ll mod = 1000000007;
int tmp[200010];
void add(int i, ll x) {
i++;
while (i <= N) {
bit[i] += x;
bit[i] %= mod;
i += i & -i;
}
}
ll sum(int i) {
i++;
ll sum = 0;
while ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 906,830 | 906,829 | u205655980 | cpp |
p03096 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 906,837 | 906,838 | u614421689 | cpp |
p03096 | #include <iostream>
#include <vector>
using namespace std;
const int mod = int(1e9) + 7;
int main() {
int n;
cin >> n;
vector<int> c(1);
cin >> c[0];
for (int i = 1; i < n; i++) {
int tmp;
cin >> tmp;
if (tmp != c[i - 1])
c.push_back(tmp);
}
n = c.size();
vector<long> cn(200010, 0);
... | #include <iostream>
#include <vector>
using namespace std;
const int mod = int(1e9) + 7;
int main() {
int n;
cin >> n;
vector<int> c(1);
cin >> c[0];
for (int i = 1; i < n; i++) {
int tmp;
cin >> tmp;
if (tmp != c[c.size() - 1])
c.push_back(tmp);
}
n = c.size();
vector<long> cn(20001... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 906,839 | 906,840 | u809153881 | cpp |
p03096 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mk make_pair
#define rint register int
using namespace std;
const int mod = 1e9 + 7;
inline int read() {
int w = 1, s = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
w = -1;
ch = getchar();
}
while (isdigi... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mk make_pair
#define rint register int
using namespace std;
const int mod = 1e9 + 7;
inline int read() {
int w = 1, s = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
w = -1;
ch = getchar();
}
while (isdigi... | [
"control_flow.loop.condition.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.variable.change"
] | 906,857 | 906,858 | u574380866 | cpp |
p03096 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#inc... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#inc... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,877 | 906,878 | u219786796 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
//#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout << "=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#defin... | #include <bits/stdc++.h>
using namespace std;
//#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout << "=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#defin... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 906,886 | 906,887 | u216962796 | cpp |
p03096 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
lon... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
lon... | [
"assignment.value.change",
"identifier.change"
] | 906,891 | 906,892 | u997521090 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (int i = 0; i < m; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 998244353
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
boo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (int i = 0; i < m; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 998244353
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
boo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 906,897 | 906,898 | u773548422 | cpp |
p03096 | #include <algorithm>
#include <iostream>
using namespace std;
const int z = 1e9 + 7;
const int C = 2e5;
int main() {
int n;
cin >> n;
int last[C];
fill(last, last + C, -1);
int dp[n + 1];
dp[0] = 1;
for (int i = 1; i <= n; i++) {
int c;
cin >> c;
c--;
dp[i] = dp[i - 1];
if (last[c... | #include <algorithm>
#include <iostream>
using namespace std;
const int z = 1e9 + 7;
const int C = 2e5;
int main() {
int n;
cin >> n;
int last[C];
fill(last, last + C, -1);
int dp[n + 1];
dp[0] = 1;
for (int i = 1; i <= n; i++) {
int c;
cin >> c;
c--;
dp[i] = dp[i - 1];
if (last[c... | [
"expression.operation.binary.remove"
] | 906,908 | 906,909 | u587665681 | cpp |
p03096 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,910 | 906,911 | u703999673 | cpp |
p03096 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 906,912 | 906,911 | u703999673 | cpp |
p03096 | #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>;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> C(N);
rep(i, N) cin >> C[i];
vector<int> dp(N + 1);
map<int, int> d;
dp[0] = 1;
rep(i, N) ... | #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>;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> C(N);
rep(i, N) cin >> C[i];
vector<int> dp(N + 1);
map<int, int> d;
dp[0] = 1;
rep(i, N) ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 906,923 | 906,924 | u814781830 | cpp |
p03096 |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr <... |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr <... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 906,925 | 906,926 | u089177147 | cpp |
p03096 |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr <... |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr <... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 906,927 | 906,926 | u089177147 | cpp |
p03096 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,942 | 906,943 | u415325136 | cpp |
p03096 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typede... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typede... | [
"identifier.change",
"expression.operation.binary.change"
] | 906,951 | 906,952 | u328811800 | cpp |
p03096 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typede... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define ROF(i, a, b) for (ll i = a; i >= b; i--)
#define per(i, a) ROF(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using ch = char;
typede... | [
"identifier.change",
"expression.operation.binary.change"
] | 906,951 | 906,953 | u328811800 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,965 | 906,966 | u014442925 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> P;
typedef unsign... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> P;
typedef unsign... | [
"expression.operation.binary.remove"
] | 906,971 | 906,972 | u765815947 | cpp |
p03096 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 906,973 | 906,974 | u516525290 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 906,983 | 906,984 | u832995587 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | [
"literal.number.change",
"variable_declaration.value.change"
] | 906,991 | 906,990 | u826189900 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++)
cin >> c[i];
c.erase(unique(c.begin(), c.end()), c.end());
int C = *max_element(c.begin(), c.end());
n = c.size();
vector<ll> dp(n +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++)
cin >> c[i];
c.erase(unique(c.begin(), c.end()), c.end());
int C = *max_element(c.begin(), c.end());
n = c.size();
vector<ll> dp(n +... | [
"expression.operation.binary.remove"
] | 906,996 | 906,997 | u813174766 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define long long ll
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define long long ll
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 907,015 | 907,016 | u942393279 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int N;
vector<int> C;
vector<int> memo;
vector<int> nearest;
vector<int> ind;
int f(int i) {
if (i >= nearest.size())
return 1;
if (memo[i] != -1)
return memo[i];
if (nearest[i] == -1) {
return memo[i] = f(i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int N;
vector<int> C;
vector<int> memo;
vector<int> nearest;
vector<int> ind;
int f(int i) {
if (i >= nearest.size())
return 1;
if (memo[i] != -1)
return memo[i];
if (nearest[i] == -1) {
return memo[i] = f(i ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,017 | 907,018 | u167988719 | cpp |
p03096 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [] | 907,023 | 907,024 | u128572736 | cpp |
p03096 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#in... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 907,025 | 907,024 | u128572736 | cpp |
p03096 | //高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i+... | //高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i+... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"assignment.variable.change"
] | 907,033 | 907,034 | u450007962 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> a(n), ls(n + 1, -1);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<ll> dp(n);
dp[0] = 1;
ls[a[0]] = 0;
for (int i = 1; i < n; i++) {
ll inx = ls[a[i]];
if (inx == -1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> a(200005), ls(200005, -1);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<ll> dp(200005);
dp[0] = 1;
ls[a[0]] = 0;
for (int i = 1; i < n; i++) {
ll inx = ls[a[i]];
if... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,039 | 907,040 | u429261574 | cpp |
p03096 | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 907,048 | 907,049 | u653699618 | cpp |
p03096 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
const int N = 300100;
const int MOD = (int)1e9 + 7;
int n, a[N], f[N], d[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
f[a[i]] = 0;
}
d[0] = ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
const int N = 300100;
const int MOD = (int)1e9 + 7;
int n, a[N], f[N], d[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
f[a[i]] = 0;
}
d[0] = ... | [
"control_flow.loop.for.condition.change"
] | 907,052 | 907,053 | u902910558 | cpp |
p03096 | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>... | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>... | [
"assignment.change",
"assignment.value.change"
] | 907,063 | 907,062 | u302000346 | cpp |
p03096 | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//#d... | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//#d... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,076 | 907,077 | u521389909 | cpp |
p03096 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int n, i, t, c, dp[200003] = {};
const int mod = 1e9 + 7;
vector<int> cv;
map<int, ll> m;
cv.push_back(0);
t = 1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> c;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int n, i, t, c, dp[200003] = {};
const int mod = 1e9 + 7;
vector<int> cv;
map<int, int> m;
cv.push_back(0);
t = 1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> c;
... | [
"assignment.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,080 | 907,081 | u088895504 | cpp |
p03096 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.b... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.b... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 907,084 | 907,085 | u733814820 | cpp |
p03096 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [] | 907,086 | 907,087 | u841131859 | cpp |
p03096 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"variable_declaration.type.change"
] | 907,088 | 907,087 | u841131859 | cpp |
p03096 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.change"
] | 907,089 | 907,087 | u841131859 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,092 | 907,091 | u714538557 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,093 | 907,094 | u004411048 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vec c(n);
for (ll i = 0; i < n; i++) {
cin >> c[i];
}
vec dp(n + 1);
vec left(2e5 + 1, -1);
dp[0] = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vec c(n);
for (ll i = 0; i < n; i++) {
cin >> c[i];
}
vec dp(n + 1);
vec left(2e5 + 1, -1);
dp[0] = 1;
for ... | [] | 907,095 | 907,096 | u718758485 | cpp |
p03096 | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vect... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vect... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,097 | 907,098 | u862095327 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,099 | 907,100 | u917282863 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,107 | 907,108 | u806999568 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,121 | 907,120 | u572472538 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 907,122 | 907,120 | u572472538 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long Nc;
cin >> Nc;
vector<long> C;
for (long i = 0; i < Nc; i++) {
long c;
cin >> c;
c--;
if (i == 0 || c != C[C.size() - 1])
C.push_back(c);
}
long N = C.size();
vector<long> DP(N, 1), L(Nc, 0);
fo... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long Nc;
cin >> Nc;
vector<long> C;
for (long i = 0; i < Nc; i++) {
long c;
cin >> c;
c--;
if (i == 0 || c != C[C.size() - 1])
C.push_back(c);
}
long N = C.size();
Nc = 200000;
vector<long> DP(N, 1),... | [
"assignment.add"
] | 907,136 | 907,137 | u236193715 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long Nc;
cin >> Nc;
vector<long> C;
for (long i = 0; i < Nc; i++) {
long c;
cin >> c;
c--;
if (i == 0 || c != C[C.size() - 1])
C.push_back(c);
}
long N = C.size();
vector<long> DP(N, 1), L(Nc, 0);
for... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long Nc;
cin >> Nc;
vector<long> C;
for (long i = 0; i < Nc; i++) {
long c;
cin >> c;
c--;
if (i == 0 || c != C[C.size() - 1])
C.push_back(c);
}
long N = C.size();
Nc = 200000;
vector<long> DP(N, 1),... | [
"assignment.add"
] | 907,138 | 907,137 | u236193715 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mod 1000000007
#define pb emplace_back
#define mp make_pair
#define fi first
#define sec second
typedef long long ll;
typ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mod 1000000007
#define pb emplace_back
#define mp make_pair
#define fi first
#define sec second
typedef long long ll;
typ... | [
"expression.operation.binary.remove"
] | 907,141 | 907,142 | u232189905 | cpp |
p03096 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define INF 1000000009
#define LINF 1000000000000000009
#define double long double
#define all(a) a.beg... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define INF 1000000009
#define LINF 1000000000000000009
#define double long double
#define all(a) a.beg... | [] | 907,147 | 907,148 | u179970156 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
const int _ = 2e5 + 7, MOD = 1e9 + 7;
int dp[_], sum[_], arr[_], pos, N;
int main() {
scanf("%d", &N);
int pre = 0;
for (int i = 1, x; i <= N; ++i) {
scanf("%d", &x);
if (pre != x)
arr[++pos] = pre = x;
}
dp[1] = sum[arr[1]] = 1;
for (int i = 2; ... | #include <bits/stdc++.h>
using namespace std;
const int _ = 2e5 + 7, MOD = 1e9 + 7;
int dp[_], sum[_], arr[_], pos, N;
int main() {
scanf("%d", &N);
int pre = 0;
for (int i = 1, x; i <= N; ++i) {
scanf("%d", &x);
if (pre != x)
arr[++pos] = pre = x;
}
dp[1] = sum[arr[1]] = 1;
for (int i = 2; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 907,166 | 907,167 | u563201135 | cpp |
p03096 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
for (int i... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
for (int i... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,170 | 907,171 | u658993896 | cpp |
p03096 | #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))
#define All(a) (a).begin(), (a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
int N;
int m... | #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))
#define All(a) (a).begin(), (a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
int N;
int m... | [
"assignment.change"
] | 907,182 | 907,183 | u280114218 | cpp |
p03096 | #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))
#define All(a) (a).begin(), (a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
int N;
int m... | #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))
#define All(a) (a).begin(), (a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
int N;
int m... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,185 | 907,183 | u280114218 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,186 | 907,187 | u017271745 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tu... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tu... | [] | 907,194 | 907,195 | u155416173 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tu... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tu... | [
"variable_declaration.value.change"
] | 907,196 | 907,195 | u155416173 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(10);
#define rep(i, n) for (int i ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,199 | 907,200 | u184335045 | cpp |
p03096 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | [
"assignment.change"
] | 907,201 | 907,202 | u783675879 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.