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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int INF = 1e9 + 7;
const int maxn = 2e5 + 5;
int a[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
struct note {
int i, cost;
bool operator<(const note &x) const { return i > x.i; }
} t[100];
int ans[100], tot, flag;
int temp... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int INF = 1e9 + 7;
const int maxn = 2e5 + 5;
int a[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
struct note {
int i, cost;
bool operator<(const note &x) const { return i > x.i; }
} t[100];
int ans[100], tot, flag;
int temp... | replace | 82 | 85 | 82 | 85 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const string MINUSINF = "-";
int N, M;
cin >> N >> M;
int A[N];
string dp[11000]; // N本使った時の最大の数
// dp[i] = dp[i-M]
int cost[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
for (int i = 0; i < M; i++)
cin >> A[i];
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const string MINUSINF = "-";
int N, M;
cin >> N >> M;
int A[M];
string dp[11000]; // N本使った時の最大の数
// dp[i] = dp[i-M]
int cost[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
for (int i = 0; i < M; i++)
cin >> A[i];
for (i... | replace | 9 | 10 | 9 | 10 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | replace | 59 | 60 | 59 | 61 | -6 | malloc(): corrupted top size
|
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | replace | 24 | 25 | 24 | 25 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include ... | replace | 41 | 42 | 41 | 42 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | #include <bits/stdc++.h>
#define err(args...) \
{}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream &operator>>(istre... | replace | 17 | 18 | 17 | 18 | 127 | /tmp/779294f4-2e11-4f2b-998e-33d906bb0608.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <... | replace | 25 | 26 | 25 | 26 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define forin(i, array) for (auto &x : array)
#define all(v) (v).begin(), (v).end()
#define pb push_back... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define forin(i, array) for (auto &x : array)
#define all(v) (v).begin(), (v).end()
#define pb push_back... | replace | 26 | 27 | 26 | 27 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int num_sticks[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
vector<int> dp(N + 1, -1e9);
dp.at(0) = 0;
for (auto &a : A) {
cin >> a;
dp.at(num_sticks[a]) = 1;
}
for (int i = 1; i <= N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const int num_sticks[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
vector<int> dp(N + 10, -1e9);
dp.at(0) = 0;
for (auto &a : A) {
cin >> a;
dp.at(num_sticks[a]) = 1;
}
for (int i = 1; i <= N; i++) {... | replace | 10 | 11 | 10 | 11 | 0 | |
p03128 | Python | Runtime Error | def main():
n, m, *a = map(int, open(0).read().split())
t = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
a.sort(reverse=True)
dp = [-float("Inf")] * (n + 1)
dp[0] = 0
for i in range(2, n + 1):
for j in a:
dp[i] = max(dp[i], dp[i - t[j]] + 1)
nums = []
k = ... | def main():
n, m, *a = map(int, open(0).read().split())
t = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
a.sort(reverse=True)
dp = [-float("Inf")] * (n + 10)
dp[0] = 0
for i in range(2, n + 1):
for j in a:
dp[i] = max(dp[i], dp[i - t[j]] + 1)
nums = []
k =... | replace | 5 | 6 | 5 | 6 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> boo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> boo... | replace | 38 | 39 | 38 | 39 | 0 | |
p03128 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | replace | 48 | 49 | 48 | 54 | 0 | |
p03128 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdbool.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define N (1000000000 + 7)
using namespace std;
typede... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdbool.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define N (1000000000 + 7)
using namespace std;
typede... | replace | 29 | 30 | 29 | 30 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, m, a[10] = {}, c[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}, d[10004] = {};
c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, m, a[10] = {}, c[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}, d[10004] = {};
c... | replace | 26 | 27 | 26 | 27 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | replace | 57 | 59 | 57 | 59 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
struct sss {
string s;
} dp[10001];
bool flag[10];
bool cmp(string a, string b) {
if (a.size() > b.size())
return 1;
else ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
struct sss {
string s;
} dp[10001];
bool flag[10];
bool cmp(string a, string b) {
if (a.size() > b.size())
return 1;
else ... | delete | 58 | 59 | 58 | 58 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for (int(i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9 + 7;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for (int(i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9 + 7;
... | replace | 34 | 35 | 34 | 35 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const vector<int> match = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
void chmax(string &a, string b) {
if (a == "-")
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
int main() {
int n, m;
cin >> n >> m... | #include <bits/stdc++.h>
using namespace std;
const vector<int> match = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
void chmax(string &a, string b) {
if (a == "-")
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
int main() {
int n, m;
cin >> n >> m... | replace | 25 | 26 | 25 | 26 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1001001001;
// id = i - 1
const int need[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int dp[1005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> a(m);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1001001001;
// id = i - 1
const int need[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> a(m)... | replace | 9 | 10 | 9 | 10 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define forn(i, n) for (int i = 0; i < n; i++)
#define fornd(i, n) for (int i = n - 1; i >= 0; i--)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define for1d(i, n) for (int i = n; i >= 1; i--)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using n... | #include <bits/stdc++.h>
#define pb push_back
#define forn(i, n) for (int i = 0; i < n; i++)
#define fornd(i, n) for (int i = n - 1; i >= 0; i--)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define for1d(i, n) for (int i = n; i >= 1; i--)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using n... | replace | 24 | 25 | 24 | 25 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | insert | 99 | 99 | 99 | 101 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long long n, m;
long long a[11];
long long dp[10005];
vector<int> V;
vector<pair<int, int>> pd;
string s;
int k;
int num(int k) {
int answer = 0;
if (k == 1) {
answer = 2;
} else if (k == 2) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long long n, m;
long long a[11];
long long dp[10005];
vector<int> V;
vector<pair<int, int>> pd;
string s;
int k;
int num(int k) {
int answer = 0;
if (k == 1) {
answer = 2;
} else if (k == 2) {
... | replace | 42 | 43 | 42 | 43 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <deque>
#include <functional>
#include <memory>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int n, m;
int digits[9];
int sticks_for_digits[10] = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
bool called[10000];
bool reachable[10000];
struct Node {
... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <functional>
#include <memory>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
int n, m;
int digits[9];
int sticks_for_digits[10] = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
bool called[10000];
bool reachable[10000];
struct Node {
... | replace | 31 | 32 | 31 | 32 | 0 | |
p03128 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i ... |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i ... | replace | 31 | 32 | 31 | 32 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define debug(x) cerr << #x << ":" << (x) << endl
// dp[i] := i本使って作れる数値の最大値(stringで持つ)
// 遷移
// dp[i] = max(dp[i], dp[i-cost[a[j]]] + a[j])
string dp[1010];
int cost[9] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
int n, m;
cin ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define debug(x) cerr << #x << ":" << (x) << endl
// dp[i] := i本使って作れる数値の最大値(stringで持つ)
// 遷移
// dp[i] = max(dp[i], dp[i-cost[a[j]]] + a[j])
string dp[101010];
int cost[9] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
int n, m;
ci... | replace | 10 | 11 | 10 | 11 | 0 | |
p03128 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include... | replace | 155 | 156 | 155 | 156 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF 1... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF 1... | replace | 59 | 60 | 59 | 60 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
typedef long long ll;
int main() {
int num[... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
typedef long long ll;
int main() {
int num[... | replace | 30 | 31 | 30 | 31 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | replace | 57 | 58 | 57 | 59 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = (int)1e9;
int N, M;
vector<int> A;
int num[10] = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int dp[100010];
string f() {
string S = "";
int i = N;
while (1) {
if (i == 0) {
return S;
}
for (int j = 0; j < M; j++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = (int)1e9;
int N, M;
vector<int> A;
int num[10] = {-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int dp[100010];
string f() {
string S = "";
int i = N;
while (1) {
if (i == 0) {
return S;
}
for (int j = 0; j < M; j++) {
... | replace | 54 | 55 | 54 | 55 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define inf 1000000007
using namespace std;
int dp[1009];
signed main() {
int n, m;
cin >> n >> m;
int num[10] = {inf, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int nm[10] = {inf, inf, inf, inf, inf, inf, inf, inf, inf, inf};
for (int i... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define inf 1000000007
using namespace std;
int dp[10009];
signed main() {
int n, m;
cin >> n >> m;
int num[10] = {inf, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int nm[10] = {inf, inf, inf, inf, inf, inf, inf, inf, inf, inf};
for (int ... | replace | 6 | 7 | 6 | 7 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define BR "\n"
#define SP " "
#define SHOW(x) \
for (int i = 0; i < x.size(); i++) { \
cout << x[i] << SP; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define BR "\n"
#define SP " "
#define SHOW(x) \
for (int i = 0; i < x.size(); i++) { \
cout << x[i] << SP; ... | replace | 29 | 30 | 29 | 30 | 0 | |
p03128 | C++ | Runtime Error | #define DEBUGGING // Enables DEBUG macro.
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define REP(i, n) for (int i = 0; (i64)(i) < (i64)(n); ++i)
#ifndef DEBUGGING
#define DEBUG(...)
#else
template <typename T> void debug(T value) { std::cerr << value; }
templat... | #define DEBUGGING // Enables DEBUG macro.
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define REP(i, n) for (int i = 0; (i64)(i) < (i64)(n); ++i)
#ifndef DEBUGGING
#define DEBUG(...)
#else
template <typename T> void debug(T value) { std::cerr << value; }
templat... | replace | 40 | 41 | 40 | 43 | 0 | |
p03128 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 59 | 60 | 59 | 60 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | replace | 31 | 33 | 31 | 32 | TLE | |
p03128 | C++ | Runtime Error | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x;
int B[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> A(10), C(10);
rep(i, m) {
cin >> x;
A[x] ... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x;
int B[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> A(10), C(10);
rep(i, m) {
cin >> x;
A[x] ... | replace | 20 | 22 | 20 | 22 | 0 | |
p03128 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
const int C[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
const int N = 5000 + 100;
int n;
bool can[10];
void readData() {
scanf("%d", &n);
int m, x;
scanf("%d", &m);
for (int i = 1; i <= m; i++) {
scanf("%d", &x);
can[x] = true;
}
}... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
const int C[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
const int N = 10000 + 100;
int n;
bool can[10];
void readData() {
scanf("%d", &n);
int m, x;
scanf("%d", &m);
for (int i = 1; i <= m; i++) {
scanf("%d", &x);
can[x] = true;
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPI(i, f, n) for (int i = (f); i < (n); ++i)
using namespace std;
typedef long long ll;
int ma[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
// dp[i] : i本使った時の最大値
string dp[10005];
void str_max(string &a, string b) {
if (a.size() < b.size())... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPI(i, f, n) for (int i = (f); i < (n); ++i)
using namespace std;
typedef long long ll;
int ma[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
// dp[i] : i本使った時の最大値
string dp[10020];
void str_max(string &a, string b) {
if (a.size() < b.size())... | replace | 9 | 10 | 9 | 10 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | replace | 16 | 20 | 16 | 20 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), ... | replace | 276 | 277 | 276 | 277 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | replace | 28 | 29 | 28 | 29 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define reps(i, N) for (int i = 1; i <= (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define pub push_back
template <typename T> void chmax(T &a, T b) { a = max(a, b... | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define reps(i, N) for (int i = 1; i <= (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define pub push_back
template <typename T> void chmax(T &a, T b) { a = max(a, b... | replace | 26 | 27 | 26 | 27 | TLE | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | replace | 49 | 50 | 49 | 50 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
// 最小本数をマックスまで取る。
// 同じ本数の場合は数字が大きいものだけ。
// priority_queueで1つずつ出して出力っぽい。桁数的に。配列でもいいけど
// ぴったりとれるか判定が難しい･･･。
// 1つの数字をマッチに戻して、最小本数以外で満たす組み合わせがあるか都度確認か
// より少ない本数のものを最大とって、それ以降の探索
// だめなら放流して次の数、とか
// あまり数、
// 3,7とか。あまり1,4,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
// 最小本数をマックスまで取る。
// 同じ本数の場合は数字が大きいものだけ。
// priority_queueで1つずつ出して出力っぽい。桁数的に。配列でもいいけど
// ぴったりとれるか判定が難しい･･･。
// 1つの数字をマッチに戻して、最小本数以外で満たす組み合わせがあるか都度確認か
// より少ない本数のものを最大とって、それ以降の探索
// だめなら放流して次の数、とか
// あまり数、
// 3,7とか。あまり1,4,... | replace | 63 | 64 | 63 | 64 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF -1e9
typedef long long ll;
ll N;
int M;
int N_digit[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main(void) {
cin >> N >> M;
vector<int> A(N);
ll i;
// dp[i]:i本使って作れる最大の桁数
int j, min, dp[N + 1];
min = 10;
for (i = 0; i < M; i++)
cin >> A[i];
dp... | #include <bits/stdc++.h>
using namespace std;
#define INF -1e9
typedef long long ll;
ll N;
int M;
int N_digit[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main(void) {
cin >> N >> M;
vector<int> A(M);
ll i;
// dp[i]:i本使って作れる最大の桁数
int j, min, dp[N + 1];
min = 10;
for (i = 0; i < M; i++)
cin >> A[i];
dp... | replace | 10 | 11 | 10 | 11 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b = {-1, 2, 5, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b = {-1, 2, 5, ... | replace | 35 | 39 | 35 | 47 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | replace | 80 | 81 | 80 | 81 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
// #define int long long
#define p... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
// #define int long long
#define p... | replace | 76 | 77 | 76 | 77 | -6 | d117e5d9-8cd9-4391-8565-42b0c6df7679.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03128/C++/s807083061.cpp:55: void trace(int, int): Assertion `coins == 0' failed.
|
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string MINF = "-";
void chmax(string &a, string b) {
if (a == MINF)
a = b;
else if (b.size() > a.size())
a = b;
else if (b.size() < a.size())
return;
else if (a < b)
a = b;
}
int main() {
int N, M;
cin >> N >> M;
vecto... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string MINF = "-";
void chmax(string &a, string b) {
if (a == MINF)
a = b;
else if (b.size() > a.size())
a = b;
else if (b.size() < a.size())
return;
else if (a < b)
a = b;
}
int main() {
int N, M;
cin >> N >> M;
vecto... | replace | 28 | 29 | 28 | 29 | -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)
|
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, a, d[1001], s[9], t[] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<ll> v;
int main(void) {
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> s[i];
s[i]--;
}
sort(s, s + k);
reverse(s, s + k);
for (int i = 1; ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, k, a, d[10001], s[9], t[] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<ll> v;
int main(void) {
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> s[i];
s[i]--;
}
sort(s, s + k);
reverse(s, s + k);
for (int i = 1;... | replace | 4 | 5 | 4 | 5 | 0 | |
p03128 | C++ | Runtime Error | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | #include "bits/stdc++.h"
#define Rep(i, n) for (int i = 0; i < n; i++)
#define For(i, n1, n2) for (int i = n1; i < n2; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define put(a) cout << a << endl;
#define all(a) (a).begin(), (a).end()
#define SORT(c) sort((c).be... | replace | 50 | 51 | 50 | 53 | 0 | |
p03128 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, m, d[1009];
int h[10] = {0, -2, -5, -5, -4, -5, -6, -3, -7, -6};
bool c[10];
int main(void) {
cin >> n >> m;
fill(c, c + 10, false);
fill(d, d + 1004, -1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
h[a] *= -1;
c[h[a]] = true;
d[h[a]] = 1;... | #include <iostream>
using namespace std;
int n, m, d[10009];
int h[10] = {0, -2, -5, -5, -4, -5, -6, -3, -7, -6};
bool c[10];
int main(void) {
cin >> n >> m;
fill(c, c + 10, false);
fill(d, d + 1004, -1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
h[a] *= -1;
c[h[a]] = true;
d[h[a]] = 1... | replace | 3 | 4 | 3 | 4 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rrep(i, n) for (int i = (int)n - 1; i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templat... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rrep(i, n) for (int i = (int)n - 1; i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templat... | replace | 44 | 45 | 44 | 47 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
... | replace | 95 | 96 | 95 | 96 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | replace | 35 | 36 | 35 | 36 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | replace | 45 | 46 | 45 | 46 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
namespace FastIO {
const char *ln = "\n";
struct Reader {
char buf[1 << 20], *s, *t;
bool EOF_FLG;
Reader() : s(buf), t(buf), EOF_FLG(false){};
char gt() {
return s == t && ((t = (s = buf) + fread(buf, 1, 1 << 20, stdin)) == s)
? EOF
: (*s++);
}
Rea... | #include <bits/stdc++.h>
namespace FastIO {
const char *ln = "\n";
struct Reader {
char buf[1 << 20], *s, *t;
bool EOF_FLG;
Reader() : s(buf), t(buf), EOF_FLG(false){};
char gt() {
return s == t && ((t = (s = buf) + fread(buf, 1, 1 << 20, stdin)) == s)
? EOF
: (*s++);
}
Rea... | replace | 97 | 98 | 97 | 98 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if
// (a > b) { a = b; return true; } return false; }
/* attenti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if
// (a > b) { a = b; return true; } return false; }
/* attenti... | replace | 82 | 83 | 82 | 83 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef uns... | replace | 23 | 24 | 23 | 24 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define etm \
cerr << "Time elapse... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define etm \
cerr << "Time elapse... | replace | 361 | 363 | 361 | 363 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define repi(n) for (int i = 0; i < n; i++)
#define repj(n) for (int j = 0; j < n; j++)
#define repk(n) for (int k = 0; j < n; k++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (auto i = a; i < b; i++)
#define repv(itr) for ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define repi(n) for (int i = 0; i < n; i++)
#define repj(n) for (int j = 0; j < n; j++)
#define repk(n) for (int k = 0; j < n; k++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (auto i = a; i < b; i++)
#define repv(itr) for ... | replace | 75 | 76 | 75 | 76 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, M, X[10] = {100, 2, 5, 5, 4, 5, 6, 3, 7, 6}, DP[10010] = {},
INF = 1145141919;
vector<int> V;
cin >> N >> M;
for (int i = 0; i <= N; i++) {
DP[i] = -INF;
}
DP[0] = 0;
for (int i = 0; i < M; i++) {
int A;
cin >> A;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, M, X[10] = {100, 2, 5, 5, 4, 5, 6, 3, 7, 6}, DP[10010] = {},
INF = 1145141919;
vector<int> V;
cin >> N >> M;
for (int i = 0; i <= N; i++) {
DP[i] = -INF;
}
DP[0] = 0;
for (int i = 0; i < M; i++) {
int A;
cin >> A;
... | replace | 28 | 32 | 28 | 34 | TLE | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
char A[10];
cin >> N >> M;
int C[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
for (int i = 0; i < M; i++) {
cin >> A[i];
}
string dp[10010] = {};
bool possible[10010] = {};
possible[0] = true;
for (int i = 2; i <=... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
char A[10];
cin >> N >> M;
int C[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
for (int i = 0; i < M; i++) {
cin >> A[i];
}
string dp[10010] = {};
bool possible[10010] = {};
possible[0] = true;
for (int i = 2; i <=... | replace | 18 | 20 | 18 | 22 | TLE | |
p03128 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
ll n, m, a[10];
string str[10010], test[10];
map<ll, ll> mp;
map<ll, string> np;
bool jud[1010], h[10];
int main(void) {
mp[1] = 2, mp[2] = 5, mp[3] = 5, mp[4] = 4;
mp[5] = 5, mp[6] = 6, mp[7] = 3, mp[8] = 7;
mp[9] = 6... | #include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
ll n, m, a[10];
string str[10010], test[10];
map<ll, ll> mp;
map<ll, string> np;
bool jud[10010], h[10];
int main(void) {
mp[1] = 2, mp[2] = 5, mp[3] = 5, mp[4] = 4;
mp[5] = 5, mp[6] = 6, mp[7] = 3, mp[8] = 7;
mp[9] = ... | replace | 9 | 10 | 9 | 10 | 0 | |
p03128 | C++ | Runtime Error | #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<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int cost[]{0, 2, 5, 5, 4... | #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<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int cost[]{0, 2, 5, 5, 4... | replace | 52 | 53 | 52 | 53 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int match_num[10] = {1 << 30, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string num_string[10] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};
string dp[1250] = {};
string calc_bigger(const string &a, const... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int match_num[10] = {1 << 30, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string num_string[10] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9"};
string dp[12500] = {};
string calc_bigger(const string &a, cons... | replace | 10 | 11 | 10 | 11 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | replace | 22 | 23 | 22 | 23 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
string max_string(string a, string b) {
if (a.length() > b.length()) {
ret... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
string max_string(string a, string b) {
if (a.length() > b.length()) {
ret... | replace | 34 | 35 | 34 | 35 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
int main() {
int n, m;
cin >> n >> m... | #include <algorithm>
#include <cstdlib> //絶対値利用のため
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
// const int INF = INT_MAX / 2;
int main() {
int n, m;
cin >> n >> m... | replace | 34 | 35 | 34 | 35 | TLE | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#def... | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#def... | replace | 110 | 118 | 110 | 116 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> maxvec(vector<int> &a, vector<int> &b) {
if (a[0] > b[0])
return a;
if (a[0] < b[0])
return b;
for (int i = 9; i >= 1; i--) {
if (a[i] > b[i])
return a;
if (a[i] < b[i])
return b;
}
return a;
}
int main() {
int N, M;
... | #include <bits/stdc++.h>
using namespace std;
vector<int> maxvec(vector<int> &a, vector<int> &b) {
if (a[0] > b[0])
return a;
if (a[0] < b[0])
return b;
for (int i = 9; i >= 1; i--) {
if (a[i] > b[i])
return a;
if (a[i] < b[i])
return b;
}
return a;
}
int main() {
int N, M;
... | replace | 24 | 25 | 24 | 25 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, m, c[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int dp[10001], p[10001], a[10], inf = 100000;
int f(int n) {
if (n < 0)
... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, m, c[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int dp[10001], p[10001], a[10], inf = 100000;
int f(int n) {
if (n < 0)
... | replace | 34 | 39 | 34 | 36 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pair;
int main() {
int N, M;
cin >> N >> M;
int tmp;
int bou[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> A;
for (int i = 0; i < M; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
int dp[1100];
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pair;
int main() {
int N, M;
cin >> N >> M;
int tmp;
int bou[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> A;
for (int i = 0; i < M; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
int dp[11000];
for (... | replace | 15 | 17 | 15 | 17 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
bool cmp(string a, string b) {
if (a == "x")
return true;
if (b == "x")
return false;
if (a.size() < b.size())
return true;
if (a.size() > b.size())
return false;
for (int i = 0; i < a.size();... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
bool cmp(string a, string b) {
if (a == "x")
return true;
if (b == "x")
return false;
if (a.size() < b.size())
return true;
if (a.size() > b.size())
return false;
for (int i = 0; i < a.size();... | replace | 38 | 39 | 38 | 39 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | replace | 52 | 53 | 52 | 55 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll match[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
ll N, M;
cin >> N >> M;
ll A[M];
ll dp[N + 1];
dp[0] = 0;
for (int i = 0; i < M; i++) {
cin >> A[i];
}
sort(A, A + M, greater<ll>());
for (int i = 1; i <= N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll match[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
ll N, M;
cin >> N >> M;
ll A[M];
ll dp[N + 1];
dp[0] = 0;
for (int i = 0; i < M; i++) {
cin >> A[i];
}
sort(A, A + M, greater<ll>());
for (int i = 1; i <= N; i++) {
... | replace | 31 | 32 | 31 | 32 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
int n, m;
int a[10];
int nums[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++)
scanf("%d", &a[i]);
int dp[10000] = {};
for (int i = 0; i <= n; i++)
dp[i] = -1;
dp[0] ... | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
int n, m;
int a[10];
int nums[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++)
scanf("%d", &a[i]);
int dp[10050] = {};
for (int i = 0; i <= n; i++)
dp[i] = -1;
dp[0] ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n)... | insert | 31 | 31 | 31 | 33 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 14719021122270100109
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef unsigned long long ull;
#define f first
#define s second
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define pb eb
#define mp make_pair
#define forn(i... | #include <bits/stdc++.h>
using namespace std;
// 14719021122270100109
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef unsigned long long ull;
#define f first
#define s second
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define pb eb
#define mp make_pair
#define forn(i... | replace | 35 | 37 | 35 | 37 | 0 | |
p03128 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
const int MAXN = 1001;
const int weight[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
struct Stat {
short int cnt[10];
int len;
void push(int key) {
cnt[key]++;
len++;
}
Stat(int num = 0) {
memset(cnt, 0, sizeof(cnt));
len ... | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
const int MAXN = 10001;
const int weight[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
struct Stat {
short int cnt[10];
int len;
void push(int key) {
cnt[key]++;
len++;
}
Stat(int num = 0) {
memset(cnt, 0, sizeof(cnt));
len... | replace | 5 | 6 | 5 | 6 | 0 | |
p03128 | C++ | Runtime Error | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | replace | 165 | 166 | 165 | 166 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <math.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
#define INF 1 << 29... | #include <algorithm>
#include <array>
#include <iostream>
#include <math.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
#define INF 1 << 29... | replace | 22 | 24 | 22 | 24 | 0 | |
p03128 | C++ | Runtime Error | // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predic... | // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predic... | replace | 8 | 10 | 8 | 10 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | replace | 50 | 51 | 50 | 51 | TLE | |
p03128 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
template <class T, class U> constexpr bool chmin(T &a, const U b) {
if (a <= b)
return false;
a = b;
r... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
template <class T, class U> constexpr bool chmin(T &a, const U b) {
if (a <= b)
return false;
a = b;
r... | insert | 72 | 72 | 72 | 74 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 200000000;
con... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 200000000;
con... | replace | 25 | 26 | 25 | 26 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
signed main() {
int num[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int N, M;
cin >> N >> M;
vector<int> A(M);
for (int i = 0; i < M; i++) {... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
signed main() {
int num[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int N, M;
cin >> N >> M;
vector<int> A(M);
for (int i = 0; i < M; i++) {... | replace | 21 | 22 | 21 | 22 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | insert | 94 | 94 | 94 | 96 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll... | replace | 90 | 91 | 90 | 92 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll... | replace | 28 | 30 | 28 | 32 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <unordered_map>
#pragma GCC optimize("Ofast")
using namespace std;
#define int long long
#define sync ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define file \
freopen("input.txt", "r", stdin), freopen("output.t... | #include <bits/stdc++.h>
// #pragma GCC optimize ("Ofast")
using namespace std;
#define int long long
#define sync ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define file \
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#de... | replace | 1 | 3 | 1 | 2 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
int dp[1010];
fill(dp, dp + n, -1);
dp[0] = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
int need[] ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
int dp[10010];
fill(dp, dp + n, -1);
dp[0] = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
int need[]... | replace | 12 | 13 | 12 | 13 | TLE | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (auto &ai : a)
cin >> ai;
vector<int> need = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
auto add = [](string s, int a) {
s += to_string(a);
sort(s.begin(), s.end(), greater<>());
return s;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (auto &ai : a)
cin >> ai;
vector<int> need = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
auto add = [](string s, int a) {
s += to_string(a);
int n = s.size();
for (int i = n - 1; i - 1 >= 0; ... | replace | 15 | 16 | 15 | 21 | TLE | |
p03128 | C++ | Runtime Error | // includes
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered... | // includes
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered... | replace | 91 | 92 | 91 | 92 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool dp[10005][5005];
ll use[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
for (int i = 0; i < 10005; i++) {
for (int j = 0; j < 5005; j++)
dp[i][j] = false;
}
dp[0][0] = true;
ll n, m;
cin >> n >> m;
vector<ll> v;
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool dp[10005][5005];
ll use[] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
for (int i = 0; i < 10005; i++) {
for (int j = 0; j < 5005; j++)
dp[i][j] = false;
}
dp[0][0] = true;
ll n, m;
cin >> n >> m;
vector<ll> v;
for (int i... | replace | 24 | 25 | 24 | 26 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define INF (1 << 30)
#define ALEN(ARR) (sizeof(ARR) / sizeof((... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define INF (1 << 30)
#define ALEN(ARR) (sizeof(ARR) / sizeof((... | replace | 58 | 59 | 58 | 59 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#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(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
cons... | #include <bits/stdc++.h>
#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(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
cons... | replace | 23 | 24 | 23 | 24 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i < n + 1; i++)
int main() {
int N, M... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i < n + 1; i++)
int main() {
int N, M... | replace | 36 | 37 | 36 | 37 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> sticks{0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> can(m);
for (int i = 0; i < m; i++)
cin >> can[i];
sort(can.begin(), can.end());
reverse(can.begin(), ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> sticks{0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<int> can(m);
for (int i = 0; i < m; i++)
cin >> can[i];
sort(can.begin(), can.end());
reverse(can.begin(), ... | insert | 18 | 18 | 18 | 20 | TLE | |
p03129 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
if (N % 2 == 1)
N = (N + 1) / 2;
else
N /= 2;
if (N >= K)
printf("YES");
else
printf("NO");
while (1)
;
} | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
if (N % 2 == 1)
N = (N + 1) / 2;
else
N /= 2;
if (N >= K)
printf("YES");
else
printf("NO");
} | delete | 15 | 17 | 15 | 15 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.