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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02962 | C++ | Runtime Error | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
using namespace std;
typedef vector<long long> vi;
typedef pair<long long, long long> pii;
#define pb push_back
#define all(c) c.begin(), c.end()
#define FOR(i, a, b) for (long long i = a; i < b; ++i)
#define FORR(i, a, b) for (long long i = a; i > b; --i)
#define u... | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
using namespace std;
typedef vector<long long> vi;
typedef pair<long long, long long> pii;
#define pb push_back
#define all(c) c.begin(), c.end()
#define FOR(i, a, b) for (long long i = a; i < b; ++i)
#define FORR(i, a, b) for (long long i = a; i > b; --i)
#define u... | replace | 95 | 96 | 95 | 96 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | replace | 115 | 116 | 115 | 116 | 0 | |
p02962 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc135/tasks/abc135_f
#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
#include "string/RollingHash.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto inc... | // https://atcoder.jp/contests/abc135/tasks/abc135_f
#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
#include "string/RollingHash.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto inc... | replace | 590 | 591 | 590 | 591 | TLE | |
p02962 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(lo... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(lo... | replace | 123 | 124 | 123 | 124 | TLE | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... | replace | 111 | 112 | 111 | 112 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | insert | 115 | 115 | 115 | 119 | 0 | |
p02962 | C++ | Runtime Error | // Head File
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define il inline
// Variable
#define ll long long
#define ull unsigned long long
#def... | // Head File
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define il inline
// Variable
#define ll long long
#define ull unsigned long long
#def... | delete | 124 | 125 | 124 | 124 | -11 | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | insert | 165 | 165 | 165 | 167 | TLE | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pi acos(-1.0)
using namespace std;
const int maxn = 1e5 + 10;
int f[maxn], deg[maxn], dist[maxn];
vector<int> adj[maxn];
void getfail(string p) {
int n = p.size();
for (int i = 1; i < n; ++i) {
int j = f[i];
while (j && p[j] != p[i])
j = f[j];
if (p[j] == p[i])
... | #include <bits/stdc++.h>
#define pi acos(-1.0)
using namespace std;
const int maxn = 1e6 + 10;
int f[maxn], deg[maxn], dist[maxn];
vector<int> adj[maxn];
void getfail(string p) {
int n = p.size();
for (int i = 1; i < n; ++i) {
int j = f[i];
while (j && p[j] != p[i])
j = f[j];
if (p[j] == p[i])
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | replace | 43 | 44 | 43 | 44 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include<cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << ... | #include <bits/stdc++.h>
// #include<cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << ... | replace | 65 | 66 | 65 | 66 | 0 | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | replace | 40 | 41 | 40 | 41 | TLE | |
p02962 | C++ | Runtime Error | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | replace | 121 | 122 | 121 | 122 | 0 | |
p02962 | C++ | Runtime Error | /*
Though leaves are many , the root is one.
Through all the lying days of my youth
I swayed my leaves and flowers in the sun.
Now I may wither into the truth.
*/
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
// #pragma GCC target("avx,tune=native")... | /*
Though leaves are many , the root is one.
Through all the lying days of my youth
I swayed my leaves and flowers in the sun.
Now I may wither into the truth.
*/
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
// #pragma GCC target("avx,tune=native")... | replace | 33 | 34 | 33 | 34 | 0 | |
p02962 | C++ | Runtime Error | /*input
*/
#include <bits/stdc++.h>
#define up(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define down(i, b, a) for (int(i) = (b); i >= (a); --i)
#define debug(x) cerr << (x) << '\n';
#define bits(x, i) ((x >> i) & 1)
#define mid ((l + r) / 2)
#define pr pair<int, int>
using namespace std;
const int N = 1500005;
i... | /*input
*/
#include <bits/stdc++.h>
#define up(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define down(i, b, a) for (int(i) = (b); i >= (a); --i)
#define debug(x) cerr << (x) << '\n';
#define bits(x, i) ((x >> i) & 1)
#define mid ((l + r) / 2)
#define pr pair<int, int>
using namespace std;
const int N = 2000005;
i... | replace | 11 | 12 | 11 | 12 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define F first
#define S second
typedef unsigned long long ull;
struct RollingHash {
vector<ull> hash, p;
ull MOD = 1e9 + 7;
ull B = 1777771;
Roll... | #include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
typedef pair<int, int> P;
typedef pair<int, P> P2;
#define F first
#define S second
typedef unsigned long long ull;
struct RollingHash {
vector<ull> hash, p;
ull MOD = 1e9 + 7;
ull B = 1777771;
Roll... | replace | 37 | 38 | 37 | 38 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T, uint mod> struct RollingHash_ {
vector<uint> hashed, power... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T, uint mod> struct RollingHash_ {
vector<uint> hashed, power... | replace | 51 | 53 | 51 | 53 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
vector<int> Z(string s) {
vector<int> z(s.size());
z[0] = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while (i + j < s.size() && s[j] == s[i + j])
j++;
if (j == 0) {
z[i] = 0;
i++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
vector<int> Z(string s) {
vector<int> z(s.size());
z[0] = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while (i + j < s.size() && s[j] == s[i + j])
j++;
if (j == 0) {
z[i] = 0;
i++;
... | replace | 29 | 31 | 29 | 31 | 0 | |
p02962 | C++ | Runtime Error | // Words are flowing out like endless rain into a paper cup
// They slither while they pass they slip away across the universe
// Pools of sorrow, waves of joy are drifting through my open mind
// Possessing and caressing me
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
namespace _buff {
const... | // Words are flowing out like endless rain into a paper cup
// They slither while they pass they slip away across the universe
// Pools of sorrow, waves of joy are drifting through my open mind
// Possessing and caressing me
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
namespace _buff {
const... | replace | 47 | 48 | 47 | 48 | 0 | |
p02962 | C++ | Time Limit Exceeded | #include <string>
#include <vector>
struct KMP {
const std::string &pattern;
std::vector<int> table;
explicit KMP(const std::string &p) : pattern(p), table(p.size() + 1) {
table[0] = -1;
table[1] = 0;
int i = 2;
int j = 0;
while (i < pattern.size()) {
if (pattern[i - 1] == pattern[j])... | #include <string>
#include <vector>
struct KMP {
const std::string &pattern;
std::vector<int> table;
explicit KMP(const std::string &p) : pattern(p), table(p.size() + 1) {
table[0] = -1;
table[1] = 0;
int i = 2;
int j = 0;
while (i < pattern.size()) {
if (pattern[i - 1] == pattern[j])... | insert | 63 | 63 | 63 | 64 | TLE | |
p02962 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <typename T> vector<int> z_algorithm(const int len, const T &in) {
vector<int> res(len, 0);
int c = 0;
for (int i = 1; i < len; ++i) {
if (i + res[i - c] < c + res[c]) {
res[i] = res[i - c];
} else {
int j = max(... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <typename T> vector<int> z_algorithm(const int len, const T &in) {
vector<int> res(len, 0);
int c = 0;
for (int i = 1; i < len; ++i) {
if (i + res[i - c] < c + res[c]) {
res[i] = res[i - c];
} else {
int j = max(... | replace | 76 | 83 | 76 | 80 | 0 | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | replace | 39 | 40 | 39 | 40 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i ... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i ... | replace | 124 | 125 | 124 | 125 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | replace | 73 | 74 | 73 | 74 | 0 | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int m;
int get(const string &s) {
int n = (int)s.size();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; i++) {... | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int m;
int get(const string &s) {
int n = (int)s.size();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; i++) {... | replace | 52 | 53 | 52 | 53 | TLE | |
p02962 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | replace | 215 | 216 | 215 | 217 | TLE | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(5e5 + 5);
/////////////////////////////////////////////////////////////
class StringMatching {
public:
static const int MAX_N = (int)(8e5 + 100);
string... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(5e5 + 5);
/////////////////////////////////////////////////////////////
class StringMatching {
public:
static const int MAX_N = (int)(8e6 + 100);
string... | replace | 13 | 14 | 13 | 14 | 0 | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | replace | 208 | 209 | 208 | 209 | 0 | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (int i = (int)n; i >= 0; i--)
#defin... | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (int i = (int)n; i >= 0; i--)
#defin... | replace | 74 | 75 | 74 | 76 | TLE | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct RollingHash {
vector<long long> hash, power;
const int seed = 10007, mod = 1e9 + 7;
RollingHash(const string &s) {
int n = (int)s.size();
hash.assign(n + 1, 0);
power.assign(n + 1, 1);
for (int i = 0; i < n; +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct RollingHash {
vector<long long> hash, power;
const int seed = 10007, mod = 1e9 + 7;
RollingHash(const string &s) {
int n = (int)s.size();
hash.assign(n + 1, 0);
power.assign(n + 1, 1);
for (int i = 0; i < n; +... | replace | 74 | 75 | 74 | 75 | -6 | munmap_chunk(): invalid pointer
|
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> Z(string s) {
vector<int> z(s.size(), 0);
int l = 0, r = 0;
for (int i = 1; i < s.size(); i++) {
if (i <= r)
z[i] = min(z[i - l], r - i + 1);
while (i + z[i] < s.size() && s[i + z[i]] == s[z[i]])
z[i]++;
if (i + z[i] - 1 > r)
... | #include <bits/stdc++.h>
using namespace std;
vector<int> Z(string s) {
vector<int> z(s.size(), 0);
int l = 0, r = 0;
for (int i = 1; i < s.size(); i++) {
if (i <= r)
z[i] = min(z[i - l], r - i + 1);
while (i + z[i] < s.size() && s[i + z[i]] == s[z[i]])
z[i]++;
if (i + z[i] - 1 > r)
... | replace | 21 | 22 | 21 | 22 | 0 | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define eb emplace_back
typedef unsigned long long ll;
typedef long double ld;
const int IN_PROCESS = -2;
const int NOT_DONE = -1;
const int INF = 1e9;
template <class T> struct segtree_t {
v... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define eb emplace_back
typedef unsigned long long ll;
typedef long double ld;
const int IN_PROCESS = -2;
const int NOT_DONE = -1;
const int INF = 1e9;
template <class T> struct segtree_t {
v... | insert | 56 | 56 | 56 | 60 | TLE | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, k, n) for (ll i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = int64_t;
using vecint = vector<ll>;
constexpr ll MOD = 1000000007;
ll pm(ll x, ll i) {
if (i == 0)
return 1;
if ((i % 2) == 1)
return ... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (ll i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = int64_t;
using vecint = vector<ll>;
constexpr ll MOD = 1000000007;
ll pm(ll x, ll i) {
if (i == 0)
return 1;
if ((i % 2) == 1)
return ... | replace | 57 | 58 | 57 | 58 | TLE | |
p02962 | C++ | Time Limit Exceeded | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloa... | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloa... | delete | 237 | 239 | 237 | 237 | TLE | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#incl... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#incl... | replace | 86 | 87 | 86 | 87 | 0 | |
p02962 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#... | replace | 57 | 62 | 57 | 58 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long double ld;
typedef long long ll;
const int max_n = 100011, inf = 1000111222;
const ll inff = 1000111222333444;
string s, t;
char ss[max_n];
bool is_cycle(string a, const string &b) {
// cout << "is_cycle: " << a << ", " <... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long double ld;
typedef long long ll;
const int max_n = 500011, inf = 1000111222;
const ll inff = 1000111222333444;
string s, t;
char ss[max_n];
bool is_cycle(string a, const string &b) {
// cout << "is_cycle: " << a << ", " <... | replace | 9 | 10 | 9 | 10 | 0 | |
p02962 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <random>
#include <stack>
#include <vector>
using namespace std;
#define int long long
#define uint unsigned int
#define dotimes(i, n) for (int i = 0, i##max__ = (n); i < i##max__; i++)
#define whole(x, f, ...) \
([&... | #include <cstdio>
#include <cstring>
#include <random>
#include <stack>
#include <vector>
using namespace std;
#define int long long
#define uint unsigned int
#define dotimes(i, n) for (int i = 0, i##max__ = (n); i < i##max__; i++)
#define whole(x, f, ...) \
([&... | replace | 70 | 71 | 70 | 71 | 0 | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
template <typename S>
void sa_is(S s, int B, std::vector<int> &sa, std::vector<int> &cnt) {
int n ... | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
template <typename S>
void sa_is(S s, int B, std::vector<int> &sa, std::vector<int> &cnt) {
int n ... | replace | 205 | 207 | 205 | 211 | 0 | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
template <int MAXV> struct scc {
std::vector<int> G[MAXV], rG[MAXV], vs;
bool used[MAXV];
// i... | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
template <int MAXV> struct scc {
std::vector<int> G[MAXV], rG[MAXV], vs;
bool used[MAXV];
// i... | replace | 96 | 97 | 96 | 100 | 0 | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | replace | 75 | 76 | 75 | 76 | 0 | |
p02962 | Python | Time Limit Exceeded | import sys
sys.setrecursionlimit(10**6)
def rolling_hash(s, w, MOD):
ret = []
tmp = 0
p = pow(26, w, MOD)
ords = [ord(c) - 97 for c in s]
for i, o in enumerate(ords):
tmp = tmp * 26 + o
if i >= w:
tmp = tmp - ords[i - w] * p
tmp %= MOD
ret.append(tmp)
... | import sys
sys.setrecursionlimit(10**6)
def rolling_hash(s, w, MOD):
ret = []
tmp = 0
p = pow(26, w, MOD)
ords = [ord(c) - 97 for c in s]
for i, o in enumerate(ords):
tmp = tmp * 26 + o
if i >= w:
tmp = tmp - ords[i - w] * p
tmp %= MOD
ret.append(tmp)
... | replace | 32 | 33 | 32 | 33 | TLE | |
p02962 | Python | Time Limit Exceeded | s = input()
t = input()
u = ""
while len(u) < len(s) + len(t):
u = s * (len(t) // len(s) + 1)
t_add = t + "."
def partial_match_table(word):
table = [0] * (len(word) + 1)
table[0] = -1
i, j = 0, 1
while j < len(word):
matched = word[i] == word[j]
if not matched and i > 0:
... | s = input()
t = input()
u = s * (len(t) // len(s) + 2)
t_add = t + "."
def partial_match_table(word):
table = [0] * (len(word) + 1)
table[0] = -1
i, j = 0, 1
while j < len(word):
matched = word[i] == word[j]
if not matched and i > 0:
i = table[i]
else:
... | replace | 3 | 6 | 3 | 4 | TLE | |
p02962 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b)... | replace | 118 | 119 | 118 | 120 | TLE | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
re... | replace | 113 | 115 | 113 | 115 | TLE | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | insert | 97 | 97 | 97 | 101 | -11 | |
p02962 | C++ | Time Limit Exceeded | #define DEBUG 0
/**
* File : F.cpp
* Author : Kazune Takahashi
* Created : 7/28/2019, 1:18:49 AM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fu... | #define DEBUG 0
/**
* File : F.cpp
* Author : Kazune Takahashi
* Created : 7/28/2019, 1:18:49 AM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fu... | replace | 193 | 194 | 193 | 194 | TLE | |
p02962 | C++ | Runtime Error | // 2019.7.27 by ljz
// email 573902690@qq.com
// if you find any bug in my code
// please tell me
#include <bits/stdc++.h>
using namespace std;
#define res register int
#define LL long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f
#define eps 1e-10
#define RG register
#define db double
#define lb long db
#de... | // 2019.7.27 by ljz
// email 573902690@qq.com
// if you find any bug in my code
// please tell me
#include <bits/stdc++.h>
using namespace std;
#define res register int
#define LL long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f
#define eps 1e-10
#define RG register
#define db double
#define lb long db
#de... | replace | 64 | 65 | 64 | 65 | 0 | |
p02962 | C++ | Runtime Error | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx2,tune=native")
// #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
#define X first
#define Y second
// #include <boost/unordered_map.hpp>
// using namespace boost;
/*
#include <ext/p... | delete | 0 | 3 | 0 | 0 | 127 | /tmp/f032b621-4be6-46de-91bc-bf3b01049ec6.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1,... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1,... | replace | 38 | 39 | 38 | 39 | 0 | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using i64 = long long;
auto calc(const std::string &s) {
std::vector<int> a(s.size() + 1);
a[0] = -1;
for (int i = 0, j = -1; i < s.size(); i++) {
while (j >= 0 && s[i] != s[j])
j = a[j];
j++;
a[i + 1] = s[i + 1] == s[j] ? a[j] : j;
}
return a;
}
int main() {
std... | #include <bits/stdc++.h>
using i64 = long long;
auto calc(const std::string &s) {
std::vector<int> a(s.size() + 1);
a[0] = -1;
for (int i = 0, j = -1; i < s.size(); i++) {
while (j >= 0 && s[i] != s[j])
j = a[j];
j++;
a[i + 1] = s[i + 1] == s[j] ? a[j] : j;
}
return a;
}
int main() {
std... | insert | 42 | 42 | 42 | 43 | TLE | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
tem... | replace | 120 | 121 | 120 | 121 | 0 | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define p... | replace | 109 | 110 | 109 | 110 | 0 | |
p02962 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | replace | 47 | 52 | 47 | 51 | TLE | |
p02962 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <vector>
int MP(std::string &S, std::vector<long long int> &A);
int KMP(std::string &S, std::string &word,
std::vector<long long int> &match_table);
long long int euclid_gc... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <vector>
int MP(std::string &S, std::vector<long long int> &A);
int KMP(std::string &S, std::string &word,
std::vector<long long int> &match_table);
long long int euclid_gc... | replace | 26 | 27 | 26 | 27 | 0 | Answer:
|
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <typename T, T MOD, T B> struct RollingHash {
vector<T> hash, p;
RollingHash() {}
RollingHash(const string &s) {
int n = s.size();
hash.assign(n + 1, 0);
p.assign(n + 1, 1);
for (int i = 0; i < n; i++) {
hash[i + ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <typename T, T MOD, T B> struct RollingHash {
vector<T> hash, p;
RollingHash() {}
RollingHash(const string &s) {
int n = s.size();
hash.assign(n + 1, 0);
p.assign(n + 1, 1);
for (int i = 0; i < n; i++) {
hash[i + ... | replace | 79 | 80 | 79 | 80 | TLE | |
p02962 | C++ | Time Limit Exceeded | /*
* Welcome to my code!
*---------------------------------------------*
* author : lynmisakura(twitter : @andoreiji11)
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include ... | /*
* Welcome to my code!
*---------------------------------------------*
* author : lynmisakura(twitter : @andoreiji11)
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include ... | insert | 142 | 142 | 142 | 143 | TLE | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<int> z_algorithm(const vector<int> &S) {
int N = S.size(), c = 0;
vector<int> ret(N, 0);
for (int i = 1; i < N; i++) {
if (i + ret[i - c] < c + ret[c]) {
ret[i] = ret[i - c];
} else {
int j = max(0, c + ret[c] - i);
while (i + j < N &... | #include <bits/stdc++.h>
using namespace std;
vector<int> z_algorithm(const vector<int> &S) {
int N = S.size(), c = 0;
vector<int> ret(N, 0);
for (int i = 1; i < N; i++) {
if (i + ret[i - c] < c + ret[c]) {
ret[i] = ret[i - c];
} else {
int j = max(0, c + ret[c] - i);
while (i + j < N &... | insert | 65 | 65 | 65 | 66 | TLE | |
p02962 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[tlen + 1 + i % s.le... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s;
cin >> t;
int slen = s.length(), tlen = t.length();
s = t + '#' + s;
for (int i = 0; i < t.length(); i++) {
s += s[tlen + 1 + i % s.le... | replace | 24 | 25 | 24 | 25 | TLE | |
p02962 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
const int mod = 1000000007;
template <int M = 1000000007> struct ModInt {
int data;
ModInt(int... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
const int mod = 1000000007;
template <int M = 1000000007> struct ModInt {
int data;
ModInt(int... | replace | 83 | 84 | 83 | 84 | TLE | |
p02962 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
using ll = long long;
const ll MOD = 1000000007;
bool out[500010], in[500010], arr[500010];
void MP(vector<int> &V, string S) {
V[0] = -1;
int j = -1, ss = S.size();
for (int i = 0; i < ss; i++) {
while (j >= 0 && S[i] != S[j])
... | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
using ll = long long;
const ll MOD = 1000000007;
bool out[1000010], in[1000010], arr[1000010];
void MP(vector<int> &V, string S) {
V[0] = -1;
int j = -1, ss = S.size();
for (int i = 0; i < ss; i++) {
while (j >= 0 && S[i] != S[j... | replace | 6 | 7 | 6 | 7 | 0 | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define all(x) (x).begin(), (x).end()
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define all(x) (x).begin(), (x).end()
... | replace | 36 | 92 | 36 | 41 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long S;
cin >> S;
long long N = pow(10, 9);
for (long long i = 1; i <= N; i++) {
if (S % i == 0 && S / i <= N) {
cout << 0 << " " << 0 << " " << i << " " << 0 << " " << 0 << " " << S / i
<< endl;
break;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long S;
cin >> S;
long long N = pow(10, 9);
if (S == pow(10, 18)) {
cout << 0 << " " << 0 << " " << N << " " << 0 << " " << 0 << " " << N
<< endl;
} else {
cout << 0 << " " << 0 << " " << N << " " << 1 << " " << N - S % N << " "
... | replace | 6 | 12 | 6 | 12 | TLE | |
p02963 | C++ | Runtime Error | // #define DEB1 //output check function
// #define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <s... | // #define DEB1 //output check function
// #define DEB2 //same output, input from input.txt
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <s... | replace | 86 | 87 | 86 | 87 | 0 | |
p02963 | C++ | Runtime Error | // -----------------------------------
// Author : MatsuTaku
// Affiliation: Tokushima University
// Country : Japan
// Date : 04/07/2020
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fal... | // -----------------------------------
// Author : MatsuTaku
// Affiliation: Tokushima University
// Country : Japan
// Date : 04/07/2020
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fal... | replace | 18 | 36 | 18 | 21 | TLE | |
p02963 | C++ | Runtime Error | /* Dsingh_24 */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int ... | /* Dsingh_24 */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int ... | insert | 29 | 29 | 29 | 33 | 0 | |
p02963 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll S;
cin >> S;
int yaku;
for (ll i = 1; i * i <=... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
long long s;
cin >> s;
const int v = 1000000000;
... | replace | 15 | 25 | 15 | 24 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf... | replace | 22 | 40 | 22 | 38 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LINF = 1ll << 55;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e... | replace | 437 | 452 | 437 | 441 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb ... | replace | 27 | 88 | 27 | 34 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
typedef long long LL;
typedef vector<int> VI;
#define UB 1000000000
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
typedef long long LL;
typedef vector<int> VI;
#define UB 1000000000
... | replace | 22 | 29 | 22 | 23 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int S;
cin >> S;
int xy[6];
xy[0] = 0;
xy[1] = 0;
bool flag = 0;
for (int i = S / 2; i <= 1000000000; i++) {
for (int j = 0; j <= 1000000000; j++) {
for (int k = 0; k <= 1000000000; k++) {
for (int h = S / 2; h <= 100000000... | #include <iostream>
using namespace std;
int main() {
long long int S;
cin >> S;
int xy[6];
xy[0] = 0;
xy[1] = 0;
xy[2] = 1000000000;
xy[3] = 1;
xy[5] = S / 1000000000 + 1;
xy[4] = 1000000000 - S % 1000000000;
if (S == 1000000000000000000) {
xy[3] = 0;
xy[5] = 1000000000;
}
for (int i =... | replace | 9 | 33 | 9 | 16 | TLE | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
#define cs const
#define pb push_back
#define y1 y_1
using namespace std;
typedef long long ll;
int main() {
#ifdef FSYolanda
freopen("1.in", "r", stdin);
#endif
ll S;
scanf("%lld", &S);
ll t = sqrt(S);
if (1ll * t * t == S) {
cout << 0 << " " << 0 << " " << t << " " << 0 << " " <... | #include <bits/stdc++.h>
#define cs const
#define pb push_back
#define y1 y_1
using namespace std;
typedef long long ll;
int main() {
#ifdef FSYolanda
freopen("1.in", "r", stdin);
#endif
ll S;
scanf("%lld", &S);
ll t = sqrt(S);
if (1ll * t * t == S) {
cout << 0 << " " << 0 << " " << t << " " << 0 << " " <... | replace | 21 | 29 | 21 | 38 | 0 | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | replace | 51 | 53 | 51 | 56 | 0 | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e5 + 7;
const int Inf = 1 << 30;
const ll INF = 1ll << 60;
ll s;
int a, b, c, d;
int main() {
scanf("%lld", &s);
// 定一顶点在(0, 0), 构造向量(a, b)和(c, d)
// 叉积求面积: s = ad - bc
a = d = (int)sqrt(s);
while (s > a * d * 1ll) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e5 + 7;
const int Inf = 1 << 30;
const ll INF = 1ll << 60;
ll s;
int a, b, c, d;
int main() {
scanf("%lld", &s);
// 定一顶点在(0, 0), 构造向量(a, b)和(c, d)
// 叉积求面积: s = ad - bc
a = d = (int)sqrt(s);
while (s > 1ll * a * d) {
if... | replace | 14 | 15 | 14 | 15 | TLE | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pf printf
#define sc scanf
#define pb push_back
#define eb emplace_back
#define present(c, x) ((c).find(x) != (c).end())
#define mp make_pair
#define xx first
#define yy second
#define endl '\n'
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
t... | #include <bits/stdc++.h>
using namespace std;
#define pf printf
#define sc scanf
#define pb push_back
#define eb emplace_back
#define present(c, x) ((c).find(x) != (c).end())
#define mp make_pair
#define xx first
#define yy second
#define endl '\n'
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
t... | replace | 39 | 40 | 39 | 40 | 0 | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int64_t lot = 1000000000;
signed main() {
int64_t s;
cin >> s;
for (int64_t a = 1; a * a <= s; ++a) {
if (s % a == 0) {
int64_t b = s / a;
if (a <= lot && b <= lot) {
cout << 0 << ' ' << 0 << ' ' << a << ' ' << 0 << ' ' << 0 << ' ' << b... | #include <bits/stdc++.h>
using namespace std;
const int64_t lot = 1000000000;
signed main() {
int64_t s;
cin >> s;
int64_t x = (lot - (s % lot)) % lot, y = (s + x) / lot;
cout << 0 << ' ' << 0 << ' ' << lot << ' ' << 1 << ' ' << x << ' ' << y
<< '\n';
}
| replace | 8 | 18 | 8 | 11 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll s;
int main() {
cin >> s;
ll memo;
for (ll i = 1; i * i <= s; i++) {
if (s % i == 0 && s / i <= 1e9) {
memo = i;
break;
}
}
cout << 0 << ' ' << 0 << ' ' << 0 << ' ' << memo << ' ' << s / memo << ' '
<< 0 << end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll s;
int main() {
cin >> s;
ll memo = 1e9;
ll y = (s + memo - 1) / memo;
ll x = y * memo - s;
cout << 0 << ' ' << 0 << ' ' << memo << ' ' << 1 << ' ' << x << ' ' << y
<< endl;
return 0;
}
| replace | 8 | 17 | 8 | 13 | TLE | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
cin >> s;
long long a, b;
for (a = s - 1;; a--) {
if (s % a == 0)
break;
}
b = s / a;
cout << 0 << " " << 0 << " " << 0 << " " << a << " " << b << " " << 0 << endl;
getchar();
getchar();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long s;
cin >> s;
long long x1, y1, x2, y2, x3, y3;
x1 = 0, y1 = 0;
x2 = 1000000000, y2 = 1;
x3 = (1000000000 - s % 1000000000) % 1000000000, y3 = (s + x3) / 1000000000;
cout << x1 << " " << y1 << " " << x2 << " " << y2 << " " << x3 << " " ... | replace | 7 | 14 | 7 | 12 | 0 | |
p02963 | Python | Time Limit Exceeded | import sys
import math # noqa
import bisect # noqa
import queue # noqa
def input():
return sys.stdin.readline().rstrip()
if __name__ == "__main__":
S = int(input())
if len(str(S)) == 19:
print(0, 0, 1000000000, 0, 0, 1000000000)
exit(0)
search = min(1000000000, math.ceil(math.sq... | import sys
import math # noqa
import bisect # noqa
import queue # noqa
def input():
return sys.stdin.readline().rstrip()
if __name__ == "__main__":
S = int(input())
x1, y1 = 0, 0
x2, y2 = 1000000000, 1
x3 = (x2 - S % x2) % x2
y3 = (S + x3) // x2
print("{} {} {} {} {} {}".format(x1, y... | replace | 13 | 22 | 13 | 18 | TLE | |
p02963 | Python | Time Limit Exceeded | def solve(s):
k = 10**9
if s <= k:
return 0, 0, 1, 0, 0, s
X = k
while True:
Y = (s - 1) // X + 1
while Y <= k:
xy = X * Y - s
lim = min(Y, int(xy**0.5))
for y in range(1, lim + 1):
x, m = divmod(xy, y)
if x <= X... | def solve(s):
k = 10**9
if s <= k:
return 0, 0, 1, 0, 0, s
X = k
while True:
Y = (s - 1) // X + 1
while Y <= k:
xy = X * Y - s
if xy == 0:
return 0, 0, X, 0, 0, Y
lim = min(Y, int(xy**0.5))
for y in range(1, lim + 1)... | insert | 9 | 9 | 9 | 11 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h> // Tomasz Nowak
using namespace std; // XIII LO Szczecin
using LL = long long; // Poland
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
template <class T> int size(T &&x) { return int(x.size()); }
template <class A, class B>
ostream &operator<<(o... | #include <bits/stdc++.h> // Tomasz Nowak
using namespace std; // XIII LO Szczecin
using LL = long long; // Poland
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
template <class T> int size(T &&x) { return int(x.size()); }
template <class A, class B>
ostream &operator<<(o... | replace | 41 | 42 | 41 | 45 | TLE | |
p02963 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII... | insert | 30 | 30 | 30 | 35 | 0 | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
using namespace std;
#define repi(itr, ds) for (auto itr = ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
using namespace std;
#define repi(itr, ds) for (auto itr = ... | replace | 87 | 88 | 87 | 88 | 0 | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long S;
cin >> S; // s=ad-bc(0,0,a,b,c,d)
long long a = 1000000000;
long long b = 1;
long long c = (S + 999999999) / 1000000000;
long long d = (S + b * c) / a;
cout << "0 0 " + a + ' ' + b + ' ' + c + ' ' + d << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long S;
cin >> S; // s=ad-bc(0,0,a,b,c,d)
int a = 1000000000;
int b = 1;
int d = (S + 999999999) / 1000000000;
int c = (-S + a * d) / b;
char e = ' ';
cout << "0 0 " << a << e << b << e << c << e << d << endl;
}
| replace | 6 | 11 | 6 | 12 | -11 | |
p02963 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
const ll LINF = 0x1fffffffffffffff;
const int... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
const ll LINF = 0x1fffffffffffffff;
const int... | replace | 73 | 81 | 73 | 78 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
// 使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
// 使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#def... | replace | 47 | 65 | 47 | 53 | TLE | |
p02963 | C++ | Time Limit Exceeded | #include <cstdio>
int k, x1, x2, x3, y1, y2, y3;
long long s;
int main() {
scanf("%lld", &s);
for (x2 = 1, y3 = 1, k = 1; 1LL * x2 * y3 < s; k = k ^ 1)
if (k)
x2++;
else
y3++;
y2 = 1, x3 = 1LL * x2 * y3 - s;
printf("%d %d %d %d %d %d\n", x1, y1, x2, y2, x3, y3);
return 0;
} | #include <cstdio>
int k, x1, x2, x3, y1, y2, y3;
long long s;
int main() {
scanf("%lld", &s);
for (x2 = 1, y3 = 1; 1LL * (x2 + 10000) * (y3 + 10000) < s;
x2 = x2 + 10000, y3 = y3 + 10000)
;
for (k = 1; 1LL * x2 * y3 < s; k = k ^ 1)
if (k)
x2++;
else
y3++;
y2 = 1, x3 = 1LL * x2 *... | replace | 7 | 8 | 7 | 11 | TLE | |
p02963 | C++ | Time Limit Exceeded | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.07.21 20:55:19
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typed... | /**
* @brief : c++ code for AtCoder
* @author : rk222
* @created: 2019.07.21 20:55:19
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typed... | replace | 96 | 97 | 96 | 97 | TLE | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) begin(x), end(x)
#define d... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) begin(x), end(x)
#define d... | replace | 130 | 131 | 130 | 131 | 0 | |
p02963 | C++ | Runtime Error | #include <stdio.h>
int main() {
long s;
scanf("%d", s);
printf("0 ");
printf("0 ");
printf("2 ");
printf("0 ");
printf("0 ");
printf("%ld", s);
} | #include <stdio.h>
int main() {
long long s, t, u;
scanf("%lld", &s);
t = s / 1000000000 + 1;
u = 1000000000 - s % 1000000000;
if (s % 1000000000 == 0) {
t--;
u = 0;
}
printf("0 0 %lld 1000000000 %lld 1", u, t);
}
| replace | 2 | 10 | 2 | 11 | 0 | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define h... | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define h... | replace | 23 | 25 | 23 | 29 | 0 | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ll s, x, z, r;
cin >> s;
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ll s, x, z, r;
cin >> s;
if... | insert | 15 | 15 | 15 | 26 | TLE | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> f(3, 0);
cin >> f.at(0) >> f.at(1) >> f.at(2);
vector<int> ln(n, 0);
rep(i, n) { cin >> ln.at(i); }
// sort(ln.begin(),ln.end());
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
int main() {
ll s;
cin >> s;
ll x1, y1, x2, y2;
x1 = 1e9;
x2 = 1;
y2 = s / x1;
y1 = (ll)(x1 * y2 - s);
if (y1 < 0) {
y2++;
y1 = (ll)(x1 * y2 - s);
}
printf("0 ... | replace | 6 | 15 | 6 | 18 | 0 | |
p02963 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | insert | 147 | 147 | 147 | 162 | TLE | |
p02963 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e6 + 1;
const int MOD = 998244353; // 1e9+7;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e6 + 1;
const int MOD = 998244353; // 1e9+7;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) ... | replace | 59 | 60 | 59 | 65 | 0 | |
p02963 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll S;
cin >> S;
ll x1, y1 = 10e9, x2 =... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll S;
cin >> S;
ll x1, y1, x2 = 100000... | replace | 18 | 23 | 18 | 22 | 0 | |
p02964 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vi>;
using pi = pair<ll, ll>;
using vpi = vector<pi>;
const ll mod = 7 * 17 * (1 << 23) + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().cou... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vi>;
using pi = pair<ll, ll>;
using vpi = vector<pi>;
const ll mod = 7 * 17 * (1 << 23) + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().cou... | replace | 16 | 17 | 16 | 17 | 0 | |
p02964 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template <class t> inline t read(t &x) {
char c = getchar();
bool f = 0;
x = 0;
while (!isdigit(c))
f |= c == '-', c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48),... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template <class t> inline t read(t &x) {
char c = getchar();
bool f = 0;
x = 0;
while (!isdigit(c))
f |= c == '-', c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48),... | delete | 36 | 37 | 36 | 36 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.