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 |
|---|---|---|---|---|---|---|---|
p03172 | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | #include "algorithm"
#include "bitset"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#inclu... | [
"assignment.change"
] | 981,893 | 981,894 | u468700753 | cpp |
p03172 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
... | [
"control_flow.return.add"
] | 981,903 | 981,904 | u217145434 | cpp |
p03172 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
FOR(i, 1, n ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
FOR(i, 1, n ... | [
"assignment.change"
] | 981,908 | 981,909 | u772304668 | cpp |
p03172 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
FOR(i, 1, n ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
FOR(i, 1, n ... | [
"assignment.change"
] | 981,910 | 981,909 | u772304668 | cpp |
p03172 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
FOR(i, 1, n ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
FOR(i, 1, n ... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 981,911 | 981,909 | u772304668 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
// macros
#define... | #include <bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
// macros
#define... | [
"expression.operation.binary.add",
"call.add",
"call.arguments.change"
] | 981,921 | 981,922 | u493148162 | cpp |
p03172 | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 105, MAX_K = 1e5 + 5, MOD = 1e9 + 7;
long long no_of_ways[MAX_N][MAX_K], sum_no_of_ways[MAX_N][MAX_K];
int main() {
int no_of_people, no_of_candies;
cin >> no_of_people >> no_of_candies;
vector<int> limit(no_of_peo... | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 105, MAX_K = 1e5 + 5, MOD = 1e9 + 7;
long long no_of_ways[MAX_N][MAX_K], sum_no_of_ways[MAX_N][MAX_K];
int main() {
int no_of_people, no_of_candies;
cin >> no_of_people >> no_of_candies;
vector<int> limit(no_of_peo... | [
"assignment.change"
] | 981,923 | 981,924 | u927253988 | cpp |
p03172 | #include <iostream>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<int> dp(K + 1, 0);
dp[0] = 1;
for (int i = 0; i < N; ++i) {
vector<int> dp_(K + 1, 0);
int s = 0;
for... | #include <iostream>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<int> dp(K + 1, 0);
dp[0] = 1;
for (int i = 0; i < N; ++i) {
vector<int> dp_(K + 1, 0);
int s = 0;
for... | [
"expression.operator.change"
] | 981,927 | 981,928 | u107077660 | cpp |
p03172 | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long long int dp[n][k + 1];
long long int sum[n][k + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= ... | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long long int dp[n][k + 1];
long long int sum[n][k + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j <= ... | [
"assignment.change"
] | 981,937 | 981,938 | u806543889 | cpp |
p03172 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
... | [
"assignment.change"
] | 981,939 | 981,940 | u780950519 | cpp |
p03172 | #include <iostream>
#include <vector>
using namespace std;
static const int kModulo = 1000 * 1000 * 1000 + 7;
int main() {
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> ways(K + 1, 0);
ways[0] = 1;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
vector<int> partial(N + 1... | #include <iostream>
#include <vector>
using namespace std;
static const int kModulo = 1000 * 1000 * 1000 + 7;
int main() {
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> ways(K + 1, 0);
ways[0] = 1;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
vector<int> partial(K + 1... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 981,950 | 981,951 | u577270802 | cpp |
p03172 | #include <iostream>
#include <vector>
using namespace std;
static const int kModulo = 1000 * 1000 * 1000 + 7;
int main() {
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> ways(K + 1, 0);
ways[0] = 1;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
vector<int> partial(N);
... | #include <iostream>
#include <vector>
using namespace std;
static const int kModulo = 1000 * 1000 * 1000 + 7;
int main() {
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> ways(K + 1, 0);
ways[0] = 1;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
vector<int> partial(K + 1... | [
"assignment.change"
] | 981,952 | 981,951 | u577270802 | cpp |
p03172 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#inc... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#inc... | [
"expression.operator.change"
] | 981,961 | 981,962 | u977184814 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll ... | #include <bits/stdc++.h>
using namespace std;
vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll ... | [
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 981,970 | 981,971 | u559507546 | cpp |
p03172 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#inc... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#inc... | [
"call.arguments.change"
] | 981,977 | 981,978 | u423166489 | cpp |
p03172 | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
void solve() {
int N, K, a;
cin >> N >> K;
vector<int> dp(K + 1);
dp[0] = 1;
for (int i = 0; i < N; i++) {
cin >> a;
vector<int> nx = dp;
for (int j = 1; j <= K; j++) {
if (j > a) {
(nx[j] += nx[j - 1] - dp[j -... | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
void solve() {
int N, K, a;
cin >> N >> K;
vector<long> dp(K + 1);
dp[0] = 1;
for (int i = 0; i < N; i++) {
cin >> a;
vector<long> nx = dp;
for (int j = 1; j <= K; j++) {
if (j > a) {
(nx[j] += nx[j - 1] - dp[j... | [
"variable_declaration.type.primitive.change"
] | 981,979 | 981,980 | u344412812 | cpp |
p03172 | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
void solve() {
int N, K, a;
cin >> N >> K;
vector<int> dp(K + 1);
dp[0] = 1;
for (int i = 0; i < N; i++) {
cin >> a;
vector<int> nx = dp;
for (int j = 1; j <= K; j++) {
if (j > a) {
(nx[j] += nx[j - 1] - dp[j -... | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
void solve() {
int N, K, a;
cin >> N >> K;
vector<long> dp(K + 1);
dp[0] = 1;
for (int i = 0; i < N; i++) {
cin >> a;
vector<long> nx = dp;
for (int j = 1; j <= K; j++) {
if (j > a) {
(nx[j] += nx[j - 1] - dp[j... | [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 981,981 | 981,980 | u344412812 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
#define ld double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi>
#define str string
#define vs vector<str>
#define vb vector<bool>
#define mii map<int, int>
#define mp make_pair
#define mod 1000000007
#define pii pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#define ld double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi>
#define str string
#define vs vector<str>
#define vb vector<bool>
#define mii map<int, int>
#define mp make_pair
#define mod 1000000007
#define pii pair<int, i... | [
"expression.operation.binary.add"
] | 981,990 | 981,991 | u908296547 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
int main() {
lli n, k;
cin >> n >> k;
lli i, j, l;
lli a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
lli dp[n + 1][k + 1];
for (i = 0; i <= n; i++) {
for (j = 0; j <= k; j++) {
dp[i][j] = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
int main() {
lli n, k;
cin >> n >> k;
lli i, j, l;
lli a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
lli dp[n + 1][k + 1];
for (i = 0; i <= n; i++) {
for (j = 0; j <= k; j++) {
dp[i][j] = 0;
... | [
"assignment.change"
] | 981,992 | 981,993 | u533093031 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
int main() {
int n, k;
cin >> n >> k;
int i, j, l;
int a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1][k + 1];
for (i = 0; i <= n; i++) {
for (j = 0; j <= k; j++) {
dp[i][j] = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
int main() {
lli n, k;
cin >> n >> k;
lli i, j, l;
lli a[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
lli dp[n + 1][k + 1];
for (i = 0; i <= n; i++) {
for (j = 0; j <= k; j++) {
dp[i][j] = 0;
... | [
"variable_declaration.type.change",
"assignment.change"
] | 981,994 | 981,993 | u533093031 | cpp |
p03172 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"assignment.change",
"expression.operation.binary.remove"
] | 982,007 | 982,008 | u905715926 | cpp |
p03172 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"assignment.change"
] | 982,009 | 982,008 | u905715926 | cpp |
p03172 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"assignment.change"
] | 982,010 | 982,008 | u905715926 | cpp |
p03172 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 982,007 | 982,011 | u905715926 | cpp |
p03172 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [] | 982,009 | 982,011 | u905715926 | cpp |
p03172 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [] | 982,010 | 982,011 | u905715926 | cpp |
p03172 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"expression.operation.binary.add"
] | 982,010 | 982,012 | u905715926 | cpp |
p03172 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | [
"assignment.change"
] | 982,033 | 982,034 | u120810144 | cpp |
p03172 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | [
"expression.operation.binary.add"
] | 982,035 | 982,036 | u968834127 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <int MD> struct ModInt {
typedef ModInt M;
int v;
ModInt(int _v = 0) : v(_v) {}
M &operator+=(const M &r) {
if ((v += r.v - MD) < 0)
v += MD;
return *this;
}
M &operator-=(const M &r) {
if ((v -= r.v) < 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <int MD> struct ModInt {
typedef ModInt M;
int v;
ModInt(int _v = 0) : v(_v) {}
M &operator+=(const M &r) {
if ((v += r.v - MD) < 0)
v += MD;
return *this;
}
M &operator-=(const M &r) {
if ((v -= r.v) < 0)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 982,041 | 982,042 | u242534780 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <int MD> struct ModInt {
typedef ModInt M;
int v;
ModInt(int _v = 0) : v(_v) {}
M &operator+=(const M &r) {
if ((v += r.v - MD) < 0)
v += MD;
return *this;
}
M &operator-=(const M &r) {
if ((v -= r.v) < 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <int MD> struct ModInt {
typedef ModInt M;
int v;
ModInt(int _v = 0) : v(_v) {}
M &operator+=(const M &r) {
if ((v += r.v - MD) < 0)
v += MD;
return *this;
}
M &operator-=(const M &r) {
if ((v -= r.v) < 0)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 982,043 | 982,042 | u242534780 | cpp |
p03172 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#includ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#includ... | [
"expression.operator.change",
"assignment.change"
] | 982,044 | 982,045 | u783676040 | cpp |
p03172 | #include <bits/stdc++.h>
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> dp(k + 2);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
vector<int> nxt(k + 2);
for (int j = 0; j <= a[i]... | #include <bits/stdc++.h>
using namespace std;
constexpr int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> dp(k + 2);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
vector<int> nxt(k + 2);
for (int j = 0; j <= k; +... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 982,054 | 982,055 | u733618878 | cpp |
p03173 | // include
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue... | // include
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue... | [
"call.arguments.add"
] | 982,064 | 982,063 | u424621178 | cpp |
p03173 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
... | [
"call.remove"
] | 982,065 | 982,066 | u018679195 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n), pre(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
pre[i] = i == 0 ? A[i] : pre[i - 1] + A[i];
}
vector<vector<long long>> dp(n, vector<long long>(n, pow(10, 18)));
for (int i = n - 1; i >= 0; i--) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n), pre(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
pre[i] = i == 0 ? A[i] : pre[i - 1] + A[i];
}
vector<vector<long long>> dp(n, vector<long long>(n, pow(10, 18)));
for (int i = n - 1; i >= 0; i--) ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 982,067 | 982,068 | u155258214 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define ip pair<int, int>
#define it pair<int, pair<int, int>>
#define F first
#define S second
#define fori(p, n) for (int i = p; i < n; i++)
#define forj(q, m) for (int j = q; j < m; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define ip pair<int, int>
#define it pair<int, pair<int, int>>
#define F first
#define S second
#define fori(p, n) for (int i = p; i < n; i++)
#define forj(q, m) for (int j = q; j < m; ... | [
"assignment.value.change",
"identifier.change"
] | 982,075 | 982,076 | u022809468 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll dp[404][404];
ll arr[404];
ll solve(ll l, ll r) {
if (l > r)
return 0;
if (l == r)
return arr[l];
if (dp[l][r] != -1)
return dp[l][r];
// cout<<l<<' '<<r<<'\n';
ll x = arr[l] + min(solve(l + 2, r), solve(l + 1, r - 1));
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll dp[404][404];
ll arr[404];
ll solve(ll l, ll r) {
if (l > r)
return 0;
if (l == r)
return arr[l];
if (dp[l][r] != -1)
return dp[l][r];
// cout<<l<<' '<<r<<'\n';
ll x = arr[l] + min(solve(l + 2, r), solve(l + 1, r - 1));
... | [
"literal.number.change",
"assignment.value.change"
] | 982,079 | 982,080 | u408933336 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
long long dp[401][401];
long long sum[401][401];
long long func(long long i, long long j, long long *a) {
if (i == j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
dp[i][j] = INT_MAX;
for (long long x = i; x < j; x++) {
dp[i][j] = min(func(... | #include <bits/stdc++.h>
using namespace std;
long long dp[401][401];
long long sum[401][401];
long long func(long long i, long long j, long long *a) {
if (i == j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
dp[i][j] = LLONG_MAX;
for (long long x = i; x < j; x++) {
dp[i][j] = min(fun... | [
"assignment.value.change",
"identifier.change"
] | 982,081 | 982,082 | u633697116 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
vector<ll> sum(N + 1, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<vector<ll>> dp(N + 1, vector<ll>(N + 1, 0));
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
vector<ll> sum(N + 1, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<vector<ll>> dp(N + 1, vector<ll>(N + 1, 0));
for (int ... | [
"assignment.value.change",
"identifier.change"
] | 982,092 | 982,093 | u907512832 | cpp |
p03173 | #include <bits/stdc++.h>
#define loop(i, a, b) for (lli i = a; i <= b; ++i)
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
... | #include <bits/stdc++.h>
#define loop(i, a, b) for (lli i = a; i <= b; ++i)
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 982,097 | 982,098 | u699025659 | cpp |
p03173 | // https://atcoder.jp/contests/dp/tasks/dp_n
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
void helper(const vector<long long> &slimes, vector<vector<long long>> ... | // https://atcoder.jp/contests/dp/tasks/dp_n
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
void helper(const vector<long long> &slimes, vector<vector<long long>> ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 982,101 | 982,102 | u184819501 | cpp |
p03173 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1145141919810893;
int N;
ll dp[400][400];
ll cost[400];
ll ruisekiwa[401]; // idx i ~ idx j (i < j)は [i, j)
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> cost[i];
ruisekiwa[i + 1] = cost[i] +... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1145141919810893;
int N;
ll dp[400][400];
ll cost[400];
ll ruisekiwa[401]; // idx i ~ idx j (i < j)は [i, j)
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> cost[i];
ruisekiwa[i + 1] = cost[i] +... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 982,107 | 982,108 | u107077805 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[409], sum[409][409], siz[409][409], s[409];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s[i + 1] = s[i] + a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
sum[i][j] = 999999999;
}
for (i... | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[409], sum[409][409], siz[409][409], s[409];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s[i + 1] = s[i] + a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
sum[i][j] = 99999999999999999;
}
... | [
"literal.number.change",
"assignment.value.change"
] | 982,110 | 982,111 | u035652615 | cpp |
p03173 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll infl = 10000000; // inflは十分大きい
// N,a[404];入力値、b[404]:b[n]はa[0]からb[n]までの和
int N;
ll a[404], b[404];
// bの初期化
void init_b() {
b[0] = a[0];
for (int i = 1; i < N; i++)
b[i] = a[i] + b[i - 1];
}
// a[L]からa[R]までの総和
ll get(in... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll infl = 100000000000000000000; // inflは十分大きい
// N,a[404];入力値、b[404]:b[n]はa[0]からb[n]までの和
int N;
ll a[404], b[404];
// bの初期化
void init_b() {
b[0] = a[0];
for (int i = 1; i < N; i++)
b[i] = a[i] + b[i - 1];
}
// a[L]からa[R]まで... | [
"literal.number.change",
"variable_declaration.value.change"
] | 982,112 | 982,113 | u010393289 | cpp |
p03173 | // BROWNIE TK
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf po... | // BROWNIE TK
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf po... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.change"
] | 982,122 | 982,123 | u653959743 | cpp |
p03173 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define FOR(i, a, b) for (long long int i = a; i < b; i++)
#define sz(s) (long long int)(s).size()
#define pb push_back
#define mp make_pair
const ll inf = 1000000000;
const ll MOD = 1000000007;
int main(void) {
ios_base::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define FOR(i, a, b) for (long long int i = a; i < b; i++)
#define sz(s) (long long int)(s).size()
#define pb push_back
#define mp make_pair
const ll inf = 1e17;
const ll MOD = 1000000007;
int main(void) {
ios_base::sync_with_stdio(false);
cin.t... | [
"literal.number.change",
"variable_declaration.value.change"
] | 982,124 | 982,125 | u660054140 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
long long dp[405][405];
int main() {
int n;
cin >> n;
vector<long long> arr(n + 1);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
vector<long long> sum(n);
for (int i = 0; i < n; ++i) {
sum[i] = arr[i];
if (i > 0) {
sum[i] += sum[i - 1];
... | #include <bits/stdc++.h>
using namespace std;
long long dp[405][405];
int main() {
int n;
cin >> n;
vector<long long> arr(n + 1);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
vector<long long> sum(n);
for (int i = 0; i < n; ++i) {
sum[i] = arr[i];
if (i > 0) {
sum[i] += sum[i - 1];
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 982,146 | 982,147 | u542111796 | cpp |
p03173 | #include <cstdlib>
#include <iostream>
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main() {
int cale = 0, mid, len, l, r, i, n;
cin >> n;
int pref[n], a[n], dp[n][n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
pref[0] = a... | #include <cstdlib>
#include <iostream>
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main() {
long long cale = 0, mid, len, l, r, i, n;
cin >> n;
long long pref[n], a[n], dp[n][n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 982,151 | 982,152 | u700270455 | cpp |
p03173 | #include <bits/stdc++.h>
#define DIM 407
#define INF 1000000007
using namespace std;
long long n, a[DIM], p[DIM], d[DIM][DIM];
long long F(int l, int r) {
if (d[l][r] != -1)
return d[l][r];
if (l == r)
return d[l][r] = 0, 0;
d[l][r] = INF;
for (int i = l; i < r; ++i)
d[l][r] = min(d[l][r], F(l, i)... | #include <bits/stdc++.h>
#define DIM 407
#define INF 1000000000000000007LL
using namespace std;
long long n, a[DIM], p[DIM], d[DIM][DIM];
long long F(int l, int r) {
if (d[l][r] != -1)
return d[l][r];
if (l == r)
return d[l][r] = 0, 0;
d[l][r] = INF;
for (int i = l; i < r; ++i)
d[l][r] = min(d[l][... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 982,162 | 982,163 | u674071078 | cpp |
p03173 | //** aman**/
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define l... | //** aman**/
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define l... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 982,173 | 982,174 | u006069211 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 440;
const ll INF = 1e8 + 7;
ll dp[M][M], a[M], pre[M];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 440;
const ll INF = 1e18 + 7;
ll dp[M][M], a[M], pre[M];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 982,256 | 982,257 | u230002616 | cpp |
p03173 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [
"control_flow.return.add"
] | 982,271 | 982,272 | u283869437 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
int arr[500];
long long int dp[500][500], pre[420];
int N;
long long int solve(int i, int j) {
if (i == j - 1)
return arr[i] + arr[j];
if (i == j)
return 0;
if (dp[i][j] != 1e9)
return dp[i][j];
for (int low = i; low < j; low++)
dp[i][j] =
... | #include <bits/stdc++.h>
using namespace std;
int arr[500];
long long int dp[500][500], pre[420];
int N;
long long int solve(int i, int j) {
if (i == j - 1)
return arr[i] + arr[j];
if (i == j)
return 0;
if (dp[i][j] != 1e15)
return dp[i][j];
for (int low = i; low < j; low++)
dp[i][j] =
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 982,281 | 982,282 | u292217769 | cpp |
p03173 | /*
$$$$$$$\ $$\ $$$$$$$\
$$ __$$\ \__| $$ __$$\
$$ | $$ | $$$$$$\ $$$$$$\ $$\ $$$$$$$\ $$ | $$ | $$$$$$\ $$$$$$\
$$$$$$$\ $$$$$$\
$$$$$$$\ |$$ __$$\ $$ __$$\ $$ |$$ _____|$$$$$$$\ | \____$$\ $$
__$$\ $$ _____... | /*
$$$$$$$\ $$\ $$$$$$$\
$$ __$$\ \__| $$ __$$\
$$ | $$ | $$$$$$\ $$$$$$\ $$\ $$$$$$$\ $$ | $$ | $$$$$$\ $$$$$$\
$$$$$$$\ $$$$$$\
$$$$$$$\ |$$ __$$\ $$ __$$\ $$ |$$ _____|$$$$$$$\ | \____$$\ $$
__$$\ $$ _____... | [
"assignment.value.change",
"identifier.change"
] | 982,288 | 982,289 | u604519317 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[1000][1000];
ll arr[1000];
ll sum(int i, int j) {
ll ans = 0;
for (int a = i; a <= j; a++) {
ans += arr[a];
}
return ans;
}
ll ans(int i, int j) {
if (i >= j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = IN... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[500][500];
ll arr[500];
ll sum(int i, int j) {
ll ans = 0;
for (int a = i; a <= j; a++) {
ans += arr[a];
}
return ans;
}
ll ans(int i, int j) {
if (i >= j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = 10000... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 982,300 | 982,301 | u885151856 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long uLL;
typedef long long int LL;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<long long, long long> pll;
typedef pair<long long, pll> plll;
const int N = 1e5 + 5;
const int inf = 1e9;
const long long INF = 1e18;
const doubl... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long uLL;
typedef long long int LL;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<long long, long long> pll;
typedef pair<long long, pll> plll;
const int N = 1e5 + 5;
const int inf = 1e9;
const long long INF = 1e18;
const doubl... | [
"variable_declaration.type.change"
] | 982,302 | 982,303 | u872217461 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long uLL;
typedef long long int LL;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<long long, long long> pll;
typedef pair<long long, pll> plll;
const int N = 1e5 + 5;
const int inf = 1e9;
const long long INF = 1e18;
const doubl... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long uLL;
typedef long long int LL;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<long long, long long> pll;
typedef pair<long long, pll> plll;
const int N = 1e5 + 5;
const int inf = 1e9;
const long long INF = 1e18;
const doubl... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.change"
] | 982,304 | 982,303 | u872217461 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; ++i)... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 982,305 | 982,306 | u906129425 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 INF = 1LL << 59;
int N, A[401];
int64 dp[400][400];
int64 getCost(int l, int r) { return A[r + 1] - A[l]; }
int64 rec(int l, int r) {
if (l == r)
return 0;
if (~dp[l][r])
return dp[l][r];
int64 ret = INF;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 INF = 1LL << 59;
int64 N, A[401];
int64 dp[400][400];
int64 getCost(int l, int r) { return A[r + 1] - A[l]; }
int64 rec(int l, int r) {
if (l == r)
return 0;
if (~dp[l][r])
return dp[l][r];
int64 ret = INF;
for (int ... | [
"variable_declaration.type.change"
] | 982,321 | 982,322 | u524343822 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[3005][3005];
ll a[3005], pre[3005];
ll mini(ll x, ll y) {
if (x >= y)
return y;
return x;
}
int main(void) {
// your code goes here
int n, k, i;
multiset<ll> s;
scanf("%d", &n);
ll ans = 0;
ll x, y;
for (i = 1; i <= n; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[3005][3005];
ll a[3005], pre[3005];
ll mini(ll x, ll y) {
if (x >= y)
return y;
return x;
}
int main(void) {
// your code goes here
int n, k, i;
multiset<ll> s;
scanf("%d", &n);
ll ans = 0;
ll x, y;
for (i = 1; i <= n; i++) ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 982,331 | 982,332 | u582770155 | cpp |
p03173 | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define MAXN 405
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll n, k, a[MAXN], dp[MAXN][MAXN], sum[MAXN];
int main() {
scanf("%lld", &n);
for (ll i = 1; i <= n; i+... | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define MAXN 405
#define INF 1000000000000000000LL
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll n, k, a[MAXN], dp[MAXN][MAXN], sum[MAXN];
int main() {
scanf("%lld", &n);
for (ll i = 1;... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 982,335 | 982,336 | u237254894 | cpp |
p03174 | // by Top1
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<long, long>
#define mp make_pair
#define pb push_back
#define pf push_front
#define pp pop_back
#define rev reverse
#define all(s)... | // by Top
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<long, long>
#define mp make_pair
#define pb push_back
#define pf push_front
#define pp pop_back
#define rev reverse
#define all(s) ... | [
"assignment.value.change",
"identifier.change"
] | 982,190 | 982,191 | u018679195 | cpp |
p03174 | // by Top1
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<long, long>
#define mp make_pair
#define pb push_back
#define pf push_front
#define pp pop_back
#define rev reverse
#define all(s)... | // by Top1
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<long, long>
#define mp make_pair
#define pb push_back
#define pf push_front
#define pp pop_back
#define rev reverse
#define all(s)... | [
"assignment.value.change",
"identifier.change"
] | 982,190 | 982,192 | u018679195 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 3e3 + 5, inf = INT_MAX, mod = 1e9 + 7;
int n, dp[22][(1 << 22)], a[22][22];
int solve(int i, int mask) {
if (i == n)
return 1;
if (dp[i][mask] != -1)
return dp[i][mask];
int ans = 0;
for (int j =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 3e3 + 5, inf = INT_MAX, mod = 1e9 + 7;
int n, dp[22][(1 << 22)], a[22][22];
int solve(int i, int mask) {
if (i == n)
return 1;
if (dp[i][mask] != -1)
return dp[i][mask];
int ans = 0;
for (int j =... | [
"assignment.change"
] | 982,201 | 982,202 | u836953711 | cpp |
p03174 | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 982,226 | 982,227 | u752949890 | cpp |
p03174 | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("trapv")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 982,228 | 982,227 | u752949890 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a[22][22];
ll n;
const ll m = 1e9 + 7;
ll dp[22][1 << 21];
ll solve(ll index, ll mask) {
if (index == n) {
return 1;
}
if (dp[index][mask] != -1) {
return dp[index][mask];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if ((... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a[22][22];
ll n;
const ll m = 1e9 + 7;
ll dp[22][1 << 21];
ll solve(ll index, ll mask) {
if (index == n) {
return 1;
}
if (dp[index][mask] != -1) {
return dp[index][mask];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if ((... | [
"call.arguments.change"
] | 982,249 | 982,250 | u217234114 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | [
"assignment.change"
] | 982,347 | 982,348 | u987594251 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
const int N = 1e7, M = 7 + 1e9;
int n, t;
ll dp[21][N];
vector<int> v[21];
map<int, bool> sorryIhaveaboyfriend;
ll cal(int i, int taken) {
if (i == n)
return 1;
ll &ret = dp[i][taken];
if (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
const int N = 1e7, M = 7 + 1e9;
int n, t;
ll dp[21][2097152]; // (1 << 21)-1 the maximum number for the mask
vector<int> v[21];
map<int, bool> sorryIhaveaboyfriend;
ll cal(int i, int taken) {
if (i... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 982,349 | 982,350 | u148496542 | cpp |
p03174 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 982,353 | 982,354 | u537874719 | cpp |
p03174 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define pb push_back
#define size(v) (int)v.size()
#define fast \
ios_base::sync_with_stdio(false); ... | [
"control_flow.loop.for.condition.change"
] | 982,369 | 982,370 | u742642200 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod = 1000000007;
struct Mint {
// typedef long long LL;
LL x;
Mint(LL x = 0) : x((x % mod + mod) % mod) {}
Mint operator-() const { return Mint(-x); }
Mint &operator+=(const Mint a) {
if ((x += a.x) >= mod)
x -= mod;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod = 1000000007;
struct Mint {
// typedef long long LL;
LL x;
Mint(LL x = 0) : x((x % mod + mod) % mod) {}
Mint operator-() const { return Mint(-x); }
Mint &operator+=(const Mint a) {
if ((x += a.x) >= mod)
x -= mod;
... | [
"control_flow.branch.if.condition.change"
] | 982,375 | 982,376 | u385825353 | cpp |
p03174 | #include <bits/stdc++.h>
typedef int64_t LL;
using namespace std;
const int N = 25;
const int mod = 1e9 + 7;
bool A[N][N];
int n;
int dp[N][1 << 21];
LL solve(int k, int used) {
if (k == n)
return 1LL;
if (dp[k][used] >= 0)
return dp[k][used];
LL res = 0;
for (int i = 0; i < n; i++) {
if (A[k][i] &... | #include <bits/stdc++.h>
typedef int64_t LL;
using namespace std;
const int N = 25;
const int mod = 1e9 + 7;
bool A[N][N];
int n;
int dp[N][1 << 21];
LL solve(int k, int used) {
if (k == n)
return 1LL;
if (dp[k][used] >= 0)
return dp[k][used];
LL res = 0;
for (int i = 0; i < n; i++) {
if (A[k][i] &... | [
"call.arguments.add",
"call.arguments.change"
] | 982,377 | 982,378 | u385825353 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n;
int a[21];
int cnt[(1 << 21)];
int dp[(1 << 21)];
void builtin_popcount() {
for (int i = 1; i < (1 << 21); ++i) {
cnt[i] = cnt[i & (i - 1)] + 1;
}
}
int main() {
builtin_popcount();
cin >> n;
for (int i = 0; i < n; ++i) {
fo... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n;
int a[21];
int cnt[(1 << 21)];
int dp[(1 << 21)];
void builtin_popcount() {
for (int i = 1; i < (1 << 21); ++i) {
cnt[i] = cnt[i & (i - 1)] + 1;
}
}
int main() {
builtin_popcount();
cin >> n;
for (int i = 0; i < n; ++i) {
fo... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 982,379 | 982,380 | u734192058 | cpp |
p03174 | #include <bits/stdc++.h>
#define fi first
#define se second
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define for1(i, n) for (int i = 1; i <= (int)n; ++i)
#define fore(i, l, r) for (int i = (int)l; i <= (int)r; ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fored(i, l, r) for (int i = ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define for1(i, n) for (int i = 1; i <= (int)n; ++i)
#define fore(i, l, r) for (int i = (int)l; i <= (int)r; ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fored(i, l, r) for (int i = ... | [
"call.arguments.change"
] | 982,384 | 982,385 | u440697133 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"control_flow.branch.if.condition.change"
] | 982,408 | 982,409 | u530107518 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#include <unordered_map>
#define inputarr(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define prllarr(a, n) ... | #include <bits/stdc++.h>
using namespace std;
#include <unordered_map>
#define inputarr(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define prllarr(a, n) ... | [
"call.remove"
] | 982,428 | 982,429 | u818356308 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#include <unordered_map>
#define inputarr(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define prllarr(a, n) ... | #include <bits/stdc++.h>
using namespace std;
#include <unordered_map>
#define inputarr(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define prllarr(a, n) ... | [
"call.remove"
] | 982,430 | 982,431 | u818356308 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define LSB __builtin_ctzll
#define sc(a) scanf("%d", &a)
#define MSB 63 - __builtin_clzll
#define scl(a) scanf("%lld", &a)
#define BITS __builtin_popcountll
#define mem(a, v) memset(a, v, sizeof(a))
#define fastIO ... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define LSB __builtin_ctzll
#define sc(a) scanf("%d", &a)
#define MSB 63 - __builtin_clzll
#define scl(a) scanf("%lld", &a)
#define BITS __builtin_popcountll
#define mem(a, v) memset(a, v, sizeof(a))
#define fastIO ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 982,456 | 982,457 | u266944880 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define D(x) cerr << #x << " = " << (x) << '\n'
using ll = long long;
const int mod = 1e9 + 7;
void add_self(ll x, ll y) {
x += y;
if (x > mod)
x -= mod;
}
int main() {
ios::sync_with_stdio(false... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define D(x) cerr << #x << " = " << (x) << '\n'
using ll = long long;
const int mod = 1e9 + 7;
void add_self(ll &x, ll y) {
x += y;
if (x >= mod)
x -= mod;
}
int main() {
ios::sync_with_stdio(fal... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 982,458 | 982,459 | u403305794 | cpp |
p03174 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 982,460 | 982,461 | u614128939 | cpp |
p03174 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 982,462 | 982,461 | u614128939 | cpp |
p03174 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i,... | [
"call.arguments.add"
] | 982,473 | 982,474 | u863044225 | cpp |
p03174 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
#define INF 1100000000000
#define MAX 1100000
#define MOD 1000000007
typedef long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
#define INF 1100000000000
#define MAX 1100000
#define MOD 1000000007
typedef long... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 982,483 | 982,484 | u591914971 | cpp |
p03174 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int a[22][22];
long long dp[22][2107152];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> a[i][j];
dp[0][0] = 1;
int nnn = 1 << n;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int a[22][22];
long long dp[22][2107152];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> a[i][j];
dp[0][0] = 1;
int nnn = 1 << n;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 982,488 | 982,489 | u173526104 | cpp |
p03174 | #include <bits/stdc++.h>
#include <iostream>
#define db(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z ... | #include <bits/stdc++.h>
#include <iostream>
#define db(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z ... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 982,494 | 982,493 | u290440425 | cpp |
p03174 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
inline long long po(int n) {
long long ans = 1;
for (int i = 0; i < n; i++) {
ans *= 2;
}
return ans;
}
inline long long bac(vector<bool> ju) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
inline long long po(int n) {
long long ans = 1;
for (int i = 0; i < n; i++) {
ans *= 2;
}
return ans;
}
inline long long bac(vector<bool> ju) {
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 982,503 | 982,504 | u057079894 | cpp |
p03174 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define MOD 1000000007
int N, a[21][21];
LL dp[21][1 << 21];
LL solve(int now, int state) {
if (now == N)
return 1LL;... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define MOD 1000000007LL
int N, a[21][21];
LL dp[21][1 << 21];
LL solve(int now, int state) {
if (now == N)
return 1L... | [
"control_flow.loop.for.condition.change"
] | 982,524 | 982,525 | u422592877 | cpp |
p03174 | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 21
#define MOD 1000000007
int N;
long long dp[MAXN][1 << MAXN];
int m[MAXN][MAXN];
int d(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = 0;
for (int k = 0; k < N; k++) {
if (m[i][k] == 1 && (j & (1 << k))) {
... | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 21
#define MOD 1000000007
int N;
long long dp[MAXN][1 << MAXN];
int m[MAXN][MAXN];
int d(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = 0;
for (int k = 0; k < N; k++) {
if (m[i][k] == 1 && (j & (1 << k))) {
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 982,532 | 982,533 | u719290158 | cpp |
p03174 | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 21
#define MOD 1000000007
int N;
long long dp[MAXN][1 << MAXN];
int m[MAXN][MAXN];
int d(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = 0;
for (int k = 0; k < N; k++) {
if (m[i][k] == 1 && (j & (1 << k))) {
... | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 21
#define MOD 1000000007
int N;
long long dp[MAXN][1 << MAXN];
int m[MAXN][MAXN];
int d(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = 0;
for (int k = 0; k < N; k++) {
if (m[i][k] == 1 && (j & (1 << k))) {
... | [
"assignment.value.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 982,534 | 982,533 | u719290158 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 405;
typedef long long ll;
int A[maxn];
ll ta[maxn], memo[maxn][maxn];
ll solve(int l, int r) {
if (l + 1 == r)
return A[l] + A[r];
if (l == r)
return 0;
if (l > r)
return 0;
ll &ans = memo[l][r];
if (ans != -1)
return ans;
ans =... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 405;
typedef long long ll;
int A[maxn];
ll ta[maxn], memo[maxn][maxn];
ll solve(int l, int r) {
if (l + 1 == r)
return A[l] + A[r];
if (l == r)
return 0;
if (l > r)
return 0;
ll &ans = memo[l][r];
if (ans != -1)
return ans;
ans =... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 982,539 | 982,540 | u303586394 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
const int mx = 405;
typedef long long ll;
const ll INF = 1e18 + 5LL;
ll dp[mx][mx]; // dp[i][j] - min cost to merge range i to j in one slime]
int main() {
int n;
cin >> n;
int a[n], sum[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i > 0)
su... | #include <bits/stdc++.h>
using namespace std;
const int mx = 405;
typedef long long ll;
const ll INF = 1e18 + 5LL;
ll dp[mx][mx]; // dp[i][j] - min cost to merge range i to j in one slime
int main() {
int n;
cin >> n;
ll a[n], sum[n] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i > 0)
sum[... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 982,541 | 982,542 | u446828913 | cpp |
p03173 | #include <iostream>
#include <stdio.h>
using namespace std;
int n;
int main() {
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
long long
dp[n][n]; // 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++) {
dp[i][i] = 0;
}
for (int i =... | #include <iostream>
#include <stdio.h>
using namespace std;
int n;
int main() {
cin >> n;
long long arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
long long
dp[n][n]; // 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++) {
dp[i][i] = 0;
}
for (i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 982,545 | 982,546 | u297798194 | cpp |
p03173 | #include <iostream>
#include <stdio.h>
using namespace std;
int n;
int main() {
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
long long
dp[n][n]; // 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++) {
dp[i][i] = 0;
}
for (int i =... | #include <iostream>
#include <stdio.h>
using namespace std;
int n;
int main() {
cin >> n;
long long arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
long long
dp[n][n]; // 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++) {
dp[i][i] = 0;
}
for (i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 982,547 | 982,546 | u297798194 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
long long f[401][401], sum[401];
int main() {
int i, j, n, s, k;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &sum[i]);
sum[i] += sum[i - 1];
}
for (s = 1; s < n; s++) {
for (i = 1; i <= n - s; i++) {
j = s + i;
f[i][j] = 0x7ff... | #include <bits/stdc++.h>
using namespace std;
long long f[401][401], sum[401];
int main() {
int i, j, n, s, k;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &sum[i]);
sum[i] += sum[i - 1];
}
for (s = 1; s < n; s++) {
for (i = 1; i <= n - s; i++) {
j = s + i;
f[i][j] = 0x7ff... | [
"literal.number.change",
"assignment.value.change"
] | 982,552 | 982,553 | u511639787 | cpp |
p03173 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define ALL(v) v.begin(), v.end()
#define INF 1e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define ALL(v) v.begin(), v.end()
#define INF 1LL << 55
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 982,560 | 982,561 | u245487028 | cpp |
p03173 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define ALL(v) v.begin(), v.end()
#define INF 2e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define ALL(v) v.begin(), v.end()
#define INF 1LL << 55
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 982,563 | 982,561 | u245487028 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const char sp = ' ';
const char cmm = ',';
const int MOD = 1000000007;
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const char sp = ' ';
const char cmm = ',';
const int MOD = 1000000007;
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return ... | [
"variable_declaration.value.change",
"identifier.change"
] | 982,564 | 982,565 | u306142032 | cpp |
p03173 | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define read() f... | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define read() f... | [
"assignment.value.change",
"identifier.change"
] | 982,568 | 982,569 | u302781973 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.