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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02589 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
int n;
string s[202020];
int l[202020];
int b[202020];
int tr[1222333][26];
int tc;
int th[1222333][26];
void add(int i, int k) {
int u = 0;
for (int j = k; j >= 1; j--) {
for (int h = 0; h < 26; h++) {
if (b[j] & (1 << h))
th[u][... | #include <iostream>
using namespace std;
typedef long long ll;
int n;
string s[202020];
int l[202020];
int b[1222333];
int tr[1222333][26];
int tc;
int th[1222333][26];
void add(int i, int k) {
int u = 0;
for (int j = k; j >= 1; j--) {
for (int h = 0; h < 26; h++) {
if (b[j] & (1 << h))
th[u]... | replace | 9 | 10 | 9 | 10 | -11 | |
p02589 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
int ch[1000010][26], pr[1000010];
int ct[1000010], ex[100010][26];
bool fn[100010];
int N;
void add(int i, char *s) {
// printf("%d %c\n",i,*s);
if (*s == 0) {
fn[i] = true;
} else if (ch[i][(*s) - 'a'] == -1) {
ch[i][(*s) - 'a'] = N;
for (int x = 0; x < 26; x++)... | #include <cstdio>
#include <cstring>
int ch[1000010][26], pr[1000010];
int ct[1000010], ex[1000010][26];
bool fn[1000010];
int N;
void add(int i, char *s) {
// printf("%d %c\n",i,*s);
if (*s == 0) {
fn[i] = true;
} else if (ch[i][(*s) - 'a'] == -1) {
ch[i][(*s) - 'a'] = N;
for (int x = 0; x < 26; x+... | replace | 4 | 6 | 4 | 6 | -11 | |
p02589 | C++ | Runtime Error | // Coded by Abhijay Mitra
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <vector>
// ... | // Coded by Abhijay Mitra
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <vector>
// ... | replace | 40 | 41 | 40 | 41 | 0 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define idfc \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
//:/
#define pb push_back
#define mp make_pair
#define nt _ll128
#define ld double
long doub... | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define idfc \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
//:/
#define pb push_back
#define mp make_pair
#define nt _ll128
#define ld double
long doub... | replace | 14 | 15 | 14 | 15 | 0 | |
p02589 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
const int N = 200005;
const int M = 1000005;
void getint(int &num) {
cha... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
const int N = 200005;
const int M = 1000005;
void getint(int &num) {
cha... | replace | 29 | 30 | 29 | 30 | -11 | |
p02589 | C++ | Time Limit Exceeded | /* #region header */
#ifdef LOCAL
#include "/Users/takakurashokichi/Desktop/atcoder/cxx-prettyprint-master/prettyprint.hpp"
#define debug(x) cout << x << endl
#else
#define debug(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
using ull = unsign... | /* #region header */
#ifdef LOCAL
#include "/Users/takakurashokichi/Desktop/atcoder/cxx-prettyprint-master/prettyprint.hpp"
#define debug(x) cout << x << endl
#else
#define debug(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
using ull = unsign... | replace | 328 | 330 | 328 | 332 | TLE | |
p02589 | C++ | Runtime Error | /*
In the name of ALLAH
Author : Raashid Anwar
*/
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int M1 = 998244353;
const int M2 = 1000000007;
int trie[200000][26];
int cnt[2000000][26];
int tot;
void insert(string s) {
reverse(s.begin(), s.end());
int n = s.size();
int a[26] = {... | /*
In the name of ALLAH
Author : Raashid Anwar
*/
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int M1 = 998244353;
const int M2 = 1000000007;
int trie[2000000][26];
int cnt[2000000][26];
int tot;
void insert(string s) {
reverse(s.begin(), s.end());
int n = s.size();
int a[26] = ... | replace | 12 | 13 | 12 | 13 | -11 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vvi = vector<vi>;
#define all(a) a.begin(), a.end()
#define pb push_back
void solve() {
int n;
cin >> n;
vector<pair<string, char>> vec(n);
for (int i = 0; i < n; i++) {
string s;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vvi = vector<vi>;
#define all(a) a.begin(), a.end()
#define pb push_back
void solve() {
int n;
cin >> n;
vector<pair<string, char>> vec(n);
for (int i = 0; i < n; i++) {
string s;
... | replace | 49 | 50 | 49 | 51 | 0 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 100100;
const int Q = 1000100;
using namespace std;
int n;
string s[N];
int G;
int t[Q][26];
int f[Q];
bool good[Q][26];
int main() {
ios_base::sync_with_stdio(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", std... | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 200100;
const int Q = 1000100;
using namespace std;
int n;
string s[N];
int G;
int t[Q][26];
int f[Q];
bool good[Q][26];
int main() {
ios_base::sync_with_stdio(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", std... | replace | 5 | 6 | 5 | 6 | -11 | |
p02589 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int n;
#define Maxn 200010
#define V 1000010
char ch[Maxn];
int len;
char *str[Maxn];
int L[Maxn];
int *sum[26][Maxn];
struct Node {
int son[26], sum;
} tree[V];
int root = 0, cnt = 0;
void Insert(... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int n;
#define Maxn 200010
#define V 1000010
char ch[V];
int len;
char *str[Maxn];
int L[Maxn];
int *sum[26][Maxn];
struct Node {
int son[26], sum;
} tree[V];
int root = 0, cnt = 0;
void Insert(int... | replace | 9 | 10 | 9 | 10 | -11 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 2e5 + 5;
int nxt[N][26], cnt[N][26], cur = 0;
void insert(string s) {
vector<int> c(26, 0);
int idx = 0;
for (auto i : s)
c[i - 'a']++;
for (int j = 0; j < 26; j++)
cnt[idx][j] += (c[j] > 0);
for (auto i : s) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 1e6 + 5;
int nxt[N][26], cnt[N][26], cur = 0;
void insert(string s) {
vector<int> c(26, 0);
int idx = 0;
for (auto i : s)
c[i - 'a']++;
for (int j = 0; j < 26; j++)
cnt[idx][j] += (c[j] > 0);
for (auto i : s) {
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02589 | C++ | Time Limit Exceeded | // By TheOneYouWant
#pragma GCC optimize("-O2")
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define f... | // By TheOneYouWant
#pragma GCC optimize("-O2")
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define f... | replace | 103 | 104 | 103 | 107 | TLE | |
p02589 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | replace | 116 | 117 | 116 | 123 | TLE | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int max_n = 202222, inf = 1000111222;
const int max_v = 1000111;
const int max_c = 27;
char buf[max_n];
string read() {
scanf("%s", buf);
return buf;
}
int n;
int first, nxt[max_v][max_c], cnt[max_v][max_c], tot[max_c];
string s[max_n];
long long ans;
void a... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 202222, inf = 1000111222;
const int max_v = 1000111;
const int max_c = 27;
char buf[max_v];
string read() {
scanf("%s", buf);
return buf;
}
int n;
int first, nxt[max_v][max_c], cnt[max_v][max_c], tot[max_c];
string s[max_n];
long long ans;
void a... | replace | 8 | 9 | 8 | 9 | -11 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long n, cur, pas, b[N], endz[N * 10][30], aft[N * 10][30], k, ans;
string s[N];
bool ss(string s1, string s2) { return s1.size() < s2.size(); }
int get() {
int u = 0, pas = 0;
b[0] = 1ll << (s[k][0] - 'a');
for (int i = 1; i < s[k].size(); ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long n, cur, pas, b[5 * N], endz[N * 10][30], aft[N * 10][30], k, ans;
string s[N];
bool ss(string s1, string s2) { return s1.size() < s2.size(); }
int get() {
int u = 0, pas = 0;
b[0] = 1ll << (s[k][0] - 'a');
for (int i = 1; i < s[k].size... | replace | 3 | 4 | 3 | 4 | -11 | |
p02589 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | replace | 102 | 103 | 102 | 105 | TLE | |
p02589 | C++ | Time Limit Exceeded | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 79 | 80 | 79 | 80 | TLE | |
p02589 | C++ | Runtime Error | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#... | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#... | replace | 68 | 69 | 68 | 69 | 0 | |
p02589 | C++ | Runtime Error |
#pragma comment(linker, "/STACK: 16777216")
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end()
#define pb push_back
using namespace std;
void dout() { cerr << endl; }
// typedef long long ll;
template <typename Head, typename... Tail> void dout(Head H, Tail... T... |
#pragma comment(linker, "/STACK: 16777216")
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end()
#define pb push_back
using namespace std;
void dout() { cerr << endl; }
// typedef long long ll;
template <typename Head, typename... Tail> void dout(Head H, Tail... T... | replace | 72 | 73 | 72 | 73 | 0 | |
p02589 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned ll
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const in... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned ll
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const in... | replace | 55 | 56 | 55 | 59 | TLE | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAX_N = 2e5 + 5;
int N;
string s[MAX_N];
int ch[MAX_N][26];
int ed[MAX_N], tot = 1;
void ins(string s) {
int o = 1;
for (int i = 0; i < (int)s.length(); i++) {
int c = s[i] - 'a';
if (!ch[o][c])
ch[o][c] = ++tot;
o = ch[... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAX_N = 2e6 + 5;
int N;
string s[MAX_N];
int ch[MAX_N][26];
int ed[MAX_N], tot = 1;
void ins(string s) {
int o = 1;
for (int i = 0; i < (int)s.length(); i++) {
int c = s[i] - 'a';
if (!ch[o][c])
ch[o][c] = ++tot;
o = ch[... | replace | 3 | 4 | 3 | 4 | 0 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pii pair<int, int>
#define pb emplace_back
#define pf emplace_front
#define mp make_pair
#define ld long double
#define all(x) x.begin(), x.end()
#define uniq(x) sort(all(x)), x.resize(unique(all(x)) - x.beg... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pii pair<int, int>
#define pb emplace_back
#define pf emplace_front
#define mp make_pair
#define ld long double
#define all(x) x.begin(), x.end()
#define uniq(x) sort(all(x)), x.resize(unique(all(x)) - x.beg... | replace | 15 | 16 | 15 | 16 | 0 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fir first
#define sec second
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrp(i, a, b) for (int i = (a); i >= (b); --i)
#define gc() getchar()
template <typename tp> inline void read(tp &x) {
x = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fir first
#define sec second
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrp(i, a, b) for (int i = (a); i >= (b); --i)
#define gc() getchar()
template <typename tp> inline void read(tp &x) {
x = 0... | replace | 27 | 28 | 27 | 28 | -11 | |
p02589 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N;
string s[200010];
char tmp[200010];
typedef long long LL;
bool vis[1000010][26];
int ch[1000010][26];
bool isend[1000010];
int tot = 1;
long long ans = 0;
void ins(string s) {
int n = s.length();
for (int i = 0; i < 26; i++)
vis[0][i] = (s[0] - 'a' == i);
... | #include <bits/stdc++.h>
using namespace std;
int N;
string s[200010];
char tmp[1000010];
typedef long long LL;
bool vis[1000010][26];
int ch[1000010][26];
bool isend[1000010];
int tot = 1;
long long ans = 0;
void ins(string s) {
int n = s.length();
for (int i = 0; i < 26; i++)
vis[0][i] = (s[0] - 'a' == i);... | replace | 6 | 7 | 6 | 7 | -11 | |
p02589 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (... | delete | 136 | 137 | 136 | 136 | TLE | |
p02590 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
constexpr int64 P = 200003;
using Complex = complex<double>;
// Reference: http://www.prefield.com/algorithm/math/fft.html
vector<Complex> DFT(const vector<Complex> &p, int n, int sign = 1) {
const double theta = 2.0 ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
constexpr int64 P = 200003;
using Complex = complex<double>;
// Reference: http://www.prefield.com/algorithm/math/fft.html
vector<Complex> DFT(const vector<Complex> &p, int n, int sign = 1) {
const double theta = 2.0 ... | insert | 82 | 82 | 82 | 83 | TLE | |
p02590 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | replace | 126 | 127 | 126 | 127 | TLE | |
p02590 | C++ | Runtime Error | /**
* @brief atcoder
* @author yao
*/
#include <algorithm>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <utility>
#define ft first
#define sd second
#ifdef DBG
#define dbg_pri(x...) fprintf(stderr, x)
#else
#define dbg_pri(x...) 0
#define... | /**
* @brief atcoder
* @author yao
*/
#include <algorithm>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <utility>
#define ft first
#define sd second
#ifdef DBG
#define dbg_pri(x...) fprintf(stderr, x)
#else
#define dbg_pri(x...) 0
#define... | replace | 99 | 106 | 99 | 105 | 0 | |
p02590 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD @
#define ADD(X, Y) ((X) = ((X) + (Y) % MOD) % MOD)
typedef long long i64... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD @
#define ADD(X, Y) ((X) = ((X) + (Y) % MOD) % MOD)
typedef long long i64... | delete | 127 | 129 | 127 | 127 | TLE | |
p02591 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | replace | 62 | 68 | 62 | 65 | 0 | |
p02591 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MX = 1 << 18, md = 1000000007;
unordered_map<int, int> here[18];
bool old[18];
int a[MX];
int main() {
int h = 18;
ignore = scanf("%d", &h);
int n = 1 << (h - 1);
for (int i = 0; i < n; i++)
ignore = scanf("%d", a + i);
// srand(42);
// iota(... | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int MX = 1 << 18, md = 1000000007;
unordered_map<int, int> here[18];
bool old[18];
int a[MX];
int main() {
int h = 18;
ignore = scanf("%d", &h);
int n = 1 <... | insert | 0 | 0 | 0 | 4 | TLE | |
p02591 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int const p = 1e9 + 7;
int c[1000005], w[1000005], lg2[100005];
int mod(int x) { return x >= p ? x - p : x; }
int main() {
int h, ans = 0;
scanf("%d", &h);
for (int i = (1 << (h - 1)); i < (1 << h); i++)
scanf("%d", &c[i]), c[i] += (1 << (h - 1)) - 1;
for (int i... | #include <bits/stdc++.h>
using namespace std;
int const p = 1e9 + 7;
int c[1000005], w[1000005], lg2[1000005];
int mod(int x) { return x >= p ? x - p : x; }
int main() {
int h, ans = 0;
scanf("%d", &h);
for (int i = (1 << (h - 1)); i < (1 << h); i++)
scanf("%d", &c[i]), c[i] += (1 << (h - 1)) - 1;
for (int ... | replace | 3 | 4 | 3 | 4 | TLE | |
p02591 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T... | insert | 292 | 292 | 292 | 293 | TLE | |
p02591 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
using namespace std;
const int maxn = 234567;
const int M = 1000000007;
typedef long long ll;
typedef pair<int, ll> pi;
void add(ll &x, ll y) {
x += y;
if (x >= M)
x -= M;
}
int n, h, p[maxn];
vector<pi> v[2];
ll ans, cnt[2][maxn];
v... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
using namespace std;
const int maxn = 434567;
const int M = 1000000007;
typedef long long ll;
typedef pair<int, ll> pi;
void add(ll &x, ll y) {
x += y;
if (x >= M)
x -= M;
}
int n, h, p[maxn];
vector<pi> v[2];
ll ans, cnt[2][maxn];
v... | replace | 5 | 6 | 5 | 6 | 0 | |
p02591 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
#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 (reg... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
#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 (reg... | delete | 82 | 83 | 82 | 82 | TLE | |
p02593 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define db long double
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
struct PermutationTree {
static const int N = 200007;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<... | #include <bits/stdc++.h>
#define ll long long
#define db long double
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
struct PermutationTree {
static const int N = 400007;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<... | replace | 13 | 14 | 13 | 14 | 0 | |
p02594 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
string ret;
if (x >= 30) {
ret = "Yes";
} else {
ret = "No";
}
cout << ret << endl;
return true;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
string ret;
if (x >= 30) {
ret = "Yes";
} else {
ret = "No";
}
cout << ret << endl;
} | delete | 15 | 16 | 15 | 15 | 1 | |
p02594 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n >= 30) {
cout << "Yes" << endl;
break;
} else
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n >= 30)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 4 | 12 | 4 | 10 | TLE | |
p02594 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define sl set<ll>
#define vs vector<string>
#define vl vector<ll>
#define vi vector<int>
#define vpl vector<pair<ll, ll>>
#define pb push_back
#define PI 3.14159265358979323846
#define ll long long
#define ld long double
#define endl "\n"
#define rep... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define sl set<ll>
#define vs vector<string>
#define vl vector<ll>
#define vi vector<int>
#define vpl vector<pair<ll, ll>>
#define pb push_back
#define PI 3.14159265358979323846
#define ll long long
#define ld long double
#define endl "\n"
#define rep... | replace | 28 | 53 | 28 | 34 | TLE | |
p02594 | C++ | Memory Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define in(x, l, r) (ll)(l) <= (x) && (x) < (ll)(r)
int main() {
vector<int> v(300000000, 0);
int X;
cin >> X;
if (X >= 30)... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define in(x, l, r) (ll)(l) <= (x) && (x) < (ll)(r)
int main() {
vector<int> v(250000000, 0);
int X;
cin >> X;
if (X >= 30)... | replace | 9 | 10 | 9 | 10 | MLE | |
p02594 | Python | Runtime Error | x = input()
if x >= 30:
print("Yes")
else:
print("No")
| x = int(input())
if x >= 30:
print("Yes")
else:
print("No")
| replace | 0 | 1 | 0 | 1 | TypeError: '>=' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02594/Python/s522477833.py", line 3, in <module>
if x >= 30:
TypeError: '>=' not supported between instances of 'str' and 'int'
|
p02594 | Python | Runtime Error | X = int(input().split())
if X >= 30:
print("Yes")
else:
print("No")
| X = int(input())
if X >= 30:
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/p02594/Python/s217813658.py", line 1, in <module>
X = int(input().split())
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
p02594 | Python | Runtime Error | x = input()
if x >= 30:
print("Yes")
else:
print("No")
| x = int(input())
if x >= 30:
print("Yes")
else:
print("No")
| replace | 0 | 1 | 0 | 1 | TypeError: '>=' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02594/Python/s624570905.py", line 2, in <module>
if x >= 30:
TypeError: '>=' not supported between instances of 'str' and 'int'
|
p02594 | Python | Runtime Error | x = input()
if x >= 30:
print("Yes")
else:
print("No")
| x = input()
if int(x) >= 30:
print("Yes")
else:
print("No")
| replace | 1 | 2 | 1 | 2 | TypeError: '>=' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02594/Python/s511585247.py", line 2, in <module>
if x >= 30:
TypeError: '>=' not supported between instances of 'str' and 'int'
|
p02594 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, n, a) for (ll i = n - 1; i >= a; i--)
#define nl "\n"
#define LLMAX 1e18
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pll p... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, n, a) for (ll i = n - 1; i >= a; i--)
#define nl "\n"
#define LLMAX 1e18
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pll p... | replace | 43 | 44 | 43 | 44 | 0 | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
#define FORA(i, I) for (const auto &i : I)
#... | replace | 16 | 18 | 16 | 18 | 0 | |
p02595 | C++ | Runtime Error | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, count = 0;
double X[20000], Y[20000], D, x;
cin >> N;
cin >> D;
for (int i = 0; i < N; i++) {
cin >> X[i];
cin >> Y[i];
x = X[i] * X[i] + Y[i] * Y[i];
x = sqrt(x);
if (D >= x)
count++;
}
cout << count... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, count = 0;
static double X[200000], Y[200000];
double D, x;
cin >> N;
cin >> D;
for (int i = 0; i < N; i++) {
cin >> X[i];
cin >> Y[i];
x = X[i] * X[i] + Y[i] * Y[i];
x = sqrt(x);
if (D >= x)
count++;
... | replace | 5 | 6 | 5 | 7 | 0 | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n, d;
cin >> n >> d;
int count = 0;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d %d");
if (x * x + y * y <= d * d)
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n, d;
cin >> n >> d;
int count = 0;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%lld %lld", &x, &y);
if (x * x + y * y <= d * d)
count++;
}
cout << count << endl;
} | replace | 14 | 15 | 14 | 15 | -11 | |
p02595 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#define L 20005
using namespace std;
double x[L], y[L];
double dist(double x, double y) {
double s = (double)(x * x) + (double)(y * y);
return sqrt(s);
}
int main() {
int N, D;
cin >> N >> D;
int cnt = 0;
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i];
for (i... | #include <cmath>
#include <iostream>
#define L 200005
using namespace std;
double x[L], y[L];
double dist(double x, double y) {
double s = (double)(x * x) + (double)(y * y);
return sqrt(s);
}
int main() {
int N, D;
cin >> N >> D;
int cnt = 0;
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i];
for (... | replace | 3 | 4 | 3 | 4 | 0 | |
p02595 | C++ | Runtime Error | #include <string.h>
#include <algorithm>
#include <cmath>
#include <cstdlib> // abs() for integer
#include <iostream>
using namespace std;
int main(void) {
int N, D;
int X[200], Y[200];
cin >> N >> D;
for (int i = 0; i < N; i++)
cin >> X[i] >> Y[i];
int cnt = 0;
for (int i = 0; i < N; i++) {
lo... | #include <string.h>
#include <algorithm>
#include <cmath>
#include <cstdlib> // abs() for integer
#include <iostream>
using namespace std;
int main(void) {
int N, D;
int X[200000], Y[200000];
cin >> N >> D;
for (int i = 0; i < N; i++)
cin >> X[i] >> Y[i];
int cnt = 0;
for (int i = 0; i < N; i++) {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02595 | C++ | Runtime Error | #include <stdio.h>
typedef long long ll;
int main() {
int n, ans = 0;
ll d, x, y;
scanf("%d%lld", &n, &d);
d = d * d;
while (n--) {
scanf("%lld%lld", &x, y);
if (x * x + y * y <= d)
ans++;
}
printf("%lld\n", ans);
return 0;
} | #include <stdio.h>
typedef long long ll;
int main() {
int n, ans = 0;
ll d, x, y;
scanf("%d%lld", &n, &d);
d = d * d;
while (n--) {
scanf("%lld%lld", &x, &y);
if (x * x + y * y <= d)
ans++;
}
printf("%lld\n", ans);
return 0;
} | replace | 8 | 9 | 8 | 9 | -11 | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
int count = 0;
cin >> N >> D;
vector<vector<int>> position(N, vector<int>(N));
for (int i = 0; i < N; i++) {
cin >> position.at(i).at(0) >> position.at(i).at(1);
if (sqrt(pow(position.at(i).at(0), 2) + pow(position.at(i).at(1), 2)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
int count = 0;
cin >> N >> D;
vector<vector<int>> position(N, vector<int>(2));
for (int i = 0; i < N; i++) {
cin >> position.at(i).at(0) >> position.at(i).at(1);
if (sqrt(pow(position.at(i).at(0), 2) + pow(position.at(i).at(1), 2)... | replace | 7 | 8 | 7 | 8 | 0 | |
p02595 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long long N, D;
long long X[110000];
long long Y[110000];
int main(void) {
cin >> N >> D;
for (int i = 1; i <= N; i++)
cin >> X[i] >> Y[i];
int ans;
ans = 0;
D = D * D;
for (int i = 1; i <= N; i++) {
long long dist ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
long long N, D;
long long X[210000];
long long Y[210000];
int main(void) {
cin >> N >> D;
for (int i = 1; i <= N; i++)
cin >> X[i] >> Y[i];
int ans;
ans = 0;
D = D * D;
for (int i = 1; i <= N; i++) {
long long dist ... | replace | 6 | 8 | 6 | 8 | 0 | |
p02595 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long N, D;
cin >> N >> D;
long long X[100000], Y[100000];
for (long long i = 0; i < N; i++) {
cin >> X[i];
cin >> Y[i];
}
string s;
// cin >> s;
// int A[5]
// sort(A, A + 5);... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long N, D;
cin >> N >> D;
long long X[200000], Y[200000];
for (long long i = 0; i < N; i++) {
cin >> X[i];
cin >> Y[i];
}
string s;
// cin >> s;
// int A[5]
// sort(A, A + 5);... | replace | 9 | 10 | 9 | 10 | 0 | |
p02595 | C++ | Runtime Error | /*
___ is a raging sadist.
*/
// Destroy all WA at test 2
// Stay cool
// Pass the 4th wall..
#include <bits/stdc++.h>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | /*
___ is a raging sadist.
*/
// Destroy all WA at test 2
// Stay cool
// Pass the 4th wall..
#include <bits/stdc++.h>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 51 | 53 | 51 | 53 | TLE | |
p02595 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
using namespace std;
int n, ans;
double d, x[100005], y[100005];
signed main() {
cin >> n >> d;
for (int i = 1; i <= n; i++) {
scanf("%lf %lf", ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
using namespace std;
int n, ans;
double d, x[200005], y[200005];
signed main() {
cin >> n >> d;
for (int i = 1; i <= n; i++) {
scanf("%lf %lf", ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define optimizar_io \
ios_base::sync_with_stdio(false); \
cin.tie(0);
typedef long long int ll;
int main() {
optimizar_io int n;
ll d, x[100010], y[100010];
ci... | #include <bits/stdc++.h>
using namespace std;
#define optimizar_io \
ios_base::sync_with_stdio(false); \
cin.tie(0);
typedef long long int ll;
int main() {
optimizar_io int n;
ll d, x[200010], y[200010];
ci... | replace | 10 | 11 | 10 | 11 | 0 | |
p02595 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long N, D, output = 0;
cin >> N;
cin >> D;
long *X = (long *)malloc(N * sizeof(long));
long *Y = (long *)malloc(N * sizeof(long));
double *distances = (double *)malloc(N * sizeof(float));
for (long i = 0; i < N; i++) {
cin >> X... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long N, D, output = 0;
cin >> N;
cin >> D;
long *X = (long *)malloc(N * sizeof(long));
long *Y = (long *)malloc(N * sizeof(long));
double *distances = (double *)malloc(N * sizeof(double));
for (long i = 0; i < N; i++) {
cin >> ... | replace | 12 | 13 | 12 | 13 | -6 | malloc(): corrupted top size
|
p02595 | C++ | Runtime Error | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n, d;
int counter = 0;
long long A[100010], B[100010];
long double C[100010];
cin >> n >> d;
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
C[i] = (double)((A[i] * A[i]) + (B[i] * B[i]));
// cout << C[i] << " " <... | #include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n, d;
int counter = 0;
long long A[200020], B[200020];
long double C[200020];
cin >> n >> d;
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
C[i] = (double)((A[i] * A[i]) + (B[i] * B[i]));
// cout << C[i] << " " <... | replace | 6 | 8 | 6 | 8 | 0 | |
p02595 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int x[100001], y[100001];
int main() {
int n, d;
cin >> n >> d;
for (int i = 0; i < n; i++) {
cin >> x... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int x[200001], y[200001];
int main() {
int n, d;
cin >> n >> d;
for (int i = 0; i < n; i++) {
cin >> x... | replace | 12 | 13 | 12 | 13 | 0 | |
p02595 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | replace | 48 | 49 | 48 | 49 | 0 | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
lint n, d;
cin >> n >> d;
lint x[2000], y[2000];
rep(i, n) cin >> x[i] >> y[i];
lint ans = 0;
rep(i, n) {
lint t = x[i] * x[i] + y[i] * y[i];
if (t <... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
lint n, d;
cin >> n >> d;
lint x[200000], y[200000];
rep(i, n) cin >> x[i] >> y[i];
lint ans = 0;
rep(i, n) {
lint t = x[i] * x[i] + y[i] * y[i];
if ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[250][3], n, d, ans = 0;
int main() {
cin >> n >> d;
for (int i = 1; i <= n; i++)
cin >> a[i][1] >> a[i][2];
for (int i = 1; i <= n; i++) {
double x, y, z;
x = a[i][1];
y = a[i][2];
z = sqrt(x * x + y * y);
if (z <= d)
ans++;
}
c... | #include <bits/stdc++.h>
using namespace std;
int a[200010][3], n, d, ans = 0;
int main() {
cin >> n >> d;
for (int i = 1; i <= n; i++)
cin >> a[i][1] >> a[i][2];
for (int i = 1; i <= n; i++) {
double x, y, z;
x = a[i][1];
y = a[i][2];
z = sqrt(x * x + y * y);
if (z <= d)
ans++;
}
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02595 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int D, N, ans = 0;
long long int X[100001], Y[100001];
cin >> N >> D;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i];
}
for (int i = 0; i < N; i++) {
if (X[i] * X[i] + Y[i] * Y[i] <= D * D)
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int D, N, ans = 0;
long long int X[1000001], Y[1000001];
cin >> N >> D;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i];
}
for (int i = 0; i < N; i++) {
if (X[i] * X[i] + Y[i] * Y[i] <= D * D)
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
P p[100010];
int main() {
ll n, d;
ll dis = 0;
int res = 0;
cin >> n >> d;
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
for (int i = 0; i < n; i++) {
ll x = p[i].first;
ll y = p[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
P p[200010];
int main() {
ll n, d;
ll dis = 0;
int res = 0;
cin >> n >> d;
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
for (int i = 0; i < n; i++) {
ll x = p[i].first;
ll y = p[i]... | replace | 5 | 6 | 5 | 6 | 0 | |
p02595 | C++ | Runtime Error | #include <iostream>
using namespace std;
#include <vector>
#define re(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
long long x[10000];
long long y[10000];
long long d;
cin >> d;
d *= d;
int cnt = 0;
long long z;
re(i, n) {
cin >> x[i] >> y[i];
z = x[i] * x[i] + y[i] * y[i... | #include <iostream>
using namespace std;
#include <vector>
#define re(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
long long x[300000];
long long y[300000];
long long d;
cin >> d;
d *= d;
int cnt = 0;
long long z;
re(i, n) {
cin >> x[i] >> y[i];
z = x[i] * x[i] + y[i] * y... | replace | 8 | 10 | 8 | 10 | 0 | |
p02595 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d, x, y, ans = 0;
scanf("%d%d", &n, &d);
d *= d;
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &x, &y);
ans += (x * x + y * y <= d);
}
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, d, x, y, ans = 0;
scanf("%lld%lld", &n, &d);
d *= d;
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &x, &y);
ans += (x * x + y * y <= d);
}
printf("%d", ans);
return 0;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p02595 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, d;
scanf("%lld%lld", &n, &d);
int ans = 0;
d *= d;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%lld%lld", x, y);
if (x * x + y * y == d)
ans++;
}
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, d;
scanf("%lld%lld", &n, &d);
int ans = 0;
d *= d;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%lld%lld", &x, &y);
if (x * x + y * y <= d)
ans++;
}
printf("%lld\n", ans);
} | replace | 11 | 13 | 11 | 13 | -11 | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, t, a[100005];
vector<ll> adj[100005];
#define ari \
for (int i = 0; i < n; i++) \
cin >> a[i];
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, t, a[100005];
vector<ll> adj[100005];
#define ari \
for (int i = 0; i < n; i++) \
cin >> a[i];
#d... | replace | 30 | 31 | 30 | 31 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).... | replace | 67 | 68 | 67 | 68 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
long long next_inc = 70;
long long ex = 7;
int cnt = 1;
while (ex % k != 0) {
ex %= k;
ex += next_inc;
next_inc *= 10;
next_inc %= k;
cnt +=... | #include <iostream>
using namespace std;
int main(void) {
long long k;
cin >> k;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
long long next_inc = 70;
long long ex = 7;
int cnt = 1;
while (ex % k != 0) {
ex %= k;
ex += next_inc;
next_inc *= 10;
next_inc %=... | replace | 8 | 9 | 8 | 9 | TLE | |
p02596 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | replace | 37 | 38 | 37 | 38 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define all(v) v.begin(), v.end()
const ll mod = 1000000007;
ll countBits(ll in) {
int res = 0;
for (; in > 0; in >>= 1) {
if ((in & 0x01) != 0) {
res++;
}
}
return res;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define all(v) v.begin(), v.end()
const ll mod = 1000000007;
ll countBits(ll in) {
int res = 0;
for (; in > 0; in >>= 1) {
if ((in & 0x01) != 0) {
res++;
}
}
return res;... | replace | 101 | 102 | 101 | 102 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
int main() {
ll k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
ll s = k;
ll cnt = 0;
while (1) {
if (s == 7) {
cnt++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
int main() {
ll k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
if (k % 5 == 0) {
cout << -1 << endl;
return 0;
}
ll s = k;
... | insert | 10 | 10 | 10 | 14 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
if (n % 2 == 0) {
cout << "-1" << endl;
return 0;
}
long long int k = 7;
long long int cnt = 1;
while (1) {
if (k % n == 0) {
cout << cnt << endl;
break;
}
if (cnt > n) {
cout << "-1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
if (n % 2 == 0) {
cout << "-1" << endl;
return 0;
}
long long int k = 7;
long long int cnt = 1;
while (1) {
if (k % n == 0) {
cout << cnt << endl;
break;
}
if (cnt > n) {
cout << "-1... | insert | 18 | 18 | 18 | 19 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pf push_front
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define pll pair<ll, ll>
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define vll vector<ll>
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pf push_front
#define pof pop_front
#define pob pop_back
#define mp make_pair
#define pll pair<ll, ll>
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define vll vector<ll>
#defi... | insert | 64 | 64 | 64 | 68 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// One implementation to rule them all?
#define db double
#define ll long long int
#define ld long double
// #define int long long int
#define ull unsigned long long
#define fi first
#define se second
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, n, b) for (int i = ... | #include <bits/stdc++.h>
// One implementation to rule them all?
#define db double
#define ll long long int
#define ld long double
// #define int long long int
#define ull unsigned long long
#define fi first
#define se second
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, n, b) for (int i = ... | replace | 180 | 181 | 180 | 181 | TLE | |
p02596 | C++ | Time Limit Exceeded | // created by mtnshh
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define err() cout << "--------------------------" << endl;
#define errA(A) ... | // created by mtnshh
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define err() cout << "--------------------------" << endl;
#define errA(A) ... | replace | 55 | 56 | 55 | 56 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, sum = 0;
cin >> K;
if (K % 2 == 0 || K % 5 == 0) {
sum = -1;
} else {
K *= 9;
if (K % 7 == 0) {
K /= 7;
}
int s = 0, i = 10;
while (s == 0) {
sum++;
if (i % K == 1) {
s = 1;
}
i *= 10... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, sum = 0;
cin >> K;
if (K % 2 == 0 || K % 5 == 0) {
sum = -1;
} else {
K *= 9;
if (K % 7 == 0) {
K /= 7;
}
int s = 0, i = 10;
while (s == 0) {
sum++;
i %= K;
if (i == 1) {
s = 1;
}
... | replace | 16 | 17 | 16 | 18 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n = 1;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
} else {
int r = 7 % k;
while (r != 0) {
r = (10 * r + 7) % k;
n++;
}
cout << n << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n = 1;
cin >> k;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
} else {
int r = 7 % k;
while (r != 0) {
r = (10 * r + 7) % k;
n++;
}
cout << n << endl;
}
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(void) {
int n, i, k, now = 7, ans = 1;
cin >> n;
if (n % 2 == 0 || n % 5 == 0) {
cout << -1 << "\n";
} else {
while (1) {
if (now % n == 0) {
cout << ans << "\n";
break;
} else {
ans... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(void) {
int n, i, k, now = 7, ans = 1;
cin >> n;
if (n % 2 == 0 || n % 5 == 0) {
cout << -1 << "\n";
} else {
while (1) {
if (now % n == 0) {
cout << ans << "\n";
break;
} else {
ans... | replace | 22 | 27 | 22 | 23 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define mem0(x) memset(x, 0, sizeof(x))
#define meminf(x) memset(x, 0x3f, sizeof(x))
#define VI vector<int>
#define VL vec... | #include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define mem0(x) memset(x, 0, sizeof(x))
#define meminf(x) memset(x, 0x3f, sizeof(x))
#define VI vector<int>
#define VL vec... | replace | 16 | 17 | 16 | 17 | TLE | |
p02596 | C++ | Time Limit Exceeded | #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>;
void solve() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return;
}
int cnt = 1;
int r = 7;
map<int, int> check;
while (true) {
if (r % ... | #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>;
void solve() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return;
}
int cnt = 1;
int r = 7;
map<int, int> check;
while (true) {
if (r % ... | insert | 22 | 22 | 22 | 23 | TLE | |
p02596 | C++ | Time Limit Exceeded | // Author: AnandRaj doubleux
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpl... | // Author: AnandRaj doubleux
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpl... | replace | 46 | 47 | 46 | 47 | TLE | |
p02596 | C++ | Time Limit Exceeded | using namespace std;
#include <algorithm>
#include <assert.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long k;
cin >> k;
long long nm = 1;
long long md... | using namespace std;
#include <algorithm>
#include <assert.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long k;
cin >> k;
long long nm = 1;
long long md... | replace | 24 | 25 | 24 | 25 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long int
void solve() {
int k, cnt = 0, rem = 0, num = 7;
cin >> k;
if (k % 2 == 0)
cout << "-1"
<< "\n";
else {
while (1) {
rem += (num % k);
num %= k;
num *= 10;
cnt++;
rem %= k;
if (rem % k ... | #include <bits/stdc++.h>
using namespace std;
// #define int long long int
void solve() {
int k, cnt = 0, rem = 0, num = 7;
cin >> k;
if (k % 2 == 0)
cout << "-1"
<< "\n";
else {
while (1) {
rem += (num % k);
num %= k;
num *= 10;
cnt++;
rem %= k;
if (rem % k ... | insert | 18 | 18 | 18 | 22 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | replace | 41 | 42 | 41 | 42 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x)... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x)... | replace | 58 | 59 | 58 | 59 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | replace | 55 | 56 | 55 | 56 | TLE | |
p02596 | C++ | Time Limit Exceeded | // #include<i_am_noob_orz>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int, int>
#define X first
#define Y second
#define mod ((ll)1e9 + 7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x) > 0 ? (x) : (-(x)))
#define F(n)... | // #include<i_am_noob_orz>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int, int>
#define X first
#define Y second
#define mod ((ll)1e9 + 7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x) > 0 ? (x) : (-(x)))
#define F(n)... | insert | 51 | 51 | 51 | 52 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using... | replace | 271 | 272 | 271 | 272 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LI list<int>
#define D(a) (double)(a)
#define vct vector
#define vi vct<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vct<vi>
#define vll vct<ll>
#define vvll vct<vll>
#define vpii vct<pii>
#define vpll vct<pll>
#define vb... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LI list<int>
#define D(a) (double)(a)
#define vct vector
#define vi vct<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vct<vi>
#define vll vct<ll>
#define vvll vct<vll>
#define vpii vct<pii>
#define vpll vct<pll>
#define vb... | insert | 55 | 55 | 55 | 59 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
if (n % 2 == 0) {
cout << "-1" << endl;
return 0;
}
ll count = 1, num ... | #include <bits/stdc++.h>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
if (n % 2 == 0) {
cout << "-1" << endl;
return 0;
}
ll count = 1, num ... | insert | 25 | 25 | 25 | 29 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long
#define endl ... | #include <bits/stdc++.h>
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long
#define endl ... | replace | 194 | 195 | 194 | 195 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool checkValue(long long v) {
while (v > 0) {
if ((v % 7 != 0) || (v % 10 == 0))
return false;
v /= 10;
}
return true;
}
int main() {
long long x;
cin >> x;
unsigned long long value = 7;
vector<long long> result;
long long cnt = 0;
while (va... | #include <bits/stdc++.h>
using namespace std;
bool checkValue(long long v) {
while (v > 0) {
if ((v % 7 != 0) || (v % 10 == 0))
return false;
v /= 10;
}
return true;
}
int main() {
long long x;
cin >> x;
unsigned long long value = 7;
vector<long long> result;
long long cnt = 0;
while (va... | replace | 24 | 31 | 24 | 35 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt","r",stdin);
long long n, i = 1, k = 7;
cin >> n;
while (1) {
if (n % 2 == 0) {
cout << -1 << endl;
break;
} else {
if (k % n) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt","r",stdin);
long long n, i = 1, k = 7;
cin >> n;
while (1) {
if (n % 2 == 0 || n % 5 == 0) {
cout << -1 << endl;
break;
} else {
i... | replace | 13 | 14 | 13 | 14 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MX = 0; // 最大値
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define PB push_back
#define F first
#define S second... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MX = 0; // 最大値
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define PB push_back
#define F first
#define S second... | insert | 19 | 19 | 19 | 25 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t L, s = 1;
if (n % 7 == 0) {
L = 9 * n / 7;
s = 10 % L;
for (int64_t i = 1;; i++) {
if (s % L == 1) {
cout << i << endl;
break;
}
s = (s % L) * 10;
}
} else {
L = 9 * n;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t L, s = 1;
if (n % 2 == 0 || n % 5 == 0) {
cout << -1 << endl;
} else if (n % 7 == 0) {
L = 9 * n / 7;
s = 10 % L;
for (int64_t i = 1;; i++) {
if (s % L == 1) {
cout << i << endl;
break... | replace | 6 | 7 | 6 | 9 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
int n = 0;
int k1 = k;
int num = 0;
int des = 1;
while (k1) {
n++;
num = 7 * des + num;
des *= 10;
k1 /= 10;
}
// cout<<des<<endl;
int count = 0;
wh... | #include <iostream>
using namespace std;
int main() {
int k;
cin >> k;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
int n = 0;
int k1 = k;
int num = 0;
int des = 1;
while (k1) {
n++;
num = 7 * des + num;
des *= 10;
k1 /= 10;
}
// cout<<des<<endl;
int c... | replace | 6 | 7 | 6 | 7 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int k;
cin >> k;
if (k % 7 == 0) {
k = k / 7;
}
if (gcd(10, k) != 1) {
cout << -1 << endl;
}
long long int l = 1, v = 1 % k;
while (v != 0) {
l++;... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int k;
cin >> k;
if (k % 7 == 0) {
k = k / 7;
}
if (gcd(10, k) != 1) {
cout << -1 << endl;
return 0;
}
long long int l = 1, v = 1 % k;
while (v !=... | insert | 19 | 19 | 19 | 20 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.