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 |
|---|---|---|---|---|---|---|---|
p03165 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd __gcd
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd __gcd
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 972,981 | 972,980 | u616547520 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd __gcd
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define gcd __gcd
#define all(a) a.begin(), a.end()
#define sz(a) (ll)(a.size())... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 972,982 | 972,980 | u616547520 | cpp |
p03165 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 100000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 100000... | [
"expression.operation.binary.add"
] | 973,002 | 973,003 | u274883254 | cpp |
p03165 | #define NDEBUG
NDEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#incl... | #define NDEBUG
NDEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#incl... | [
"literal.number.change",
"variable_declaration.value.change"
] | 973,011 | 973,012 | u060679524 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (int i = (int)(init); i < (int)(n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> DP(s.size() + 1, vector<int>(t.size() + 1, 0));
REP(i, 1, s.size() + 1) {
REP(j, 1, t.size() + 1) {
if (s[i] == t[j])
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (int i = (int)(init); i < (int)(n); i++)
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> DP(s.size() + 1, vector<int>(t.size() + 1, 0));
REP(i, 1, s.size() + 1) {
REP(j, 1, t.size() + 1) {
if (s[i - 1] == t[j - 1])... | [
"control_flow.branch.if.condition.change"
] | 973,106 | 973,107 | u559424030 | cpp |
p03165 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | [
"expression.operation.binary.add"
] | 973,113 | 973,114 | u354567428 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dp[3010][3010];
int main() {
string s, t;
cin >> s >> t;
rep(i, 3010) rep(j, 3010) dp[i][j] = 0;
dp[... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dp[3010][3010];
int main() {
string s, t;
cin >> s >> t;
rep(i, 3010) rep(j, 3010) dp[i][j] = 0;
dp[... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 973,115 | 973,116 | u808943968 | cpp |
p03165 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define MX 3003
int dp[MX][MX];
int main() {
string s, t;
cin >> s >> t;
for (int i = 1; i <= s.size(); ++i) {
for (int j = 1; j <= t.size(); ++j) {
if (s[i - 1] == t[j - 1])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
d... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define MX 3003
int dp[MX][MX];
int main() {
string s, t;
cin >> s >> t;
for (int i = 1; i <= s.size(); ++i) {
for (int j = 1; j <= t.size(); ++j) {
if (s[i - 1] == t[j - 1])
dp[i][j] = dp[i - 1][j - 1] + 1;
else
d... | [
"control_flow.branch.if.condition.change"
] | 973,131 | 973,132 | u559654669 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, j, n) for (int i = j; i < n; i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int mai... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, j, n) for (int i = j; i < n; i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int mai... | [
"expression.operation.binary.remove"
] | 973,163 | 973,164 | u908393090 | cpp |
p03165 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
short dp[3003][3003];
int main() {
string s, t;
cin >> s >> t;
int ss, ts;
ss = s.size();
ts = t.size();
// int dp[ss+1][ts+1];
rep(i, ts + 1) dp[0][i] = 0;
rep... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
short dp[3003][3003];
int main() {
string s, t;
cin >> s >> t;
int ss, ts;
ss = s.size();
ts = t.size();
// int dp[ss+1][ts+1];
rep(i, ts + 1) dp[0][i] = 0;
rep... | [
"expression.unary.arithmetic.add"
] | 973,190 | 973,191 | u164112876 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define rrep2(i, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define rrep2(i, n) for (int i ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 973,258 | 973,259 | u365512540 | cpp |
p03165 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 973,264 | 973,265 | u195054737 | cpp |
p03165 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"assignment.value.change",
"call.function.change"
] | 973,266 | 973,265 | u195054737 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n, m;
n = s.size(), m = t.size();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (s[i - 1] == t[j - 1])
dp[i][j] = dp[i - 1][j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int n, m;
n = s.size(), m = t.size();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (s[i - 1] == t[j - 1])
dp[i][j] = dp[i - 1][j ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 973,279 | 973,280 | u735499035 | cpp |
p03165 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"assignment.change"
] | 973,281 | 973,282 | u103850114 | cpp |
p03165 | // https://atcoder.jp/contests/dp/tasks/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
vector<vector<int>> dp;
char solve(const string &s, int &r... | // https://atcoder.jp/contests/dp/tasks/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
vector<vector<int>> dp;
char solve(const string &s, int &r... | [
"expression.operation.binary.add"
] | 973,308 | 973,309 | u864329440 | cpp |
p03165 | // https://atcoder.jp/contests/dp/tasks/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
vector<vector<int>> dp;
char solve(const string &s, int &r... | // https://atcoder.jp/contests/dp/tasks/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
vector<vector<int>> dp;
char solve(const string &s, int &r... | [
"control_flow.branch.if.condition.change"
] | 973,310 | 973,309 | u864329440 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
int arr[3005][3005];
// char arr2[1000000];
int main() {
int test;
scanf("%d", &test);
// for(int xx=1;xx<=test;xx++)
//{
string a, b;
cin >> a >> b;
int len1 = a.size();
int len2 = b.size();
for (int i = 0; i <= len1; i++) {
arr[i][0] = 0;
}
for... | #include <bits/stdc++.h>
using namespace std;
int arr[3005][3005];
// char arr2[1000000];
int main() {
int test;
scanf("%d", &test);
// for(int xx=1;xx<=test;xx++)
//{
string a, b;
cin >> a >> b;
int len1 = a.size();
int len2 = b.size();
for (int i = 0; i <= len1; i++) {
arr[i][0] = 0;
}
for... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 973,324 | 973,325 | u285938905 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
int arr[1000][1000];
// char arr2[1000000];
int main() {
int test;
scanf("%d", &test);
// for(int xx=1;xx<=test;xx++)
//{
string a, b;
cin >> a >> b;
int len1 = a.size();
int len2 = b.size();
for (int i = 0; i <= len1; i++) {
arr[i][0] = 0;
}
for... | #include <bits/stdc++.h>
using namespace std;
int arr[3005][3005];
// char arr2[1000000];
int main() {
int test;
scanf("%d", &test);
// for(int xx=1;xx<=test;xx++)
//{
string a, b;
cin >> a >> b;
int len1 = a.size();
int len2 = b.size();
for (int i = 0; i <= len1; i++) {
arr[i][0] = 0;
}
for... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 973,326 | 973,325 | u285938905 | cpp |
p03165 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define io ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define io ... | [
"assignment.change"
] | 973,338 | 973,339 | u890290031 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define drep2(i, m, n) for (int i = int(m - 1); i >= int(n); i--)
#define rep(i, n) rep2(i, 0, n)
#define drep (i, n) drep2(i, n, 0)
using ll = long long;
const int INF = 1 << 30;... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define drep2(i, m, n) for (int i = int(m - 1); i >= int(n); i--)
#define rep(i, n) rep2(i, 0, n)
#define drep (i, n) drep2(i, n, 0)
using ll = long long;
const int INF = 1 << 30;... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 973,397 | 973,398 | u525008368 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll N, W;
vector<ll> w, v;
vector<vector<ll>> dp;
/*void solve(ll i,ll j){
if(dp[i][j]!=-1){
continue;
}
ll res = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll N, W;
vector<ll> w, v;
vector<vector<ll>> dp;
/*void solve(ll i,ll j){
if(dp[i][j]!=-1){
continue;
}
ll res = 0;... | [] | 973,441 | 973,442 | u876784108 | cpp |
p03164 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ch... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ch... | [] | 973,448 | 973,449 | u824337972 | cpp |
p03164 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ch... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool ch... | [] | 973,450 | 973,449 | u824337972 | cpp |
p03164 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long li;
const li MAX = 100001;
li n, dp[101][1001], a, b, w, inf = 99999999999;
vector<pair<li, li>> items;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;
items.push_back({a, b});
}
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long li;
const li MAX = 100001;
li n, dp[101][100001], a, b, w, inf = 99999999999;
vector<pair<li, li>> items;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;
items.push_back({a, b});
}
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 973,462 | 973,461 | u190504030 | cpp |
p03164 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long li;
const li MAX = 100001;
li n, dp[101][1001], a, b, w, inf = 99999999999;
vector<pair<li, li>> items;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;
items.push_back({a, b});
}
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long li;
const li MAX = 100001;
li n, dp[101][100001], a, b, w, inf = 99999999999;
vector<pair<li, li>> items;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;
items.push_back({a, b});
}
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 973,463 | 973,461 | u190504030 | cpp |
p03164 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long li;
const li MAX = 100001;
li n, dp[101][1001], a, b, w, inf = 99999999999;
vector<pair<li, li>> items;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;
items.push_back({a, b});
}
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long li;
const li MAX = 100001;
li n, dp[101][100001], a, b, w, inf = 99999999999;
vector<pair<li, li>> items;
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a >> b;
items.push_back({a, b});
}
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 973,464 | 973,461 | u190504030 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define inf 10000000000000000
int main() {
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define inf 10000000000000000
int main() {
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 973,471 | 973,472 | u511137896 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i <... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i <... | [
"expression.operation.binary.add"
] | 973,473 | 973,474 | u136378781 | cpp |
p03164 | #include <iostream>
using namespace std;
int main() {
int a = 0, b = 0;
cin >> a >> b;
int items[a + 1][2] = {0};
int sum = 0;
for (int i = 1; i <= a; i++) {
cin >> items[i][0] >> items[i][1];
sum += items[i][1];
}
long long int arr[sum + 1] = {0};
for (int j = sum; j >= 0; j--) {
arr[j] ... | #include <iostream>
using namespace std;
int main() {
int a = 0, b = 0;
cin >> a >> b;
int items[a + 1][2] = {0};
int sum = 0;
for (int i = 1; i <= a; i++) {
cin >> items[i][0] >> items[i][1];
sum += items[i][1];
}
long long int arr[sum + 1] = {0};
for (int j = sum; j > 0; j--) {
arr[j] =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 973,477 | 973,478 | u223578409 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
void min_self(ll &a, ll b) { a = min(a, b); }
const int N = 110;
int n, W;
int main() {
scanf("%d%d", &n, &W);
vector<ll> weight(n);
vector<ll> value(n);
for (int i = 0; i < n; ++i) {
cin >> weight[i] >> value[i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
void min_self(ll &a, ll b) { a = min(a, b); }
const int N = 110;
int n, W;
int main() {
scanf("%d%d", &n, &W);
vector<ll> weight(n);
vector<ll> value(n);
for (int i = 0; i < n; ++i) {
cin >> weight[i] >> value[i];
}
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 973,479 | 973,480 | u763404917 | cpp |
p03164 | #include <bits/stdc++.h>
#include <limits.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <limits.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [] | 973,489 | 973,490 | u535349616 | cpp |
p03164 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll w[102], v[102], dp[102][100005];
int main() {
int n;
ll W;
scanf("%d %lld", &n, &W);
for (int i = 1; i <= n; i++) {
scanf("%lld %lld", &w[i], &v[i]);
}
for (int i = 1; i < 100005; i++)
dp[0][i] = 1e18;
for (int i = 1; i <= n; ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll w[102], v[102], dp[102][100005];
int main() {
int n;
ll W;
scanf("%d %lld", &n, &W);
for (int i = 1; i <= n; i++) {
scanf("%lld %lld", &w[i], &v[i]);
}
for (int i = 1; i < 100005; i++)
dp[0][i] = 1e18;
for (int i = 1; i <= n; ... | [
"expression.operation.binary.remove"
] | 973,500 | 973,501 | u385306891 | cpp |
p03164 | // Resting_Prince
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000009
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; ... | // Resting_Prince
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mod 1000000009
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; ... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 973,502 | 973,503 | u640930204 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
typedef long long ll;
const int INF = 1e9;
const int MAX_N = 105;
const int MAX_V = 1005;
// input
ll N, W;
vector<ll> w(MAX_N), v(MAX_N);
// dp
ll dp[MAX_N][MAX_N * MAX_V];
int main() {
cin >> N >> W;
rep(i, N) c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
typedef long long ll;
const int INF = 1e10;
const int MAX_N = 105;
const int MAX_V = 1005;
// input
ll N, W;
vector<ll> w(MAX_N), v(MAX_N);
// dp
ll dp[MAX_N][MAX_N * MAX_V];
int main() {
cin >> N >> W;
rep(i, N) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 973,506 | 973,507 | u106297876 | cpp |
p03164 | #include <bits/stdc++.h>
#define INF 1e10;
using namespace std;
typedef long long ll;
int main(void) {
int N, W;
cin >> N >> W;
ll w[N + 1], v[N + 1];
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> w[i + 1] >> v[i + 1];
sum += v[i + 1];
}
ll dp[N + 1][sum + 1];
for (int i = 0; i <= N; i++)... | #include <bits/stdc++.h>
#define INF 1e10;
using namespace std;
typedef long long ll;
int main(void) {
int N, W;
cin >> N >> W;
ll w[N + 1], v[N + 1];
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> w[i + 1] >> v[i + 1];
sum += v[i + 1];
}
ll dp[N + 10][sum + 100];
for (int i = 0; i <= N; i... | [
"literal.number.change",
"expression.operation.binary.change"
] | 973,512 | 973,513 | u413492096 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define endl "\n"
#define printarr(arr, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define endl "\n"
#define printarr(arr, n) ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 973,514 | 973,515 | u563511494 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define MAX 105
ll dp[MAX][100005];
ll W[MAX], V[MAX];
ll n, w;
ll INF = 1e14;
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> W[i] >> V[i];
}
for (int i = 1; i < 100005; i++) {
dp[0][... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define MAX 105
ll dp[MAX][100005];
ll W[MAX], V[MAX];
ll n, w;
ll INF = 1e14;
int main() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> W[i] >> V[i];
}
for (int i = 1; i < 100005; i++) {
dp[0][... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 973,518 | 973,519 | u389854459 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define PI 3.14159265358979323846... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define PI 3.14159265358979323846... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 973,526 | 973,527 | u936599352 | cpp |
p03164 | #include <bits/stdc++.h>
#define MAX_N 100
#define MAX_V 1000
#define INF 1 << 60
typedef long long int ll;
ll dp[MAX_N + 1][MAX_V + 1];
int main() {
int n, v[MAX_N + 1];
ll W, w[MAX_N + 1];
std::cin >> n >> W;
for (int i = 0; i < n; ++i) {
std::cin >> w[i] >> v[i];
}
for (int j = 1; j <= MAX_V; ++... | #include <bits/stdc++.h>
#define MAX_N 100
#define MAX_V 100000
#define INF 1 << 30
typedef long long int ll;
ll dp[MAX_N + 1][MAX_V + 1];
int main() {
int n, v[MAX_N + 1];
ll W, w[MAX_N + 1];
std::cin >> n >> W;
for (int i = 0; i < n; ++i) {
std::cin >> w[i] >> v[i];
}
for (int j = 1; j <= MAX_V; ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 973,535 | 973,534 | u600759947 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long int
typedef pair<int, int> pii;
vector<int> v;
map<int, int> op;
#define MAX 200005
bool visited[MAX];
vector<int> adj[MAX];
const int M = 1e9 + 7;
int n, m;
const ll INF = 1LL ... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long int
typedef pair<int, int> pii;
vector<int> v;
map<int, int> op;
#define MAX 200005
bool visited[MAX];
vector<int> adj[MAX];
const int M = 1e9 + 7;
int n, m;
const ll INF = 1LL ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 973,546 | 973,547 | u486889274 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 105;
const int maxw = 1e5 + 5;
int w[maxn], v[maxn];
int n, W;
ll dp[maxw];
int main() {
scanf("%d %d", &n, &W);
int sum = 0;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 105;
const int maxw = 1e5 + 5;
int w[maxn], v[maxn];
int n, W;
ll dp[maxw];
int main() {
scanf("%d %d", &n, &W);
int sum = 0;
for (int i = 1; i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"misc.opposites",
"call.function.change"
] | 973,561 | 973,562 | u905710781 | cpp |
p03164 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N = 0;
int W = 0;
int main() {
//ナップサック問題 荷物の価値を最大化
cin >> N;
cin >> W;
vector<pair<ll, ll>> T;
ll value = 0;
ll weight = 0;
ll max_value = 0;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N = 0;
int W = 0;
int main() {
//ナップサック問題 荷物の価値を最大化
cin >> N;
cin >> W;
vector<pair<ll, ll>> T;
ll value = 0;
ll weight = 0;
ll max_value = 0;... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 973,563 | 973,564 | u048791623 | cpp |
p03164 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define f first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define f first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 973,573 | 973,574 | u697012152 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | [
"literal.number.change",
"expression.operation.binary.change"
] | 973,589 | 973,590 | u568652083 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll n, dp[105][100005], v[105], w[105], m, ans;
int main(void) {
scanf("%lld%lld", &n, &m);
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll n, dp[105][100005], v[105], w[105], m, ans;
int main(void) {
scanf("%lld%lld", &n, &m);
for (int ... | [] | 973,615 | 973,616 | u743900647 | cpp |
p03164 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll n, dp[100][100005], v[105], w[105], m, ans;
int main(void) {
scanf("%lld%lld", &n, &m);
for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll n, dp[105][100005], v[105], w[105], m, ans;
int main(void) {
scanf("%lld%lld", &n, &m);
for (int ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 973,617 | 973,616 | u743900647 | cpp |
p03165 | #pragma GCC optimize("O2")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
using namespace st... | #pragma GCC optimize("O2")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
using namespace st... | [
"control_flow.loop.condition.change"
] | 973,682 | 973,683 | u487128874 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()... | [
"assignment.value.change"
] | 973,697 | 973,702 | u074445770 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
string lcs(string s, string t) {
int n = s.size();
int m = t.size();
int arr[n][m];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 || j == 0) {
arr[i][j] = 0;
continue;
}
if (s[i - 1] == t[j - 1]) {
... | #include <bits/stdc++.h>
using namespace std;
string lcs(string s, string t) {
int n = s.size();
int m = t.size();
int arr[n + 1][m + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 || j == 0) {
arr[i][j] = 0;
continue;
}
if (s[i - 1] == t[j - 1... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 973,722 | 973,723 | u100071032 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MAXN 3010
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1e9 + 7;
int n, m;
int dp[MAXN][MAXN];
string s, t;
int main() {
cin >> s >> t;
n = s.size();
m = t.size... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MAXN 3010
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll mod = 1e9 + 7;
int n, m;
int dp[MAXN][MAXN];
string s, t;
int main() {
cin >> s >> t;
n = s.size();
m = t.size... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 973,747 | 973,748 | u558720836 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 29;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#else
#define debug(var)
#endif
#define p(var) std::cout << var << std::endl
#define PI (ac... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 29;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#else
#define debug(var)
#endif
#define p(var) std::cout << var << std::endl
#define PI (ac... | [
"function.return_value.change"
] | 973,778 | 973,779 | u061071198 | cpp |
p03165 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 973,786 | 973,787 | u904131314 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | [
"control_flow.branch.if.condition.change"
] | 973,788 | 973,789 | u172929647 | cpp |
p03165 | #define rep(i, n) REP(i, 0, n)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
... | #define rep(i, n) REP(i, 0, n)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 973,863 | 973,864 | u381755004 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"assignment.value.change"
] | 973,865 | 973,866 | u052332717 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 973,867 | 973,868 | u052332717 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 973,869 | 973,868 | u052332717 | cpp |
p03165 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 973,872 | 973,873 | u366676780 | cpp |
p03165 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[3001][3001];
int main(void) {
string str1, str2;
cin >> str1 >> str2;
for (int i = 1; i <= str1.length(); i++) {
for (int j = 1; j <= str2.length(); j++) {
if (str1[i] == str2[j]) {
dp[i][j] = dp[i - 1][j ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[3001][3001];
int main(void) {
string str1, str2;
cin >> str1 >> str2;
for (int i = 1; i <= str1.length(); i++) {
for (int j = 1; j <= str2.length(); j++) {
if (str1[i - 1] == str2[j - 1]) {
dp[i][j] = dp[i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"control_flow.loop.condition.change"
] | 973,911 | 973,912 | u117734686 | cpp |
p03165 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[3001][3001];
int main(void) {
string str1, str2;
cin >> str1 >> str2;
for (int i = 1; i <= str1.length(); i++) {
for (int j = 1; j <= str2.length(); j++) {
if (str1[i] == str2[j]) {
dp[i][j] = dp[i - 1][j ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[3001][3001];
int main(void) {
string str1, str2;
cin >> str1 >> str2;
for (int i = 1; i <= str1.length(); i++) {
for (int j = 1; j <= str2.length(); j++) {
if (str1[i - 1] == str2[j - 1]) {
dp[i][j] = dp[i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 973,913 | 973,912 | u117734686 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
#define MAX 3100
int dp[MAX][MAX];
int main() {
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < MAX; j++) {
dp[i][j] = 0;
}
}
string s, t;
cin >> s >> t;
for (int i = 0; i < s.length(); i++) {
for (int j = i; j < t.length(); j++) {
i... | #include <bits/stdc++.h>
using namespace std;
#define MAX 3100
int dp[MAX][MAX];
int main() {
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < MAX; j++) {
dp[i][j] = 0;
}
}
string s, t;
cin >> s >> t;
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j < t.length(); j++) {
i... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 973,919 | 973,920 | u055447809 | cpp |
p03165 | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef lon... | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef lon... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 973,943 | 973,944 | u535347736 | cpp |
p03165 | #include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll div_ceil(ll, ll);
int dx[4] = {0, 0, -1, 1};... | #include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll div_ceil(ll, ll);
int dx[4] = {0, 0, -1, 1};... | [
"literal.number.change",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.loop.condition.change"
] | 973,974 | 973,973 | u408053343 | cpp |
p03165 | #include <iostream>
using namespace std;
const int MAX_S = 3100;
const int MAX_T = 3100;
long long dp[MAX_S][MAX_T] = {
0}; // N-1番目までで入れた容量の価値を最大にするもの
const long long INF = 1LL << 60;
int main() {
string S, T;
cin >> S >> T;
dp[0][0] = 0;
for (int i = 0; i < S.size(); ++i) {
for (int j = 0; j < T.... | #include <iostream>
using namespace std;
const int MAX_S = 3100;
const int MAX_T = 3100;
long long dp[MAX_S][MAX_T] = {
0}; // N-1番目までで入れた容量の価値を最大にするもの
const long long INF = 1LL << 60;
int main() {
string S, T;
cin >> S >> T;
dp[0][0] = 0;
for (int i = 0; i < S.size(); ++i) {
for (int j = 0; j < T.... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 974,012 | 974,013 | u894555185 | cpp |
p03165 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, i0, n) for (int i = (i0); i < (n); i++)
#define COUT(val) cout << (val) << "\n";
using namespace std;
using ll = long long int;
int main(void) {
string s, t;
cin >> s >> t;
int ns = s.size(), nt = t.size();
vector<vect... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, i0, n) for (int i = (i0); i < (n); i++)
#define COUT(val) cout << (val) << "\n";
using namespace std;
using ll = long long int;
int main(void) {
string s, t;
cin >> s >> t;
int ns = s.size(), nt = t.size();
vector<vect... | [
"control_flow.loop.condition.change"
] | 974,066 | 974,067 | u375405838 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vpi = vector<pi>;
using vvpi = vector<vpi>;
const ull MOD = 998244353;
#ifdef LOCAL
#include "../../pp.hpp"
#define debug pp::debug
#else
#... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vpi = vector<pi>;
using vvpi = vector<vpi>;
const ull MOD = 998244353;
#ifdef LOCAL
#include "../../pp.hpp"
#define debug pp::debug
#else
#... | [
"identifier.change",
"call.arguments.change"
] | 974,092 | 974,093 | u286163941 | cpp |
p03165 | // https://atcoder.jp/contests/dp/tasks/dp_f
// shauryakr
#include <bits/stdc++.h>
using namespace std;
string a, b;
int dp[3005][3005];
void solve() {
for (int i = 1; i <= a.length(); i++) {
for (int j = 1; j <= b.length(); j++) {
if (a[i - 1] == b[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}... | // https://atcoder.jp/contests/dp/tasks/dp_f
// shauryakr
#include <bits/stdc++.h>
using namespace std;
string a, b;
int dp[3005][3005];
void solve() {
for (int i = 1; i <= a.length(); i++) {
for (int j = 1; j <= b.length(); j++) {
if (a[i - 1] == b[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}... | [
"misc.opposites",
"control_flow.loop.condition.change"
] | 974,114 | 974,115 | u009824133 | cpp |
p03165 | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 3010
string s, t;
string ans;
int dp[MAXN][MAXN];
void dfs(int i, int j) {
int val = dp[i][j];
if (val == 0)
return;
if (i == 0 && j == 0) {
ans += s[0];
return;
}
if (i == 0) {
ans += s[0];
return;
}
if (j ... | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 3010
string s, t;
string ans;
int dp[MAXN][MAXN];
void dfs(int i, int j) {
int val = dp[i][j];
if (val == 0)
return;
if (i == 0 && j == 0) {
ans += s[0];
return;
}
if (i == 0) {
ans += s[0];
return;
}
if (j ... | [
"control_flow.return.add"
] | 974,137 | 974,138 | u719290158 | cpp |
p03165 | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 3010
string s, t;
string ans;
int dp[MAXN][MAXN];
void dfs(int i, int j) {
int val = dp[i][j];
if (val == 0)
return;
if (i == 0 && j == 0) {
ans += s[0];
return;
}
if (i == 0) {
ans += s[0];
return;
}
if (j == 0... | #include <cmath>
#include <iostream>
using namespace std;
#define MAXN 3010
string s, t;
string ans;
int dp[MAXN][MAXN];
void dfs(int i, int j) {
int val = dp[i][j];
if (val == 0)
return;
if (i == 0 && j == 0) {
ans += s[0];
return;
}
if (i == 0) {
ans += s[0];
return;
}
if (j ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.return.add"
] | 974,139 | 974,138 | u719290158 | cpp |
p03165 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const long long INF = 1e18;
int main() {
string s, t;
cin >> s >> t;
int ls = s.size(), lt = t.size();
auto dp = vector<vector<int>>(3010, vector<int>(3010, 0));
dp[0][0] = (s[0] == t[0]) ? 1 : 0;
for (int i = 1; i < ls; i++) ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const long long INF = 1e18;
int main() {
string s, t;
cin >> s >> t;
int ls = s.size(), lt = t.size();
auto dp = vector<vector<int>>(3010, vector<int>(3010, 0));
dp[0][0] = (s[0] == t[0]) ? 1 : 0;
for (int i = 1; i < ls; i++) ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 974,159 | 974,160 | u808916291 | cpp |
p03165 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<int, int>
#define debug(x) cerr << #x << " = " << x << endl;
const int MAX = 3e3 + 100;
int dp[MAX][MAX];
pair<int, ii> p[MAX][MAX];
string s, t;
int dp_solve(int idxs, int idxt) {
if (idxs < 0 || idxt < 0)
return 0;
int &ans... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<int, int>
#define debug(x) cerr << #x << " = " << x << endl;
const int MAX = 3e3 + 100;
int dp[MAX][MAX];
pair<int, ii> p[MAX][MAX];
string s, t;
int dp_solve(int idxs, int idxt) {
if (idxs < 0 || idxt < 0)
return 0;
int &ans... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 974,208 | 974,209 | u364803514 | cpp |
p03165 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int dp[3000][3000];
int main() {
string s;
string t;
cin >> s;
cin >> t;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
if (i == 0) {
if (t.substr... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int dp[3000][3000];
int main() {
string s;
string t;
cin >> s;
cin >> t;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < t.size(); j++) {
if (i == 0) {
if (t.substr... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.add",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 974,215 | 974,216 | u623349537 | cpp |
p03166 | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <string.h>
#define ll long long
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 974,270 | 974,271 | u375055372 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> x;
int n, m;
bool visited[100009];
int dp[100009];
int solve(int curr) {
if (dp[curr] != -1)
return dp[curr];
int temp = -1;
for (auto i : x[curr]) {
if (dp[i] != -1) {
temp = 1 + dp[i];
dp[curr] = max(dp[curr], temp);
} els... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> x;
int n, m;
bool visited[100009];
int dp[100009];
int solve(int curr) {
if (dp[curr] != -1)
return dp[curr];
int temp = -1;
for (auto i : x[curr]) {
if (dp[i] != -1) {
temp = 1 + dp[i];
dp[curr] = max(dp[curr], temp);
} els... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 974,311 | 974,312 | u059216660 | cpp |
p03166 | using namespace std;
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define vect vector<ll>
#define maap map<ll, ll>
#define MOD 1000000007
#define mit map::iterator
#define pii pair<ll, ll>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fast ... | using namespace std;
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define vect vector<ll>
#define maap map<ll, ll>
#define MOD 1000000007
#define mit map::iterator
#define pii pair<ll, ll>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fast ... | [] | 974,315 | 974,316 | u379844185 | cpp |
p03166 | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> vertices;
vector<int> dp;
int longestPath(int root) {
if (dp[root] != -1)
return dp[root];
int max = 0;
for (int vertex : vertices[root]) {
dp[vertex] = longestPath(vertex);
if (dp[vertex] > max) {
max = dp[vertex]... | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> vertices;
vector<int> dp;
int longestPath(int root) {
if (dp[root] != -1)
return dp[root];
int max = 0;
for (int vertex : vertices[root]) {
dp[vertex] = longestPath(vertex);
if (dp[vertex] > max) {
max = dp[vertex]... | [
"assignment.change",
"expression.operation.binary.remove"
] | 974,328 | 974,329 | u446995216 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define fast \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define fast \
ios_base::sync_with_stdio(0); ... | [
"assignment.change"
] | 974,331 | 974,332 | u806085844 | cpp |
p03166 | /*
https://atcoder.jp/contests/dp/tasks/dp_g
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 10;
const int oo = 1e9 + 7;
vector<vector<int>> adj;
int n, m;
int f[N], ans = 0;
bool Visited[N];
void Init() {
cin >> n >> m;
for (int i = 0; i <= n; ++i) {
adj.push_back(vector<int>());
}
int u,... | /*
https://atcoder.jp/contests/dp/tasks/dp_g
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const int oo = 1e9 + 7;
vector<vector<int>> adj;
int n, m;
int f[N], ans = 0;
bool Visited[N];
void Init() {
cin >> n >> m;
for (int i = 0; i <= n; ++i) {
adj.push_back(vector<int>());
}
i... | [
"literal.number.change"
] | 974,335 | 974,336 | u130511458 | cpp |
p03166 | #include <bits/stdc++.h>
#define pi pair<int, int>
#define mk make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fo(i, a, n) for (int i = a; i < n; i++)
#define fr(i, a, n) for (int i = a; i >= n; i--)
#define ll long long
#define N 1000000
using namespace std;
vector<int> adj[100005];
vector<int> dp(100005... | #include <bits/stdc++.h>
#define pi pair<int, int>
#define mk make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fo(i, a, n) for (int i = a; i < n; i++)
#define fr(i, a, n) for (int i = a; i >= n; i--)
#define ll long long
#define N 1000000
using namespace std;
vector<int> adj[100005];
vector<int> dp(100005... | [
"assignment.change"
] | 974,337 | 974,338 | u765828490 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,339 | 974,340 | u900229905 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,343 | 974,344 | u688146320 | cpp |
p03166 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
vector<int> arr[100001];
bool vis[100001];
int dist[100001];
void dfs(int node) {
vis[node] = 1;
for (auto child : arr[node]) {
if (vis[child] == 0) {
dfs(child);
dist[node] = max(dist[node], 1 + dist[child]);
}
}
}
int main(... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
vector<int> arr[100001];
bool vis[100001];
int dist[100001];
void dfs(int node) {
vis[node] = 1;
for (auto child : arr[node]) {
if (vis[child] == 0)
dfs(child);
dist[node] = max(dist[node], 1 + dist[child]);
}
}
int main() {
// h... | [] | 974,349 | 974,350 | u780643980 | cpp |
p03166 | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stack>
#include <vector>
#define pb push_back
// #define pop pop_back
#define ll long long int
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define rep(i, n) for... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stack>
#include <vector>
#define pb push_back
// #define pop pop_back
#define ll long long int
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define rep(i, n) for... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 974,354 | 974,355 | u016294888 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> V[200005];
int indegree[200005];
int bio[200005];
int dp[200005];
void dfs(int a) {
bio[a] = 1;
for (auto b : V[a]) {
dp[b] = max(dp[b], dp[a] + 1);
indegree[b]--;
if (!indegree[b]) {
dfs(b);
}
}
}
int main() {... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> V[200005];
int indegree[200005];
int bio[200005];
int dp[200005];
void dfs(int a) {
bio[a] = 1;
for (auto b : V[a]) {
dp[b] = max(dp[b], dp[a] + 1);
indegree[b]--;
if (!indegree[b]) {
dfs(b);
}
}
}
int main() {... | [
"variable_declaration.value.change"
] | 974,400 | 974,401 | u787597250 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<int> adj[100005];
bool visited[100005];
int dp[100005];
void visit(int vertex) {
visited[vertex] = 1;
dp[vertex] = 0;
for (int child : adj[vertex]) {
if (!visited[child]) {
visit(child);
}
dp[vertex] = max(dp[vertex], 1 + dp[child]);
}
}
... | #include <bits/stdc++.h>
using namespace std;
vector<int> adj[100005];
bool visited[100005];
int dp[100005];
void visit(int vertex) {
visited[vertex] = 1;
dp[vertex] = 0;
for (int child : adj[vertex]) {
if (!visited[child]) {
visit(child);
}
dp[vertex] = max(dp[vertex], 1 + dp[child]);
}
}
... | [
"io.output.change"
] | 974,402 | 974,403 | u397680283 | cpp |
p03166 | #define _CRT_SECURE_NO_WARNINGS
/* وتزودوا فإن خير الزاد التقوى */
/* وما تدري نفس ماذا تکسب غدا وما تدري نفس باي ارض تموت */
#include <bits/stdc++.h>
#include <fstream>
#include <iomanip>
#include <unordered_map>
using namespace std;
#define endl '\n'
#define ll long lon... | #define _CRT_SECURE_NO_WARNINGS
/* وتزودوا فإن خير الزاد التقوى */
/* وما تدري نفس ماذا تکسب غدا وما تدري نفس باي ارض تموت */
#include <bits/stdc++.h>
#include <fstream>
#include <iomanip>
#include <unordered_map>
using namespace std;
#define endl '\n'
#define ll long lon... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.remove"
] | 974,443 | 974,444 | u018679195 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m;
const int mx = 1000009;
vector<ll> edg[mx];
int visited[mx];
ll dp[mx];
void dfs(int node) {
visited[node] = 1;
for (auto i : edg[node]) {
if (!visited[i]) {
dfs(i);
}
dp[node] = max(dp[node], dp[i] + 1);
}
}
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m;
const int mx = 1000009;
vector<ll> edg[mx];
int visited[mx];
ll dp[mx];
void dfs(int node) {
visited[node] = 1;
for (auto i : edg[node]) {
if (!visited[i]) {
dfs(i);
}
dp[node] = max(dp[node], dp[i] + 1);
}
}
int main(... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,445 | 974,446 | u474448122 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#include <map>
#include <string.h>
#define MEM(var, val) memset(var, (val), sizeof(var))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define nitro \
ios_base::sync_wit... | #include <bits/stdc++.h>
using namespace std;
#include <map>
#include <string.h>
#define MEM(var, val) memset(var, (val), sizeof(var))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define nitro \
ios_base::sync_wit... | [] | 974,459 | 974,460 | u116264984 | cpp |
p03166 |
//#include "stdc++.h"
#include <bits/stdc++.h>
#include <iostream>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long lon... |
//#include "stdc++.h"
#include <bits/stdc++.h>
#include <iostream>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long lon... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 974,471 | 974,472 | u314476982 | cpp |
p03166 | #include <bits/stdc++.h>
#define N 500003
#define MOD 1000000007
#define int long long
using namespace std;
int vis[100006];
vector<int> v[100006];
int dp[100006];
void dfs(int root) {
if (vis[root])
return;
vis[root] = 1;
for (auto it : v[root]) {
if (!vis[root])
dfs(it);
dp[root] = max(dp[roo... | #include <bits/stdc++.h>
#define N 500003
#define MOD 1000000007
#define int long long
using namespace std;
int vis[100006];
vector<int> v[100006];
int dp[100006];
void dfs(int root) {
if (vis[root])
return;
vis[root] = 1;
for (auto it : v[root]) {
if (!vis[it])
dfs(it);
dp[root] = max(dp[root]... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 974,511 | 974,512 | u360668137 | cpp |
p03166 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
... | [
"identifier.change",
"call.arguments.change"
] | 974,513 | 974,514 | u258553417 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[100001];
int dp[100001];
// void d_m_c()
// {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// }
int solve(int src) {
if (dp[s... | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[100001];
int dp[100001];
// void d_m_c()
// {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// }
int solve(int src) {
if (dp[s... | [
"literal.number.change",
"assignment.value.change",
"function.return_value.change"
] | 974,526 | 974,527 | u337524871 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[100001];
int dp[100001];
// void d_m_c()
// {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// }
int solve(int src) {
if (dp[s... | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[100001];
int dp[100001];
// void d_m_c()
// {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// }
int solve(int src) {
if (dp[s... | [
"literal.number.change",
"assignment.value.change",
"function.return_value.change",
"control_flow.return.add"
] | 974,528 | 974,527 | u337524871 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[100001];
int dp[100001];
// void d_m_c()
// {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// }
int solve(int src) {
if (dp[s... | #include <bits/stdc++.h>
using namespace std;
vector<int> graph[100001];
int dp[100001];
// void d_m_c()
// {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// }
int solve(int src) {
if (dp[s... | [
"control_flow.return.add",
"function.return_type.change"
] | 974,529 | 974,527 | u337524871 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long int
#define loop(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rloop(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define loopl(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define loopr(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define count_1(n) __builtin... | #include <bits/stdc++.h>
#define ll long long int
#define loop(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rloop(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define loopl(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define loopr(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define count_1(n) __builtin... | [
"identifier.change",
"call.arguments.change"
] | 974,534 | 974,535 | u202379883 | cpp |
p03166 | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 974,546 | 974,547 | u487912105 | cpp |
p03166 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mod 1000000007
#define check exit(0)
#define nl cout << endl;
#define inp 10
#define ordered_set \
tree<int, null_type, less_equal<int>, rb_tree_ta... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mod 1000000007
#define check exit(0)
#define nl cout << endl;
#define inp 200005
#define ordered_set \
tree<int, null_type, less_equal<int>, rb_tre... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 974,548 | 974,549 | u319910051 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define MAX 100005
vector<int> v[MAX];
int dp[MAX], vis[MAX], indeg[MAX];
void dfs(int x) {
vis[x] = 1;
dp[x] = 0;
if (v[x].size() == 0)
return;
int val = 0;
for (auto i : v[x]) {
if (vis[i] == 0) {
dfs(i);
if (val < dp[i])
... | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define MAX 100005
vector<int> v[MAX];
int dp[MAX], vis[MAX], indeg[MAX];
void dfs(int x) {
vis[x] = 1;
dp[x] = 0;
if (v[x].size() == 0)
return;
int val = 0;
for (auto i : v[x]) {
if (vis[i] == 0)
dfs(i);
if (val < dp[i])
... | [] | 974,563 | 974,564 | u474688099 | cpp |
p03165 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 974,579 | 974,580 | u876978301 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.