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 |
|---|---|---|---|---|---|---|---|
p03173 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
int a[n + 1];
int csum[n + 1];
a[0] = 0;
csum[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
csum[i] = a[i] + csum[i - 1];
}
int dp[n + 1][n + 1];
memset(dp, 0, size... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
int a[n + 1];
int csum[n + 1];
a[0] = 0;
csum[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
csum[i] = a[i] + csum[i - 1];
}
int dp[n + 1][n + 1];
memset(dp, 0, size... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,307 | 981,308 | u536383397 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
int N;
int a[410];
int b[410];
long long dp[410][410];
bool ischecked[410][410] = {false... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
int N;
long long a[410];
long long b[410];
long long dp[410][410];
bool ischecked[410][4... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 981,313 | 981,314 | u843175622 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
long long helper(vector<long long> &vec, vector<vector<long long>> &dp,
long long l, long long r) {
if (l == r)
return 0;
if (l + 1 == r)
return dp[l][r] = vec[l] + vec[r];
if (dp[l][r] != -1)
return dp[l][r];
long l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
long long helper(vector<long long> &vec, vector<vector<long long>> &dp,
long long l, long long r) {
if (l == r)
return 0;
if (l + 1 == r)
return dp[l][r] = vec[l] + vec[r];
if (dp[l][r] != -1)
return dp[l][r];
long l... | [
"literal.number.change",
"call.arguments.change"
] | 981,315 | 981,316 | u492789403 | cpp |
p03173 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define int long long int
#define endl "\n"
#define PI 3.14159265
int MAX_CHARS = 10000;
const int mod = 1e9 + 7;
const int INF = LONG_LONG_MAX;
inline int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline int pow(int a, int ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define int long long int
#define endl "\n"
#define PI 3.14159265
int MAX_CHARS = 10000;
const int mod = 1e9 + 7;
const int INF = LONG_LONG_MAX;
inline int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline int pow(int a, int ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 981,319 | 981,320 | u452103000 | cpp |
p03173 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define int long long int
#define endl "\n"
#define PI 3.14159265
int MAX_CHARS = 10000;
const int mod = 1e9 + 7;
const int INF = LONG_LONG_MAX;
inline int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline int pow(int a, int ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define int long long int
#define endl "\n"
#define PI 3.14159265
int MAX_CHARS = 10000;
const int mod = 1e9 + 7;
const int INF = LONG_LONG_MAX;
inline int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline int pow(int a, int ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 981,321 | 981,320 | u452103000 | cpp |
p03173 | #include <bits/stdc++.h>
#include <cstring>
#include <limits>
using namespace std;
#define ll long long int
#define X first
#define Y second
#define fw(i, start, end) for (ll i = start; i < end; ++i)
#define fe(i, start, end) for (ll i = start; i <= end; ++i)
#define L(T) ... | #include <bits/stdc++.h>
#include <cstring>
#include <limits>
using namespace std;
#define ll long long int
#define X first
#define Y second
#define fw(i, start, end) for (ll i = start; i < end; ++i)
#define fe(i, start, end) for (ll i = start; i <= end; ++i)
#define L(T) ... | [
"assignment.value.change",
"identifier.change"
] | 981,324 | 981,325 | u161386534 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define fi first
#define si second
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define fi first
#define si second
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie... | [] | 981,328 | 981,329 | u677037883 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
static const int64_t INF = 1000000000000000000;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int64_t dp[N][N];
for (int i = 0; i < N; i++)
dp[i][i] = 0;
for (int l = 1; l <= N - 1; l++) {
int64_t s... | #include <bits/stdc++.h>
using namespace std;
static const int64_t INF = 1000000000000000000;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int64_t dp[N][N];
for (int i = 0; i < N; i++)
dp[i][i] = 0;
for (int l = 1; l <= N - 1; l++) {
int64_t s... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 981,334 | 981,333 | u101018317 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
unsigned long long int dp2[n + 1] = {0};
int i, j, k;
for (i = 0; i < n; i++) {
cin >> a[i];
dp2[i + 1] = dp2[i] + a[i];
}
unsigned long long int dp[n][n], m;
for (i = 0; i < n; i++) {
dp[i][i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
unsigned long long int dp2[n + 1] = {0};
int i, j, k;
for (i = 0; i < n; i++) {
cin >> a[i];
dp2[i + 1] = dp2[i] + a[i];
}
unsigned long long int dp[n][n], m;
for (i = 0; i < n; i++) {
dp[i][i]... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 981,342 | 981,341 | u639413043 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
long long int dp2[n + 1] = {0};
int i, j, k;
for (i = 0; i < n; i++) {
cin >> a[i];
dp2[i + 1] = dp2[i] + a[i];
}
long long int dp[n][n], m;
for (i = 0; i < n; i++) {
dp[i][i] = 0;
}
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
unsigned long long int dp2[n + 1] = {0};
int i, j, k;
for (i = 0; i < n; i++) {
cin >> a[i];
dp2[i + 1] = dp2[i] + a[i];
}
unsigned long long int dp[n][n], m;
for (i = 0; i < n; i++) {
dp[i][i]... | [
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 981,343 | 981,341 | u639413043 | cpp |
p03173 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 30)
ll dp[440][440];
ll sum[440][440];
ll a[440];
int main() {
int n;
cin >> n;
rep(i, n) cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
ll dp[440][440];
ll sum[440][440];
ll a[440];
int main() {
int n;
cin >> n;
rep(i, n) cin >>... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 981,356 | 981,357 | u503228842 | cpp |
p03173 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 30)
ll dp[440][440];
ll sum[440][440];
ll a[440];
int main() {
int n;
cin >> n;
rep(i, n) cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
ll dp[440][440];
ll sum[440][440];
ll a[440];
int main() {
int n;
cin >> n;
rep(i, n) cin >>... | [
"preprocessor.define.value.change",
"literal.integer.change",
"assignment.value.change",
"identifier.change"
] | 981,358 | 981,357 | u503228842 | cpp |
p03173 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 30)
int dp[440][440];
int sum[440][440];
int a[440];
int main() {
int n;
cin >> n;
rep(i, n) cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
ll dp[440][440];
ll sum[440][440];
ll a[440];
int main() {
int n;
cin >> n;
rep(i, n) cin >>... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change"
] | 981,359 | 981,357 | u503228842 | cpp |
p03173 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MAX = 1e9 + 1;
const int MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<pair<ll, ll>>> dp(
n + 1, vector<pair<ll, ll>>(n + 1, make_pair(INT_MAX,... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MAX = 1e9 + 1;
const int MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<pair<ll, ll>>> dp(
n + 1, vector<pair<ll, ll>>(n + 1, make_pair(LLONG_MAX... | [
"identifier.change",
"call.arguments.change"
] | 981,360 | 981,361 | u896475222 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9 + 7;
ll dp[405][405];
int main() {
int n;
cin >> n;
memset(dp, 0x1c, sizeof(dp));
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
auto sum = [&](int l, int r) {
ll s = 0;
for (int i = l; i <= r; i++) ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9 + 7;
ll dp[405][405];
int main() {
int n;
cin >> n;
memset(dp, 0x1c, sizeof(dp));
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
auto sum = [&](int l, int r) {
ll s = 0;
for (int i = l; i <= r; i++) ... | [
"variable_declaration.type.change"
] | 981,364 | 981,365 | u500482384 | cpp |
p03173 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | [
"identifier.change",
"call.arguments.change"
] | 981,366 | 981,367 | u264405855 | cpp |
p03173 | /*input
4
10 20 30 40
*/
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const int SINF = 10... | /*input
5
10 10 10 10 10
*/
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const int SINF =... | [
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change"
] | 981,368 | 981,369 | u464574147 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[401];
ll dp[401][401];
ll get(int i, int j) { return a[j] - (i > 0 ? a[i - 1] : 0); }
ll solve(int i, int j) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = INT_MAX;
for (int k = i; k < j; k++)
dp[i][j... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[401];
ll dp[401][401];
ll get(int i, int j) { return a[j] - (i > 0 ? a[i - 1] : 0); }
ll solve(int i, int j) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = 1e17;
for (int k = i; k < j; k++)
dp[i][j] =... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,388 | 981,389 | u879906354 | cpp |
p03173 | #include <algorithm>
#include <climits>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007
ll dp[405][405];
int main() {
for (int i = 0; i < 405; i... | #include <algorithm>
#include <climits>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define mod 1000000007
ll dp[405][405];
int main() {
for (int i = 0; i < 405; i... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,398 | 981,399 | u545278207 | cpp |
p03173 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll prefix[402];
ll cost[402][402];
ll sum(int l, int r) { return prefix[r] - (l > 0 ? prefix[l - 1] : 0); }
int main() {
int n;
cin >> n;
vector... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll prefix[402];
ll cost[402][402];
ll sum(int l, int r) { return prefix[r] - (l > 0 ? prefix[l - 1] : 0); }
int main() {
int n;
cin >> n;
vector... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 981,404 | 981,405 | u270654502 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll n, ans = 0, A[401], dp[401][401][2] = {0}, inf = 1e18;
int main() {
cin >> n;
rep(i, n) cin ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll n, ans = 0, A[401], dp[401][401][2] = {0}, inf = 1e18;
int main() {
cin >> n;
rep(i, n) cin ... | [] | 981,406 | 981,407 | u441296840 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void min_self(ll &a, ll b) { a = min(a, b); }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) {
cin >> x;
}
vector<vector<ll>> dp(n, vector<ll>(n, 1e13 + 5));
vector<int> prefix(n);
prefix[0] = a[0];
for (int i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void min_self(ll &a, ll b) { a = min(a, b); }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) {
cin >> x;
}
vector<vector<ll>> dp(n, vector<ll>(n, 1e13 + 5));
vector<ll> prefix(n);
prefix[0] = a[0];
for (int i ... | [] | 981,420 | 981,421 | u906885500 | cpp |
p03173 | // https://atcoder.jp/contests/dp/tasks/dp_n
#include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#defi... | // https://atcoder.jp/contests/dp/tasks/dp_n
#include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#defi... | [
"literal.number.change",
"assignment.value.change"
] | 981,430 | 981,431 | u130958693 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v(n);
vector<ll> sum(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
if (i == 0)
sum[i] = v[i];
else
sum[i] = v[i] + sum[i - 1];
}
vector<vector<ll>> dp(n, vector<ll>(n, 0))... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v(n);
vector<ll> sum(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
if (i == 0)
sum[i] = v[i];
else
sum[i] = v[i] + sum[i - 1];
}
vector<vector<ll>> dp(n, vector<ll>(n, 0))... | [
"assignment.value.change",
"identifier.change"
] | 981,432 | 981,433 | u249211191 | cpp |
p03173 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using Graph = vector<vector<edge>>;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using Graph = vector<vector<edge>>;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {... | [] | 981,436 | 981,437 | u539011156 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int find(ll a[], int n) {
ll c[n + 1][n + 1];
ll sums[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
ll s = 0;
for (int j = i; j <= n; j++) {
s += a[j];
sums[i][j] = s;
}
}
for (int s = 0; s < n; s++) {
for (i... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll find(ll a[], int n) {
ll c[n + 1][n + 1];
ll sums[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
ll s = 0;
for (int j = i; j <= n; j++) {
s += a[j];
sums[i][j] = s;
}
}
for (int s = 0; s < n; s++) {
for (in... | [] | 981,438 | 981,439 | u535367554 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int find(int a[], int n) {
ll c[n + 1][n + 1];
ll sums[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
int s = 0;
for (int j = i; j <= n; j++) {
s += a[j];
sums[i][j] = s;
}
}
for (int s = 0; s < n; s++) {
for ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll find(ll a[], int n) {
ll c[n + 1][n + 1];
ll sums[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
ll s = 0;
for (int j = i; j <= n; j++) {
s += a[j];
sums[i][j] = s;
}
}
for (int s = 0; s < n; s++) {
for (in... | [
"variable_declaration.type.change"
] | 981,440 | 981,439 | u535367554 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int find(int a[], int n) {
ll c[n + 1][n + 1];
ll sums[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
int s = 0;
for (int j = i; j <= n; j++) {
s += a[j];
sums[i][j] = s;
}
}
for (int s = 0; s < n; s++) {
for ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll find(ll a[], int n) {
ll c[n + 1][n + 1];
ll sums[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
ll s = 0;
for (int j = i; j <= n; j++) {
s += a[j];
sums[i][j] = s;
}
}
for (int s = 0; s < n; s++) {
for (in... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change"
] | 981,441 | 981,439 | u535367554 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[401];
ll dp[401][401];
ll solve(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
int sum = 0;
if (l == r)
return 0;
for (int i = l; i <= r; i++) {
sum += a[i];
}
ll mn = 1e18;
for (int i = l; i < r; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[401];
ll dp[401][401];
ll solve(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
ll sum = 0;
if (l == r)
return 0;
for (int i = l; i <= r; i++) {
sum += a[i];
}
ll mn = 1e18;
for (int i = l; i < r; i++) {... | [
"variable_declaration.type.change"
] | 981,449 | 981,450 | u048420094 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[401];
ll dp[401][401];
ll solve(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
int sum = 0;
if (l == r)
return 0;
for (int i = l; i <= r; i++) {
sum += a[i];
}
ll mn = 0x7fffffff;
for (int i = l; i < r;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[401];
ll dp[401][401];
ll solve(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
ll sum = 0;
if (l == r)
return 0;
for (int i = l; i <= r; i++) {
sum += a[i];
}
ll mn = 1e18;
for (int i = l; i < r; i++) {... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 981,451 | 981,450 | u048420094 | cpp |
p03173 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> prefix;
ll dp[401][401];
ll minCost(vector<int> a, int i, int j) {
if (i >= j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll sum = 0;
if (i > 0) {
sum = prefix[j] - prefix[i - 1];
} else {
s... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> prefix;
ll dp[401][401];
ll minCost(vector<ll int> a, int i, int j) {
if (i >= j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll sum = 0;
if (i > 0) {
sum = prefix[j] - prefix[i - 1];
} else {
... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,454 | 981,455 | u348267046 | cpp |
p03173 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[401][401];
ll prefix[401];
ll v[401];
ll solve(int i, int j) {
if (i >= j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll ans = LLONG_MAX;
ll s;
if (i > 0) {
s = prefix[j] - prefix[i - 1];
} else {
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[401][401];
ll prefix[401];
ll v[401];
ll solve(int i, int j) {
if (i >= j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll ans = LLONG_MAX;
ll s;
if (i > 0) {
s = prefix[j] - prefix[i - 1];
} else {
... | [
"expression.operation.binary.add"
] | 981,456 | 981,457 | u348267046 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
const int N = 405;
const int A = 1e9 + 5;
int sl[N];
int64_t dp[N][N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> sl[i], dp[i][i] = 0;
auto sum = [&](int L, int R) {
int64_t s = 0;
for (int i = L; i <= R; i++) {
s += sl[... | #include <bits/stdc++.h>
using namespace std;
const int N = 405;
const int A = 1e9 + 5;
int sl[N];
int64_t dp[N][N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> sl[i], dp[i][i] = 0;
auto sum = [&](int L, int R) {
int64_t s = 0;
for (int i = L; i <= R; i++) {
s += sl[... | [
"assignment.value.change",
"identifier.change"
] | 981,469 | 981,470 | u479813076 | cpp |
p03173 | #include <bits/stdc++.h>
#define FAST_INPUT \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long
using namespace ... | #include <bits/stdc++.h>
#define FAST_INPUT \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long
using namespace ... | [
"variable_declaration.type.change"
] | 981,485 | 981,486 | u278805281 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const ll INF = 2e18;
int n;
vector<int> nums(405, 0);
ll sum(int l, int r) {
ll sum = 0;
for (int i = l; i <= r; i++) {
sum += nums[i];
}
return sum;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const ll INF = 2e18;
int n;
vector<int> slimes(405, 0);
ll sum(int l, int r) {
ll sum = 0;
for (int i = l; i <= r; i++) {
sum += slimes[i];
}
return sum;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(N... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 981,487 | 981,488 | u414957786 | cpp |
p03173 | /*
() ()()()() () () () () ()
()() () () ()() () ()() ()() ()
() () () () () () () () () () () ()
()()()() () () () () () ()()()() () () ()
() () () () () ... | /*
() ()()()() () () () () ()
()() () () ()() () ()() ()() ()
() () () () () () () () () () () ()
()()()() () () () () () ()()()() () () ()
() () () () () ... | [
"type_conversion.add"
] | 981,496 | 981,497 | u651612828 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 401
#define inf (1LL << 60)
int n;
int a[nn], dp[nn][nn], sum[nn][nn];
void preprocess() {
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
sum[i][j] = a[j] + ((j == i) ? 0 : sum[i][j - 1]);
}
}
}
int solve... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 401
#define inf (1LL << 60)
int n;
int a[nn], dp[nn][nn], sum[nn][nn];
void preprocess() {
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
sum[i][j] = a[j] + ((j == i) ? 0 : sum[i][j - 1]);
}
}
}
int solve... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,498 | 981,499 | u093748998 | cpp |
p03173 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using n... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using n... | [
"variable_declaration.value.change",
"call.add"
] | 981,504 | 981,505 | u409668302 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf pow(10, 18);
vector<ll> arr;
vector<vector<ll>> dp;
vector<vector<ll>> cost;
pair<ll, ll> help(int i, int j) {
if (i > j)
return {0, 0};
if (i == j) {
dp[i][j] = arr[i];
cost[i][j] = dp[i][j];
return {0, dp[i][j]};
}... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf pow(10, 18);
vector<ll> arr;
vector<vector<ll>> dp;
vector<vector<ll>> cost;
pair<ll, ll> help(int i, int j) {
if (i > j)
return {0, 0};
if (i == j) {
dp[i][j] = arr[i];
cost[i][j] = dp[i][j];
return {0, dp[i][j]};
}... | [
"expression.operation.binary.remove"
] | 981,506 | 981,507 | u651012287 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll maxn = 1e9 + 7;
ll dp[500][500]; // dp[i][j] represents total cost from i to j;
vector<ll> v;
ll sum(ll l, ll r) {
ll s = 0;
for (ll i = l; i <= r; i++)
s += v[i];
return s;
}
int main() {
ll n, i, j;
cin >> n;
for (i = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll maxn = 1e18 + 7;
ll dp[500][500]; // dp[i][j] represents total cost from i to j;
vector<ll> v;
ll sum(ll l, ll r) {
ll s = 0;
for (ll i = l; i <= r; i++)
s += v[i];
return s;
}
int main() {
ll n, i, j;
cin >> n;
for (i = 0... | [
"literal.number.change",
"expression.operation.binary.change"
] | 981,509 | 981,510 | u857888442 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[3001][3001];
ll sum[3001][3001];
ll slimes(vector<ll> &v, int i, int j) {
if (i == j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll minCost = INT_MAX;
for (int k = i; k < j; k++) {
minCost = min(minCost, sum[i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[3001][3001];
ll sum[3001][3001];
ll slimes(vector<ll> &v, int i, int j) {
if (i == j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll minCost = 1000000000000000;
for (int k = i; k < j; k++) {
minCost = min(minCo... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,516 | 981,515 | u510516229 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define debug(var) \
do { \
std::cout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define debug(var) \
do { \
std::cout ... | [
"variable_declaration.type.change"
] | 981,519 | 981,520 | u279033107 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define debug(var) \
do { \
std::cout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define debug(var) \
do { \
std::cout ... | [
"variable_declaration.type.change"
] | 981,521 | 981,520 | u279033107 | cpp |
p03173 | #include <bits/stdc++.h>
#define endl '\n'
#define PI 3.14159265358979323844
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define mp make_pair
#define pb push_back
#d... | #include <bits/stdc++.h>
#define endl '\n'
#define PI 3.14159265358979323844
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define mp make_pair
#define pb push_back
#d... | [] | 981,531 | 981,532 | u594918324 | cpp |
p03173 | #include <iostream>
using namespace std;
long rec(int a[], int n, long **mem, int i, int j, int sum[]) {
if (i == j)
return 0;
if (mem[i][j] != 1e18)
return mem[i][j];
for (int k = i; k <= j; k++)
mem[i][j] =
min(mem[i][j], rec(a, n, mem, i, k, sum) +
rec(a, n, mem,... | #include <iostream>
using namespace std;
long rec(int a[], int n, long **mem, int i, int j, long sum[]) {
if (i == j)
return 0;
if (mem[i][j] != 1e18)
return mem[i][j];
for (int k = i; k <= j; k++)
mem[i][j] =
min(mem[i][j], rec(a, n, mem, i, k, sum) +
rec(a, n, mem... | [
"variable_declaration.type.primitive.change"
] | 981,537 | 981,538 | u933124026 | cpp |
p03173 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> v(n);
for (int i = 1; i <= n; i++)
cin >> v[i];
v[0] = 0;
for (int i = 1; i <= n; i++)
v[i] += v[i - 1];
long dp[n + 1][n + 1];
for (int i = 0; i <= n; i++) {
for (int ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
v[0] = 0;
for (int i = 1; i <= n; i++)
v[i] += v[i - 1];
long dp[n + 1][n + 1];
for (int i = 0; i <= n; i++) {
for (... | [
"assignment.change"
] | 981,539 | 981,540 | u933124026 | cpp |
p03173 | #include <bits/stdc++.h>
#define db(x) cout << x << " "
#define db1(x) cout << x << '\n'
#define db2(x, y) cout << x << " " << y << '\n'
#define db3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, ... | #include <bits/stdc++.h>
#define db(x) cout << x << " "
#define db1(x) cout << x << '\n'
#define db2(x, y) cout << x << " " << y << '\n'
#define db3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, ... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,544 | 981,545 | u483789716 | cpp |
p03173 | /*
Author : DemonStar
*/
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using n... | /*
Author : DemonStar
*/
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using n... | [
"literal.number.change",
"call.arguments.change"
] | 981,550 | 981,551 | u831139780 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sz(x) ((long long)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const ld eps = 1e-9;
const ld pi = acosl(-1);
const int mod = 998244353;
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sz(x) ((long long)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const ld eps = 1e-9;
const ld pi = acosl(-1);
const int mod = 998244353;
co... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,552 | 981,553 | u834005964 | cpp |
p03173 | #include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N;
long long a[409];
long long dp[409][409];
long long solve(int l, int r) {
if (l == r)
return 0;
if (dp[l][r] != 0)
return dp[l][r];
long long res = INF;
for (int i = l; i < r; i++)
res = min(res, solve(l, i) + solve... | #include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N;
long long a[409];
long long dp[409][409];
long long solve(int l, int r) {
if (l == r)
return 0;
if (dp[l][r] != 0)
return dp[l][r];
long long res = INF;
for (int i = l; i < r; i++)
res = min(res, solve(l, i) + solve... | [
"literal.number.change",
"io.output.change"
] | 981,554 | 981,555 | u047554023 | cpp |
p03173 | // ysh_gpta
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace ... | // ysh_gpta
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace ... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,559 | 981,560 | u898771121 | cpp |
p03173 | // ysh_gpta
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace ... | // ysh_gpta
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace ... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,561 | 981,562 | u898771121 | cpp |
p03173 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
#defin... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 981,568 | 981,569 | u299869545 | cpp |
p03173 | // youngjinp20
// 2020 03
#include <bits/stdc++.h>
#define by(x) [](const auto &a, const auto &b) { return a.x < b.x; }
#define byr(x) [](const auto &a, const auto &b) { return a.x > b.x; }
#define smax(a, b) ((a) < (b) ? ((a) = (b), true) : false)
#define smin(a, b) ((a) > (b) ? ((a) = (b), true) : false)
using names... | // youngjinp20
// 2020 03
#include <bits/stdc++.h>
#define by(x) [](const auto &a, const auto &b) { return a.x < b.x; }
#define byr(x) [](const auto &a, const auto &b) { return a.x > b.x; }
#define smax(a, b) ((a) < (b) ? ((a) = (b), true) : false)
#define smin(a, b) ((a) > (b) ? ((a) = (b), true) : false)
using names... | [
"literal.number.change",
"variable_declaration.value.change"
] | 981,572 | 981,573 | u688683948 | cpp |
p03173 | #include <bits/stdc++.h>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
P dp[400][400];
int main() {
int n;
cin >> n;
rep(i, n) {
cin >> dp[i][i].first;
dp[i][i].second = 0;
}
for (int i = 1; i < n; i++)
for... | #include <bits/stdc++.h>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
pair<ll, ll> dp[400][400];
int main() {
int n;
cin >> n;
rep(i, n) {
cin >> dp[i][i].first;
dp[i][i].second = 0;
}
for (int i = 1; i < n; i... | [
"variable_declaration.type.change"
] | 981,574 | 981,575 | u164112876 | cpp |
p03173 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize(3)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC target("sse3","sse2","sse")
//#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
//#pragma GCC target("f16c")
//#p... | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize(3)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC target("sse3","sse2","sse")
//#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
//#pragma GCC target("f16c")
//#p... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 981,576 | 981,577 | u337802798 | cpp |
p03173 | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
// A
// int main()
//{
// int n, h;
// std::vector<int> heights;
//
// cin >> n;
// for (int i = 0; i < n; ++i)
// {
// cin >> h;
// heights.push_back(h);
// }
//
// vector<int> m(n, 0... | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
// A
// int main()
//{
// int n, h;
// std::vector<int> heights;
//
// cin >> n;
// for (int i = 0; i < n; ++i)
// {
// cin >> h;
// heights.push_back(h);
// }
//
// vector<int> m(n, 0... | [
"assignment.value.change",
"identifier.change"
] | 981,586 | 981,587 | u052234601 | cpp |
p03173 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
#define pi pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define N 404
#define INF 1e9 +... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
#define pi pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define N 404
#define INF 1e15
... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 981,588 | 981,589 | u751243213 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
const int MAX_N = 500;
const int inf = 2e9;
int a[MAX_N];
int dp[MAX_N][MAX_N];
signed main(void) {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 1; i < N; i++) { //幅を先に決める
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
const int MAX_N = 500;
const int inf = 1LL << 60;
int a[MAX_N];
int dp[MAX_N][MAX_N];
signed main(void) {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 1; i < N; i++) { //幅を先に決める
... | [
"literal.number.change"
] | 981,600 | 981,601 | u904123392 | cpp |
p03173 | // She is Pretty pretty!
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
const int N = 1100;
ll n, a[N], f[N][N], sum[N];
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
memset(f, 0x3f, sizeof f);
f... | // She is Pretty pretty!
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
const int N = 1100;
ll n, a[N], f[N][N], sum[N];
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
memset(f, 0x3f, sizeof f);
f... | [
"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"
] | 981,602 | 981,603 | u862413182 | cpp |
p03173 | /*
DATE: 2020-03-12 13:02:27
NAME:
PROBLEM: ATDPN
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400;
const long long LLINF = 1e15;
int a[MAXN + 7];
long long pre[MAXN + 7];
long long sum(int l, int r) { return pre[r] - pre[l - 1]; }
long long dp[MAXN + 7][MAXN + 7];
lo... | /*
DATE: 2020-03-12 13:02:27
NAME:
PROBLEM: ATDPN
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400;
const long long LLINF = 1e15;
int a[MAXN + 7];
long long pre[MAXN + 7];
long long sum(int l, int r) { return pre[r] - pre[l - 1]; }
long long dp[MAXN + 7][MAXN + 7];
lo... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 981,604 | 981,605 | u242454152 | cpp |
p03173 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"expression.operation.binary.remove"
] | 981,606 | 981,607 | u508571192 | cpp |
p03173 | #include <bits/stdc++.h>
#define int long long int
#define pll pair<int, int>
#define dbl long double
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define eps 0.00000001
#define inf 10000000000001
#define all(x) (x).begin(), (x).end()
#define size(x) (int)(x).size()
#define pb(x) push_bac... | #include <bits/stdc++.h>
#define int long long int
#define pll pair<int, int>
#define dbl long double
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define eps 0.00000001
#define inf 10000000000001
#define all(x) (x).begin(), (x).end()
#define size(x) (int)(x).size()
#define pb(x) push_bac... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,610 | 981,611 | u443507760 | cpp |
p03173 | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <c... | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <c... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,612 | 981,613 | u385780408 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int SIZE = 404;
const int INF = 1e18 + 3000;
int dp[SIZE][SIZE];
int tab[SIZE];
int pre[SIZE];
int n, p = 0;
void input() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tab[i];
p += tab[i];
pre[i] = p;
}
}
void infinity() {... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int SIZE = 404;
const int INF = 1e18 + 3000;
int dp[SIZE][SIZE];
int tab[SIZE];
int pre[SIZE];
int n, p = 0;
void input() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tab[i];
p += tab[i];
pre[i] = p;
}
}
void infinity() {... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,614 | 981,615 | u662817252 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int SIZE = 404;
const int INF = 1000;
int dp[SIZE][SIZE];
int tab[SIZE];
int pre[SIZE];
int n, p = 0;
void input() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tab[i];
p += tab[i];
pre[i] = p;
}
}
void infinity() {
for ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int SIZE = 404;
const int INF = 1e18 + 3000;
int dp[SIZE][SIZE];
int tab[SIZE];
int pre[SIZE];
int n, p = 0;
void input() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tab[i];
p += tab[i];
pre[i] = p;
}
}
void infinity() {... | [
"literal.number.change"
] | 981,616 | 981,615 | u662817252 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 575;
const long long... | #include <bits/stdc++.h>
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 575;
const long long... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 981,628 | 981,629 | u615258936 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = (ll)(1e9 + 7);
ll run();
int main() {
#ifdef home
freopen("i", "r", stdin);
freopen("d", "w", stderr);
#endif
cout.precision(15);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
run();
return 0;
}
const... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = (ll)(1e9 + 7);
ll run();
int main() {
#ifdef home
freopen("i", "r", stdin);
freopen("d", "w", stderr);
#endif
cout.precision(15);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
run();
return 0;
}
const... | [
"variable_declaration.type.change"
] | 981,634 | 981,635 | u244818078 | cpp |
p03173 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define limit(... | [
"call.remove"
] | 981,644 | 981,645 | u850516963 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> pre, v;
vector<vector<ll>> dp;
int n;
int main() {
cin >> n;
v.resize(n);
pre.resize(n, 0);
dp.resize(n);
for (auto &i : v)
cin >> i;
// for(auto x: v) cout << x << " ";
pre[0] = v[0];
for (int i = 1; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> pre, v;
vector<vector<ll>> dp;
int n;
int main() {
cin >> n;
v.resize(n);
pre.resize(n, 0);
dp.resize(n);
for (auto &i : v)
cin >> i;
// for(auto x: v) cout << x << " ";
pre[0] = v[0];
for (int i = 1; i < n; i++) {
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.change"
] | 981,668 | 981,669 | u495742512 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
vector<ll> arr, ps;
vector<vector<int>> dp;
ll solve(int x, int y) {
if (x == y)
return 0;
if (dp[x][y] != -1)
return dp[x][y];
// if(x > y) return 0;
ll mn = LONG_LONG_MAX;
for (int p = x + 1; p <= y; p++) {
ll l = sol... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
vector<ll> arr, ps;
vector<vector<ll>> dp;
ll solve(int x, int y) {
if (x == y)
return 0;
if (dp[x][y] != -1)
return dp[x][y];
// if(x > y) return 0;
ll mn = LONG_LONG_MAX;
for (int p = x + 1; p <= y; p++) {
ll l = solv... | [
"call.arguments.change"
] | 981,674 | 981,675 | u556467689 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define f(i, a, n) for (int i = a; i < n; i++)
#define all(c) (c).begin(), (c).end()
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(nullptr);
typedef long double ld;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define f(i, a, n) for (int i = a; i < n; i++)
#define all(c) (c).begin(), (c).end()
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(nullptr);
typedef long double ld;
typedef... | [
"identifier.change",
"function.return_value.change",
"variable_declaration.value.change"
] | 981,680 | 981,681 | u670919462 | cpp |
p03173 | #include <bits/stdc++.h>
typedef long long int ll;
#define vaibhavv06 \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define end... | #include <bits/stdc++.h>
typedef long long int ll;
#define vaibhavv06 \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define end... | [
"assignment.value.change",
"identifier.change"
] | 981,693 | 981,694 | u699580536 | cpp |
p03173 | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 10000000000006;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1, 0);
vector<vector<long long>> dp(1005, vector<long long>(1005, MAX));
vector<long long> s(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
s... | #include <iostream>
#include <vector>
using namespace std;
const long long MAX = 10000000000006;
int main() {
int n;
cin >> n;
vector<long long> a(n + 9, 0);
vector<vector<long long>> dp(1005, vector<long long>(1005, MAX));
vector<long long> s(n + 9, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 981,697 | 981,698 | u189233751 | cpp |
p03173 | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 10000000000006;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1, 0);
vector<vector<long long>> dp(1005, vector<long long>(1005, MAX));
vector<long long> s(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
s... | #include <iostream>
#include <vector>
using namespace std;
const long long MAX = 10000000000006;
int main() {
int n;
cin >> n;
vector<long long> a(n + 9, 0);
vector<vector<long long>> dp(1005, vector<long long>(1005, MAX));
vector<long long> s(n + 9, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 981,699 | 981,698 | u189233751 | cpp |
p03173 | #include <fstream>
#include <iostream>
using namespace std;
int n;
long long dp[1005][1005];
long long slimes[100005];
long long p[100005];
void init() {
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 10000006;
// for(int i = 0; i <= n; i++)
// slimes[i] = 0;
}
void prelucrare();
... | #include <fstream>
#include <iostream>
using namespace std;
int n;
long long dp[1005][1005];
long long slimes[100005];
long long p[100005];
void init() {
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 10000000000006;
// for(int i = 0; i <= n; i++)
// slimes[i] = 0;
}
void prelucra... | [
"literal.number.change",
"assignment.value.change"
] | 981,704 | 981,703 | u389347166 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i < (int)n; i++)
#define endl '\n'
#define IOS \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i < (int)n; i++)
#define endl '\n'
#define IOS \
ios_base::sync_with_stdio(0); ... | [
"identifier.change",
"call.function.change"
] | 981,711 | 981,712 | u651954565 | cpp |
p03173 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long dp[410][410];
vector<long long> v;
cin >> n;
v.resize(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dp[i][j] = 1e9;
for (int i = 1; ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long dp[410][410];
vector<long long> v;
cin >> n;
v.resize(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dp[i][j] = 1e17;
for (int i = 1;... | [
"literal.number.change",
"assignment.value.change"
] | 981,716 | 981,717 | u771099984 | cpp |
p03173 | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long int ar[n + 1];
long long int cum[n + 1];
ar[0] = cum[0] = 0;
for (int i =... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long int ar[n + 1];
long long int cum[n + 1];
ar[0] = cum[0] = 0;
for (int i =... | [
"variable_declaration.value.change",
"identifier.change"
] | 981,720 | 981,721 | u764355221 | cpp |
p03173 | #pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define mod 1000000007
using namespace std;
ll n, a[410], dp[410][410], sum[410];
int main() {
// ifstream cin("tst.in");
// ofstream cout("tst.out");
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ci... | #pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define mod 1000000007
using namespace std;
ll n, a[410], dp[410][410], sum[410];
int main() {
// ifstream cin("tst.in");
// ofstream cout("tst.out");
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ci... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 981,722 | 981,723 | u093252820 | cpp |
p03173 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | [
"expression.operation.binary.remove"
] | 981,726 | 981,727 | u548624367 | cpp |
p03173 | /// i thought of single state not possible because
/*#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
ll a[505];
ll s[505];
ll dp[505];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
if(i==1) s[i] = a[i];
else{
s[i] = ... | /// i thought of single state not possible because
/*#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
ll a[505];
ll s[505];
ll dp[505];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
if(i==1) s[i] = a[i];
else{
s[i] = ... | [
"literal.number.change",
"assignment.value.change"
] | 981,732 | 981,733 | u090794688 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
long long dp[1000][1000], p[1005], n, a[1005];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
p[0] = 0;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 1e9;
for (int i = 0; i < n; i++) {
p[i + 1] = (p[i] +... | #include <bits/stdc++.h>
using namespace std;
long long dp[1000][1000], p[1005], n, a[1005];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
p[0] = 0;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = 1e18;
for (int i = 0; i < n; i++) {
p[i + 1] = (p[i] ... | [
"literal.number.change",
"assignment.value.change"
] | 981,745 | 981,746 | u072293533 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int solve(vector<vector<int>> &dp, int i, int j, vector<int> s) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int mn = INT_MAX;
for (int k = i; k < j; k++) {
mn = min(mn, solve(dp, i, k, s) + solve(dp, k + 1, j, s));
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int solve(vector<vector<int>> &dp, int i, int j, vector<int> s) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int mn = INT_MAX;
for (int k = i; k < j; k++) {
mn = min(mn, solve(dp, i, k, s) + solve(dp, k + 1, j, s));
... | [
"variable_declaration.value.change"
] | 981,761 | 981,762 | u207955315 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<vector<ll>> dp(n, vector<ll>(n, INT_MAX));
vector<vector<ll>> pre(n, vector<ll>(n, 0));
for (int i = 0; i < n; i++) {
ll sum = 0;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<vector<ll>> dp(n, vector<ll>(n, 9999999999999999));
vector<vector<ll>> pre(n, vector<ll>(n, 0));
for (int i = 0; i < n; i++) {
ll ... | [] | 981,766 | 981,767 | u645622153 | cpp |
p03173 | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | [
"variable_declaration.type.primitive.change"
] | 981,768 | 981,769 | u625893557 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<db, db> pdd;
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<db, db> pdd;
typedef vecto... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,776 | 981,777 | u692657943 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 403;
int n;
int a[N], pref[N];
int dp[N][N];
int recur(int i, int j) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int ans = INT_MAX;
for (int k = i; k <= j - 1; k++)
ans = min(ans, recur(i, k) + r... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 403;
int n;
int a[N], pref[N];
int dp[N][N];
int recur(int i, int j) {
if (i == j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int ans = 1e18;
for (int k = i; k <= j - 1; k++)
ans = min(ans, recur(i, k) + recu... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 981,788 | 981,789 | u231045825 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int dp[401][401];
int A[401];
int sm(int l, int r) {
int q = 0;
for (int i = 0; i <= r; i++)
q = q + A[i];
return q;
}
signed main() {
int n, k;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
for (int l = n - 1; l >= 0; l-... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int dp[401][401];
int A[401];
int sm(int l, int r) {
int q = 0;
for (int i = l; i <= r; i++)
q = q + A[i];
return q;
}
signed main() {
int n, k;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
for (int l = n - 1; l >= 0; l-... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 981,794 | 981,795 | u463305326 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
vector<ll> pref(k + 1);
pref[0] = 1;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
vector<ll> pref(k + 1);
pref[0] = 1;
for (int i = ... | [
"assignment.change"
] | 981,805 | 981,806 | u150659133 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
vector<ll> pref(k + 1);
pref[0] = 1;
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1));
vector<ll> pref(k + 1);
pref[0] = 1;
for (int i = ... | [
"assignment.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 981,807 | 981,806 | u150659133 | cpp |
p03172 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | [
"assignment.change"
] | 981,812 | 981,813 | u431173823 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define vi vector<int>
#define pb emplace_back
#define sz(x) (int)x.size()
#define all(v) v.begin(), v.end()
#define x first
#define y second
#define rep(i, j, k) for (i = j; i < k; i++)
#define sep(i, j, k) for (i = j; i > k;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define vi vector<int>
#define pb emplace_back
#define sz(x) (int)x.size()
#define all(v) v.begin(), v.end()
#define x first
#define y second
#define rep(i, j, k) for (i = j; i < k; i++)
#define sep(i, j, k) for (i = j; i > k;... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 981,840 | 981,841 | u761472821 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
const int mod = 1e9 + 7;
inline void add_self(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
if (x < 0)
x += mod;
}
inline void add_range(vector<int> &v, int x, int l, int r) {
add... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
const int mod = 1e9 + 7;
inline void add_self(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
if (x < 0)
x += mod;
}
inline void add_range(vector<int> &v, int x, int l, int r) {
add... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 981,848 | 981,849 | u711859557 | cpp |
p03172 | #include <bits/stdc++.h>
#define int long long
#define mod ((int)1e9 + 7)
using namespace std;
int a, dp[10000007];
void solve() {
int n, k;
cin >> n >> k;
dp[0] = 1;
for (int i = 1; i <= n; i++) {
cin >> a;
for (int j = 1; j <= k; j++)
dp[j] = (dp[j - 1] % mod + dp[j] % mod) % mod;
for (in... | #include <bits/stdc++.h>
#define int long long
#define mod ((int)1e9 + 7)
using namespace std;
int a, dp[10000007];
void solve() {
int n, k;
cin >> n >> k;
dp[0] = 1;
for (int i = 1; i <= n; i++) {
cin >> a;
for (int j = 1; j <= k; j++)
dp[j] = (dp[j - 1] % mod + dp[j] % mod) % mod;
for (in... | [
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 981,854 | 981,855 | u361596783 | cpp |
p03172 | #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) \... | [
"assignment.change"
] | 981,856 | 981,857 | u692632484 | cpp |
p03172 | #include <bits/stdc++.h>
#define Nmax 3005
using namespace std;
const long long INF = 1e18l;
ifstream f("1.in");
ofstream g("1.out");
const int mod = 1e9 + 7;
void add_self(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
void sub_self(int &a, int b) {
a -= b;
if (a < 0)
a += mod;
}
int main() {... | #include <bits/stdc++.h>
#define Nmax 3005
using namespace std;
const long long INF = 1e18l;
ifstream f("1.in");
ofstream g("1.out");
const int mod = 1e9 + 7;
void add_self(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
void sub_self(int &a, int b) {
a -= b;
if (a < 0)
a += mod;
}
int main() {... | [
"variable_access.subscript.index.change",
"io.output.change",
"expression.operation.binary.remove"
] | 981,869 | 981,870 | u275238097 | cpp |
p03172 | #define ONLINE_JUDGE
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <vector>
#ifndef ONLINE_JUDGE
#include <prettyprint/prettyprint.hpp>
#endif
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define TEST ... | #define ONLINE_JUDGE
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <vector>
#ifndef ONLINE_JUDGE
#include <prettyprint/prettyprint.hpp>
#endif
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define TEST ... | [
"identifier.change",
"call.arguments.change"
] | 981,873 | 981,874 | u702346849 | cpp |
p03172 | #include <functional>
#include <iostream>
#include <vector>
using namespace std;
const int MD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
function<long long(int, int)> solve = [&](... | #include <functional>
#include <iostream>
#include <vector>
using namespace std;
const int MD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
function<long long(int, int)> solve = [&](... | [
"assignment.change"
] | 981,883 | 981,884 | u467133453 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll mod = 1e9 + 7;
int main() {
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll mod = 1e9 + 7;
int main() {
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
... | [
"assignment.change"
] | 981,889 | 981,890 | u825143564 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.