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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02893 | Python | Time Limit Exceeded | n = int(input())
a = input()
inva = "".join(map(lambda x: str(int(x) ^ 1), a))
mod = 998244353
ans = 0
p = 1
num = [0] * -~n
for i in range(n):
if i:
num[i] += (num[i - 1] * 2) % mod
if a[i] == "1":
num[i] += 1
def get_div(x):
y = []
for i in range(1, n):
if x % i == 0 and (x ... | n = int(input())
a = input()
inva = "".join(map(lambda x: str(int(x) ^ 1), a))
mod = 998244353
ans = 0
p = 1
num = [0] * -~n
for i in range(n):
if i:
num[i] += (num[i - 1] * 2) % mod
if a[i] == "1":
num[i] += 1
def get_div(x):
y = []
for i in range(1, n):
if x % i == 0 and (x ... | replace | 32 | 33 | 32 | 33 | TLE | |
p02893 | C++ | Runtime Error | /* cerberus97 - Hanit Banga */
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define fa... | /* cerberus97 - Hanit Banga */
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define fa... | replace | 28 | 29 | 28 | 29 | 0 | |
p02893 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int mod = 998244353;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
o = -1, ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
o = -1, ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02893 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define x first
#define y second
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pii... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define x first
#define y second
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pii... | replace | 149 | 150 | 149 | 150 | 0 | |
p02893 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define m_p make_pair
#define sz(x) (int)x.size()
#define out(x) cerr << #x << " = " << x << " "
#define ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define m_p make_pair
#define sz(x) (int)x.size()
#define out(x) cerr << #x << " = " << x << " "
#define ... | replace | 66 | 67 | 66 | 67 | 0 | |
p02893 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100, MOD = 998244353;
int add(ll a, int b) { return (a + b + 2LL * MOD) % MOD; }
int mul(ll a, int b) { return (a * b) % MOD; }
void sadd(int &a, int b) { a = add(a, b); }
void smul(int &a, int b) { a = mul(a, b); }
vector<i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e5 + 100, MOD = 998244353;
int add(ll a, int b) { return (a + b + 2LL * MOD) % MOD; }
int mul(ll a, int b) { return (a * b) % MOD; }
void sadd(int &a, int b) { a = add(a, b); }
void smul(int &a, int b) { a = mul(a, b); }
vector<i... | replace | 6 | 7 | 6 | 7 | 0 | |
p02893 | C++ | Runtime Error | #pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
// hloya template v26
// ░░░░░░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░░░░░
// ░░░░░░█░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░█░░░░░
// ░░░░░░█░█░▀░░░░░▀░░▀░░░░█░█░░░░░
// ░░░░░░█░█░░░░░░░░▄▀▀▄░▀░█░█▄▀▀▄░
// █▀▀█▄░█░█░░▀░░░░░█░░░▀▄▄█▄▀░░░█░
// ▀▄▄░▀██░█▄░▀░░░▄▄▀░░░░░░░░░░░░▀▄
// ░░▀█▄▄█░█░... | #pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
// hloya template v26
// ░░░░░░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░░░░░
// ░░░░░░█░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░█░░░░░
// ░░░░░░█░█░▀░░░░░▀░░▀░░░░█░█░░░░░
// ░░░░░░█░█░░░░░░░░▄▀▀▄░▀░█░█▄▀▀▄░
// █▀▀█▄░█░█░░▀░░░░░█░░░▀▄▄█▄▀░░░█░
// ▀▄▄░▀██░█▄░▀░░░▄▄▀░░░░░░░░░░░░▀▄
// ░░▀█▄▄█░█░... | replace | 186 | 187 | 186 | 187 | 0 | |
p02893 | C++ | Runtime Error | // #define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
usi... | // #define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
usi... | replace | 361 | 362 | 361 | 362 | 0 | |
p02893 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for... | replace | 197 | 198 | 197 | 198 | TLE | |
p02893 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> class Modular {
public:
using Type = typename decay<... | #include <bits/stdc++.h>
using namespace std;
template <typename T> T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> class Modular {
public:
using Type = typename decay<... | replace | 273 | 274 | 273 | 274 | TLE | |
p02894 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
typedef long double db;
typedef long long ll;
const db pi = acos(-1.0);
int n, L, a[maxn];
ll w;
db x, y, X, Y;
int main() {
cin >> n >> L;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 1; i <= n; i++)
for (int... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3005;
typedef long double db;
typedef long long ll;
const db pi = acos(-1.0);
int n, L, a[maxn];
ll w;
db x, y, X, Y;
int main() {
cin >> n >> L;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 1; i <= n; i++)
for (int... | replace | 2 | 3 | 2 | 3 | 0 | |
p02894 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef unsigned ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef unsigned ... | replace | 16 | 17 | 16 | 17 | TLE | |
p02894 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 2005
const double PI = acos(-1.0);
typedef long long ll;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 3005
const double PI = acos(-1.0);
typedef long long ll;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c... | replace | 5 | 6 | 5 | 6 | 0 | |
p02894 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (register int i = a; i <= b; i++)
#define per(i, a, b) for (register int i = a; i >= b; i--)
using namespace std;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long long ll;
template <typename _T> inline void read(_T &f) {
f = 0;
_T fu = 1;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (register int i = a; i <= b; i++)
#define per(i, a, b) for (register int i = a; i >= b; i--)
using namespace std;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long long ll;
template <typename _T> inline void read(_T &f) {
f = 0;
_T fu = 1;
... | replace | 40 | 41 | 40 | 41 | 0 | |
p02894 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define per(i, r, l) for (int i = (r); i >= (l); --i)
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define per(i, r, l) for (int i = (r); i >= (l); --i)
using namespace ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02894 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define... | replace | 27 | 28 | 27 | 28 | 0 | |
p02895 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; i++)
typedef long long ll;
ll dp[22][22][22], isused[22][22][22];
char isok[22][22];
ll solve(int l, int mid, int r) {
if (r - l <= 0)
return 1;
if (mid <= l || mid >= r)
return 0;
if (isused[l][mid][r])
return d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; i++)
typedef long long ll;
ll dp[44][44][44], isused[44][44][44];
char isok[44][44];
ll solve(int l, int mid, int r) {
if (r - l <= 0)
return 1;
if (mid <= l || mid >= r)
return 0;
if (isused[l][mid][r])
return d... | replace | 4 | 6 | 4 | 6 | 0 | |
p02895 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
#define rll register ll
const int N = 45;
char e[N][N];
int n;
ll f[N][N][N], g[N][N][N];
inline void modify(ri i, ri j, ri k) {
for (ri p = j + 1; p < n; ++p)
if (e[p][k])
g[i][j][p] += f[i][j][k];
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
#define rll register ll
const int N = 45;
char e[N][N];
int n;
ll f[N][N][N], g[N][N][N];
inline void modify(ri i, ri j, ri k) {
for (ri p = j + 1; p < n; ++p)
if (e[p][k])
g[i][j][p] += f[i][j][k];
}
int main() {
... | replace | 25 | 26 | 25 | 26 | 0 | |
p02895 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 22;
int n;
string s[N];
typedef long long ll;
ll ans, f[N][N][N], g[N][N][N][N];
ll F(int l, int r, int p);
ll G(int a, int b, int c, int d) {
if (~g[a][b][c][d])
return g[a][b][c][d];
ll ret = 0;
for (int i = a; i <= b; i++) {
for (int j = c; j ... | #include <bits/stdc++.h>
using namespace std;
const int N = 42;
int n;
string s[N];
typedef long long ll;
ll ans, f[N][N][N], g[N][N][N][N];
ll F(int l, int r, int p);
ll G(int a, int b, int c, int d) {
if (~g[a][b][c][d])
return g[a][b][c][d];
ll ret = 0;
for (int i = a; i <= b; i++) {
for (int j = c; j ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02895 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char mp[41][45];
int n;
long long dp[41][41][41][41], dp2[41][41][41][41];
long long calc_dp2(int l, int r, int ll, int rr);
long long calc_dp(int l, int r, int ll, int rr);
long long calc_dp(int l, int r, int ll, int rr) {
if (dp[l][r][ll][rr] != -1)
return dp[l]... | #include <bits/stdc++.h>
using namespace std;
char mp[41][45];
int n;
long long dp[42][42][42][42], dp2[42][42][42][42];
long long calc_dp2(int l, int r, int ll, int rr);
long long calc_dp(int l, int r, int ll, int rr);
long long calc_dp(int l, int r, int ll, int rr) {
if (dp[l][r][ll][rr] != -1)
return dp[l]... | replace | 6 | 7 | 6 | 7 | 0 | |
p02895 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 25;
ll dp[MAX_N][MAX_N][MAX_N];
ll can[MAX_N][MAX_N];
int main() {
int n;
cin >> n;
n *= 2;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c;
cin >> c;
can[i][j] = c - '0';
}
}
... | #include <iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 45;
ll dp[MAX_N][MAX_N][MAX_N];
ll can[MAX_N][MAX_N];
int main() {
int n;
cin >> n;
n *= 2;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c;
cin >> c;
can[i][j] = c - '0';
}
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02895 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 25;
long long dp[MAXN][MAXN][MAXN];
int A[MAXN][MAXN];
char S[MAXN];
int n;
long long ans;
long long getAns(int l, int r, int c) {
if (dp[l][r][c] != -1)
return dp[l][r][c];
if (l == r)
return dp[l][r][c] = 1;
if (l == c || r == c)
retur... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 55;
long long dp[MAXN][MAXN][MAXN];
int A[MAXN][MAXN];
char S[MAXN];
int n;
long long ans;
long long getAns(int l, int r, int c) {
if (dp[l][r][c] != -1)
return dp[l][r][c];
if (l == r)
return dp[l][r][c] = 1;
if (l == c || r == c)
retur... | replace | 3 | 4 | 3 | 4 | 0 | |
p02895 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | replace | 75 | 76 | 75 | 76 | 0 | |
p02896 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define LD long double
using namespace std;
const int NN = 117;
const int MM = 100 + 117;
int read() {
int fl = 1, x;
char c;
for (c = getchar()... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define LD long double
using namespace std;
const int NN = 117;
const int MM = 100 + 117;
int read() {
int fl = 1, x;
char c;
for (c = getchar()... | replace | 61 | 62 | 61 | 62 | TLE | |
p02897 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed \
ios::sync_with_stdio(0); \
cin.tie(0);
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define speed \
ios::sync_with_stdio(0); \
cin.tie(0);
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endi... | replace | 14 | 15 | 14 | 15 | 0 | |
p02897 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1e9 + 7;
ll const maxn = 4e5 + 5;
ll const inf = 1e18;
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll powm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1e9 + 7;
ll const maxn = 4e5 + 5;
ll const inf = 1e18;
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll powm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {... | replace | 19 | 23 | 19 | 23 | 0 | |
p02897 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define FAST \
ios_base::sync_with_stdio(false), cin.tie(0), c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define FAST \
ios_base::sync_with_stdio(false), cin.tie(0), c... | replace | 22 | 23 | 22 | 23 | 0 | |
p02897 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define EPS 1e-7
#define LLMAX 9223372036854775807
#... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define EPS 1e-7
#define LLMAX 9223372036854775807
#... | delete | 49 | 53 | 49 | 49 | 0 | |
p02897 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
size_t n;
cin >> n;
double t = 0.0;
for (size_t i = 1; i <= n; ++i) {
if (i % 2 == 1)
t += 1.0;
}
auto... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
size_t n;
cin >> n;
double t = 0.0;
for (size_t i = 1; i <= n; ++i) {
if (i % 2 == 1)
t += 1.0;
}
auto... | replace | 22 | 23 | 22 | 23 | 1 | |
p02897 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define maxim (ll)1000000000000
#define PB push_back
#define MP make_pair
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define maxim (ll)1000000000000
#define PB push_back
#define MP make_pair
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n;
cin >> n;
ld ans = (ld)((n / 2) + (n ... | replace | 9 | 13 | 9 | 10 | 0 | |
p02897 | Python | Runtime Error | N = input()
if N % 2 == 0:
print((N / 2) / N)
else:
print(((N + 1) / 2) / N)
| N = int(input())
if N % 2 == 0:
print((N / 2) / N)
else:
print(((N + 1) / 2) / N)
| replace | 0 | 1 | 0 | 1 | TypeError: not all arguments converted during string formatting | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02897/Python/s639132796.py", line 3, in <module>
if N % 2 == 0:
TypeError: not all arguments converted during string formatting
|
p02897 | C++ | Runtime Error | #include <iostream>
int main() {
int n;
std::cin >> n;
return (n - n / 2) / (double)n;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
std::cout << (n - n / 2) / (double)n;
} | replace | 5 | 7 | 5 | 6 | 0 | |
p02897 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
// #include"testlib.h"
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
// #include"testlib.h"
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI... | replace | 38 | 39 | 38 | 39 | 0 | |
p02897 | C++ | Runtime Error | #include <iostream>
int main() {
int n;
std::cin >> n;
double ans;
if (n % 2 == 0)
ans = 0.5;
else
ans = (n / 2 + 1) / (n / 2);
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
double ans;
if (n % 2 == 0)
ans = 0.5;
else
ans = (double)(n / 2 + 1) / (double)n;
std::cout << ans << std::endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02897 | C++ | Runtime Error | #include <bits/stdc++.h>
#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 per(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define per1(i, n) for (int i = int(n); i > 0; i--)
#define foreach(i, n) for (auto &&i : n)
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
#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 per(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define per1(i, n) for (int i = int(n); i > 0; i--)
#define foreach(i, n) for (auto &&i : n)
#define all(x) (x).begin(), (x).end()
#def... | replace | 61 | 62 | 61 | 62 | 0 | |
p02897 | Python | Runtime Error | N = int(input())
nums = filter(lambda x: x % 2 != 0, range(1, N + 1))
print(len(nums) / float(N))
| N = int(input())
odds = list(filter(lambda x: x % 2 != 0, range(1, N + 1)))
print("{:.10f}".format(len(odds) / float(N)))
| replace | 1 | 3 | 1 | 3 | TypeError: object of type 'filter' has no len() | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02897/Python/s177857539.py", line 3, in <module>
print(len(nums) / float(N))
TypeError: object of type 'filter' has no len()
|
p02897 | Python | Runtime Error | n = int(input())
odd = (n + 1) // 2
ans = odd / n
print(f"{ans:.9f}")
| n = int(input())
odd = (n + 1) // 2
ans = odd / n
print("{:.9f}".format(ans))
| replace | 4 | 5 | 4 | 5 | 0 | |
p02897 | C++ | Runtime Error | #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define dbg(x) \
{ cerr... | #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define dbg(x) \
{ cerr... | replace | 35 | 36 | 35 | 38 | 0 | |
p02898 | Python | Runtime Error | # -*- coding: utf-8 -*-
n, k = map(int, input().split())
cnt = 0
h = list(map(int, input().split()))
for high in h:
if h >= k:
cnt += 1
print(cnt)
| # -*- coding: utf-8 -*-
n, k = map(int, input().split())
cnt = 0
h = list(map(int, input().split()))
for high in h:
if high >= k:
cnt += 1
print(cnt)
| replace | 8 | 9 | 8 | 9 | TypeError: '>=' not supported between instances of 'list' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02898/Python/s184020467.py", line 9, in <module>
if h >= k:
TypeError: '>=' not supported between instances of 'list' and 'int'
|
p02898 | Python | Runtime Error | n, k = map(int, input().split())
H = list(map(int, input().split()))
cnt = 0
for i in n:
if H[i] >= k:
cnt += 1
print(cnt)
| n, k = map(int, input().split())
H = list(map(int, input().split()))
cnt = 0
for i in range(n):
if H[i] >= k:
cnt += 1
print(cnt)
| replace | 3 | 4 | 3 | 4 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02898/Python/s127858228.py", line 4, in <module>
for i in n:
TypeError: 'int' object is not iterable
|
p02898 | Python | Runtime Error | n, k = map(int, input().split())
h = list(map(int, input().split()))
print(len(filter(lambda x: x >= k, h)))
| n, k = map(int, input().split())
h = list(map(int, input().split()))
print(len(list(filter(lambda x: x >= k, h))))
| replace | 2 | 3 | 2 | 3 | TypeError: object of type 'filter' has no len() | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02898/Python/s747999474.py", line 3, in <module>
print(len(filter(lambda x: x >= k, h)))
TypeError: object of type 'filter' has no len()
|
p02898 | Python | Runtime Error | N = int(input())
K = int(input())
h = list(map(int, input().split()))
count = 0
for i in h:
if i >= K:
count += 1
print(count)
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
count = 0
for i in h:
if i >= K:
count += 1
print(count)
| replace | 0 | 2 | 0 | 1 | ValueError: invalid literal for int() with base 10: '4 150' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02898/Python/s129159641.py", line 1, in <module>
N = int(input())
ValueError: invalid literal for int() with base 10: '4 150'
|
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k, cnt = 0;
int v[501];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] >= k)
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k, cnt = 0;
int v[1000000];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] >= k)
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using namespace std;
int main() {
int N, K;
vector<int> A(500);
cin >> N >> K;
int count = 0;
for (int ... | #include <iostream>
#include <vector>
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using namespace std;
int main() {
int N, K;
vector<int> A(100000);
cin >> N >> K;
int count = 0;
for (i... | replace | 9 | 10 | 9 | 10 | 0 | |
p02898 | Python | Runtime Error | N, K = map(int, input().split())
ar = list(map, input().split())
count = 0
for i in range(N):
if ar[i] >= K:
count += 1
print(count)
| N, K = map(int, input().split())
ar = list(map(int, input().split()))
count = 0
for i in range(N):
if ar[i] >= K:
count += 1
print(count)
| replace | 1 | 2 | 1 | 2 | TypeError: list expected at most 1 argument, got 2 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02898/Python/s440277663.py", line 2, in <module>
ar = list(map, input().split())
TypeError: list expected at most 1 argument, got 2
|
p02898 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K, h[500], count = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
if (h[i] >= K) {
count++;
}
}
printf("%d", count);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K, h[100000], count = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
if (h[i] >= K) {
count++;
}
}
printf("%d", count);
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RREP(i, n) for (int i = n; 0 <= i; --i)
#define FOR(i, start, end) for (int i = start; i < end; ++i)
#define RFOR(i, start, end) for (int i = start; end <= ... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RREP(i, n) for (int i = n; 0 <= i; --i)
#define FOR(i, start, end) for (int i = start; i < end; ++i)
#define RFOR(i, start, end) for (int i = start; end <= ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02898 | Python | Runtime Error | n = int(input())
min_height = int(input())
height = []
for _ in range(n):
height.append(int(input()))
height.sort(reverse=True)
cnt = 0
for h in height:
if h < min_height:
break
cnt += 1
print(cnt)
| n, min_height = map(int, input().split())
height = list(map(int, input().split()))
height.sort(reverse=True)
cnt = 0
for h in height:
if h < min_height:
break
cnt += 1
print(cnt)
| replace | 0 | 6 | 0 | 2 | ValueError: invalid literal for int() with base 10: '4 150' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02898/Python/s709157737.py", line 1, in <module>
n = int(input())
ValueError: invalid literal for int() with base 10: '4 150'
|
p02898 | C++ | Runtime Error | #include <stdio.h>
int main() {
int r = 0, i, n, k, h[10010];
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
for (i = 1; i <= n; i++) {
if (h[i] >= k) {
r++;
}
}
printf("%d", r);
return 0;
}
| #include <stdio.h>
int main() {
int r = 0, i, n, k, h[100100];
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
for (i = 1; i <= n; i++) {
if (h[i] >= k) {
r++;
}
}
printf("%d", r);
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (i... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (i... | replace | 23 | 24 | 23 | 24 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int N, K;
int h[510];
int res = 0;
cin >> N >> K;
rep(i, N) cin >> h[i];
rep(i, N) {
if (h[i] >= K)
res++;
}
cout << res << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int N, K;
int h[110000];
int res = 0;
cin >> N >> K;
rep(i, N) cin >> h[i];
rep(i, N) {
if (h[i] >= K)
res++;
}
cout << res << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define FOR(i, m, M) for (int i = m; i < M; i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[500];
bool flag = 0;
FOR(i, 0, N) { cin >> h[i]; }
sort(h, h + N, greater<int>());
FOR(j, 0, N) {
if (h[j] < K) {
cout << j << endl;
fl... | #include <algorithm>
#include <iostream>
#define FOR(i, m, M) for (int i = m; i < M; i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[100000];
bool flag = 0;
FOR(i, 0, N) { cin >> h[i]; }
sort(h, h + N, greater<int>());
FOR(j, 0, N) {
if (h[j] < K) {
cout << j << endl;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[1000], count = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100005], count = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k)
count++;
}
cout << count << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
int h[1000];
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= k) {
ans++;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= k) {
ans++;
}
}
cout << ans << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int h[550];
rep(i, n) { cin >> h[i]; }
int noreru = 0;
rep(j, n) {
if (h[j] >= k) {
noreru++;
}
}
cout << noreru << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) { cin >> h[i]; }
int noreru = 0;
rep(j, n) {
if (h[j] >= k) {
noreru++;
}
}
cout << noreru << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02898 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N, K;
int h[500];
int count = 0;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++) {
if (h[i] >= K)
count++;
}
cout << count;
} | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N, K;
int h[100000];
int count = 0;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++) {
if (h[i] >= K)
count++;
}
cout << count;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[k];
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= k)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= k)
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, c = 0, i;
int h[500];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
if (h[i] >= k) {
c++;
}
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, c = 0, i;
int h[100000];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
if (h[i] >= k) {
c++;
}
}
cout << c << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int k;
cin >> k;
int j = 0;
int h[500];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
if (k <= h[i]) {
j++;
}
}
cout << j;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int k;
cin >> k;
int j = 0;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
if (k <= h[i]) {
j++;
}
}
cout << j;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, K;
int array[10000] = {};
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> array[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (array[i] >= K) {
// 乗れる
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
int array[100000] = {};
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> array[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (array[i] >= K) {
// 乗れる
cnt++;
}
}
cout << cnt << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int h[510];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int cnt = 0;
for (int i = 0; i < N; ++i) {
if (h[i] >= K)
cnt++;
}
cout << cnt << endl;
}
| #include <iostream>
using namespace std;
int h[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int cnt = 0;
for (int i = 0; i < N; ++i) {
if (h[i] >= K)
cnt++;
}
cout << cnt << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02898 | 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, k, i, count;
vector<int> h(500);
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h.at(i);
}
count = 0;
for (i = 0; i < n; i++) {
if (h.at(i) >= k)
count++;
}
cout << count ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, k, i, count;
vector<int> h(100000);
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h.at(i);
}
count = 0;
for (i = 0; i < n; i++) {
if (h.at(i) >= k)
count++;
}
cout << cou... | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int count = 0;
vector<int> wtf(K);
for (int i = 0; i < N; i++) {
cin >> wtf.at(i);
if (wtf.at(i) >= K) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int count = 0;
vector<int> wtf(N);
for (int i = 0; i < N; i++) {
cin >> wtf.at(i);
if (wtf.at(i) >= K) {
count++;
}
}
cout << count << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int N, K, h[500], a;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
a = 0;
for (int i = 1; i <= N; i++) {
if (h[i] >= K) {
a = a + 1;
}
}
cout << a << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int N, K, h[100000], a;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
a = 0;
for (int i = 1; i <= N; i++) {
if (h[i] >= K) {
a = a + 1;
}
}
cout << a << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
int main() {
int n, k;
cin >> n >> k;
int h[k];
rep(i, n) cin >> h[i];
int ans = 0;
rep(i, n) {
if (h[i] >= k)
ans++;
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
int ans = 0;
rep(i, n) {
if (h[i] >= k)
ans++;
}
cout << ans <... | replace | 10 | 11 | 10 | 11 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
int height[100];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (height[i] >= K) {
count++;
}
}
cout << count << endl;
return 0;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
int height[100000];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> height[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (height[i] >= K) {
count++;
}
}
cout << count << endl;
return ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[500];
int result = 0;
for (int i = 0; i < N; i++) {
cin >> h[i];
if (h[i] >= K) {
result++;
}
}
cout << result << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[100000];
int result = 0;
for (int i = 0; i < N; i++) {
cin >> h[i];
if (h[i] >= K) {
result++;
}
}
cout << result << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[510];
for (int i = 0; i < n; i++)
cin >> h[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= k)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[100010];
for (int i = 0; i < n; i++)
cin >> h[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= k)
cnt++;
}
cout << cnt << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
if (h >= k)
ans++;
}
return ans;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int ans = 0;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
if (h >= k)
ans++;
}
cout << ans << endl;
}
| replace | 16 | 17 | 16 | 17 | 2 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
#define maxn (int)(1e5)
#define i64 long long
#define pii pair<i64, i64>
#define all(x) x.begin(), x.end()
#define LB(x, v) lower_bound(all(x), v) - x.begin()
#define fread() freopen("in.txt", "r", stdin);
using namespace std;
int h[110];
int solve(int n, int k) {
int ans = 0;
for (int i =... | #include <bits/stdc++.h>
#define maxn (int)(1e5)
#define i64 long long
#define pii pair<i64, i64>
#define all(x) x.begin(), x.end()
#define LB(x, v) lower_bound(all(x), v) - x.begin()
#define fread() freopen("in.txt", "r", stdin);
using namespace std;
int h[maxn + 2];
int solve(int n, int k) {
int ans = 0;
for (in... | replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
#define max 500
using namespace std;
int main() {
int n, k, i, ara[max], cnt = 0;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &ara[i]);
}
for (i = 0; i < n; i++) {
if (ara[i] >= k)
cnt++;
}
printf("%d", cnt);
}
| #include <bits/stdc++.h>
#define max 500
using namespace std;
int main() {
int n, k, i, ara[100005], cnt = 0;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &ara[i]);
}
for (i = 0; i < n; i++) {
if (ara[i] >= k)
cnt++;
}
printf("%d", cnt);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[1000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= k)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[200000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= k)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <queue>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int i, j, k;
long n, m, tmp;
int a[10000];
int num = 0;
string s[200000];
... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <queue>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int i, j, k;
long n, m, tmp;
int a[100000];
int num = 0;
string s[200000];
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02898 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
int h[1000];
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= k)
ans++;
}
cout << ans << endl;
} | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
int h[100002];
for (int i = 0; i < n; i++) {
cin >> h[i];
if (h[i] >= k)
ans++;
}
cout << ans << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main(void) {
int N, K... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main(void) {
int N, K... | replace | 21 | 22 | 21 | 22 | 0 | |
p02898 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n, k, h[500], i, cnt;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
cnt = 0;
for (i = 0; i < n; i++) {
if (k <= h[i]) {
cnt++;
}
}
printf("%d\n", cnt);
return 0;
}
| #include <stdio.h>
int main() {
int n, k, h[100000], i, cnt;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
cnt = 0;
for (i = 0; i < n; i++) {
if (k <= h[i]) {
cnt++;
}
}
printf("%d\n", cnt);
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
int K = 0;
int A = 0;
cin >> N >> K;
vector<int> H(K);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
for (int j = 0; j < N; j++) {
if (H.at(j) >= K) {
A += 1;
}
}
cout << A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
int K = 0;
int A = 0;
cin >> N >> K;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
for (int j = 0; j < N; j++) {
if (H.at(j) >= K) {
A += 1;
}
}
cout << A << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define for_... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define for_... | replace | 28 | 29 | 28 | 29 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int a[505];
int main() {
int n, m, cnt = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] >= m)
cnt++;
}
cout << cnt;
return 0;
} | #include <iostream>
using namespace std;
int a[100005];
int main() {
int n, m, cnt = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] >= m)
cnt++;
}
cout << cnt;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int h[500];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int h[(int)1e+5];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K)
ans++;
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | replace | 43 | 44 | 43 | 44 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
int k, a, cc;
cin >> n >> k;
vector<long> data(500);
for (long i = 0; i < n; i++) {
cin >> a;
data.at(i) = a;
}
cc = 0;
for (long i = 0; i < n; i++) {
if (data.at(i) >= k) {
cc++;
}
}
cout << cc << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
int k, a, cc;
cin >> n >> k;
vector<long> data(1000000);
for (long i = 0; i < n; i++) {
cin >> a;
data.at(i) = a;
}
cc = 0;
for (long i = 0; i < n; i++) {
if (data.at(i) >= k) {
cc++;
}
}
cout << cc << endl;
}... | replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
int i = 0;
while (h.at(i) >= K) {
i++;
if (i == N) {
break;
}
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
reverse(h.begin(), h.end());
int i = 0;
while (h.at(i) >= K) {
i++;
if (i == N) {
break;
}
}
cout <... | insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02898 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <... | // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <... | replace | 44 | 45 | 44 | 45 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
if (h.at(i) >= K)
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
if (h.at(i) >= K)
count++;
}
cout << count << endl;
}
| replace | 5 | 6 | 5 | 6 | -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)
|
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int odd(int n, int A[], int k) {
int i, j = 0;
for (i = 0; i < n; i++) {
if (A[i] >= k) {
j++;
}
}
return j;
}
int main() {
int p, u;
int c, B[1000], b;
cin >> p >> c;
for (u = 0; u < p; u++) {
cin >> B[u];
}
b = odd(p, B, c);
cout <... | #include <bits/stdc++.h>
using namespace std;
int odd(int n, int A[], int k) {
int i, j = 0;
for (i = 0; i < n; i++) {
if (A[i] >= k) {
j++;
}
}
return j;
}
int main() {
int p, u;
int c, B[100005], b;
cin >> p >> c;
for (u = 0; u < p; u++) {
cin >> B[u];
}
b = odd(p, B, c);
cout... | replace | 14 | 15 | 14 | 15 | 0 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int h[1000] = {};
int main() {
int N, K;
cin >> N >> K;
int cnt = 0;
rep(i, N) {
cin >> h[i];
if (h[i] >= K) {
cnt+... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int h[100010] = {};
int main() {
int N, K;
cin >> N >> K;
int cnt = 0;
rep(i, N) {
cin >> h[i];
if (h[i] >= K) {
cn... | replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace ::std;
int N, K;
int main() {
int h[505] = {0};
int ans = 0;
cin >> N >> K;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
if (h[i] >= K) {
++ans;
}
}
cout << ans;
return 0;
} | #include <iostream>
using namespace ::std;
int N, K;
int main() {
int h[100000] = {0};
int ans = 0;
cin >> N >> K;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
if (h[i] >= K) {
++ans;
}
}
cout << ans;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k;
int arr[50];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> arr[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (arr[i] >= k)
count++;
}
cout << count;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
int arr[100000];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> arr[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (arr[i] >= k)
count++;
}
cout << count;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[505], ilosc = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k) {
ilosc++;
}
}
cout << ilosc;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100005], ilosc = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= k) {
ilosc++;
}
}
cout << ilosc;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
in... | #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
in... | replace | 17 | 18 | 17 | 18 | 0 | |
p02898 | C++ | Time Limit Exceeded | #include <iostream>
int main(void) {
int n = 0, k = 0, a = 0;
scanf("%d", &n);
scanf("%d", &k);
int h[n + 1];
for (int i = 1; i = n; i++) {
scanf("%d", &h[i]);
if (h[i] >= k) {
a++;
}
}
printf("%d\n", a);
} | #include <iostream>
int main(void) {
int n = 0, k = 0, a = 0;
scanf("%d", &n);
scanf("%d", &k);
int h[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d", &h[i]);
if (h[i] >= k) {
a++;
}
}
printf("%d\n", a);
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// #include <tr1/unordered_map>
#include <iostream>
#define maxn 10005
#define M 1000000007
using namespace std;
// using namespace tr1;
int main() {
int n, k, num = 0;
scanf("%d%d", &n, &k);
int a[m... | #include <algorithm>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// #include <tr1/unordered_map>
#include <iostream>
#define maxn 100005
#define M 1000000007
using namespace std;
// using namespace tr1;
int main() {
int n, k, num = 0;
scanf("%d%d", &n, &k);
int a[... | replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int cnt = 0;
int a[505];
int main() {
int n, h;
cin >> n >> h;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (h <= a[i]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int cnt = 0;
int a[100005];
int main() {
int n, h;
cin >> n >> h;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (h <= a[i]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, k = 0;
cin >> n >> k;
assert(n > 0 && 10000 >= n);
assert(k > 0 && 500 >= k);
int answer = 0;
for (int i = 0; i < n; i++) {
int h = 0;
cin >> h;
assert(h > 0 && h <= 500);
if (h >= k)
answer++;
}
cout << answ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, k = 0;
cin >> n >> k;
assert(n > 0 && 100000 >= n);
assert(k > 0 && 500 >= k);
int answer = 0;
for (int i = 0; i < n; i++) {
int h = 0;
cin >> h;
assert(h > 0 && h <= 500);
if (h >= k)
answer++;
}
cout << ans... | replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
int h[11000];
cin >> n >> k;
rep(i, n) cin >> h[i];
int count = 0;
rep(i, n) {
if (h[i] >= k) {
count++;
}
}
cout << count << endl;... | #include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
int h[110000];
cin >> n >> k;
rep(i, n) cin >> h[i];
int count = 0;
rep(i, n) {
if (h[i] >= k) {
count++;
}
}
cout << count << endl... | replace | 8 | 9 | 8 | 9 | 0 | |
p02898 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, o, p, k, i, x = 0, y;
cin >> n >> k;
o = n;
p = n;
int h[i];
for (i = 0; i < o; i++) {
cin >> h[i];
}
for (y = 0; y < p; y++) {
if (h[y] >= k) {
x++;
}
}
cout << x << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, o, p, k, i, x = 0, y;
cin >> n >> k;
o = n;
p = n;
int h[100000];
for (i = 0; i < o; i++) {
cin >> h[i];
}
for (y = 0; y < p; y++) {
if (h[y] >= k) {
x++;
}
}
cout << x << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int h[550];
int cot = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; ++i) {
if (h[i] >= k)
++cot;
}
cout << cot;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int h[1000000];
int cot = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; ++i) {
if (h[i] >= k)
++cot;
}
cout << cot;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define m0(x) memset(x, 0, sizeof(x))
int A[1000];
int main() {
int n, k;
scanf("%d %d", &n, &k);
rep(i, n) scanf("%d", &A[i]);
int sum = 0;
rep(i, n) if (A[i] >= k) sum++;
printf("%d", sum);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define m0(x) memset(x, 0, sizeof(x))
int A[100000];
int main() {
int n, k;
scanf("%d %d", &n, &k);
rep(i, n) scanf("%d", &A[i]);
int sum = 0;
rep(i, n) if (A[i] >= k) sum++;
printf("%d", sum);
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02898 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(501);
for (int i = 0; i < N; i++)
cin >> h[i];
int ans = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K)
ans += 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(200000);
for (int i = 0; i < N; i++)
cin >> h[i];
int ans = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= K)
ans += 1;
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 |