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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02875 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
t... | replace | 77 | 78 | 77 | 78 | -11 | |
p02875 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | replace | 101 | 102 | 101 | 102 | 0 | |
p02875 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define pii pair<ll, ll>
#define X first
#define Y second
#define mp make_pair
typedef... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define pii pair<ll, ll>
#define X first
#define Y second
#define mp make_pair
typedef... | replace | 21 | 22 | 21 | 22 | 0 | |
p02875 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T, class U> void ckmin(T &a, U b) {
if (a > b)
a = b;
}
template <class T, class U> void ckmax(T &a, U b) {
if (a < b)
a = b;
}
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U> void ckmin(T &a, U b) {
if (a > b)
a = b;
}
template <class T, class U> void ckmax(T &a, U b) {
if (a < b)
a = b;
}
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se... | replace | 24 | 25 | 24 | 25 | -11 | |
p02875 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#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 repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loo... | #include <bits/stdc++.h>
using namespace std;
#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 repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loo... | replace | 110 | 111 | 110 | 112 | 0 | |
p02875 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &... | replace | 116 | 117 | 116 | 117 | 0 | |
p02875 | C++ | Runtime Error | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | replace | 369 | 370 | 369 | 370 | 0 | |
p02875 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
// #define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if ... | // #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
// #define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if ... | replace | 79 | 80 | 79 | 80 | 0 | |
p02875 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const int MOD = 998244353;
const int MX = 5000005;
int n;
ll ans = 1, k;
ll exp(ll b, ll n) {
ll res = 1;
for (; n; n /= 2, (b *= b) %= MOD)
if (n % 2)
(res *= b) %= MOD;
return res;
}
ll ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const int MOD = 998244353;
const int MX = 10000005;
int n;
ll ans = 1, k;
ll exp(ll b, ll n) {
ll res = 1;
for (; n; n /= 2, (b *= b) %= MOD)
if (n % 2)
(res *= b) %= MOD;
return res;
}
ll... | replace | 5 | 6 | 5 | 6 | 0 | |
p02875 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
struct ModInt {
using M = ModInt;
long long v;
ModInt(long long _v = 0) : v(_v % MOD + MOD) { norm(); }
M &norm() {
v = (v < MOD) ? v : v - MOD;
return *this;
}
M operator+(const M &x) const { return M(v + x.v); }
M operator-(const M &x) const { retur... | #include <bits/stdc++.h>
using namespace std;
struct ModInt {
using M = ModInt;
long long v;
ModInt(long long _v = 0) : v(_v % MOD + MOD) { norm(); }
M &norm() {
v = (v < MOD) ? v : v - MOD;
return *this;
}
M operator+(const M &x) const { return M(v + x.v); }
M operator-(const M &x) const { retur... | replace | 73 | 75 | 73 | 77 | TLE | |
p02875 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 2e5 + 10;
const int mod = 998244353;
int n;
ll poww(ll x, ll k) {
ll ans = 1;
while (k) {
if (k & 1)
ans = ans * x % mod;
x = x * x % mod;
k >>= 1;
}
return ans;
}
ll mul[maxn], inv[maxn], er[maxn], ans;
ll C(... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e7 + 10;
const int mod = 998244353;
int n;
ll poww(ll x, ll k) {
ll ans = 1;
while (k) {
if (k & 1)
ans = ans * x % mod;
x = x * x % mod;
k >>= 1;
}
return ans;
}
ll mul[maxn], inv[maxn], er[maxn], ans;
ll C(... | replace | 4 | 5 | 4 | 5 | 0 | |
p02875 | C++ | Time Limit Exceeded | #include <bits/stdc++.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>
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 | 110 | 110 | 110 | 114 | TLE | |
p02875 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
// #define ll __int128
// #define int ll
// #define int ll
// #define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
// #define ll __int128
// #define int ll
// #define int ll
// #define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
... | replace | 174 | 177 | 174 | 178 | TLE | |
p02875 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template ... | #include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <class T> ostream &prnt(ostream &out, T v) {
out << v.size() << '\n';
for (auto e : v)
out << e << ' ';
return out;
}
template <class T> ostream &operator<<(ostream &out, vector<T> v) {
return prnt(out, v);
}
template ... | replace | 43 | 44 | 43 | 44 | 0 | |
p02875 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll mod = 998244353;
ll mod_pow(ll a, ll b) {
a %= mod;
if (b == 0)
return 1;
if (b == 1)
return a;
ll res = mod_pow(a, b / 2) % mod;
res *= res;
res %= mod;
if (b % 2)
res *= a;
return... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
ll mod = 998244353;
ll mod_pow(ll a, ll b) {
a %= mod;
if (b == 0)
return 1;
if (b == 1)
return a;
ll res = mod_pow(a, b / 2) % mod;
res *= res;
res %= mod;
if (b % 2)
res *= a;
return... | replace | 46 | 47 | 46 | 47 | 0 | |
p02875 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#p... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#p... | replace | 71 | 72 | 71 | 72 | 0 | |
p02875 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
#define MOD (long)(998244353)
#define MAX 1000001 // 階乗をいくつまで計算するか
class modlong;
void computeAll(long n);
modlong modComb(long n, long k);
modlong modFact(long n);
class modlong... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
#define MOD (long)(998244353)
#define MAX 10000001 // 階乗をいくつまで計算するか
class modlong;
void computeAll(long n);
modlong modComb(long n, long k);
modlong modFact(long n);
class modlon... | replace | 11 | 12 | 11 | 12 | 0 | |
p02875 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll modinv(ll a, ll m) {
assert(m > 0);
if (m == 1)
return 0;
a %= m;
if (a < 0)
a += m;
assert(a != 0);
if (a == 1)
return 1;
return m - modinv(m, a) * m / a;
}
template <int MOD_> struct modnum {
private:
int v;
public:
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll modinv(ll a, ll m) {
assert(m > 0);
if (m == 1)
return 0;
a %= m;
if (a < 0)
a += m;
assert(a != 0);
if (a == 1)
return 1;
return m - modinv(m, a) * m / a;
}
template <int MOD_> struct modnum {
private:
int v;
public:
... | replace | 84 | 86 | 84 | 89 | TLE | |
p02875 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
const int mod = 998244353;
int n;
long long ans, ji[10000007];
long long qpow(long long a, long long b) {
long long res = 1;
long long now = a % mod;
while (b) {
if (b & 1)
res = res * now % mod;
now = now * now % mod;
b >>= 1;
}
return res;
}
void in... | #include <iostream>
using namespace std;
const int mod = 998244353;
int n;
long long ans, ji[10000007];
long long qpow(long long a, long long b) {
long long res = 1;
long long now = a % mod;
while (b) {
if (b & 1)
res = res * now % mod;
now = now * now % mod;
b >>= 1;
}
return res;
}
void in... | replace | 27 | 39 | 27 | 32 | TLE | |
p02876 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define a first
#define b second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i, u) for (register int i = head[u]; i; i = nxt[i])
#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;
ty... | #include <bits/stdc++.h>
#define a first
#define b second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i, u) for (register int i = head[u]; i; i = nxt[i])
#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;
ty... | replace | 72 | 73 | 72 | 73 | TLE | |
p02876 | C++ | Runtime Error | #include <bits/stdc++.h>
#define XX first
#define YY second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define REP rep
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(... | #include <bits/stdc++.h>
#define XX first
#define YY second
#define pb emplace_back
#define FOR(i, a, b) for (int(i) = (a); i < (b); ++(i))
#define EFOR(i, a, b) for (int(i) = (a); i <= (b); ++(i))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define REP rep
#define rrep(X, Y) for (int(X) = (Y)-1; (X) >= 0; --(... | replace | 132 | 134 | 132 | 136 | 0 | |
p02877 | C++ | Time Limit Exceeded | // Zory-2019
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pr pair<int, int>
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1ll << (x))
#define fo(i, l, r) ... | // Zory-2019
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pr pair<int, int>
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1ll << (x))
#define fo(i, l, r) ... | replace | 93 | 94 | 93 | 94 | TLE | |
p02877 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
template <class T> inline void read(T &x) {
static char ch;
while (!isdigit(ch = getchar()))
;
x = ch - '0';
while (isdigit(ch = getchar()))
x = x * 10 + ch - '0';
}
template <class T> inline void tense(T &x, const T &y) {
if (x > y)
x = y;
}
template <class T> inline v... | #include <bits/stdc++.h>
template <class T> inline void read(T &x) {
static char ch;
while (!isdigit(ch = getchar()))
;
x = ch - '0';
while (isdigit(ch = getchar()))
x = x * 10 + ch - '0';
}
template <class T> inline void tense(T &x, const T &y) {
if (x > y)
x = y;
}
template <class T> inline v... | delete | 53 | 56 | 53 | 53 | TLE | |
p02877 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100005;
inline int gi() {
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
int sum = 0;
while ('0' <= c && c <= '9')
sum = sum * 10 + c - 48, c = getchar();
return sum;
}
int n, a[maxn], ans, f[3], g[3... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200005;
inline int gi() {
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
int sum = 0;
while ('0' <= c && c <= '9')
sum = sum * 10 + c - 48, c = getchar();
return sum;
}
int n, a[maxn], ans, f[3], g[3... | replace | 4 | 5 | 4 | 5 | 0 | |
p02878 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef complex<ld> cd;
typedef vector<int> vi;
typed... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef complex<ld> cd;
typedef vector<int> vi;
typed... | replace | 285 | 286 | 285 | 286 | 0 | |
p02878 | C++ | Runtime Error | #include <bits/stdc++.h>
const int N = 1e7 + 5;
const int mod = 998244353;
int fra[N], inv[N];
int n, a, b, ans;
template <class T> inline T Min(T x, T y) { return x < y ? x : y; }
inline void add(int &x, int y) {
x += y;
x >= mod ? x -= mod : 0;
}
inline void dec(int &x, int y) {
x -= y;
x < 0 ? x += mod :... | #include <bits/stdc++.h>
const int N = 1e7 + 5;
const int mod = 998244353;
int fra[N], inv[N];
int n, a, b, ans;
template <class T> inline T Min(T x, T y) { return x < y ? x : y; }
inline void add(int &x, int y) {
x += y;
x >= mod ? x -= mod : 0;
}
inline void dec(int &x, int y) {
x -= y;
x < 0 ? x += mod :... | replace | 55 | 56 | 55 | 56 | 0 | |
p02878 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll modinv(ll a, ll m) {
assert(m > 0);
if (m == 1)
return 0;
a %= m;
if (a < 0)
a += m;
assert(a != 0);
if (a == 1)
return 1;
return m - modinv(m, a) * m / a;
}
template <int MOD_> struct modnum {
private:
int v;
public:
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll modinv(ll a, ll m) {
assert(m > 0);
if (m == 1)
return 0;
a %= m;
if (a < 0)
a += m;
assert(a != 0);
if (a == 1)
return 1;
return m - modinv(m, a) * m / a;
}
template <int MOD_> struct modnum {
private:
int v;
public:
... | replace | 95 | 96 | 95 | 96 | 0 | |
p02878 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e7 + 10, mod = 998244353;
inline int gi() {
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
int sum = 0;
while ('0' <= c && c <= '9')
sum = sum * 10 + c - 48, c = getchar();
return sum;
}
inline int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e7 + 10, mod = 998244353;
inline int gi() {
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
int sum = 0;
while ('0' <= c && c <= '9')
sum = sum * 10 + c - 48, c = getchar();
return sum;
}
inline int ... | replace | 33 | 34 | 33 | 34 | -11 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (0 < A && A < 10 && 0 < B && B < 10)
cout << A * B << endl;
else
return -1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (0 < A && A < 10 && 0 < B && B < 10)
cout << A * B << endl;
else
cout << -1 << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repA(a, i, n) for (int i = a; i < n; i++)
#define trav(a, x) for (auto &a : x)
#define fll(a) memset(a, 0, sizeof(a));
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define fst first
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repA(a, i, n) for (int i = a; i < n; i++)
#define trav(a, x) for (auto &a : x)
#define fll(a) memset(a, 0, sizeof(a));
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define fst first
#define... | replace | 27 | 28 | 27 | 28 | 0 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000;
signed main() {
int a, b;
cin >> a >> b;
if (a < 1 || a > 9)
return -1;
if (b < 1 || b > 9)
return -1;
cout << (a * b) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000;
signed main() {
int a, b;
cin >> a >> b;
if (a < 1 || a > 9) {
cout << -1 << endl;
return 0;
}
if (b < 1 || b > 9) {
cout << -1 ... | replace | 12 | 16 | 12 | 20 | 0 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define eps 1e-9
#define maxp 400
#define mod 1000000007
#define sin(s) scanf("%lld", &s);
#define sout(s) printf("%lld\n", s);
#define in(s) cin >> s
#define in2(a, b) cin >> a >> b
#define in3(a, b, c) cin >> a >> b >> c
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define eps 1e-9
#define maxp 400
#define mod 1000000007
#define sin(s) scanf("%lld", &s);
#define sout(s) printf("%lld\n", s);
#define in(s) cin >> s
#define in2(a, b) cin >> a >> b
#define in3(a, b, c) cin >> a >> b >> c
#define... | replace | 32 | 36 | 32 | 33 | 0 | |
p02879 | C++ | Runtime Error | // someshsingh22
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define loop(i, n) for (int i = 0; i < n; i++)
#define FAST \
ios_base::sync_with_stdio(false); \
cin.... | // someshsingh22
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define loop(i, n) for (int i = 0; i < n; i++)
#define FAST \
ios_base::sync_with_stdio(false); \
cin.... | delete | 29 | 34 | 29 | 29 | 0 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define max1 1000005
#define sz1 100001
#define mod 1000000007
#define moda 421412341324321ll
#define inf 1e18
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
typedef pair<ll, ll> pr;
#define rte ... | #include <bits/stdc++.h>
using namespace std;
#define max1 1000005
#define sz1 100001
#define mod 1000000007
#define moda 421412341324321ll
#define inf 1e18
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
typedef pair<ll, ll> pr;
#define rte ... | replace | 25 | 29 | 25 | 29 | 0 | |
p02879 | Python | Runtime Error | S = list(input())
if len(S) > 3:
print(int(S[0]) * int(S[1]))
else:
print(-1)
| S = list(input())
if len(S) < 4:
print(int(S[0]) * int(S[-1]))
else:
print(-1)
| replace | 1 | 3 | 1 | 3 | 0 | |
p02879 | C++ | Runtime Error | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (a > 9 || b > 9) {
std::cout << -1 << std::endl;
} else {
std::cout << a * b << std::endl;
}
return -1;
} | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (a > 9 || b > 9) {
std::cout << -1 << std::endl;
} else {
std::cout << a * b << std::endl;
}
} | delete | 10 | 11 | 10 | 10 | 255 | |
p02879 | Python | Runtime Error | a = int(input())
b = int(input())
if a >= 10 or b >= 10:
print(-1)
else:
print(a * b)
| a, b = map(int, input().split())
if a >= 10 or b >= 10:
print(-1)
else:
print(a * b)
| replace | 0 | 2 | 0 | 1 | ValueError: invalid literal for int() with base 10: '2 5' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02879/Python/s727358727.py", line 1, in <module>
a = int(input())
ValueError: invalid literal for int() with base 10: '2 5'
|
p02879 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1 << 30;
const int MAX = 1e5;
int n;
template <class T> inline void xmin(T &a, T b) { a = (a < b) ? a : b; }
template <class T> inline void xmax(T &a, T b) { a = (a > b) ? a : b; }
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1 << 30;
const int MAX = 1e5;
int n;
template <class T> inline void xmin(T &a, T b) { a = (a < b) ? a : b; }
template <class T> inline void xmax(T &a, T b) { a = (a > b) ? a : b; }
... | replace | 27 | 29 | 27 | 29 | TLE | |
p02879 | C++ | Runtime Error | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
//... | replace | 10 | 14 | 10 | 14 | 0 | Time: 0.000162
|
p02879 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a > 9 || b > 9) || (a < 1 || b < 1))
return -1;
cout << a * b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 9 || b > 9)
cout << -1 << endl;
else
cout << a * b << endl;
return 0;
}
| replace | 5 | 8 | 5 | 9 | 0 | |
p02879 | C++ | Runtime Error | // Nihal Mittal - nihal_47
// Shine Like a Sun , Burn like a Sun
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀
⠀⠀⠀⣼⣿... | // Nihal Mittal - nihal_47
// Shine Like a Sun , Burn like a Sun
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀
⠀⠀⠀⣼⣿... | replace | 40 | 44 | 40 | 41 | 0 | |
p02879 | C++ | Runtime Error | /* Don't try to hack it :|
_/﹋\_
(҂`_´)
<,︻╦╤─҉- - - - - - - - - - - - - - -
_/﹋\_
*/
#include <bits/stdc++.h>
#define ll long long
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
#define mp make_pair
#define tr(con) for (auto it ... | /* Don't try to hack it :|
_/﹋\_
(҂`_´)
<,︻╦╤─҉- - - - - - - - - - - - - - -
_/﹋\_
*/
#include <bits/stdc++.h>
#define ll long long
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
#define mp make_pair
#define tr(con) for (auto it ... | replace | 22 | 26 | 22 | 23 | 0 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
void solve() {
in... | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
void solve() {
in... | replace | 24 | 28 | 24 | 28 | 0 | |
p02879 | C++ | Time Limit Exceeded | #include <cstdio>
inline int in();
inline void wr(int);
int main(int argc, char **argv) {
#ifndef ONLINE_JUDGE
freopen("A.in", "r", stdin);
freopen("A.ans", "w", stdout);
#endif
register int a = in(), b = in();
if (a > 9 || b > 9) {
wr(-1), putchar('\n');
return 0;
}
wr(a * b), putchar('\n');
}
inli... | #include <cstdio>
inline int in();
inline void wr(int);
int main(int argc, char **argv) {
#ifndef ONLINE_JUDGE
// freopen("A.in","r",stdin);
// freopen("A.ans","w",stdout);
#endif
register int a = in(), b = in();
if (a > 9 || b > 9) {
wr(-1), putchar('\n');
return 0;
}
wr(a * b), putchar('\n');
}
inline... | replace | 5 | 7 | 5 | 7 | TLE | |
p02879 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tr1/unordered_map>
#include <tr1/unordered_set>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tr1/unordered_map>
#include <tr1/unordered_set>
#include <vector>
using names... | replace | 40 | 45 | 40 | 45 | 0 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000000
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vs vector<string>
#define psi pair<string, ll>
#define pii pair<ll, ll>
#define vsi vector<psi>
#define vii vector<pii>
#define mp make_pair
#define pb push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000000
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vs vector<string>
#define psi pair<string, ll>
#define pii pair<ll, ll>
#define vsi vector<psi>
#define vii vector<pii>
#define mp make_pair
#define pb push_back
#defin... | replace | 56 | 62 | 56 | 58 | 0 | |
p02879 | C++ | Runtime Error | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
return (A < 10 && B < 10) ? A * B : -1;
} | #include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
printf("%d", (A < 10 && B < 10) ? A * B : -1);
return 0;
} | replace | 4 | 5 | 4 | 6 | 10 | |
p02879 | C++ | Runtime Error | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
int ans;
if (a > 9 || b > 9) {
ans = -1;
} else {
ans = a * b;
}
std::cout << ans;
return 1;
} | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
int ans;
if (a > 9 || b > 9) {
ans = -1;
} else {
ans = a * b;
}
std::cout << ans;
return 0;
} | replace | 12 | 13 | 12 | 13 | 1 | |
p02879 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define ld long double
const int mod = 1e9 + 7;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define ld long double
const int mod = 1e9 + 7;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b;
cin >> a >> b;
if (a >= 1 && a <= 9 && b <= 9 && b >= 1) {
cout << a * b << "\... | delete | 12 | 17 | 12 | 12 | 0 | |
p02880 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i;
cin >> n;
for (i = 0; i < 10; i++)
if (n % i == 0 && n / i < 10)
break;
if (i == 10)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i;
cin >> n;
for (i = 1; i < 10; i++)
if (n % i == 0 && n / i < 10)
break;
if (i == 10)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool flag = false;
for (int i = 0; i < 9; i++) {
if (N % i == 0 && N / i <= 9) {
flag = 1;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool flag = false;
for (int i = 1; i <= 9; i++) {
if (N % i == 0 && N / i <= 9) {
flag = 1;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 9 | 10 | 9 | 10 | -8 | |
p02880 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(... | replace | 22 | 24 | 22 | 24 | TLE | |
p02880 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ANS(ans) cout << ans << endl
#define FLG(flg) \
if (flg) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ANS(ans) cout << ans << endl
#define FLG(flg) \
if (flg) ... | replace | 28 | 30 | 28 | 30 | TLE | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
for (int i = 1; i <= 9; i++) {
if ((N % i) == 0 && (N / i) < 10) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 1;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
for (int i = 1; i <= 9; i++) {
if ((N % i) == 0 && (N / i) < 10) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02880 | C++ | Runtime Error | #include <iostream>
int main() {
int N = 0;
std::cin >> N; // hold a number
for (int i = 0; i < 10; ++i)
if (N % i == 0 && N / i < 10) {
std::cout << "Yes" << std::endl;
return 0;
}
std::cout << "No" << std::endl;
return 0;
} | #include <iostream>
int main() {
int N = 0;
std::cin >> N; // hold a number
for (int i = 1; i < 10; ++i)
if (N % i == 0 && N / i < 10) {
std::cout << "Yes" << std::endl;
return 0;
}
std::cout << "No" << std::endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | -8 | |
p02880 | C++ | Runtime Error | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
//... | replace | 10 | 14 | 10 | 14 | TLE | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
if (a > 81) {
cout << "No" << endl;
return 0;
}
int cnt = 0;
rep(i, 9) {
if (a % i == 0 && (0 <= a / i && a / i <= 9))
cnt++;
}
if (cnt > 0)
cout << "... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
if (a > 81) {
cout << "No" << endl;
return 0;
}
int cnt = 0;
rep(i, 9) {
if (a % (i + 1) == 0 && (0 <= a / (i + 1) && a / (i + 1) <= 9))
cnt++;
}
if (cnt ... | replace | 14 | 15 | 14 | 15 | -8 | |
p02880 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool ans = false;
for (int i = 1; i < 10;) {
for (int j = 1; j < 10; j++) {
if (i * j == N)
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool ans = false;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
if (i * j == N)
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02880 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k = 9;
cin >> n;
for (k = 0; k >= 1; k--) {
if (n % k == 0)
break;
}
int c = n / k;
if (c >= 10)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, k = 9;
cin >> n;
for (k = 9; k >= 1; k--) {
if (n % k == 0)
break;
}
int c = n / k;
if (c >= 10)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | replace | 7 | 8 | 7 | 8 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 3;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 3;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#de... | delete | 34 | 38 | 34 | 34 | 0 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int i, N, judge = 0;
cin >> N;
rep(i, 9) {
if (N % i == 0 && N / i < 10) {
judge = 1;
break;
}
}
if (judge)
cout << "Yes";
el... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int i, N, judge = 0;
cin >> N;
rep(i, 9) {
if (N % (i + 1) == 0 && N / (i + 1) < 10) {
judge = 1;
break;
}
}
if (judge)
cout <<... | replace | 12 | 13 | 12 | 13 | -8 | |
p02880 | C++ | Runtime Error | #include <iostream>
int main() {
int n;
std::cin >> n;
bool ans = false;
for (int i = 1; i < 10; ++i) {
if (n % i == 0 && n / i < 10) {
ans = true;
break;
}
}
if (ans) {
std::cout << "Yes";
} else {
std::cout << "No";
}
return 1;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
bool ans = false;
for (int i = 1; i < 10; ++i) {
if (n % i == 0 && n / i < 10) {
ans = true;
break;
}
}
if (ans) {
std::cout << "Yes";
} else {
std::cout << "No";
}
return 0;
} | replace | 17 | 18 | 17 | 18 | 1 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> P;
int N;
int M = 0;
int count = 0;
cin >> N;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
P.at(M) = i * j;
M++;
}
}
for (int i = 0; i < 81; i++) {
if (N == P.at(i)) {
cout << "Yes" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> P(81);
int N;
int M = 0;
int count = 0;
cin >> N;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
P.at(M) = i * j;
M++;
}
}
for (int i = 0; i < 81; i++) {
if (N == P.at(i)) {
cout << "Ye... | replace | 4 | 5 | 4 | 5 | -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)
|
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, start, end) for (i64 i = start; i < end; i++)
#define newline std::cout << '\n';
#define newlinedx(num) \
for (int i = 0; i < num; i++) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, start, end) for (i64 i = start; i < end; i++)
#define newline std::cout << '\n';
#define newlinedx(num) \
for (int i = 0; i < num; i++) ... | replace | 46 | 47 | 46 | 47 | -8 | |
p02880 | C++ | Runtime Error | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<long long> vi;
typedef pair<long long, long long> pii;
#define pb push_bac... | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<long long> vi;
typedef pair<long long, long long> pii;
#define pb push_bac... | delete | 94 | 98 | 94 | 94 | 0 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (a); i > (b); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (a); i > (b); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | replace | 85 | 91 | 85 | 86 | 0 | |
p02880 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 10; i++) {
if (n % i == 0) {
if (n / i < 10) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 1;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 10; i++) {
if (n % i == 0) {
if (n / i < 10) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
int main() {
int n;
cin >> n;
rep(i, 10) {
if (n % i == 0 && n / i < 10) {
cout << "Yes";
return 0;
}
}
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
int main() {
int n;
cin >> n;
rep1(i, 10) {
if (n % i == 0 && n / i < 10) {
cout << "Yes";
return 0;
}
}
cout << "No";
return 0;
}
| replace | 9 | 10 | 9 | 10 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | replace | 35 | 36 | 35 | 36 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool flag = false;
for (int i = 0; i < 10; i++) {
if (N % i == 0 && N / i < 10) {
flag = true;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool flag = false;
for (int i = 1; i < 10; i++) {
if (N % i == 0 && N / i < 10) {
flag = true;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 7 | 8 | 7 | 8 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
if (i * j == n) {
cout << "Yes" << endl;
exit(1);
}
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
if (i * j == n) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | replace | 11 | 12 | 11 | 12 | 1 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool ans = false;
for (int i = 0; i < 10; i++) {
if (N % i == 0 && N / i < 10) {
ans = true;
break;
}
}
if (ans == true) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool ans = false;
for (int i = 1; i < 10; i++) {
if (N % i == 0 && N / i < 10) {
ans = true;
break;
}
}
if (ans == true) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | replace | 8 | 9 | 8 | 9 | -8 | |
p02880 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
if (i * j == n) {
cout << "Yes";
exit(1);
}
}
}
cout << "No";
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
if (i * j == n) {
cout << "Yes";
exit(0);
}
}
}
cout << "No";
}
| replace | 9 | 10 | 9 | 10 | 1 | |
p02880 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int a, b;
int c = 0;
cin >> a;
for (int i = 1; i < 10; ++i) {
for (int ii = 1; i < 10; ++ii) {
if (i * ii == a) {
c = 1;
}
}
}
if (c == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int a, b;
int c = 0;
cin >> a;
for (int i = 1; i < 10; i++) {
for (int ii = 1; ii < 10; ii++) {
if (i * ii == a) {
c = 1;
}
}
}
if (c == 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 8 | 10 | 8 | 10 | TLE | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOR(i, j, k, in) for (int i = j; i < k; i += in)
#define forn(i, n) for (int i = 0; i < n; i++)
#define RFOR(i, j, k, in) for (int i = j; i >= k; i -= in)
#define rforn(i, n) for (int i = n; i >= 0; i--)
#define REP(i, j... | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOR(i, j, k, in) for (int i = j; i < k; i += in)
#define forn(i, n) for (int i = 0; i < n; i++)
#define RFOR(i, j, k, in) for (int i = j; i >= k; i -= in)
#define rforn(i, n) for (int i = n; i >= 0; i--)
#define REP(i, j... | delete | 39 | 43 | 39 | 39 | 0 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fals... | replace | 35 | 36 | 35 | 36 | 0 | |
p02880 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a;
cin >> a;
for (int i = 0; i <= 9; i++) {
if (a % i == 0 && a / i <= 9 && a / i >= 1) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a;
cin >> a;
for (int i = 1; i <= 9; i++) {
if (a % i == 0 && a / i <= 9 && a / i >= 1) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | -8 | |
p02880 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define i64 int64_t
#define tos(x) to_string(x)
int main() {
int n;
cin >> n;
int a = 0;
ff(i, 0, 10) {
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define i64 int64_t
#define tos(x) to_string(x)
int main() {
int n;
cin >> n;
int a = 0;
ff(i, 1, 10) {
... | replace | 17 | 18 | 17 | 18 | -8 | |
p02880 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[101] = {0};
cin >> n;
for (int i = 0; i < 9; i++) {
for (int j = 0; i < 9; j++) {
a[(i + 1) * (j + 1) - 1]++;
}
}
if (a[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[101] = {0};
cin >> n;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
a[(i + 1) * (j + 1) - 1]++;
}
}
if (a[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02880 | C++ | Time Limit Exceeded | #include <cstdio>
#include <string>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int i;
int j;
bool canflag = false;
for (i = 1; i = 9; i++) {
for (j = 1; j = 9; j++) {
if (n % i == j)
canflag = true;
}
}
if (canflag == true)
printf("Yes");
else
printf... | #include <cstdio>
#include <string>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int i;
int j;
bool canflag = false;
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
if (i * j == n)
canflag = true;
}
}
if (canflag == true)
printf("Yes");
else
prin... | replace | 15 | 18 | 15 | 18 | TLE | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
... | replace | 91 | 92 | 91 | 96 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num = 0;
for (int i = 1; i < 100; i++) {
if (N != i && N % i == 0) {
num = N / i;
}
}
if (num <= 9 && N / num <= 9) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num = 0;
for (int i = 1; i <= 9; i++) {
if (N % i == 0) {
num = N / i;
}
}
if (num <= 9 && N / num <= 9) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 9 | 11 | 9 | 11 | 0 | |
p02880 | C++ | Runtime Error | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | replace | 715 | 716 | 715 | 716 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string ans = "No\n";
for (int i = 0; i < 10; i++) {
if (N % i == 0 && N / i < 10) {
ans = "Yes\n";
break;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string ans = "No\n";
for (int i = 1; i < 10; i++) {
if (N % i == 0 && N / i < 10) {
ans = "Yes\n";
break;
}
}
cout << ans;
} | replace | 6 | 7 | 6 | 7 | -8 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (auto i = (o); (i) < (n); ++(i))
#define FOR1(i, n) FOR(i, 1, n + 1)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (auto i = (n)-1; (i) >= 0; --i)
#define REPI(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define REPIR(itr, v) f... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (auto i = (o); (i) < (n); ++(i))
#define FOR1(i, n) FOR(i, 1, n + 1)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (auto i = (n)-1; (i) >= 0; --i)
#define REPI(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define REPIR(itr, v) f... | replace | 24 | 25 | 24 | 25 | 0 | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i, s, e) for (i = s; i < e; i++)
#define ms(arr, val) memset(arr, val, sizeof(arr))
using namespace std;
const int mxn = 2e5 + 1;
int main() {
ios_base::sync_with_stdio(false);
c... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i, s, e) for (i = s; i < e; i++)
#define ms(arr, val) memset(arr, val, sizeof(arr))
using namespace std;
const int mxn = 2e5 + 1;
int main() {
ios_base::sync_with_stdio(false);
c... | replace | 16 | 20 | 16 | 17 | 0 | |
p02880 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define itn int
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define itn int
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR... | replace | 26 | 27 | 26 | 27 | TLE | |
p02880 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int a = 0, N;
cin >> N;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
while (N == i * j) {
a++;
}
}
}
if (a == 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int a = 0, N;
cin >> N;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (N == i * j) {
a++;
}
}
}
if (a == 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#include <algorithm>
int main() {
int N = 81;
int a[N];
rep(i, N) {
rep(j, N) { a[N * i + j] = (i + 1) * (j + 1); }
}
int tf = 0;
int x;
cin >> x;
rep(i, N * N) {
if (x == a[i]... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#include <algorithm>
int main() {
int N = 9;
int a[N * N];
rep(i, N) {
rep(j, N) { a[N * i + j] = (i + 1) * (j + 1); }
}
int tf = 0;
int x;
cin >> x;
rep(i, N * N) {
if (x == a... | replace | 7 | 9 | 7 | 9 | -11 | |
p02880 | Python | Runtime Error | n = int(input().split())
a = []
for i in range(1, 10):
for j in range(1, 10):
a.append(i * j)
if n in a:
print("Yes")
else:
print("No")
| n = int(input())
a = []
for i in range(1, 10):
for j in range(1, 10):
a.append(i * j)
if n in a:
print("Yes")
else:
print("No")
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02880/Python/s433972108.py", line 1, in <module>
n = int(input().split())
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
p02880 | Python | Runtime Error | N = int(input())
for i in range(1, 10):
if N % i == 0 and N / i <= 9:
print("Yes")
exit(1)
print("No")
| N = int(input())
for i in range(1, 10):
if N % i == 0 and N / i <= 9:
print("Yes")
exit()
print("No")
| replace | 5 | 6 | 5 | 6 | 1 | |
p02880 | Python | Runtime Error | n = int(input())
if n > 81:
print("No")
else:
is_ok = False
for x in range(1, 10):
if n % x == 0 and n // x <= 9:
is_ok = True
break
if is_ok:
print("Yes")
else:
print("No")
| n = int(input())
if n > 81:
print("No")
else:
is_ok = False
for x in range(1, 10):
if n % x == 0 and n // x <= 9:
is_ok = True
break
if is_ok:
print("Yes")
else:
print("No")
| replace | 9 | 14 | 9 | 13 | 0 | |
p02880 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool flag = false;
for (int i = 1; i < 100; i++) {
for (int k = 1; k < 100; i++) {
if (n == (i * k)) {
flag = true;
}
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool flag = false;
for (int i = 1; i < 10; i++) {
for (int k = 1; k < 10; k++) {
if (n == (i * k)) {
flag = true;
}
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
... | replace | 11 | 13 | 11 | 13 | TLE | |
p02880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | replace | 146 | 147 | 146 | 147 | -4 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
ll n;
cin >> n;
ll mn = LLONG_MAX;
for (ll i = 1; i <= n / 2; i++) {
if (n % i == 0) {
ll a = i - 1, b = n / i - 1;
mn = min(mn, a + b);
}
}
cout << mn << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void) {
ll n;
cin >> n;
ll mn = LLONG_MAX;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ll a = i - 1, b = n / i - 1;
mn = min(mn, a + b);
}
}
cout << mn << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e12;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = INF;
for (ll i = 1; i <= n / 2; i++) {
if (n % i == 0) {
ans = min(ans, i + n / i - 2);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e12;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = INF;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, i + n / i - 2);
}
}
cout << ans << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, s, N) for (int i = s; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
ll ans = 0;
int main() {
ll N;
cin >> N;
REP(i, 1, N / 2 + 1) {
if (N % i == 0) {
if (N / i - i >= 0) {
ans = i + N / i - 2;
} el... | #include <bits/stdc++.h>
#define REP(i, s, N) for (int i = s; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
ll ans = 0;
int main() {
ll N;
cin >> N;
REP(i, 1, sqrt(N) + 1) {
if (N % i == 0) {
if (N / i - i >= 0) {
ans = i + N / i - 2;
} ... | replace | 13 | 14 | 13 | 14 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
int main() {
long long int i, j, v, count = 1000000000000;
long long int a = 0;
cin >> v;
for (i = 1; i <= v / 2; i++) {
if (v % i == 0) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
int main() {
long long int i, j, v, count = 1000000000000;
long long int a = 0;
cin >> v;
for (i = 1; i * i <= v; i++) {
if (v % i == 0) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
#define ll long long
const int N = 1e6 + 10;
using namespace std;
ll n;
int main() {
cin >> n;
ll ans = n + 1;
for (int i = 1; i * i < n; i++) {
if (n % i == 0) ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
#define ll long long
const int N = 1e6 + 10;
using namespace std;
ll n;
int main() {
cin >> n;
ll ans = n + 1;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) ... | replace | 16 | 17 | 16 | 17 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll ans = n - 1;
f... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll ans = n - 1;
f... | replace | 22 | 23 | 22 | 23 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.