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 9
values |
|---|---|---|---|---|---|---|---|
p02960 | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
vector<ll> dp;
int main() {
string s;
cin >> s;
int n = s.length();
dp.resize(n, 0);
dp[0] = 1;
for (char c : s) {
vector<ll> dp_next(13, 0);
for (int i = 0; i < 10; ++i)... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
vector<ll> dp;
int main() {
string s;
cin >> s;
int n = s.length();
dp.resize(13, 0);
dp[0] = 1;
for (char c : s) {
vector<ll> dp_next(13, 0);
for (int i = 0; i < 10; ++i... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 769,241 | 769,242 | u882821419 | cpp |
p02960 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
us... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
us... | [
"assignment.value.change",
"identifier.change"
] | 769,247 | 769,248 | u337845373 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const unsigned long long MOD = 1000000007LL;
int main() {
string s;
cin >> s;
int c;
ll length = s.length();
ll dp[length + 5][13];
dp[0][0] = 1;
for (ll n = 0; n < length; n++) {
if (s[n] != '?')
c = -1;
else
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const unsigned long long MOD = 1000000007LL;
int main() {
string s;
cin >> s;
int c;
ll length = s.length();
ll dp[length + 1000][13];
dp[0][0] = 1;
for (ll n = 0; n < length; n++) {
if (s[n] == '?')
c = -1;
else
... | [
"literal.number.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 769,252 | 769,253 | u364916333 | cpp |
p02960 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | [
"assignment.change"
] | 769,263 | 769,264 | u153607901 | cpp |
p02960 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout <<... | [
"assignment.change"
] | 769,263 | 769,265 | u153607901 | cpp |
p02960 | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 ... | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 ... | [
"assignment.change"
] | 769,268 | 769,269 | u047858101 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
const int mxN = 1e9 + 7;
char s[100005];
long long dp[100005][13];
int main() {
string s;
cin >> s;
int n = s.length();
dp[0][0] = 1;
for... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
const int mxN = 1e9 + 7;
char s[100005];
long long dp[100005][13];
int main() {
string s;
cin >> s;
int n = s.length();
dp[0][0] = 1;
fo... | [
"assignment.change"
] | 769,270 | 769,271 | u221780420 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 769,304 | 769,305 | u825601908 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 769,306 | 769,305 | u825601908 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | #include <bits/stdc++.h>
using namespace std;
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pint = pa... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 769,307 | 769,305 | u825601908 | cpp |
p02960 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int mod = 1000000007;
vector<vector<int>> dp(
s.size() + 1, vector<int>(13)); // i文字までにあまりjの数がいくつあるか
if (s.at(0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int mod = 1000000007;
vector<vector<int>> dp(
s.size() + 1, vector<int>(13)); // i文字までにあまりjの数がいくつあるか
if (s.at(0... | [
"literal.number.change",
"call.arguments.change"
] | 769,316 | 769,317 | u387371565 | cpp |
p02960 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip> //setprecision(桁)
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stac... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip> //setprecision(桁)
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stac... | [
"literal.number.change",
"assignment.value.change"
] | 769,318 | 769,319 | u504800764 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int dp[100005][13];
int main() {
string S;
cin >> S;
if (S[0] != '?')
dp[0][(S[0] - '0')]++;
else
for (int k = 0; k < 10; k++)
dp[0][k]++;
for (int i = 1; i < S.length(); i++) {
for (int j = 0; j < 13;... | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int dp[100005][13];
int main() {
string S;
cin >> S;
if (S[0] != '?')
dp[0][(S[0] - '0')]++;
else
for (int k = 0; k < 10; k++)
dp[0][k]++;
for (int i = 1; i < S.length(); i++) {
for (int j = 0; j < 13;... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 769,335 | 769,336 | u983681697 | cpp |
p02960 | // RAKSHIT KADAM
// ALWAYS USE &IT FOR ITERATING USING AUTO ...
// USE COUNT(STARTING ADDRESS, ENDING ADRESS ,VALUE) FOR FINDING THE COUNT IN
// THE RESPECTIVE DATA STRUCTURE NOTE THAT MEMSET CANNOT ASSIGN A VALUE OF 10^18
// IT WILL ASSIGN A LOWER VALUE THAN THAT!!!
#include <bits/stdc++.h>
// #include <ext/pb_ds/ass... | // RAKSHIT KADAM
// ALWAYS USE &IT FOR ITERATING USING AUTO ...
// USE COUNT(STARTING ADDRESS, ENDING ADRESS ,VALUE) FOR FINDING THE COUNT IN
// THE RESPECTIVE DATA STRUCTURE NOTE THAT MEMSET CANNOT ASSIGN A VALUE OF 10^18
// IT WILL ASSIGN A LOWER VALUE THAN THAT!!!
#include <bits/stdc++.h>
// #include <ext/pb_ds/ass... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,352 | 769,353 | u677600881 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int mod = 1e9 + 7;
ll dp[n + 1][13]{};
dp[0][0] = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j < 13; j++)
for (int k = 0; k <= 9; k++)
if (s[i] == '?' || s[i] - '0'... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int mod = 1e9 + 7;
ll dp[n + 1][13]{};
dp[0][0] = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j < 13; j++)
for (int k = 0; k <= 9; k++)
if (s[i] == '?' || s[i] - '0'... | [
"assignment.change"
] | 769,356 | 769,357 | u804999113 | cpp |
p02960 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
const ll MOD = 1e9 + 7;
in... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
const ll MOD = 1e9 + 7;
in... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,373 | 769,374 | u977925575 | cpp |
p02960 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
string S;
cin >> S;
const int N = ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main() {
string S;
cin >> S;
const int N = ... | [
"assignment.value.change",
"identifier.change"
] | 769,377 | 769,378 | u552122040 | cpp |
p02960 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
const int n = 13;
vector<vector<ll>> dp(100001, vector<ll>(n));
ll mod = 1000000007;
int mul = 1;
dp[s.length()][0] = 1;
for (int i = s.length() - 1; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
const int n = 13;
vector<vector<ll>> dp(100001, vector<ll>(n));
ll mod = 1000000007;
int mul = 1;
dp[s.length()][0] = 1;
for (int i = s.length() - 1; ... | [
"assignment.add"
] | 769,385 | 769,386 | u915797797 | cpp |
p02960 | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
char s[100005];
int dp[100005][13];
int main() {
int n;
cin >> s;
n = strlen(s);
dp[0][0] = 1;
rep(i, n) {
int c;
if (s[i] == '?... | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
char s[100005];
ll dp[100005][13];
int main() {
int n;
cin >> s;
n = strlen(s);
dp[0][0] = 1;
rep(i, n) {
int c;
if (s[i] == '?'... | [
"variable_declaration.type.change"
] | 769,399 | 769,400 | u554988565 | cpp |
p02960 | #include <algorithm>
#include <cstring>
#include <stdio.h>
using namespace std;
static const int mo = 1e9 + 7, sz = 1e5 + 6;
int n;
char s[sz];
int dp[sz][13];
main() {
scanf("%s", s);
n = strlen(s);
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
int c;
if (s[i] == '?')
c = -1;
else
c = (i... | #include <algorithm>
#include <cstring>
#include <stdio.h>
using namespace std;
static const int mo = 1e9 + 7, sz = 1e5 + 6;
int n;
char s[sz];
long long dp[sz][13];
main() {
scanf("%s", s);
n = strlen(s);
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
int c;
if (s[i] == '?')
c = -1;
else
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,406 | 769,407 | u468811760 | cpp |
p02960 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep... | [
"assignment.add"
] | 769,410 | 769,411 | u786944534 | cpp |
p02960 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | [
"variable_declaration.type.change"
] | 769,418 | 769,419 | u493750228 | cpp |
p02960 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007
using namespace... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007
using namespace... | [
"variable_declaration.type.change"
] | 769,420 | 769,421 | u493750228 | cpp |
p02960 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int le = (int)(S.length());
reverse(S.begin(), S.end());
long long mod = 1000000007;
long long dp[le][13];
long long modi[le];
modi[0] = 1;
for (int i = 1; i < le; i++)
modi[i] = (mod... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int le = (int)(S.length());
reverse(S.begin(), S.end());
long long mod = 1000000007;
long long dp[le][13];
long long modi[le];
modi[0] = 1;
for (int i = 1; i < le; i++)
modi[i] = (mod... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 769,424 | 769,425 | u014847113 | cpp |
p02960 | #include <algorithm>
#include <array>
#include <assert.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 769,432 | 769,433 | u651764969 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<vector<int>> dp(s.size() + 1, vector<int>(13));
dp.at(0).at(0) = 1;
for (int i = 0; i < s.size(); i++) {
int c;
if (s.at(i) == '?') {
c = -1;
} else {
c = s.at(i) - '0';
}
for (int j = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<vector<long long>> dp(s.size() + 1, vector<long long>(13));
dp.at(0).at(0) = 1;
for (int i = 0; i < s.size(); i++) {
int c;
if (s.at(i) == '?') {
c = -1;
} else {
c = s.at(i) - '0';
}
for... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,454 | 769,455 | u752904037 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int(1e9) + int(1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int(1e9) + int(1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 + ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 769,458 | 769,459 | u427756349 | cpp |
p02960 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 100000000... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 100000000... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 769,462 | 769,463 | u991664217 | cpp |
p02960 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long long MOD = 1e9 + 7;
string s;
long long d[100000][13];
int main() {
cin >> s;
int l = s.size();
reverse(s.begin(), s.end());
if (s[0] == '?') {
for (int i = 0; i < 13; i++)
d[0][i] = 1;
} else {
for (int i = ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long long MOD = 1e9 + 7;
string s;
long long d[100000][13];
int main() {
cin >> s;
int l = s.size();
reverse(s.begin(), s.end());
if (s[0] == '?') {
for (int i = 0; i < 10; i++)
d[0][i] = 1;
} else {
for (int i = ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 769,464 | 769,465 | u705230587 | cpp |
p02960 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
int main() {
string S;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
int main() {
string S;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 769,468 | 769,469 | u048791623 | cpp |
p02960 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | [
"literal.number.change",
"assignment.value.change"
] | 769,515 | 769,516 | u117734686 | cpp |
p02960 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | [
"assignment.add"
] | 769,517 | 769,516 | u117734686 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
vector<vector<ll>> dp(
100001,
vector<ll>(
13,
0)); //先頭i文字で考えられる、13で割った時の余りがjであるようなものの個数
vector<vector<ll>> Num(7, vec... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
vector<vector<ll>> dp(
100001,
vector<ll>(
13,
0)); //先頭i文字で考えられる、13で割った時の余りがjであるようなものの個数
vector<vector<ll>> Num(7, vec... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change",
"assignment.value.change"
] | 769,522 | 769,523 | u050138914 | cpp |
p02960 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,526 | 769,527 | u528720841 | cpp |
p02960 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unorde... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unorde... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,535 | 769,536 | u212345309 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [
"assignment.change"
] | 769,543 | 769,544 | u330661451 | cpp |
p02960 | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll... | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 769,545 | 769,546 | u100869561 | cpp |
p02960 | #include <cstdint>
#include <cstdio>
#include <cstring>
static const unsigned long long MOD = 1000000007LL;
int n;
char s[100005];
uint64_t dp[100005][13];
int main() {
int i, j, ki;
uint64_t res = 0;
scanf("%s", s);
n = strlen(s);
dp[0][0] = 1;
for (i = 0; i < n; i++) {
int c;
if (s[i] == '?')... | #include <cstdint>
#include <cstdio>
#include <cstring>
static const unsigned long long MOD = 1000000007LL;
int n;
char s[100005];
uint64_t dp[100005][13];
int main() {
int i, j, ki;
uint64_t res = 0;
scanf("%s", s);
n = strlen(s);
dp[0][0] = 1;
for (i = 0; i < n; i++) {
int c;
if (s[i] == '?')... | [
"assignment.value.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,551 | 769,552 | u675757825 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define mod (1000000007)
main() {
int n;
string s;
cin >> s;
n = s.size();
vector<vector<int>> dp(n, vector<int>(13, 0));
if (s[0] == '?')
for (int i = 0; i < 10; ++i)
dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
for (int i = 1; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define mod (1000000007)
#define int long
main() {
int n;
string s;
cin >> s;
n = s.size();
vector<vector<int>> dp(n, vector<int>(13, 0));
if (s[0] == '?')
for (int i = 0; i < 10; ++i)
dp[0][i] = 1;
else
dp[0][s[0] - '0'] = 1;
for (int i = 1; i... | [] | 769,569 | 769,570 | u756659922 | cpp |
p02960 | #include <stdio.h>
#define mod 1000000007
#define large 100050
int main() {
char s[large];
scanf("%s", &s);
int dp[large][13] = {};
int length = 0;
for (int i = 0;; i++) {
if (s[i] == '\0') {
length = i;
break;
}
}
for (int i = 0; i < length; i++) {
if (i == 0) {
if (s[i] =... | #include <stdio.h>
#define mod 1000000007
#define large 100050
int main() {
char s[large];
scanf("%s", &s);
int dp[large][13] = {};
int length = 0;
for (int i = 0;; i++) {
if (s[i] == '\0') {
length = i;
break;
}
}
for (int i = 0; i < length; i++) {
if (i == 0) {
if (s[i] =... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 769,571 | 769,572 | u691912637 | cpp |
p02960 | #include <stdio.h>
#define mod 1000000007
#define large 50 // 100050
int main() {
char s[large];
scanf("%s", &s);
int dp[large][13] = {};
int length = 0;
for (int i = 0;; i++) {
if (s[i] == '\0') {
length = i;
break;
}
}
for (int i = 0; i < length; i++) {
if (i == 0) {
if (... | #include <stdio.h>
#define mod 1000000007
#define large 100050
int main() {
char s[large];
scanf("%s", &s);
int dp[large][13] = {};
int length = 0;
for (int i = 0;; i++) {
if (s[i] == '\0') {
length = i;
break;
}
}
for (int i = 0; i < length; i++) {
if (i == 0) {
if (s[i] =... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 769,573 | 769,572 | u691912637 | cpp |
p02960 | #include <stdio.h>
#define mod 1000000007
#define large 100050
int main() {
char s[large];
scanf("%s", &s);
int dp[large][13] = {};
int length = 0;
for (int i = 0;; i++) {
if (s[i] == '\0') {
length = i;
break;
}
}
for (int i = 0; i < length; i++) {
if (i == 0) {
if (s[i] =... | #include <stdio.h>
#define mod 1000000007
#define large 100050
int main() {
char s[large];
scanf("%s", &s);
int dp[large][13] = {};
int length = 0;
for (int i = 0;; i++) {
if (s[i] == '\0') {
length = i;
break;
}
}
for (int i = 0; i < length; i++) {
if (i == 0) {
if (s[i] =... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 769,574 | 769,572 | u691912637 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
int N = (int)S.size();
vector<vector<int>> dp(N, vector<int>(13, 0));
if (N == 1) {
if (S[0] == '5' || S[0] == '?') {
cout << 1 << endl;
} else {
cout << 0 << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
int N = (int)S.size();
vector<vector<int>> dp(N, vector<int>(13, 0));
if (N == 1) {
if (S[0] == '5' || S[0] == '?') {
cout << 1 << endl;
} else {
cout << 0 << ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 769,579 | 769,580 | u904123392 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll dp[100100][13];
// dp[i][j]
int main() {
string S;
cin >> S;
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (ll i = 0; i < (ll)S.size(); i++) {
char c = S[i];
if (c == '?') {
for (int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll dp[100100][13];
// dp[i][j]
int main() {
string S;
cin >> S;
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (ll i = 0; i < (ll)S.size(); i++) {
char c = S[i];
if (c == '?') {
for (int j = 0; j <... | [
"assignment.change"
] | 769,581 | 769,582 | u904123392 | cpp |
p02960 | #include <algorithm> //sort()
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) ... | #include <algorithm> //sort()
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) ... | [] | 769,589 | 769,590 | u561976793 | cpp |
p02960 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [] | 769,601 | 769,602 | u918357423 | cpp |
p02960 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> he... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> he... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 769,611 | 769,612 | u576106056 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
const ll mod = 1e9 + 7;
ll dp[101010][13];
int main() {
string s;
cin >> s;
ll a = 0;
string tmp = s;
reverse(tmp.begin(), tmp.end... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
const ll mod = 1e9 + 7;
ll dp[101010][13];
int main() {
string s;
cin >> s;
ll a = 0;
string tmp = s;
reverse(tmp.begin(), tmp.end... | [
"control_flow.loop.for.condition.change"
] | 769,617 | 769,618 | u482544950 | cpp |
p02960 | #include <iostream>
#include <string>
//#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
// s=string(100000,'?');
int n = 13;
long mod = 1000 * 1000 * 1000 + 7;
long *dp = new long[n]();
dp[0] = 1;
int cal[n][10];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10;... | #include <iostream>
#include <string>
//#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
// s=string(100000,'?');
int n = 13;
long mod = 1000 * 1000 * 1000 + 7;
long *dp = new long[n]();
dp[0] = 1;
int cal[n][10];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 10;... | [
"assignment.add"
] | 769,621 | 769,622 | u664373116 | cpp |
p02960 | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const long lo... | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const long lo... | [
"variable_declaration.specifier.add"
] | 769,625 | 769,626 | u067267922 | cpp |
p02960 | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const long lo... | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const long lo... | [
"function.return_type.change",
"variable_declaration.specifier.add"
] | 769,627 | 769,626 | u067267922 | cpp |
p02960 | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD... | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const long lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"function.return_type.change",
"variable_declaration.specifier.add"
] | 769,628 | 769,626 | u067267922 | cpp |
p02960 | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD... | #include <bits/stdc++.h>
//#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const long lo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"function.return_type.change",
"variable_declaration.specifier.add"
] | 769,629 | 769,626 | u067267922 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
ll n = s.size();
vector<vector<ll>> dp(n,
vector<ll>(13, 0)); // dp[i][j] 前からi+1桁目までにnum =
// j(mod13)となる数字がいくつあるか
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
ll n = s.size();
vector<vector<ll>> dp(n,
vector<ll>(13, 0)); // dp[i][j] 前からi+1桁目までにnum =
// j(mod13)となる数字がいくつあるか
... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 769,636 | 769,637 | u280114218 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
#define ll long long
const ll md = 1e9 + 7;
ll dp[N][15];
string s;
int n;
ll solve(int idx, int val) {
ll &ret = dp[idx][val];
if (ret >= 0)
return ret;
ret = 0;
if (idx == n) {
ret = (val == 5);
}
if (s[idx] == '?') {
int tmp... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
#define ll long long
const ll md = 1e9 + 7;
ll dp[N][15];
string s;
int n;
ll solve(int idx, int val) {
ll &ret = dp[idx][val];
if (ret >= 0)
return ret;
ret = 0;
if (idx == n) {
ret = (val == 5);
return ret;
}
if (s[idx] == '?... | [
"control_flow.return.add"
] | 769,641 | 769,642 | u699101754 | cpp |
p02960 | //
// 2019/03/30 Ver1.10
//
// Codeforces: ganariya
// AtCoder: ganariya2525
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMM... | //
// 2019/03/30 Ver1.10
//
// Codeforces: ganariya
// AtCoder: ganariya2525
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
// MMMMMMMMMMMMMMMMMMMMMMMMMM... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,653 | 769,654 | u259053514 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7;
string s;
long long n;
vector<long long> dp(13);
int main() {
cin >> s;
dp[0] = 1;
for (int i = 0; i < s.size(); i++) {
vector<long long> d_n(13);
for (int j = 0; j <= 9; j++) {
if (s[i] == '?' || s[i] - '0' == j) {
... | #include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7;
string s;
long long n;
vector<long long> dp(13);
int main() {
cin >> s;
dp[0] = 1;
for (int i = 0; i < s.size(); i++) {
vector<long long> d_n(13);
for (int j = 0; j <= 9; j++) {
if (s[i] == '?' || s[i] - '0' == j) {
... | [
"expression.operation.binary.add"
] | 769,657 | 769,658 | u201808715 | cpp |
p02960 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
ll R_list[100000][10];
int MOD = 1000000007;
void print_array(ll *arr, int n) {
for (int i = 0; i < n; i++) {
cout << arr[i] << ' ';
}
cout << endl;
}
int main() {
string S;
// vecto... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
ll R_list[100000][10];
int MOD = 1000000007;
void print_array(ll *arr, int n) {
for (int i = 0; i < n; i++) {
cout << arr[i] << ' ';
}
cout << endl;
}
int main() {
string S;
// vecto... | [
"assignment.change"
] | 769,659 | 769,660 | u033407970 | cpp |
p02960 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define FORN(i, m, n) for (int i = m; i < (n); i++)
#define PRINT... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define FORN(i, m, n) for (int i = m; i < (n); i++)
#define PRINT... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 769,694 | 769,695 | u585776323 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fo(i, a, b, k) for (int i = a; i <= b; i += k)
#define _fo(i, a, b, k) for (int i = a; i >= b; i -= k)
#define foa(i, ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fo(i, a, b, k) for (int i = a; i <= b; i += k)
#define _fo(i, a, b, k) for (int i = a; i >= b; i -= k)
#define foa(i, ... | [
"variable_declaration.value.change"
] | 769,696 | 769,697 | u183131551 | cpp |
p02960 | #include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define pri 1000000007
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
ll ass[13] = {0};
ll dp[13][13][100001];
ll findo(ll cur, ll pre, ll prec) {
ll ans = 0;
if (pre == 13)
return ... | #include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define pri 1000000007
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
ll ass[13] = {0};
ll dp[13][13][100001];
ll findo(ll cur, ll pre, ll prec) {
ll ans = 0;
if (pre == 13)
return ... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 769,701 | 769,702 | u874786170 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
te... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
te... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,703 | 769,704 | u920299620 | cpp |
p02960 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
string S;
cin >> S;
vector<long long> count(13, 0LL);
count[0] = 1LL;
for (auto c : S) {
vector<long long> nextgen(13, 0LL);
for (int digit = 0; digit < 10; digit++) {
if (c == '... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
string S;
cin >> S;
vector<long long> count(13, 0LL);
count[0] = 1LL;
for (auto c : S) {
vector<long long> nextgen(13, 0LL);
for (int digit = 0; digit < 10; digit++) {
if (c == '... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 769,705 | 769,706 | u489359960 | cpp |
p02960 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | [
"assignment.value.change",
"identifier.change"
] | 769,709 | 769,710 | u112723190 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
const long long r = 1e9 + 7;
long long d[100001][13];
int main() {
string str;
cin >> str;
str += '!';
reverse(str.begin(), str.end());
d[0][0] = 1;
long long p = 1;
for (int i = 1; i < str.length(); ++i) {
if (str[i] != '?')
for (int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
const long long r = 1e9 + 7;
long long d[100001][13];
int main() {
string str;
cin >> str;
str += '!';
reverse(str.begin(), str.end());
d[0][0] = 1;
long long p = 1;
for (int i = 1; i < str.length(); ++i) {
if (str[i] != '?')
for (int j = 0; j <... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 769,713 | 769,714 | u833150144 | cpp |
p02960 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r"... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r"... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 769,715 | 769,716 | u345794450 | cpp |
p02960 | #include <algorithm>
#include <iostream>
using namespace std;
#define MOD 1000000007
int md[100000], dp[100000][13];
int cnt = 0, idx, idx2;
int main() {
string s, x;
cin >> s;
//前処理
md[0] = 1; //[0]は1桁目
for (int i = 1; i < s.size(); i++) {
md[i] = (md[i - 1] * 10) % 13;
}
//
if (s[0] == '?') {
... | #include <algorithm>
#include <iostream>
using namespace std;
#define MOD 1000000007
#define int long
int md[100000], dp[100000][13];
int cnt = 0, idx, idx2;
signed main() {
string s, x;
cin >> s;
//前処理
md[0] = 1; //[0]は1桁目
for (int i = 1; i < s.size(); i++) {
md[i] = (md[i - 1] * 10) % 13;
}
//
if ... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 769,730 | 769,731 | u610385881 | cpp |
p02960 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 769,738 | 769,739 | u938924220 | cpp |
p02960 | #include <cstring>
#include <iostream>
using namespace std;
int a[] = {1, 10, 9, 12, 3, 4}, mod = 1e9 + 7, pw[100000];
long long dp[100000][13];
string s;
int sol(int p, int md) {
if (p == s.size() && md == 5)
return 1;
if (p == s.size())
return 0;
if (dp[p][md] != -1)
return dp[p][md];
long long ... | #include <cstring>
#include <iostream>
using namespace std;
int a[] = {1, 10, 9, 12, 3, 4}, mod = 1e9 + 7, pw[100000];
long long dp[100000][13];
string s;
int sol(int p, int md) {
if (p == s.size() && md == 5)
return 1;
if (p == s.size())
return 0;
if (dp[p][md] != -1)
return dp[p][md];
long long ... | [] | 769,746 | 769,747 | u032723841 | cpp |
p02960 | #include <cstring>
#include <iostream>
using namespace std;
int a[] = {1, 10, 9, 12, 3, 4}, mod = 1e9 + 7, pw[100000];
long long dp[100000][13];
string s;
int sol(int p, int md) {
if (p == s.size() && md == 5)
return 1;
if (p == s.size())
return 0;
if (dp[p][md] != -1)
return dp[p][md];
long long ... | #include <cstring>
#include <iostream>
using namespace std;
int a[] = {1, 10, 9, 12, 3, 4}, mod = 1e9 + 7, pw[100000];
long long dp[100000][13];
string s;
int sol(int p, int md) {
if (p == s.size() && md == 5)
return 1;
if (p == s.size())
return 0;
if (dp[p][md] != -1)
return dp[p][md];
long long ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 769,748 | 769,747 | u032723841 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int INF = 100100100;
int main() {
// ll N; cin >> N;
// ll N,M; cin >> N >> M;
string S;
cin >> S;
// ll H,W; cin >> H >> W;
int N;
N = S.length();
int nu[N][13];
for (int i = 0; i < 13; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int INF = 100100100;
int main() {
// ll N; cin >> N;
// ll N,M; cin >> N >> M;
string S;
cin >> S;
// ll H,W; cin >> H >> W;
int N;
N = S.length();
int nu[N][13];
for (int i = 0; i < 13; i++) {
for ... | [
"expression.operation.binary.add"
] | 769,749 | 769,750 | u593555034 | cpp |
p02960 | // dp[i][k] i位mod13=k 的
#include <cstdio>
#include <cstring>
using namespace std;
const int mod = 1e9 + 7;
#define N 100003
char s[N];
int dp[N][13];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int bit = 1;
if (s[n] == '?')
for (int i = 0; i < 13; ++i)
dp[n][i] = 1;
else
dp[n][s... | // dp[i][k] i位mod13=k 的
#include <cstdio>
#include <cstring>
using namespace std;
const int mod = 1e9 + 7;
#define N 100003
char s[N];
int dp[N][13];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
int bit = 1;
if (s[n] == '?')
for (int i = 0; i < 10; ++i)
dp[n][i] = 1;
else
dp[n][s... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 769,753 | 769,754 | u014095165 | cpp |
p02960 | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 769,755 | 769,756 | u320491590 | cpp |
p02960 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
ll MOD = 1000000007;
int main() {... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using lst = list<ll>;
ll MOD = 1000000007;
int main() {... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,763 | 769,764 | u765606693 | cpp |
p02960 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define mod (ll... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define mod (ll... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 769,765 | 769,766 | u504098542 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll MOD = 1e9 + 7;
vector<vector<ll>> adj(100005);
ll mem[100005][30];
string s;
ll solve(ll cur, ll rem) {
if (cur == s.size()) {
if (rem == 5) {
return 1;
}
return 0;
}
if (mem[cur][rem] != -1) {
return mem[cur][rem];
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll MOD = 1e9 + 7;
vector<vector<ll>> adj(100005);
ll mem[100005][30];
string s;
ll solve(ll cur, ll rem) {
if (cur == s.size()) {
if (rem == 5) {
return 1;
}
return 0;
}
if (mem[cur][rem] != -1) {
return mem[cur][rem];
}
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 769,771 | 769,772 | u288989709 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ostream ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ostream ... | [
"variable_declaration.value.change"
] | 769,773 | 769,774 | u696805736 | cpp |
p02960 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
ll mod = 1e9 + 7;
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % 13;
x = x * x % 13;
n >>= 1;
}
return res;
}
int main() {
string s;
cin... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
ll mod = 1e9 + 7;
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % 13;
x = x * x % 13;
n >>= 1;
}
return res;
}
int main() {
string s;
cin... | [
"literal.number.change",
"variable_declaration.value.change"
] | 769,775 | 769,776 | u201316840 | cpp |
p02960 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | [
"assignment.change"
] | 769,779 | 769,780 | u957084285 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
cnt += a[i];
cnt += m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
cnt += a[i];
cn... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,785 | 769,786 | u906572139 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N, A[100001], B, a;
int sum = 0;
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= N; i++) {
cin >> B;
a = A[i - 1] - B;
if (a < 0) {
sum += A[i - 1];
A[i] -= a * -1;
if (A[i] > 0)
sum ... | #include <iostream>
using namespace std;
int main() {
int N, A[100001], B, a;
long long sum = 0L;
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 1; i <= N; i++) {
cin >> B;
a = A[i - 1] - B;
if (a < 0) {
sum += A[i - 1];
A[i] -= a * -1;
if (A[i] > 0)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 769,791 | 769,792 | u275488634 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n + 1];
long long int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += min(a[i], b[i]);
b[i] ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n + 1];
long long int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long int sum = 0;
for (int i = 0; i < n; i++) {
sum += min(a[i], b[i]);... | [
"variable_declaration.type.widen.change"
] | 769,796 | 769,797 | u130367513 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int A = a.at(i);
int B = a.at(i + 1);
int C = b.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int &A = a.at(i);
int &B = a.at(i + 1);
int &C = b... | [] | 769,798 | 769,799 | u422633119 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
unsigned long long c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int A = a.at(i);
int B = a.at(i + 1);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int &A = a.at(i);
int &B = a.at(i + 1);
int &C = b... | [] | 769,800 | 769,799 | u422633119 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int A = a.at(i);
int B = a.at(i + 1);
int C =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int &A = a.at(i);
int &B = a.at(i + 1);
int &C = b... | [
"variable_declaration.type.narrow.change"
] | 769,801 | 769,799 | u422633119 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int A = a.at(i);
int B = a.at(i + 1);
int C = b.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long c = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
int &A = a.at(i);
int &B = a.at(i + 1);
int &C = b... | [
"variable_declaration.type.widen.change"
] | 769,802 | 769,799 | u422633119 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void solve(int N, vector<int> A, vector<int> B) {
int cnt = 0;
for (int i = 0; i < N; i++) {
int x = min(A[i], B[i]);
cnt += x;
int y = min(A[i + 1], B[i] - x);
cnt += y;
A[i + 1] -= y;
}
printf("%d\n", cnt);
}... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void solve(int N, vector<int> A, vector<int> B) {
long long cnt = 0;
for (int i = 0; i < N; i++) {
int x = min(A[i], B[i]);
cnt += x;
int y = min(A[i + 1], B[i] - x);
cnt += y;
A[i + 1] -= y;
}
printf("%lld\n",... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 769,803 | 769,804 | u910756197 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >>... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define MAX 1000000007
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >>... | [
"variable_declaration.type.change"
] | 769,805 | 769,806 | u582848517 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100000];
long mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100000];
long mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"variable_declaration.type.narrow.change"
] | 769,824 | 769,825 | u583628727 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100000];
long mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100000];
long mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 769,826 | 769,825 | u583628727 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100000];
long mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100000];
long mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 769,827 | 769,825 | u583628727 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int ma[100000];
int mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.at(0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long ma[100000];
long mb[100000];
if (A.at(0) + A.at(1) < B.at(0)) {
ma[0] = A.... | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 769,828 | 769,825 | u583628727 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long... | [
"call.add",
"call.arguments.add"
] | 769,829 | 769,830 | u061912210 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
int C[N],
D[N]; // C[i]はiにいる残りモンスター,D[i]は勇者が倒せる残りモンスター数
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
int C[N],
D[N]; // C[i]はiにいる残りモンスター,D[i]は勇者が倒せる残りモンスター数
long long ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i+... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 769,833 | 769,834 | u057617112 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using namespace std;
int main() {
int a;
cin >> a;
vector<int> enemy(a + 1);
rep(i, a + 1) cin >> enemy.at(i);
vector<int> hero(a);
rep(i, a) cin >> hero.at(i);
int ans = 0;
rep(i, a) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using namespace std;
int main() {
int a;
cin >> a;
vector<int> enemy(a + 1);
rep(i, a + 1) cin >> enemy.at(i);
vector<int> hero(a);
rep(i, a) cin >> hero.at(i);
int64_t ans = 0;
rep(i, ... | [
"variable_declaration.type.primitive.change"
] | 769,835 | 769,836 | u165267345 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using namespace std;
int main() {
int a;
cin >> a;
vector<int> enemy(a + 1);
rep(i, a + 1) cin >> enemy.at(i);
vector<int> hero(a);
rep(i, a) cin >> hero.at(i);
int ans = 0;
rep(i, a) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using namespace std;
int main() {
int a;
cin >> a;
vector<int> enemy(a + 1);
rep(i, a + 1) cin >> enemy.at(i);
vector<int> hero(a);
rep(i, a) cin >> hero.at(i);
int64_t ans = 0;
rep(i, ... | [
"variable_declaration.type.primitive.change"
] | 769,837 | 769,838 | u165267345 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int retval = 0;
for (int i =... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
long long int retval ... | [
"variable_declaration.type.widen.change"
] | 769,843 | 769,842 | u781317830 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int retval = 0;
for (int i =... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
long long int retval ... | [
"variable_declaration.type.widen.change"
] | 769,844 | 769,842 | u781317830 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int retval = 0;
fo... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
long long int retval ... | [
"variable_declaration.type.widen.change"
] | 769,841 | 769,845 | u781317830 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int retval = 0;
for (int i =... | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int *m;
m = new long long int[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
long long int *y;
y = new long long int[n];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
long long int retval ... | [
"variable_declaration.type.widen.change"
] | 769,843 | 769,845 | u781317830 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.