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 |
|---|---|---|---|---|---|---|---|
p03179 | // Vivek Rai
// Blazer_007
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/detail/standard_policies.hpp>
#define fastio ... | // Vivek Rai
// Blazer_007
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/detail/standard_policies.hpp>
#define fastio ... | [
"assignment.change"
] | 986,081 | 986,082 | u956259660 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define N 3001
const int mod = 1e9 + 7;
int n;
string s;
int dp[N][N];
void solve() {
dp[n][0] = (s[n - 2] == '>') ? 1 : 0;
dp[n][1] = (s[n - 2] == '<') ? 1 : 0;
for... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define N 3001
const int mod = 1e9 + 7;
int n;
string s;
int dp[N][N];
void solve() {
dp[n][0] = (s[n - 2] == '>') ? 1 : 0;
dp[n][1] = (s[n - 2] == '<') ? 1 : 0;
for... | [
"assignment.change"
] | 986,083 | 986,084 | u772652557 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> void chmax(T &a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> void chmax(T &a... | [
"assignment.change"
] | 986,087 | 986,088 | u463697306 | cpp |
p03179 | /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fr(a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define inf (1LL << 60)
#define all(x) (x).begin(), (x).end()
#define prDouble(x) cout << fixed << setprecision(10) << x
#define triplet pair<ll, pair<ll, ll... | /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fr(a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define inf (1LL << 60)
#define all(x) (x).begin(), (x).end()
#define prDouble(x) cout << fixed << setprecision(10) << x
#define triplet pair<ll, pair<ll, ll... | [
"assignment.change"
] | 986,089 | 986,090 | u212789054 | cpp |
p03179 | #include <iostream>
#include <vector>
using namespace std;
// Finite field Z/pZ
class ModInt {
private:
long long val;
static const int default_mod = 1e9 + 7;
static int mod;
public:
ModInt(long long val) {
this->val = val % getMod();
if (this->val < 0) {
this->val += getMod();
}
}
ModIn... | #include <iostream>
#include <vector>
using namespace std;
// Finite field Z/pZ
class ModInt {
private:
long long val;
static const int default_mod = 1e9 + 7;
static int mod;
public:
ModInt(long long val) {
this->val = val % getMod();
if (this->val < 0) {
this->val += getMod();
}
}
ModIn... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 986,093 | 986,094 | u425351967 | cpp |
p03179 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll dp[n + 1][n + 1] = {{0}};
/* for(ll i=0;i<n;i++)
{
for(ll j=0;j<=n;j++)
cout<<dp[i][j]<<" ";
cout<<endl;
}*/
for (ll i = 0; i < n; i+... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll dp[n + 1][n + 1] = {{0}};
/* for(ll i=0;i<n;i++)
{
for(ll j=0;j<=n;j++)
cout<<dp[i][j]<<" ";
cout<<endl;
}*/
for (ll i = 0; i < n; i+... | [
"control_flow.loop.for.initializer.change"
] | 986,095 | 986,096 | u340961961 | cpp |
p03179 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll dp[n + 1][n + 1] = {{0}};
for (ll i = 0; i < n; i++)
dp[0][i] = 1;
ll m = 1000000007;
for (ll i = 1; i < n; i++) {
if (s.at(i - 1) == '>') {
ll r = 0;... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll dp[n + 1][n + 1] = {{0}};
/* for(ll i=0;i<n;i++)
{
for(ll j=0;j<=n;j++)
cout<<dp[i][j]<<" ";
cout<<endl;
}*/
for (ll i = 0; i < n; i+... | [
"control_flow.loop.for.initializer.change"
] | 986,097 | 986,096 | u340961961 | cpp |
p03179 | #include <bits/stdc++.h>
//#pragma once
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<double, double> P;
const ll INF = 1e16;
const int MOD = 998244353... | #include <bits/stdc++.h>
//#pragma once
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<double, double> P;
const ll INF = 1e16;
const int MOD = 100000000... | [
"literal.number.change",
"variable_declaration.value.change"
] | 986,098 | 986,099 | u317754719 | cpp |
p03179 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typede... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typede... | [
"assignment.change"
] | 986,102 | 986,103 | u633284019 | cpp |
p03179 | #include <iostream>
using namespace std;
const int MAXN = 3000 + 10;
const int mod = 1000000007;
int dp[MAXN][MAXN];
long long n, ans;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
s = ' ' + s;
s = ' ' + s;
dp[1][1] = 1;
for (int i = 1; i <= n; i++) {
if (s[i] == '<') {
... | #include <iostream>
using namespace std;
const int MAXN = 3000 + 10;
const int mod = 1000000007;
int dp[MAXN][MAXN];
long long n, ans;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
s = ' ' + s;
s = ' ' + s;
dp[1][1] = 1;
for (int i = 1; i <= n; i++) {
if (s[i] == '<') {
... | [
"assignment.add"
] | 986,104 | 986,105 | u803932112 | cpp |
p03179 | #include <iostream>
using namespace std;
const int MAXN = 3000 + 10;
const int mod = 1000000007;
int dp[MAXN][MAXN];
int n, ans;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
s = ' ' + s;
s = ' ' + s;
dp[1][1] = 1;
for (int i = 1; i <= n; i++) {
if (s[i] == '<') {
for (... | #include <iostream>
using namespace std;
const int MAXN = 3000 + 10;
const int mod = 1000000007;
int dp[MAXN][MAXN];
long long n, ans;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
s = ' ' + s;
s = ' ' + s;
dp[1][1] = 1;
for (int i = 1; i <= n; i++) {
if (s[i] == '<') {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 986,106 | 986,105 | u803932112 | cpp |
p03179 | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | [
"assignment.change"
] | 986,113 | 986,114 | u796195598 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
template <long long mod> class Mod {
long long value;
void set_value(const long long x) { this->value = x % mod; }
public:
Mod() { set_value(0ll); }
template <typename T> Mod(T x = 0) { set_value((long long)x); }
friend istream &operator>>(istream &is, Mod &x)... | #include <bits/stdc++.h>
using namespace std;
template <long long mod> class Mod {
long long value;
void set_value(const long long x) { this->value = x % mod; }
public:
Mod() { set_value(0ll); }
template <typename T> Mod(T x = 0) { set_value((long long)x); }
friend istream &operator>>(istream &is, Mod &x)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 986,125 | 986,126 | u618697411 | cpp |
p03179 |
/* monkukui 競技プログラミング用のテンプレート (ここから) */
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... |
/* monkukui 競技プログラミング用のテンプレート (ここから) */
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 986,129 | 986,130 | u212904724 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
long long int dp[n + 1][n + 1], x = pow(10, 9) + 7;
if (s[0] == '<') {
dp[2][1] = 0;
dp[2][2] = 1;
} else {
dp[2][1] = 1;
dp[2][2] = 0;
}
for (int i = 3; i <= n; i++) {
if (s[i - 2] == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
long long int dp[n + 1][n + 1], x = pow(10, 9) + 7;
if (s[0] == '<') {
dp[2][1] = 0;
dp[2][2] = 1;
} else {
dp[2][1] = 1;
dp[2][2] = 0;
}
for (int i = 3; i <= n; i++) {
if (s[i - 2] == ... | [
"assignment.change"
] | 986,135 | 986,136 | u547420959 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
ll inf = 1e9;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<ll> sum(n + 3, 0);
vector<vector<ll>> dp(n + 1, vector<ll>(n + 3, 0));
for (int i = 0; i <= n; i++)
dp[1][i] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
ll inf = 1e9;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<ll> sum(n + 3, 0);
vector<vector<ll>> dp(n + 1, vector<ll>(n + 3, 0));
for (int i = 0; i <= n; i++)
dp[1][i] = 1;
... | [
"assignment.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 986,139 | 986,140 | u410943667 | cpp |
p03179 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ... | [
"assignment.change"
] | 986,143 | 986,144 | u209713918 | cpp |
p03179 | #include <bits/stdc++.h>
#define FAST std::ios::sync_with_stdio(0);
#define FOUT freopen(".out", "w", stdout);
#define FIN freopen(".in", "r", stdin);
#define MOD 1000000007
#define KKK 1073741824
#define pb push_back
#define mp make_pair
#define PB pop_back
#define S second
#define SZ size
#define F first
using namesp... | #include <bits/stdc++.h>
#define FAST std::ios::sync_with_stdio(0);
#define FOUT freopen(".out", "w", stdout);
#define FIN freopen(".in", "r", stdin);
#define MOD 1000000007
#define KKK 1073741824
#define pb push_back
#define mp make_pair
#define PB pop_back
#define S second
#define SZ size
#define F first
using namesp... | [
"assignment.change"
] | 986,147 | 986,148 | u722097283 | cpp |
p03179 | #include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) v.begin(), v.end... | #include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) v.begin(), v.end... | [
"assignment.value.change"
] | 986,149 | 986,150 | u708550576 | cpp |
p03179 | #include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) v.begin(), v.end... | #include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) v.begin(), v.end... | [] | 986,151 | 986,150 | u708550576 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int v[3005][3005];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
v[1][i] = 1;
for (int i = 2; i <= n; i++) {
int a = 0;
if (s[i - 2] == '<')
for (int j = 0; j <= n - i; j++)
a = (a + ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int v[3005][3005];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
v[1][i] = 1;
for (int i = 2; i <= n; i++) {
int a = 0;
if (s[i - 2] == '<')
for (int j = 0; j <= n - i; j++)
a = (a + ... | [
"expression.operation.binary.remove"
] | 986,152 | 986,153 | u308555207 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int v[3005][3005];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
v[1][i] = 1;
for (int i = 2; i < n; i++) {
int a = 0;
if (s[i - 2] == '<')
for (int j = 0; j <= n - i; j++)
a = (a + v... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int v[3005][3005];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
v[1][i] = 1;
for (int i = 2; i <= n; i++) {
int a = 0;
if (s[i - 2] == '<')
for (int j = 0; j <= n - i; j++)
a = (a + ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 986,154 | 986,153 | u308555207 | cpp |
p03179 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
typedef unsigned long long ull;
typedef signed long long sll;
using namespace std;
#define INF 0x7FFFFFFFFFFFFFFF
#define BIG_PRIME 1000000007
int main() {
string s;
ull i, j, N, sum;
cin >> N >> s;
vector<vector<ull>> dp(N);
dp[0... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
typedef unsigned long long ull;
typedef signed long long sll;
using namespace std;
#define INF 0x7FFFFFFFFFFFFFFF
#define BIG_PRIME 1000000007
int main() {
string s;
ull i, j, N, sum;
cin >> N >> s;
vector<vector<ull>> dp(N);
dp[0... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 986,155 | 986,156 | u659371255 | cpp |
p03179 | /*
[dp] T - Permutation
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long i... | /*
[dp] T - Permutation
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long i... | [
"expression.operator.change",
"assignment.change"
] | 986,157 | 986,158 | u302149106 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
typedef tuple<int, int, int> tp;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
typedef pair<LL, LL> pll;
typedef pair<pii, int> piipi;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piip... | #include <bits/stdc++.h>
using namespace std;
typedef tuple<int, int, int> tp;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
typedef pair<LL, LL> pll;
typedef pair<pii, int> piipi;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piip... | [
"assignment.change"
] | 986,159 | 986,160 | u596311662 | cpp |
p03179 | #include <bits/stdc++.h>
#define MAXN 3030
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
ll n, dp[MAXN][MAXN], pre[MAXN][MAXN], mod = 1e9 + 7;
string s;
ll go(int x, int y) {
// y good options, filling in the rhs of the xth symbol
if (dp[x][y] != -1)
return dp[x][... | #include <bits/stdc++.h>
#define MAXN 3030
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
ll n, dp[MAXN][MAXN], pre[MAXN][MAXN], mod = 1e9 + 7;
string s;
ll go(int x, int y) {
// y good options, filling in the rhs of the xth symbol
if (dp[x][y] != -1)
return dp[x][... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 986,168 | 986,169 | u190314045 | cpp |
p03179 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <... | [
"assignment.change"
] | 986,174 | 986,175 | u516353059 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define MM 998244353
#define ll long long
#define pb push_back
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define memf(a) memset(a, false, sizeof(a))
#define all(v) v.begin(), v.end()
#define sz(a) (ll) a.size()
#d... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define MM 998244353
#define ll long long
#define pb push_back
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define memf(a) memset(a, false, sizeof(a))
#define all(v) v.begin(), v.end()
#define sz(a) (ll) a.size()
#d... | [
"literal.number.change",
"variable_declaration.value.change"
] | 986,180 | 986,181 | u675249209 | cpp |
p03180 | #include <iostream>
#include <vector>
#define endl '\n'
using namespace std;
const int MAXN = 16;
long long points[MAXN][MAXN], dp[(1 << MAXN) + 3], total[(1 << MAXN) + 3];
void calc_dp(int mask, int curr, int ind, vector<int> missing) {
if (ind == (int)missing.size()) {
int new_mask = (mask | curr);
dp[n... | #include <iostream>
#include <vector>
#define endl '\n'
using namespace std;
const int MAXN = 16;
long long points[MAXN][MAXN], dp[(1 << MAXN) + 3], total[(1 << MAXN) + 3];
void calc_dp(int mask, int curr, int ind, const vector<int> &missing) {
if (ind == (int)missing.size()) {
int new_mask = (mask | curr);
... | [] | 986,184 | 986,185 | u099203212 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
t... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 986,186 | 986,187 | u006686215 | cpp |
p03180 | #include <bits/stdc++.h>
#define ll long long
#define ss second
#define ff first
#define pb push_back
using namespace std;
const int N = 1e6 + 69;
int n;
ll A[20][20], cost[(1 << 20)], dp[(1 << 20)];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> A[i][j];
... | #include <bits/stdc++.h>
#define ll long long
#define ss second
#define ff first
#define pb push_back
using namespace std;
const int N = 1e6 + 69;
int n;
ll A[20][20], cost[(1 << 20)], dp[(1 << 20)];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> A[i][j];
... | [
"assignment.value.change",
"control_flow.loop.for.update.change",
"assignment.change"
] | 986,188 | 986,189 | u954494895 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n;
ll a[25][25];
ll power[(1 << 16)];
ll dp[(1 << 16)], ans[(1 << 16)];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
power[(1 << i)] = i;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n;
ll a[25][25];
ll power[(1 << 16)];
ll dp[(1 << 16)], ans[(1 << 16)];
int main() {
cin >> n;
for (ll i = 0; i < n; ++i) {
power[(1 << i)] = i;
}
for (ll i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
}... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 986,190 | 986,191 | u734192058 | cpp |
p03180 | #include <bits/stdc++.h>
#define ll long long
#define int ll
#define mod 1000000007
#define pb push_back
#define pob pop_back
#define f1 first
#define s2 second
#define N 50
#define K 100005
#define bol (int)ceil((say - 1) / 2.0)
#define PII pair<int, int>
#define PIII pair<int, PII>
#define PIIII pair<PII, PII>
#defin... | #include <bits/stdc++.h>
#define ll long long
#define int ll
#define mod 1000000007
#define pb push_back
#define pob pop_back
#define f1 first
#define s2 second
#define N 50
#define K 100005
#define bol (int)ceil((say - 1) / 2.0)
#define PII pair<int, int>
#define PIII pair<int, PII>
#define PIIII pair<PII, PII>
#defin... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 986,194 | 986,195 | u368885250 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
const int MXN = (1 << 4) + 2;
int n, in[MXN][MXN];
long long dp[1 << MXN], pp[1 << MXN];
void npt() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> in[i][j];
}
}
}
void rec(int i, vector<int> nt, long long sc, int msk, ... | #include <bits/stdc++.h>
using namespace std;
const int MXN = (1 << 4);
int n, in[MXN][MXN];
long long dp[1 << MXN], pp[1 << MXN];
void npt() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> in[i][j];
}
}
}
void rec(int i, const vector<int> &nt, long long sc, int ms... | [
"expression.operation.binary.remove"
] | 986,196 | 986,197 | u134058207 | cpp |
p03180 | #include <cstdio>
int n;
long long v[20][20];
long long cost[1 << 17];
long long dp[1 << 17];
long long best;
inline int max(int a, int b) { return a > b ? a : b; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%lld", &v[i][j]);
}
}
for (int i ... | #include <cstdio>
int n;
long long v[20][20];
long long cost[1 << 17];
long long dp[1 << 17];
long long best;
inline long long max(long long a, long long b) { return a > b ? a : b; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%lld", &v[i][j]);
}... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 986,198 | 986,199 | u427697910 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define repi(itr, ds) for (auto itr =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define repi(itr, ds) for (auto itr =... | [
"expression.operation.binary.remove"
] | 986,200 | 986,201 | u592610268 | cpp |
p03180 | #define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l + r) / 2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define... | #define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l + r) / 2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define... | [
"assignment.change",
"expression.operation.binary.remove"
] | 986,202 | 986,203 | u600501848 | cpp |
p03180 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 986,212 | 986,213 | u241367243 | cpp |
p03180 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 986,214 | 986,213 | u241367243 | cpp |
p03180 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordere... | [
"literal.number.change",
"expression.operation.binary.change"
] | 986,218 | 986,217 | u241367243 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [
"control_flow.loop.for.initializer.change"
] | 986,220 | 986,221 | u052332717 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [
"assignment.change"
] | 986,222 | 986,223 | u052332717 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<pii, ll> piii;
typedef pair<ll, pii> ipii;
#define MOD 1000000007
#define mod(a) ((a) % MOD)
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define dbg(x) cerr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<pii, ll> piii;
typedef pair<ll, pii> ipii;
#define MOD 1000000007
#define mod(a) ((a) % MOD)
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define dbg(x) cerr... | [
"variable_declaration.type.change"
] | 986,224 | 986,225 | u906162718 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
ll dp[3005][3005]; // dp[i][j]: a[i]まで条件を満たすうち,
// a[i]より大きい未使用のvalがj個
int main() {
// cout.precision(10);
ll n;
string s;
cin >> n >> s;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
ll dp[3005][3005]; // dp[i][j]: a[i]まで条件を満たすうち,
// a[i]より大きい未使用のvalがj個
int main() {
// cout.precision(10);
ll n;
string s;
cin >> n >> s;... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 986,230 | 986,231 | u980655160 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<int, int, int>;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
const int mod = 1000000000 + 7;
int N;
string S;
ll dp[3010][3010];
ll sums[3010];
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<int, int, int>;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
const int mod = 1000000000 + 7;
int N;
string S;
ll dp[3010][3010];
ll sums[3010];
i... | [
"assignment.change"
] | 986,232 | 986,233 | u489053642 | cpp |
p03179 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, dp[3333][3333], sum[3333][3333];
char s[3333];
bool f[3333]; // 0:< 1:>
int main() {
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n - 1; i++) {
if (s[i] == '<')
f[i + 2] = 0;
else
f[i + 2] = 1;
}
dp[1][1]... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, dp[3333][3333], sum[3333][3333];
char s[3333];
bool f[3333]; // 0:< 1:>
int main() {
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n - 1; i++) {
if (s[i] == '<')
f[i + 2] = 0;
else
f[i + 2] = 1;
}
dp[1][1]... | [
"call.arguments.change"
] | 986,234 | 986,235 | u900309151 | cpp |
p03179 | #ifndef ___CLASS_MODINT
#define ___CLASS_MODINT
#include <cstdint>
template <std::uint32_t mod> class modint {
private:
std::uint32_t n;
public:
modint() : n(0){};
modint(std::uint64_t n_) : n(n_ % mod){};
bool operator==(const modint &m) const { return n == m.n; }
bool operator!=(const modint &m) const { ... | #ifndef ___CLASS_MODINT
#define ___CLASS_MODINT
#include <cstdint>
template <std::uint32_t mod> class modint {
private:
std::uint32_t n;
public:
modint() : n(0){};
modint(std::uint64_t n_) : n(n_ % mod){};
bool operator==(const modint &m) const { return n == m.n; }
bool operator!=(const modint &m) const { ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 986,242 | 986,243 | u837745858 | cpp |
p03180 | #include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#ifndef bhupixb
#define var(...)
#define stl(...)
#endif
#define rep(i, a, b) for (int i = a; i <= (int)b; ++i)
#define f first
#define s second
#define single_test
int dp[1 << 16];
void solve() {
int n;
cin >> n;... | #include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifndef bhupixb
#define var(...)
#define stl(...)
#endif
#define rep(i, a, b) for (int i = a; i <= (int)b; ++i)
#define f first
#define s second
#define single_test
int dp[1 << 16];
void solve() {
int n;
cin >> n;
... | [] | 986,250 | 986,251 | u450009898 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// DON'T USE THES... | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// DON'T USE THES... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 986,264 | 986,265 | u645327277 | cpp |
p03180 | #define D(x) cout << #x " = " << x << endl
#define DD(x, y) cout << "(" #x ", " #y ") = (" << x << ", " << y << ")" << endl
#define DDD(x, y, z) \
cout << "(" #x ", " #y ", " #z ") = (" << x << ", " << y << ", " << z << ")" \
<< endl
#define DV(v) ... | #define D(x) cout << #x " = " << x << endl
#define DD(x, y) cout << "(" #x ", " #y ") = (" << x << ", " << y << ")" << endl
#define DDD(x, y, z) \
cout << "(" #x ", " #y ", " #z ") = (" << x << ", " << y << ", " << z << ")" \
<< endl
#define DV(v) ... | [
"variable_declaration.type.change"
] | 986,266 | 986,267 | u652737716 | cpp |
p03180 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <uno... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <uno... | [] | 986,272 | 986,273 | u975336337 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const int MaxN = 16;
int dp[1 << MaxN];
int a[MaxN][MaxN];
int n;
long long gc[1 << MaxN];
long long groupCost(int mask) {
long long ans = 0;
for (int i1 = 0; i1 < n; ++i1)
if (mask & (1 << i1))
for (i... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const int MaxN = 16;
long long dp[1 << MaxN];
int a[MaxN][MaxN];
int n;
long long gc[1 << MaxN];
long long groupCost(int mask) {
long long ans = 0;
for (int i1 = 0; i1 < n; ++i1)
if (mask & (1 << i1))
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 986,274 | 986,275 | u784576081 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 100001;
int n;
int arr[16][16];
int cost[(1 << 16)];
int LG[(1 << 16) + 1];
int dp[1 << 16];
int solve(int msk) {
if (msk == (1 << n) - 1)
return 0;
int rem = ~msk & ((1 << n) - 1);
int &res = dp[msk];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 100001;
int n;
int arr[16][16];
ll cost[(1 << 16)];
int LG[(1 << 16) + 1];
ll dp[1 << 16];
ll solve(int msk) {
if (msk == (1 << n) - 1)
return 0;
int rem = ~msk & ((1 << n) - 1);
ll &res = dp[msk];
if ... | [
"variable_declaration.type.change"
] | 986,276 | 986,277 | u945097761 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 17;
int dp[(1 << MAXN)];
int main() {
#ifdef BLAT
freopen("input", "r", stdin);
#endif
int n;
cin >> n;
vector<vector<int>> v(n + 1, vector<int>(n + 1));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
cin >> v[i][j];
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 17;
long long dp[(1 << MAXN)];
int main() {
#ifdef BLAT
freopen("input", "r", stdin);
#endif
int n;
cin >> n;
vector<vector<int>> v(n + 1, vector<int>(n + 1));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
cin >> v[i][... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 986,283 | 986,284 | u745428834 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 16;
int dp[(1 << MAXN)];
int main() {
#ifdef BLAT
freopen("input", "r", stdin);
#endif
int n;
cin >> n;
vector<vector<int>> v(n + 1, vector<int>(n + 1));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
cin >> v[i][j];
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 17;
long long dp[(1 << MAXN)];
int main() {
#ifdef BLAT
freopen("input", "r", stdin);
#endif
int n;
cin >> n;
vector<vector<int>> v(n + 1, vector<int>(n + 1));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
cin >> v[i][... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 986,285 | 986,284 | u745428834 | cpp |
p03180 | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
ll dp[(1 << 17)];
int a[17][17];
i... | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
ll dp[(1 << 17)];
int a[17][17];
i... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 986,288 | 986,289 | u776618439 | cpp |
p03180 | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
ll dp[(1 << 17)];
int a[17][17];
i... | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
ll dp[(1 << 17)];
int a[17][17];
i... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 986,288 | 986,290 | u776618439 | cpp |
p03180 | #include <iostream>
#include <vector>
using namespace std;
int dp[(1 << 16) + 7], v[17][17];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
cin >> v[i][j];
for (int i = 0; i < (1 << n); ++i) {
for (int j = 0; j < n; ++j) {
if ((i & (1 << j)) == 0)
... | #include <iostream>
#include <vector>
using namespace std;
long long dp[(1 << 16) + 7];
int v[17][17];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
cin >> v[i][j];
for (int i = 0; i < (1 << n); ++i) {
for (int j = 0; j < n; ++j) {
if ((i & (1 << j))... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 986,291 | 986,292 | u084202355 | cpp |
p03180 | #include <bits/stdc++.h>
using namespace std;
int N;
long long arr[20][20];
long long pre[1 << 20];
long long dp[1 << 20];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < (1 << N); i++) {
for (int j = 0; j < N; j++... | #include <bits/stdc++.h>
using namespace std;
int N;
long long arr[20][20];
long long pre[1 << 20];
long long dp[1 << 20];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < (1 << N); i++) {
for (int j = 0; j < N; j++... | [
"expression.operation.binary.remove"
] | 986,293 | 986,294 | u937063359 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 100005
int n, m;
vector<int> tree[maxn];
int vis[maxn];
ll dp1[100005];
ll dp2[100005];
void solve2(ll par_ans, int src) {
vis[src] = 1;
dp2[src] = ((1 + par_ans) * dp1[src]) % m;
// cout<<src<<" "<<dp2[src]<<"\n";
vector<ll> prefix... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 100005
int n, m;
vector<int> tree[maxn];
int vis[maxn];
ll dp1[100005];
ll dp2[100005];
void solve2(ll par_ans, int src) {
vis[src] = 1;
dp2[src] = ((1 + par_ans) * dp1[src]) % m;
// cout<<src<<" "<<dp2[src]<<"\n";
vector<ll> prefix... | [
"expression.unary.arithmetic.add"
] | 986,581 | 986,584 | u412624159 | cpp |
p03181 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 10000000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 10000000... | [
"expression.operation.binary.add"
] | 986,591 | 986,592 | u021358975 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (int i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1,... | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (int i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1,... | [
"call.add"
] | 986,593 | 986,594 | u342075214 | cpp |
p03181 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp1[1000001];
ll dp2[1000001];
vector<ll> tree[100001];
ll m;
void solve2(ll source, bool vis[], ll parent_ans) {
vis[source] = 1;
dp2[source] = ((1 + parent_ans) * dp1[source]) % m;
vector<ll> prefix;
vector<ll> suffix;
for (ll child : tre... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp1[1000001];
ll dp2[1000001];
vector<ll> tree[100001];
ll m;
void solve2(ll source, bool vis[], ll parent_ans) {
vis[source] = 1;
dp2[source] = ((1 + parent_ans) * dp1[source]) % m;
vector<ll> prefix;
vector<ll> suffix;
for (ll child : tre... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"call.arguments.change"
] | 986,601 | 986,602 | u158107532 | cpp |
p03181 | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for (ll ... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for (ll ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 986,610 | 986,611 | u834771741 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
// #define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi; // Vector of long long
typedef vector... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
// #define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi; // Vector of long long
typedef vector... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 986,618 | 986,619 | u124676202 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
// #define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi; // Vector of long long
typedef vector... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
// #define mod 1000000007
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define pair pair<int, int>
typedef vector<int> vi; // Vector of long long
typedef vector... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 986,620 | 986,619 | u124676202 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 986,637 | 986,638 | u184335045 | cpp |
p03181 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include ... |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include ... | [
"assignment.change"
] | 986,641 | 986,642 | u471289663 | cpp |
p03181 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"expression.operation.binary.add"
] | 986,645 | 986,646 | u714724786 | cpp |
p03181 | #include <bits/stdc++.h>
#define N 100001
typedef long long ll;
using namespace std;
int n, m;
vector<int> g[N];
vector<int> tree[N];
ll in[N];
ll out[N];
void dfs1(int u, int p) {
in[u] = 1;
for (int v : g[u]) {
if (v == p)
continue;
tree[u].push_back(v);
dfs1(v, u);
in[u] = (in[u] * ((1... | #include <bits/stdc++.h>
#define N 100001
typedef long long ll;
using namespace std;
int n, m;
vector<int> g[N];
vector<int> tree[N];
ll in[N];
ll out[N];
void dfs1(int u, int p) {
in[u] = 1;
for (int v : g[u]) {
if (v == p)
continue;
tree[u].push_back(v);
dfs1(v, u);
in[u] = (in[u] * ((1... | [
"expression.operation.binary.remove"
] | 986,653 | 986,654 | u894611946 | cpp |
p03181 | #include <bits/stdc++.h>
#define N 100001
typedef long long ll;
using namespace std;
int n, m;
vector<int> g[N];
vector<int> tree[N];
ll in[N];
ll out[N];
void dfs1(int u, int p) {
in[u] = 1;
for (int v : g[u]) {
if (v == p)
continue;
tree[u].push_back(v);
dfs1(v, u);
in[u] = (in[u] * ((1... | #include <bits/stdc++.h>
#define N 100001
typedef long long ll;
using namespace std;
int n, m;
vector<int> g[N];
vector<int> tree[N];
ll in[N];
ll out[N];
void dfs1(int u, int p) {
in[u] = 1;
for (int v : g[u]) {
if (v == p)
continue;
tree[u].push_back(v);
dfs1(v, u);
in[u] = (in[u] * ((1... | [
"expression.operation.binary.remove",
"assignment.value.change",
"expression.operation.binary.change"
] | 986,655 | 986,654 | u894611946 | cpp |
p03181 | #include <bits/stdc++.h>
#define N 100001
typedef long long ll;
using namespace std;
int n, m;
vector<int> g[N];
vector<int> tree[N];
ll in[N];
ll out[N];
void dfs1(int u, int p) {
in[u] = 1;
for (int v : g[u]) {
if (v == p)
continue;
tree[u].push_back(v);
dfs1(v, u);
in[u] = (in[u] * ((1... | #include <bits/stdc++.h>
#define N 100001
typedef long long ll;
using namespace std;
int n, m;
vector<int> g[N];
vector<int> tree[N];
ll in[N];
ll out[N];
void dfs1(int u, int p) {
in[u] = 1;
for (int v : g[u]) {
if (v == p)
continue;
tree[u].push_back(v);
dfs1(v, u);
in[u] = (in[u] * ((1... | [
"expression.operation.binary.remove",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 986,656 | 986,654 | u894611946 | cpp |
p03181 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
int mod;
const int maxN = 200000;
vector<int> G[200006];
int kj[200006];
int dp1[200006];
int modpow(int a, int x) {
int res = 1;
while (x... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
int mod;
const int maxN = 200000;
vector<int> G[200006];
int kj[200006];
int dp1[200006];
int modpow(int a, int x) {
int res = 1;
while (x... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 986,657 | 986,658 | u722628899 | cpp |
p03181 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <complex>
#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);
#... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <complex>
#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);
#... | [
"assignment.change"
] | 986,667 | 986,668 | u264405855 | cpp |
p03181 | /*input
10 2
8 5
10 8
6 5
1 5
4 8
2 10
3 6
9 2
1 7
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
... | /*input
10 2
8 5
10 8
6 5
1 5
4 8
2 10
3 6
9 2
1 7
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
... | [
"assignment.change",
"control_flow.branch.if.condition.change"
] | 986,671 | 986,670 | u117615163 | cpp |
p03181 | #include <bits/stdc++.h>
#define inp_out_work \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define testCase ... | #include <bits/stdc++.h>
#define inp_out_work \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define testCase ... | [] | 986,676 | 986,675 | u302702755 | cpp |
p03181 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
#d... | [] | 986,677 | 986,678 | u553927381 | cpp |
p03181 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
const int N = 101010;
using namespace std;
vector<int> g[N];
vector<ll> v[N], be[N], en[N];
ll dp[N], ans[N];
int n, M;
ll dfs1(int i, int p) {
dp[i] = 1;
for (i... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
const int N = 101010;
using namespace std;
vector<int> g[N];
vector<ll> v[N], be[N], en[N];
ll dp[N], ans[N];
int n, M;
ll dfs1(int i, int p) {
dp[i] = 1;
for (i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 986,679 | 986,680 | u143741615 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 1e5;
ll m;
vector<int> G[MAX], H[MAX];
vector<int> color(MAX, 0);
vector<ll>
dp1(MAX); // dp1[i]:頂点iを根とした木で, 頂点iを黒く塗る方法の数(mod m)
void dfs1(int v) {
color[v] = 1;
ll keep = 1;
for (int i = 0; i < G[v].size(); i++) {
if (c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 1e5;
ll m;
vector<int> G[MAX], H[MAX];
vector<int> color(MAX, 0);
vector<ll>
dp1(MAX); // dp1[i]:頂点iを根とした木で, 頂点iを黒く塗る方法の数(mod m)
void dfs1(int v) {
color[v] = 1;
ll keep = 1;
for (int i = 0; i < G[v].size(); i++) {
if (c... | [
"expression.operation.binary.remove"
] | 986,689 | 986,690 | u979163294 | cpp |
p03178 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
LL MOD = 1000000007;
int main() {
string K;
int D;
cin >> K >> ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
LL MOD = 1000000007;
int main() {
string K;
int D;
cin >> K >> ... | [
"assignment.value.change",
"identifier.change"
] | 986,310 | 986,311 | u806201407 | cpp |
p03178 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = (... | [
"literal.number.change",
"call.arguments.change"
] | 986,338 | 986,339 | u694083533 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
int i, j, ans = 0, n, m, d, l, f[10001][101][2];
char a[10001];
int main() {
scanf("%s", a);
scanf("%d", &d);
n = strlen(a);
f[0][0][1] = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
for (l = 0; l <= 9; l++) {
f[i + 1][(j + l) % d][0] =... | #include <bits/stdc++.h>
using namespace std;
int i, j, ans = 0, n, m, d, l, f[10001][101][2];
char a[10001];
int main() {
scanf("%s", a);
scanf("%d", &d);
n = strlen(a);
f[0][0][1] = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < d; j++) {
for (l = 0; l <= 9; l++) {
f[i + 1][(j + l) % d][0] =... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 986,350 | 986,351 | u806074801 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
long long f[101], tmp[101];
char k[10001];
int main() {
int l, i, d, a = 0, b, j, ans = 0;
scanf("%s", k);
scanf("%d", &d);
l = strlen(k);
for (i = 0; i < l; i++)
a += k[i] - '0';
f[0] = 1;
a %= d;
if (a == 0)
ans++;
l--;
while (l >= 0) {
if ... | #include <bits/stdc++.h>
using namespace std;
long long f[101], tmp[101];
char k[10001];
int main() {
int l, i, d, a = 0, b, j;
long long ans = 0;
scanf("%s", k);
scanf("%d", &d);
l = strlen(k);
for (i = 0; i < l; i++)
a += k[i] - '0';
f[0] = 1;
a %= d;
if (a == 0)
ans++;
l--;
while (l >= ... | [
"variable_declaration.type.widen.change"
] | 986,356 | 986,357 | u314499126 | cpp |
p03178 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int Mod = 1000000007;
const int maxn = 1e4 + 10;
ll dp[maxn][105];
int d;
char str[maxn];
int a[maxn];
ll dfs(int pos, int left, bool limit) {
if (pos == -1)
return (left == 0);
if (!limit... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int Mod = 1000000007;
const int maxn = 1e4 + 10;
ll dp[maxn][105];
int d;
char str[maxn];
int a[maxn];
ll dfs(int pos, int left, bool limit) {
if (pos == -1)
return (left == 0);
if (!limit... | [
"assignment.change"
] | 986,385 | 986,386 | u937339263 | cpp |
p03178 | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
const int MAXD = 105;
const int MAXN = 10005;
const int INF = 0x3f3f3f3f... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
const int MAXD = 105;
const int MAXN = 10005;
const int INF = 0x3f3f3f3f... | [
"assignment.change",
"assignment.value.change"
] | 986,389 | 986,390 | u215554660 | cpp |
p03178 | // MLEが動かない
//セグフォは関数内で要素のでかい配列を定義しているから
// todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
struct initon {
initon() {
... | // MLEが動かない
//セグフォは関数内で要素のでかい配列を定義しているから
// todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
struct initon {
initon() {
... | [
"identifier.change",
"call.arguments.change"
] | 986,393 | 986,394 | u986437843 | cpp |
p03178 | // MLEが動かない
//セグフォは関数内で要素のでかい配列を定義しているから
// todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
struct initon {
initon() {
... | // MLEが動かない
//セグフォは関数内で要素のでかい配列を定義しているから
// todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
struct initon {
initon() {
... | [
"identifier.change",
"call.arguments.change",
"call.add"
] | 986,395 | 986,394 | u986437843 | cpp |
p03178 | // finish date: 2019/2/28
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | // finish date: 2019/2/28
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | [
"assignment.value.change"
] | 986,400 | 986,401 | u285660186 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const int MaxN = 1e4 + 14;
const int MaxD = 100;
int dp[MaxN][MaxD][2];
void up(int &x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// fre... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const int MaxN = 1e4 + 14;
const int MaxD = 100;
int dp[MaxN][MaxD][2];
void up(int &x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// fre... | [
"assignment.value.change"
] | 986,412 | 986,413 | u784576081 | cpp |
p03178 | #include <bits/stdc++.h>
#define FLASH \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_... | #include <bits/stdc++.h>
#define FLASH \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_... | [
"assignment.change"
] | 986,423 | 986,424 | u955177919 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define scanVec(vec, n) \
for (int i = 0; i < n; i++) { \
cin >> vec[i]; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define scanVec(vec, n) \
for (int i = 0; i < n; i++) { \
cin >> vec[i]; ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 986,430 | 986,429 | u319322407 | cpp |
p03178 | // In the Name of Allah. Ya Ali!
#include <bits/stdc++.h>
#define bp __builtin_popcount
typedef long long ll;
const ll MAX_N = 1e4 + 10;
const ll MAX_K = 105;
const ll MOD = 1e9 + 7;
using namespace std;
ll dp[MAX_N][MAX_K];
int a[MAX_N];
int m, n;
int main() {
string k;
cin >> k >> m;
n = k.length();
reverse... | // In the Name of Allah. Ya Ali!
#include <bits/stdc++.h>
#define bp __builtin_popcount
typedef long long ll;
const ll MAX_N = 1e4 + 10;
const ll MAX_K = 105;
const ll MOD = 1e9 + 7;
using namespace std;
ll dp[MAX_N][MAX_K];
int a[MAX_N];
int m, n;
int main() {
string k;
cin >> k >> m;
n = k.length();
reverse... | [
"assignment.change"
] | 986,431 | 986,432 | u509226403 | cpp |
p03178 | #include <algorithm>
#include <assert.h>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vecto... | #include <algorithm>
#include <assert.h>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vecto... | [
"expression.operation.binary.add"
] | 986,433 | 986,434 | u903951856 | cpp |
p03178 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"assignment.change"
] | 986,449 | 986,450 | u628047647 | cpp |
p03178 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 986,451 | 986,450 | u628047647 | cpp |
p03178 | #include <bits/stdc++.h>
#define N 1000000007
using namespace std;
string s;
int d;
//桁番号、less、あまり
// 1はs以下確定、0は未確定
long long dp[10001][2][100] = {0};
int main() {
cin >> d >> s;
dp[0][0][0] = 1;
for (int i = 1; i <= s.size(); ++i) {
for (int j = 0; j < d; ++j) {
for (int k = 0; k < 10; ++k) {
... | #include <bits/stdc++.h>
#define N 1000000007
using namespace std;
string s;
int d;
//桁番号、less、あまり
// 1はs以下確定、0は未確定
long long dp[10001][2][100] = {0};
int main() {
cin >> s >> d;
dp[0][0][0] = 1;
for (int i = 1; i <= s.size(); ++i) {
for (int j = 0; j < d; ++j) {
for (int k = 0; k < 10; ++k) {
... | [
"expression.operation.binary.remove"
] | 986,460 | 986,459 | u269963329 | cpp |
p03178 | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
// using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
#define int ll
#define endl "\n"
#define pb push_back
#def... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
// using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
#define int ll
#define endl "\n"
#define pb push_back
#def... | [
"call.arguments.change"
] | 986,466 | 986,467 | u528153137 | cpp |
p03178 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii... | [
"expression.operation.binary.remove"
] | 986,470 | 986,471 | u778948914 | cpp |
p03178 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 986,472 | 986,471 | u778948914 | cpp |
p03178 | #include <bits/stdc++.h>
// S - Digit Sum
#define MOD 1000000007
using namespace std;
string K;
int dp[10005][105];
bool vis[10005];
int D, ans;
void solve2(int len) {
if (vis[len])
return;
vis[len] = true;
if (len == 0) {
dp[len][0] = 1;
return;
}
int i, j;
solve2(len - 1);
for (i = 0... | #include <bits/stdc++.h>
// S - Digit Sum
#define MOD 1000000007
using namespace std;
string K;
int dp[10005][105];
bool vis[10005];
int D, ans;
void solve2(int len) {
if (vis[len])
return;
vis[len] = true;
if (len == 0) {
dp[len][0] = 1;
return;
}
int i, j;
solve2(len - 1);
for (i = 0... | [] | 986,477 | 986,478 | u530878476 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.