problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03011 | Python | Runtime Error | p, q, r = map(int, input().split())
sorted_list = sorted(list[p, q, r])
ans = sorted_list[0] + sorted_list[1]
print(ans)
| p, q, r = map(int, input().split())
sorted_list = sorted([p, q, r])
ans = sorted_list[0] + sorted_list[1]
print(ans)
| replace | 1 | 2 | 1 | 2 | TypeError: 'types.GenericAlias' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s382927375.py", line 2, in <module>
sorted_list = sorted(list[p, q, r])
TypeError: 'types.GenericAlias' object is not iterable
|
p03011 | Python | Runtime Error | # coding: utf-8
p, q, r = [int(x) for x in input().rstrip().split(" ")]
s = []
s[0] = p + q
s[1] = q + r
s[2] = r + p
print(min(s))
| # coding: utf-8
p, q, r = [int(x) for x in input().rstrip().split(" ")]
s = [0, 0, 0]
s[0] = p + q
s[1] = q + r
s[2] = r + p
print(min(s))
| replace | 4 | 5 | 4 | 5 | IndexError: list assignment index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s517518252.py", line 6, in <module>
s[0] = p + q
IndexError: list assignment index out of range
|
p03011 | Python | Runtime Error | A = [int(input()) for i in range(3)]
ans = sum(A) - max(A)
print(ans)
| A = list(map(int, input().split()))
ans = sum(A) - max(A)
print(ans)
| replace | 0 | 2 | 0 | 1 | ValueError: invalid literal for int() with base 10: '1 3 4' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s647136581.py", line 1, in <module>
A = [int(input()) for i in range(3)]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s647136581.py", line 1, in <listcomp>
... |
p03011 | Python | Runtime Error | p = list(map(int, input().split()))
print(p[0] + p[1] + [2] - max(p))
| p = list(map(int, input().split()))
print(p[0] + p[1] + p[2] - max(p))
| replace | 1 | 2 | 1 | 2 | TypeError: unsupported operand type(s) for +: 'int' and 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s411748384.py", line 2, in <module>
print(p[0] + p[1] + [2] - max(p))
TypeError: unsupported operand type(s) for +: 'int' and 'list'
|
p03011 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
vector<int> a(2);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
cout << a.at(0) + a.at(1) << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
cout << a.at(0) + a.at(1) << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03011 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define sz size
#define f first
#define s second
int main() {
freopen(... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define sz size
#define f first
#define s second
int main() {
// freop... | replace | 16 | 18 | 16 | 18 | 0 | |
p03011 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r;
while (true) {
cin >> p >> q >> r;
cout << p + q + r - max({p, q, r}) << endl;
}
}
| #include <algorithm>
#include <assert.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max({p, q, r}) << endl;
}
| replace | 8 | 12 | 8 | 10 | TLE | |
p03011 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int P, Q, R;
int min;
while (scanf("%d %d %d", &P, &Q, &R)) {
min = P + Q;
if (P + R < min)
min = P + R;
if (Q + R < min)
min = Q + R;
printf("%d\n", min);
}
return 0;
} | #include <stdio.h>
int main() {
int P, Q, R, min, i;
for (i = 0; i < 100; i++) {
if (scanf("%d %d %d", &P, &Q, &R) != 3)
break;
min = P + Q;
if (P + R < min)
min = P + R;
if (Q + R < min)
min = Q + R;
printf("%d\n", min);
}
return 0;
} | replace | 3 | 6 | 3 | 7 | TLE | |
p03011 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (i = 0; i < n; ++i)
#define REP(i, k, n) for (i = k; i < n; ++i)
#define REPR(i, k, n) for (i = k; i >= n; --i)
#define WATCH(x) cout << (#x) << " is " << (x) << endl
#define PB push_back
#define N 300101
#define SZ 3001
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (i = 0; i < n; ++i)
#define REP(i, k, n) for (i = k; i < n; ++i)
#define REPR(i, k, n) for (i = k; i >= n; --i)
#define WATCH(x) cout << (#x) << " is " << (x) << endl
#define PB push_back
#define N 300101
#define SZ 3001
#de... | delete | 34 | 40 | 34 | 34 | 0 | |
p03011 | C++ | Runtime Error | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;... | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;... | replace | 66 | 68 | 66 | 68 | 0 | |
p03011 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int p, q, r, a;
cin >> p >> q >> r;
a = min(p + q, q + r);
a = min(a, p + r);
cout << a << endl;
return 1;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int p, q, r, a;
cin >> p >> q >> r;
a = min(p + q, q + r);
a = min(a, p + r);
cout << a << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 1 | |
p03011 | C++ | Runtime Error | // Created by code_sm
//
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> pseudo_set;
#define ll long long
#define vi vector<int>
#define si set<int>
#define... | // Created by code_sm
//
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> pseudo_set;
#define ll long long
#define vi vector<int>
#define si set<int>
#define... | replace | 50 | 54 | 50 | 51 | 0 | |
p03011 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> fl;
for (int i = 0; i < 3; i++) {
cin >> fl.at(i);
}
sort(fl.begin(), fl.end());
cout << fl.at(0) + fl.at(1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> fl(3);
for (int i = 0; i < 3; i++) {
cin >> fl.at(i);
}
sort(fl.begin(), fl.end());
cout << fl.at(0) + fl.at(1) << endl;
} | replace | 3 | 4 | 3 | 4 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03011 | C++ | Runtime Error | // https://atcoder.jp/contests/abc129/tasks/abc129_a
#include <bits/stdc++.h>
#define debugi(x) cerr << "x -> " << x << endl;
#define For(i, n) for (__typeof(i) i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define _ \
ios_base::sync_with_std... | // https://atcoder.jp/contests/abc129/tasks/abc129_a
#include <bits/stdc++.h>
#define debugi(x) cerr << "x -> " << x << endl;
#define For(i, n) for (__typeof(i) i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define _ \
ios_base::sync_with_std... | replace | 23 | 27 | 23 | 27 | 0 | |
p03012 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s... | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s... | replace | 26 | 27 | 26 | 27 | TLE | |
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n, 0), s(n, 0);
for (int i = 1; i < n + 1; ++i) {
cin >> w[i];
s[i] = s[i - 1] + w[i];
}
int mn = 1e9;
for (int i = 1; i < n; ++i) {
mn = min(mn, abs(s[n] - 2 * s[i]));
}
cout << mn << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n + 1, 0), s(n + 1, 0);
for (int i = 1; i < n + 1; ++i) {
cin >> w[i];
s[i] = s[i - 1] + w[i];
}
int mn = 1e9;
for (int i = 1; i < n; ++i) {
mn = min(mn, abs(s[n] - 2 * s[i]));
}
cout << mn << endl;
... | replace | 5 | 6 | 5 | 6 | 0 | |
p03012 | C++ | Runtime Error |
#include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <io... |
#include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <io... | replace | 50 | 51 | 50 | 51 | 0 | |
p03012 | C++ | Runtime Error | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | replace | 97 | 98 | 97 | 98 | 0 | |
p03012 | C++ | Runtime Error |
#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()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<int> acc... |
#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()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<int> acc... | replace | 24 | 25 | 24 | 25 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 1; i <= N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) {... | replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p03012 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | replace | 43 | 44 | 43 | 44 | 0 | |
p03012 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int absolute(int a);
int main() {
int N, i, ans = 10010;
cin >> N;
vector<int> W(N), sum(N);
for (i = 0; i < N; i++)
cin >> W[i];
sum[0] = W[0];
for (i = 0; i < N; i++)
sum[i + 1] = sum[i] + W[i + 1];
for (i = 0; i < N; i++) {
if (ans ... | #include <iostream>
#include <vector>
using namespace std;
int absolute(int a);
int main() {
int N, i, ans = 10010;
cin >> N;
vector<int> W(N), sum(N);
for (i = 0; i < N; i++)
cin >> W[i];
sum[0] = W[0];
for (i = 0; i < N - 1; i++)
sum[i + 1] = sum[i] + W[i + 1];
for (i = 0; i < N; i++) {
if (... | replace | 11 | 12 | 11 | 12 | 0 | |
p03012 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
vector<int> ts;
ts.push_back(0);
int w;
for (int i = 1; i <= N; ++i) {
cin >> w;
ts[i] = ts[i ... | #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
vector<int> ts(N + 1);
ts[0] = 0;
int w;
for (int i = 1; i <= N; ++i) {
cin >> w;
ts[i] = ts[i... | replace | 15 | 17 | 15 | 17 | 0 | |
p03012 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
int now, n, k;
int main() {
int ans = 999999999;
cin >> n;
vector<int> a(n), csum(n + 1, 0);
REP(i, n) cin >> a[i];
REP(i, n + 1) csum[i + 1] = csum[i] + a[i];
REP(i, n -... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
int now, n, k;
int main() {
int ans = 999999999;
cin >> n;
vector<int> a(n), csum(n + 1, 0);
REP(i, n) cin >> a[i];
REP(i, n) csum[i + 1] = csum[i] + a[i];
REP(i, n - 1) ... | replace | 13 | 14 | 13 | 14 | 0 | |
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MODNum 1000000007
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
int N, ans;
scanf("%d", &N);
vector<int> W(N);
int Sum = 0;
REP(int, i, 0, N) {
scanf("%lld", &W.at(i));
Sum += W.at(i);
}
ans = ... | #include <bits/stdc++.h>
#define MODNum 1000000007
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
int N, ans;
scanf("%d", &N);
vector<int> W(N);
int Sum = 0;
REP(int, i, 0, N) {
scanf("%d", &W.at(i));
Sum += W.at(i);
}
ans = IN... | replace | 13 | 14 | 13 | 14 | 0 | |
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, sum = 0, keep = 0, a, b;
cin >> n;
vector<int> w(n), x(n - 1);
for (i = 0; i < n; i++) {
cin >> w.at(i);
sum += w.at(i);
}
for (i = 0; i < n; i++) {
keep += w.at(i);
x.at(i) = abs(sum - 2 * keep);
}
sort(x.begin(), ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, sum = 0, keep = 0, a, b;
cin >> n;
vector<int> w(n), x(n);
for (i = 0; i < n; i++) {
cin >> w.at(i);
sum += w.at(i);
}
for (i = 0; i < n; i++) {
keep += w.at(i);
x.at(i) = abs(sum - 2 * keep);
}
sort(x.begin(), x.en... | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03012 | Python | Runtime Error | N = input()
W = list(map(int, input().split()))
print(min([abs(sum(W[:i]) - sum(W[i:])) for i in range(N)]))
| N = int(input())
W = list(map(int, input().split()))
print(min([abs(sum(W[:i]) - sum(W[i:])) for i in range(N)]))
| replace | 0 | 1 | 0 | 1 | TypeError: 'str' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03012/Python/s648426101.py", line 3, in <module>
print(min([abs(sum(W[:i]) - sum(W[i:])) for i in range(N)]))
TypeError: 'str' object cannot be interpreted as an integer
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n, m, a;
cin >> n >> m;
vector<bool> br(m);
vector<ll> dp(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> a;
br[a] = true;
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if (i + 1 <= n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n, m, a;
cin >> n >> m;
vector<bool> br(n + 1, false);
vector<ll> dp(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> a;
br[a] = true;
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if ... | replace | 8 | 9 | 8 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | replace | 28 | 31 | 28 | 33 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
f... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
f... | replace | 20 | 21 | 20 | 21 | -11 | |
p03013 | C++ | Runtime Error | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return s... | replace | 116 | 117 | 116 | 117 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a;
int box;
int sum = 0;
int pre_1 = 1;
int pre_2 = 1;
int cnt = 0;
int i;
for (i = 0; i < m; i++) {
cin >> box;
a.push_back(box);
// cout << a[i] << endl;
}
for (i = ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a;
int box;
int sum = 0;
int pre_1 = 1;
int pre_2 = 1;
int cnt = 0;
int i;
if (m != 0) {
for (i = 0; i < m; i++) {
cin >> box;
a.push_back(box);
// cout << a[i] ... | replace | 20 | 24 | 20 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) ... | replace | 30 | 31 | 30 | 31 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> b(N + 1, true);
for (int i = 0; i < M + 1; i++) {
int a;
cin >> a;
b.at(a) = false;
}
vector<int> dp(N + 1, 0);
dp.at(0) = 1;
int mod = 1000000007;
if (b.at(1))
dp.at(1) = 1;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> b(N + 1, true);
for (int i = 0; i < M + 1; i++) {
int a;
cin >> a;
b.at(a) = false;
}
vector<int> dp(N + 1, 0);
dp.at(0) = 1;
int mod = 1000000007;
if (b.at(1))
dp.at(1) = 1;
for (int ... | replace | 21 | 22 | 21 | 23 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#de... | replace | 82 | 83 | 82 | 83 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
long long step[100010] = {};
// i段目までの数
step[0] = 1;
for (int i = 1; i <= N; i++) {
if (i == 1) {
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
long long step[100010] = {};
// i段目までの数
step[0] = 1;
for (int i = 1; i <= N; i++) {
if (i == 1) {
... | replace | 24 | 25 | 24 | 25 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1, false);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
broken[a] = true;
}
vector<long long> count(n + 1, 0LL);
count[0] = 1LL;
count[... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1, false);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
broken[a] = true;
}
vector<long long> count(n + 1, 0LL);
count[0] = 1LL;
count[... | replace | 18 | 19 | 18 | 19 | -11 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvw... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvw... | insert | 28 | 28 | 28 | 30 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#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)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int mod2 = 998244353;
int main() {
int n, m;
cin >> n >> m;
... | #include <bits/stdc++.h>
#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)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int mod2 = 998244353;
int main() {
int n, m;
cin >> n >> m;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | replace | 97 | 99 | 97 | 99 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
... | replace | 53 | 54 | 53 | 54 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (int(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (int(i) = 1; (i) < (n); ++(i))
#define rrep1(i, n) for (int(i) = (n)-1; (i) >= 1; --(i))
#define nfor(i, a, b) for (int(i) = (a); (i) < (b)... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (int(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (int(i) = 1; (i) < (n); ++(i))
#define rrep1(i, n) for (int(i) = (n)-1; (i) >= 1; --(i))
#define nfor(i, a, b) for (int(i) = (a); (i) < (b)... | replace | 31 | 32 | 31 | 32 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e+9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; ++i)
cin >> a[i];
sort(a.begin(), a.end());
vector<long long> dp(N + 1);
dp[0] = 1;
int idx;
if (a[0] == 1) ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e+9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; ++i)
cin >> a[i];
sort(a.begin(), a.end());
vector<long long> dp(N + 1);
dp[0] = 1;
int idx;
if (M > 0 and a... | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#include <iostream>
#include <vector>
using namespace std;
// 重複順列
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start,
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#include <iostream>
#include <vector>
using namespace std;
// 重複順列
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start,
... | replace | 32 | 33 | 32 | 33 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1e9 + 7;
dp[n] = 1;
for (int i = n - 1; i >=... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1e9 + 7;
dp[n] = 1;
for (int i = n - 1; i >=... | replace | 17 | 18 | 17 | 18 | -11 | |
p03013 | C++ | Runtime Error | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> a(M), dp(N + ... | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> a(M), dp(N + ... | replace | 26 | 27 | 26 | 27 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | replace | 91 | 94 | 91 | 97 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 46 | 47 | 46 | 47 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<bool> ban(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ban[a] = true;
}
vector<ll> dp(N + 1, 0);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<bool> ban(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ban[a] = true;
}
vector<ll> dp(N + 2, 0);
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
vector<ll> dp;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m, 0);
for (ll i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
vector<ll> dp;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m + 5, 0);
for (... | replace | 19 | 20 | 19 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long int
const LL MOD = pow(10, 9) + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; ++i)
cin >> a[i];
vector<int> dp(n + 1, 0);
dp[0] = 1;
dp[1] = 1;
int k = 0;
if (a[k] == 1) {
dp[1] = 0;
k++... | #include <bits/stdc++.h>
using namespace std;
#define LL long int
const LL MOD = pow(10, 9) + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; ++i)
cin >> a[i];
vector<int> dp(n + 1, 0);
dp[0] = 1;
dp[1] = 1;
int k = 0;
if (!a.empty() && a[k] == 1) {
dp[1... | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using... | replace | 43 | 44 | 43 | 44 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
ll sub(ll n) {
if (n <= 0) {
return -1;
} else {
vector<ll> list(n + 1);
rep(i, n + 1) {
if (i == 0) {
list.at(i) = 0;
} else if (i == 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
ll sub(ll n) {
if (n <= 0) {
return -1;
} else {
vector<ll> list(n + 1);
rep(i, n + 1) {
if (i == 0) {
list.at(i) = 0;
} else if (i == 1) {
... | replace | 47 | 48 | 47 | 52 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | replace | 25 | 26 | 25 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll mod = pow(10, 9) + 7;
ll n, m;
cin >> n >> m;
vector<ll> ng(m);
vector<ll> dp(n + 1);
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll mod = pow(10, 9) + 7;
ll n, m;
cin >> n >> m;
vector<ll> ng(m);
vector<ll> dp(n + 1);
... | replace | 47 | 51 | 47 | 53 | 0 | |
p03013 | C++ | Runtime Error | #include <cstdio>
int main() {
int n, m, a[10005], in;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
a[i] = -1;
for (int i = 1; i <= m; i++) {
scanf("%d", &in);
a[in] = 0;
}
if (a[1] != 0)
a[1] = 1;
if (a[2] != 0)
a[2] = 1 + a[1];
for (int i = 3; i <= n; i++)
if (a[i] == ... | #include <cstdio>
int main() {
int n, m, a[100005], in;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
a[i] = -1;
for (int i = 1; i <= m; i++) {
scanf("%d", &in);
a[in] = 0;
}
if (a[1] != 0)
a[1] = 1;
if (a[2] != 0)
a[2] = 1 + a[1];
for (int i = 3; i <= n; i++)
if (a[i] ==... | replace | 3 | 4 | 3 | 4 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | replace | 26 | 27 | 26 | 27 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read... | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read... | insert | 41 | 41 | 41 | 45 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1E9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n + 1, 0);
vector<int> flg(n, 0);
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
A[x] = 1;
}
flg[0] = 1;
for (int i = 1; i <= n; i++) {
if (!A[i])
flg[i]... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1E9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n + 1, 0);
vector<int> flg(n + 1, 0);
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
A[x] = 1;
}
flg[0] = 1;
for (int i = 1; i <= n; i++) {
if (!A[i])
fl... | replace | 9 | 10 | 9 | 10 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll INF = 1000000000000000;
ll mod = 1000000007;
ll i, j, k, l;
int main() {
ll n, m;
cin >> n >> m; // m個は壊れている
vector<ll> a(m), step(n + 1), dp(n + 1, 0);
// a:崩壊 step:階段の状態 dp:i段目に到達するまでの行き方
for (i = 0; i < m; i++) {
cin >> a[i];
}
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll INF = 1000000000000000;
ll mod = 1000000007;
ll i, j, k, l;
int main() {
ll n, m;
cin >> n >> m; // m個は壊れている
vector<ll> a(m), step(n + 1), dp(n + 1, 0);
// a:崩壊 step:階段の状態 dp:i段目に到達するまでの行き方
for (i = 0; i < m; i++) {
cin >> a[i];
}
... | replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
for (int i = 0; i < M; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<long long> d(N);
d[0] = 1;
for (int i = 0; i < N; i++) {
for (int j = i + 1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
for (int i = 0; i < M; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<long long> d(N + 1);
d[0] = 1;
for (int i = 0; i < N; i++) {
for (int j = i +... | replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int... | replace | 63 | 64 | 63 | 64 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
const int64_t l = 1000000007;
int64_t n, m;
cin >> n >> m;
queue<int64_t> a;
int64_t aa;
for (int64_t i = 0; i < m; i++) {
cin >> aa;
a.push(aa);
}
vector<int64_t> p(n + 1, 1);
p.at(0) = 1;
p.at(1) = 1;
p.at(2) = 2;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
const int64_t l = 1000000007;
int64_t n, m;
cin >> n >> m;
queue<int64_t> a;
int64_t aa;
for (int64_t i = 0; i < m; i++) {
cin >> aa;
a.push(aa);
}
vector<int64_t> p(n + 1, 1);
p.at(0) = 1;
p.at(1) = 1;
for (int i = 0; i < m; i++) ... | delete | 15 | 16 | 15 | 15 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MOD 1000000000 + 7
int N, M;
long long A[10 + 10];
long long dp[10 + 10];
int main(void) {
cin >> N >> M;
for (int i = 0; i < M; i++) {
long long temp;
cin >> temp;
A[temp] = 1;
}
dp[0] = 1;
for (int n = 1; n <= N; n++) {
if (A[n] == 1) {
... | #include <iostream>
using namespace std;
#define MOD 1000000000 + 7
int N, M;
long long A[100000 + 10];
long long dp[100000 + 10];
int main(void) {
cin >> N >> M;
for (int i = 0; i < M; i++) {
long long temp;
cin >> temp;
A[temp] = 1;
}
dp[0] = 1;
for (int n = 1; n <= N; n++) {
if (A[n] =... | replace | 7 | 9 | 7 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
... | replace | 77 | 78 | 77 | 78 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<bool> a(n + 1, true);
rep(i, n) {
ll x;
cin >> x;
a[x] = false;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<bool> a(n + 1, true);
rep(i, m) {
ll x;
cin >> x;
a[x] = false;
... | replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> ng(m);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
ng[a] = true;
}
const ll mod = 1e9 + 7;
vector<ll> memo(n + 1, -1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> ng(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
ng[a] = true;
}
const ll mod = 1e9 + 7;
vector<ll> memo(n + 1,... | replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
vector<int> dp(N);
int x = 0;
if (a[x] == 1) {
dp[0] = 0;
x++;
} else
dp[0] =... | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(100000);
for (int i = 0; i < M; i++)
cin >> a[i];
vector<int> dp(N);
int x = 0;
if (a[x] == 1) {
dp[0] = 0;
x++;
} else
dp... | replace | 10 | 11 | 10 | 11 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i... | replace | 38 | 39 | 38 | 39 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
// fatorial.cpp depend on this.
#ifndef MOD_INT
#define MOD_INT
template <int mod> struct ModInt {
private:
int x;
p... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
// fatorial.cpp depend on this.
#ifndef MOD_INT
#define MOD_INT
template <int mod> struct ModInt {
private:
int x;
p... | replace | 94 | 95 | 94 | 95 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define revrep(i, N) for (int(i) ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define revrep(i, N) for (int(i) ... | replace | 42 | 43 | 42 | 43 | 0 | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
const int MOD = int(1e9) + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
size_t N, M;
cin >> N >> M;
vector<bool> bad(N + 1);
for (size_t i = 0; i < M; ++i) {
int a;
cin >> a;
bad[a] = true;
}
vector<int64_t> dp(N);
dp[0]... | #include "bits/stdc++.h"
using namespace std;
const int MOD = int(1e9) + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
size_t N, M;
cin >> N >> M;
vector<bool> bad(N + 1);
for (size_t i = 0; i < M; ++i) {
int a;
cin >> a;
bad[a] = true;
}
vector<int64_t> dp(N + 1);
d... | replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (auto &A : a)
cin >> A;
vector<int> path(N + 1);
path[0] = 1;
int idx = 0;
int mod = 1000000007;
for (int i = 1; i <= N; ++i) {
if (a[idx] == i) {
path[i] = 0;
+... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (auto &A : a)
cin >> A;
vector<int> path(N + 1);
path[0] = 1;
int idx = 0;
int mod = 1000000007;
for (int i = 1; i <= N; ++i) {
if ((idx < M) && (a[idx] == i)) {
path[... | replace | 16 | 17 | 16 | 17 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#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, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define A... | #include <bits/stdc++.h>
#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, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define A... | replace | 15 | 17 | 15 | 17 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> dp(100001, -1);
vector<bool> broken(100001);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a;
ci... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> dp(100001, -1);
vector<bool> broken(100001);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a;
ci... | replace | 22 | 25 | 22 | 28 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 100001)
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m... | replace | 15 | 16 | 15 | 16 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | replace | 76 | 77 | 76 | 77 | 0 | |
p03013 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
long long dp[100001];
priority_queue<int, vector<int>, greater<int>> a;
int N, M;
memset(dp, 0, sizeof(dp));
cin >> N >> M;
for (int i = 0; i <... | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
long long dp[100001];
priority_queue<int, vector<int>, greater<int>> a;
int N, M;
memset(dp, 0, sizeof(dp));
cin >> N >> M;
for (int i = 0; i <... | replace | 28 | 29 | 28 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | replace | 167 | 168 | 167 | 168 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> v(n, false);
vector<ll> dp(n, 0);
rep(i, m) {
int a;
cin >> a;
a--;
v.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> v(n, false);
vector<ll> dp(n, 0);
rep(i, m) {
int a;
cin >> a;
a--;
v.... | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define tl 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> DP(n + 1, 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define tl 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> DP(n + 2, 0... | replace | 12 | 13 | 12 | 13 | -6 | munmap_chunk(): invalid pointer
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> d(m);
for (int i = 0; i < m; i++)
cin >> d[i];
vector<int> dp(n + 1, 0);
dp[0] = dp[1] = 1;
int tmp = 0;
if (d[0] == 1) {
tmp++;
dp[1] = 0;
}
for (int i = 2; i <= ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> d(m);
for (int i = 0; i < m; i++)
cin >> d[i];
vector<int> dp(n + 1, 0);
dp[0] = dp[1] = 1;
int tmp = 0;
if (d.size() > 0 && d[0] == 1) {
tmp++;
dp[1] = 0;
}
for (... | replace | 12 | 13 | 12 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).en... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).en... | replace | 19 | 20 | 19 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long INF = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<long long> A(K);
vector<long long> count(100001);
count[0] = 1;
count[1] = 1;
for (int i = 2; i < 100001; i++) {
count[i] = count[i - 1] + count[i - 2];
count[i] %= INF;
}
for (i... | #include <bits/stdc++.h>
using namespace std;
long long INF = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<long long> A(K);
vector<long long> count(100001);
count[0] = 1;
count[1] = 1;
for (int i = 2; i < 100001; i++) {
count[i] = count[i - 1] + count[i - 2];
count[i] %= INF;
}
for (i... | insert | 22 | 22 | 22 | 26 | 0 | |
p03013 | Python | Runtime Error | import sys
sys.setrecursionlimit(100000)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
# print(ANS)
# if x in A:
# print('::::', x)
# d[x] = 0
# return 0
... | import sys
sys.setrecursionlimit(1000000)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
# print(ANS)
# if x in A:
# print('::::', x)
# d[x] = 0
# return 0... | replace | 2 | 3 | 2 | 3 | 0 | |
p03013 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**5)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
... | import sys
sys.setrecursionlimit(10**6)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
... | replace | 2 | 3 | 2 | 3 | 0 | |
p03013 | Python | Runtime Error | n, m = map(int, input().split())
s = [0] * (n + 1)
s[-1] = 1
for _ in range(m):
a = int(input())
s[a] = None
if s[0] is None and s[1] is None:
print(0)
exit()
for i in range(n - 1, -1, -1):
if s[i] is None:
continue
if i + 1 < len(s) and s[i + 1] is not None:
s[i] += s[i + 1]
... | n, m = map(int, input().split())
s = [0] * (n + 1)
s[-1] = 1
for _ in range(m):
a = int(input())
s[a] = None
if s[0] is None and s[1] is None:
print(0)
exit()
for i in range(n - 1, -1, -1):
if s[i] is None:
continue
if i + 1 < len(s) and s[i + 1] is not None:
s[i] += s[i + 1]
... | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | Python | Time Limit Exceeded | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, M = map(int, input().split())
A = [int(input()) for _ in range(M)]
mod = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
continue
if i == 1:
dp[1] = dp[0]
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, M = map(int, input().split())
A = set([int(input()) for _ in range(M)])
mod = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
continue
if i == 1:
dp[1] = dp[0]
... | replace | 6 | 7 | 6 | 7 | TLE | |
p03013 | Python | Runtime Error | import sys
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = map(int, read().split())
a = {int(read()) - 1 for _ in range(m)}
mod = 10**9 + 7
dp = [0] * n
if 0 not in a:
dp[0] = 1
if 1 not in a:
dp[1] = 1 + dp[0]
for i in range(2, n):
if i in... | import sys
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = map(int, read().split())
a = {int(read()) - 1 for _ in range(m)}
if n == 1:
print(1)
return
mod = 10**9 + 7
dp = [0] * n
if 0 not in a:
dp[0] = 1
if 1 not in a:
dp[1] = 1 + ... | insert | 10 | 10 | 10 | 13 | 0 | |
p03013 | Python | Time Limit Exceeded | # input
N, M = map(int, input().split())
a = []
a_append = a.append
for n in range(M):
a_append(int(input()))
mod = 1000000007
# check
check = {}
for n in range(N + 1):
if n in a:
check[n] = False
else:
check[n] = True
dp = {0: 1}
if check[1] is True:
dp[1] = 1
else:
dp[1] = 0
f... | # input
N, M = map(int, input().split())
a = []
a_append = a.append
for n in range(M):
a_append(int(input()))
mod = 1000000007
# check
check = [True] * (N + 1)
for i in a:
check[i] = False
dp = {0: 1}
if check[1] is True:
dp[1] = 1
else:
dp[1] = 0
for n in range(2, N + 1):
dp[n] = 0
if chec... | replace | 11 | 17 | 11 | 14 | TLE | |
p03013 | Python | Time Limit Exceeded | Q = 1000000007
n, m = map(int, input().split())
a = [int(input()) for _ in range(m)]
dp = {0: 1, 1: 0 if 1 in a else 1}
for k in range(2, n + 1):
dp[k] = (0 if k in a else dp[k - 1] + dp[k - 2]) % Q
print(dp[n])
| Q = 1000000007
n, m = map(int, input().split())
a = set([int(input()) for _ in range(m)])
dp = {0: 1, 1: 0 if 1 in a else 1}
for k in range(2, n + 1):
dp[k] = (0 if k in a else dp[k - 1] + dp[k - 2]) % Q
print(dp[n])
| replace | 2 | 3 | 2 | 3 | TLE | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> A;
int a;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> a;
A.push_back(a);
}
long long way[101000] = {0};
way[0] = 1... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> A;
int a;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> a;
A.push_back(a);
}
long long way[101000] = {0};
way[0] = 1... | replace | 22 | 23 | 22 | 23 | 0 | |
p03013 | Python | Runtime Error | n, m = map(int, input().split())
hole_ids = {int(input()) - 1: 0 for _ in range(m)}
X = 1000000007
def solve(n, hole_ids):
nums = []
# nums = [0] * n
for i in range(n):
if i in hole_ids:
nums.append(0)
# nums[i] = 0
continue
if i == 0:
nums.... | n, m = map(int, input().split())
hole_ids = {int(input()) - 1: 0 for _ in range(m)}
X = 1000000007
def solve(n, hole_ids):
nums = []
# nums = [0] * n
for i in range(n):
if i in hole_ids:
nums.append(0)
# nums[i] = 0
continue
if i == 0:
nums.... | delete | 28 | 56 | 28 | 28 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03013/Python/s744106332.py", line 29, in <module>
n, m = map(int, input().split())
EOFError: EOF when reading a line
|
p03013 | Python | Runtime Error | n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(input().strip()))
broken = [False] * (n + 1)
for i in range(m):
broken[a[i]] = True
dp = []
dp.append(1)
if broken[1]:
dp.append(0)
else:
dp.append(1)
for i in range(2, n + 1, 1):
if broken[i]:
dp.append(0)
... | n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(input().strip()))
broken = [False] * (n + 1)
for i in range(m):
broken[a[i]] = True
dp = []
dp.append(1)
if broken[1]:
dp.append(0)
else:
dp.append(1)
for i in range(2, n + 1, 1):
if broken[i]:
dp.append(0)
... | replace | 23 | 24 | 23 | 24 | 0 | |
p03013 | Python | Runtime Error | N, M = map(int, input().split())
steps = [True] * (N + 1)
for _ in range(M):
steps[int(input())] = False
dp = [0] * (N + 1)
dp[0] = 1
for prev in range(N):
for now in range(prev + 1, min(N, prev + 2) + 1):
if steps[now]:
dp[now] += dp[prev]
dp[now] %= 1_000_000_007
print(dp[N])
| N, M = map(int, input().split())
steps = [True] * (N + 1)
for _ in range(M):
steps[int(input())] = False
dp = [0] * (N + 1)
dp[0] = 1
for prev in range(N):
for now in range(prev + 1, min(N, prev + 2) + 1):
if steps[now]:
dp[now] += dp[prev]
dp[now] %= 10**9 + 7
print(dp[N])
| replace | 10 | 11 | 10 | 11 | 0 | |
p03013 | Python | Time Limit Exceeded | mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(input()) for _ in range(m)]
dp = {}
for i in range(n + 1):
dp[i] = 1
dp[1] = 0 if 1 in a else 1
for i in range(2, n + 1):
if i in a:
dp[i] = 0
else:
dp[i] = dp[i - 1] % mod + dp[i - 2] % mod
dp[i] %= mod
print(dp[n] %... | mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = set([int(input()) for _ in range(m)])
dp = {}
for i in range(n + 1):
dp[i] = 1
dp[1] = 0 if 1 in a else 1
for i in range(2, n + 1):
if i in a:
dp[i] = 0
else:
dp[i] = dp[i - 1] % mod + dp[i - 2] % mod
dp[i] %= mod
print(dp... | replace | 3 | 4 | 3 | 4 | TLE | |
p03013 | Python | Time Limit Exceeded | import sys
import os
MOD = 10**9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.buffer.readline().split()))
A = [int(sys.stdin.buffer.readline().rstrip()) for _ in range(M)]
ret = [0, 1]
for i in range(1, N + 1):
if i in ... | import sys
import os
MOD = 10**9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.buffer.readline().split()))
A = set([int(sys.stdin.buffer.readline().rstrip()) for _ in range(M)])
ret = [0, 1]
for i in range(1, N + 1):
if ... | replace | 11 | 12 | 11 | 12 | TLE | |
p03013 | Python | Time Limit Exceeded | def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def solve(inputs):
[N, M] = list(map(lambda x: int(x), inputs[0].split()))
broke_steps = list(map(lambda x: int(x), inputs[1:]))
SSSS = 1000000007
patterns = [1]
for step in range(1, N + 1):
if step... | def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def solve(inputs):
[N, M] = list(map(lambda x: int(x), inputs[0].split()))
broke_steps = {}
for b in map(lambda x: int(x), inputs[1:]):
broke_steps[b] = True
SSSS = 1000000007
patterns = [1]
for... | replace | 7 | 8 | 7 | 10 | TLE | |
p03013 | Python | Runtime Error | N, M = map(int, input().split())
A = []
for _ in range(M):
A[int(input())] = True
step = [0] * (N + 1)
step[0] = 1
for s in range(1, N + 1):
if A[s]:
step[s] = 0
continue
if s == 1:
step[s] = 1
continue
else:
step[s] = step[s - 1] + step[s - 2]
step[s... | N, M = map(int, input().split())
A = [False] * (N + 1)
for _ in range(M):
A[int(input())] = True
step = [0] * (N + 1)
step[0] = 1
for s in range(1, N + 1):
if A[s]:
step[s] = 0
continue
if s == 1:
step[s] = 1
continue
else:
step[s] = step[s - 1] + step[s - 2]... | replace | 2 | 3 | 2 | 3 | IndexError: list assignment index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03013/Python/s337394668.py", line 6, in <module>
A[int(input())] = True
IndexError: list assignment index out of range
|
p03013 | Python | Runtime Error | n, m = map(int, input().split())
stairs = []
is_continuous = False
for i in range(m):
stairs.append(int(input()))
if i > 0 and stairs[i] - 1 == stairs[i - 1]:
is_continuous = True
break
if is_continuous:
print(0)
else:
countup_num = [0] * (n + 1)
countup_num[0] = 1
countup_num[... | n, m = map(int, input().split())
stairs = []
is_continuous = False
for i in range(m):
stairs.append(int(input()))
if i > 0 and stairs[i] - 1 == stairs[i - 1]:
is_continuous = True
break
if is_continuous:
print(0)
else:
countup_num = [0] * (n + 1)
countup_num[0] = 1
countup_num[... | replace | 26 | 28 | 26 | 31 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.