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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | replace | 203 | 204 | 203 | 205 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> sections;
for (int i = 0; i < k; ++i) {
ll l, r;
cin >> l >> r;
sections.push_back({l, r});
}
vector<ll> f(2 * n + 100, 0), a(2 * n + 100, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> sections;
for (int i = 0; i < k; ++i) {
ll l, r;
cin >> l >> r;
sections.push_back({l, r});
}
vector<ll> f(2 * n + 100, 0), a(2 * n + 100, ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02549 | C++ | Time Limit Exceeded | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include ... | replace | 95 | 96 | 95 | 96 | TLE | |
p02549 | C++ | Time Limit Exceeded |
// Problem : D - Leaping Tak
// Contest : AtCoder - AtCoder Beginner Contest 179
// URL : https://atcoder.jp/contests/abc179/tasks/abc179_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>... |
// Problem : D - Leaping Tak
// Contest : AtCoder - AtCoder Beginner Contest 179
// URL : https://atcoder.jp/contests/abc179/tasks/abc179_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>... | replace | 88 | 89 | 88 | 89 | TLE | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < (ll)b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define s... | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < (ll)b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define s... | replace | 30 | 31 | 30 | 31 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a... | replace | 68 | 69 | 68 | 69 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n - 1; i >= (int)(k); i--)
#define all(x) (x).begin(), (x).end()
#define chm... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n - 1; i >= (int)(k); i--)
#define all(x) (x).begin(), (x).end()
#define chm... | replace | 61 | 62 | 61 | 62 | 0 | |
p02549 | C++ | Runtime Error | /*
* if you are interested in the reference code here,
* see https://github.com/georeth/OJLIBS for more information
*
* Solution Author : Georeth Chow <georeth2010@gmail.com>
*/
#include <algorithm>
#include <cassert> // assert
#include <cfloat> // DBL_MIN DBL_MAX
#include <cinttypes> // PRId64 SCNd64
#includ... | /*
* if you are interested in the reference code here,
* see https://github.com/georeth/OJLIBS for more information
*
* Solution Author : Georeth Chow <georeth2010@gmail.com>
*/
#include <algorithm>
#include <cassert> // assert
#include <cfloat> // DBL_MIN DBL_MAX
#include <cinttypes> // PRId64 SCNd64
#includ... | replace | 563 | 564 | 563 | 564 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ll long long
#define MOD 998244353
using namespace std;
;
int main() {
int N, K;
cin >> N >> K;
vector<int> L(K), R(K);
rep(i, 0, K) cin >> L[i] >> R[i];
vector<ll> dp(N + 1, 0);
dp[0] = 1;
dp[1] = -1;
rep(i, 0, N) {
... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ll long long
#define MOD 998244353
using namespace std;
;
int main() {
int N, K;
cin >> N >> K;
vector<int> L(K), R(K);
rep(i, 0, K) cin >> L[i] >> R[i];
vector<ll> dp(N + 1, 0);
dp[0] = 1;
dp[1] = -1;
rep(i, 0, N) {
... | replace | 19 | 21 | 19 | 23 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
#define _GLIBCXX_DEBUG
ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> l(k), r(k);
rep(i, k) cin >> l[i] >> r[i];
vector<ll> dp(200010);
vector<ll> dpsum(20010);
dp[1] ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
#define _GLIBCXX_DEBUG
ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> l(k), r(k);
rep(i, k) cin >> l[i] >> r[i];
vector<ll> dp(n + 1);
vector<ll> dpsum(n + 1);
dp[1] =... | replace | 13 | 15 | 13 | 15 | 0 | |
p02549 | C++ | Runtime Error | // بساملہ ہیر رحمن نیر رحیم
//---------------------------//
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#in... | // بساملہ ہیر رحمن نیر رحیم
//---------------------------//
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#in... | replace | 26 | 27 | 26 | 27 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02549 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
#include <stdio.h>
#define int long long
using namespace std;
const int N = 5e5, M = 15, MOD = 998244353;
int a[N];
int f[N];
int x[M], y[M];
int n, m;
int qzh[N];
inline int modbez(int a, int b) {
register int res = a % b;
if (res < 0)
return res + b;
else
return re... | #include <cstring>
#include <iostream>
#include <stdio.h>
#define int long long
using namespace std;
const int N = 5e5, M = 15, MOD = 998244353;
int a[N];
int f[N];
int x[M], y[M];
int n, m;
int qzh[N];
inline int modbez(int a, int b) {
register int res = a % b;
if (res < 0)
return res + b;
else
return re... | replace | 46 | 47 | 46 | 47 | TLE | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define N int(1e5 + 10)
#define mod 998244353
using namespace std;
ll dp[N], pre[N];
int l[N], r[N], n, k;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(N... | #include <bits/stdc++.h>
#define ll long long int
#define N int(2e5 + 10)
#define mod 998244353
using namespace std;
ll dp[N], pre[N];
int l[N], r[N], n, k;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(N... | replace | 2 | 3 | 2 | 3 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) ... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) ... | insert | 89 | 89 | 89 | 92 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static const double PI = acos(-1.0);
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define FOR(i, a, b) for (int i = (int)(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static const double PI = acos(-1.0);
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define FOR(i, a, b) for (int i = (int)(a... | replace | 77 | 79 | 77 | 81 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld = long double;
using vin = vector<int>;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld = long double;
using vin = vector<int>;
... | replace | 62 | 64 | 62 | 66 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e10;
const long long MOD = 1e9 + 7;
using Grap... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define all(x) x.begin(), x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e10;
const long long MOD = 1e9 + 7;
using Grap... | replace | 204 | 205 | 204 | 205 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int mod = 998244353;
vector<pair<int, int>> steps;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
steps.push_back({x, y});
}
sort(steps.begin(), steps.end());
vector<int> dp(n);
dp[0] = 1;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int mod = 998244353;
vector<pair<int, int>> steps;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
steps.push_back({x, y});
}
sort(steps.begin(), steps.end());
vector<int> dp(n);
dp[0] = 1;
for... | replace | 19 | 20 | 19 | 20 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 998244353
long long dp[200005];
int main() {
ll N, K;
cin >> N >> K;
vector<pair<ll, ll>> LR(K);
rep(i, K) { cin >> LR[i].first >> LR[i].second; }
ll cu... | #include <bits/stdc++.h>
// g++ -std=c++11
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define DIV 998244353
long long dp[200005];
int main() {
ll N, K;
cin >> N >> K;
vector<pair<ll, ll>> LR(K);
rep(i, K) { cin >> LR[i].first >> LR[i].second; }
ll cu... | replace | 26 | 31 | 26 | 35 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
#define pp pair<long long, long long>
#define ppp pair<long lo... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
#define pp pair<long long, long long>
#define ppp pair<long lo... | replace | 34 | 38 | 34 | 42 | 0 | |
p02549 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
const double eps = 1e-12;
template <typename ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
const double eps = 1e-12;
template <typename ... | replace | 168 | 169 | 168 | 172 | 0 | |
p02549 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define repi(n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(p) p.begin(), p.end()
#define pop_count(p) __builtin_popcountll(p)
#define len(s, e) ... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define repi(n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(p) p.begin(), p.end()
#define pop_count(p) __builtin_popcountll(p)
#define len(s, e) ... | replace | 213 | 214 | 213 | 214 | TLE | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
templat... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
templat... | replace | 145 | 146 | 145 | 146 | 0 | |
p02549 | C++ | Runtime Error | /*
Dont BLUNDER
*/
// #pragma GCC optimize("O3")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <algorithm>
#include <array>
#include <bitset>
#include... | /*
Dont BLUNDER
*/
// #pragma GCC optimize("O3")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <algorithm>
#include <array>
#include <bitset>
#include... | replace | 106 | 107 | 106 | 107 | -11 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i, j, mod = 998244353;
cin >> n >> k;
vector<pair<long, long>> d(k);
for (j = 0; j < k; j++) {
cin >> d[j].first >> d[j].second;
}
vector<long long> ans(n + 1 + 100000, 0), cur(n + 1 + 100000, 0);
long long l, r, res;
res... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i, j, mod = 998244353;
cin >> n >> k;
vector<pair<long, long>> d(k);
for (j = 0; j < k; j++) {
cin >> d[j].first >> d[j].second;
}
vector<long long> ans(n + 1 + 100000, 0), cur(n + 1 + 100000, 0);
long long l, r, res;
res... | insert | 20 | 20 | 20 | 26 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma region atcoder
// #include <atcoder/all>
// using namespace atcoder;
#pragma endregion
#pragma region macros
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vl = vector<ll>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
usi... | #include <bits/stdc++.h>
using namespace std;
#pragma region atcoder
// #include <atcoder/all>
// using namespace atcoder;
#pragma endregion
#pragma region macros
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vl = vector<ll>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
usi... | replace | 105 | 108 | 105 | 111 | 0 | |
p02549 | C++ | Runtime Error | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typena... | replace | 302 | 304 | 302 | 308 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(... | replace | 79 | 80 | 79 | 80 | 0 | |
p02549 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
using ll = long long;
const ll MOD = 998244353;
const int INF = 1001001001;
// const ll INF = 1000000000000000000LL;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> pr(k);
rep(i, k) {
ll a, b;
cin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
using ll = long long;
const ll MOD = 998244353;
const int INF = 1001001001;
// const ll INF = 1000000000000000000LL;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> pr(k);
rep(i, k) {
ll a, b;
cin... | replace | 31 | 44 | 31 | 48 | TLE | |
p02549 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); ... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); ... | replace | 64 | 67 | 64 | 69 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ntest 0
#define l first
#define r second
using namespace std;
const int mod = 998244353;
int n, k;
pair<int, int> seg[11];
long long dp[100005], f[100005];
void solve() {
cin >> n >> k;
for (int i = 1; i <= k; ++i)
cin >> seg[i].l >> seg[i].r;
dp[1] = 1;
f[1] = 1;
for (i... | #include <bits/stdc++.h>
#define ntest 0
#define l first
#define r second
using namespace std;
const int mod = 998244353;
int n, k;
pair<int, int> seg[11];
long long dp[200005], f[200005];
void solve() {
cin >> n >> k;
for (int i = 1; i <= k; ++i)
cin >> seg[i].l >> seg[i].r;
dp[1] = 1;
f[1] = 1;
for (i... | replace | 10 | 11 | 10 | 11 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define sws ... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define sws ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define F... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define F... | replace | 33 | 36 | 33 | 41 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
const int mod = 998244353;
const int N = 1e5 + 10;
int a[N];
int f[N];
struct node {
int s[2];
} T[N];
bool cmp(node t1, node t2) { return t1.s[0] < t2.s[0]; }
int main() {
f[1] = 1;
f[2] = -1;
a[1] = 1;
int n, k;
cin >> n >> k... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
const int mod = 998244353;
const int N = 2e5 + 10;
int a[N];
int f[N];
struct node {
int s[2];
} T[N];
bool cmp(node t1, node t2) { return t1.s[0] < t2.s[0]; }
int main() {
f[1] = 1;
f[2] = -1;
a[1] = 1;
int n, k;
cin >> n >> k... | replace | 5 | 6 | 5 | 6 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
ll dp[(ll)(2e5 + 2)];
ll MOD = 998244353;
int main() {
memset(dp, 0, sizeof dp);
int n, k;
cin >> n >> k;
vector<pii> v(k);
for (int i = 0; i < k; i++) {
cin >> v[i].first >> v[i].second;
}
// int ans=0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
ll dp[(ll)(2e5 + 2)];
ll MOD = 998244353;
int main() {
memset(dp, 0, sizeof dp);
int n, k;
cin >> n >> k;
vector<pii> v(k);
for (int i = 0; i < k; i++) {
cin >> v[i].first >> v[i].second;
}
// int ans=0;
... | replace | 26 | 27 | 26 | 27 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
/*
CE
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<deque>
#include<iostream>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
*/
using namespace std;
#define rep(i,... | #include <bits/stdc++.h>
/*
CE
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<deque>
#include<iostream>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<vector>
*/
using namespace std;
#define rep(i,... | replace | 52 | 53 | 52 | 53 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fore(i, l, r) for (int i = int(l); i < int(r); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(a) int((a).size())
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fore(i, l, r) for (int i = int(l); i < int(r); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(a) int((a).size())
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi... | replace | 130 | 135 | 130 | 138 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, x, m;
cin >> n >> x >> m;
vector<bool> check(m + 1, false);
vector<ll> a;
ll rs;
check[x] = true;
a.push_back(x);
while (1) {
ll f = (x * x) % m;
if (check[f] ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, x, m;
cin >> n >> x >> m;
vector<bool> check(m + 1, false);
vector<ll> a;
ll rs;
check[x] = true;
a.push_back(x);
while (1) {
ll f = (x * x) % m;
if (check[f] ==... | replace | 32 | 33 | 32 | 33 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e18 + 7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N, X, M;
cin >> N >> X >> M;
vector<int> used(100005);
int old = X, j = 1;
used[X] = true;
while (t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e18 + 7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N, X, M;
cin >> N >> X >> M;
vector<int> used(100005);
int old = X, j = 1;
used[X] = true;
while (t... | insert | 30 | 30 | 30 | 34 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define MP... | #include <bits/stdc++.h>
using namespace std;
#define FOR(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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define MP... | replace | 59 | 60 | 59 | 60 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define int long long
#define mod 1000000007
#define pb push_back
#define S second
#define F first
#define INF 1e18
#define ordered_set ... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define int long long
#define mod 1000000007
#define pb push_back
#define S second
#define F first
#define INF 1e18
#define ordered_set ... | replace | 62 | 66 | 62 | 70 | TLE | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for... | insert | 35 | 35 | 35 | 39 | 0 | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inc... | replace | 53 | 54 | 53 | 54 | 0 | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | replace | 40 | 41 | 40 | 41 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int x, m;
vector<int> check(m + 5, 0);
vector<long long> store(m + 5, 0);
cin >> n >> x >> m;
check[x] = 1;
store[1] = x;
long long next = x;
long long ans = x;
for (long long i = 2; i <= n; i++) {
next = (next * next) % m;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int x, m;
vector<int> check(200001, 0);
vector<long long> store(200001, 0);
cin >> n >> x >> m;
check[x] = 1;
store[1] = x;
long long next = x;
long long ans = x;
for (long long i = 2; i <= n; i++) {
next = (next * next) % ... | replace | 5 | 7 | 5 | 7 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc \
int t; \
cin >> t; ... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc \
int t; \
cin >> t; ... | replace | 56 | 58 | 56 | 60 | TLE | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf... | insert | 36 | 36 | 36 | 40 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll n, ll x, ll m) {
ll ref = x;
ll now = x * x % m;
int cnt = 1;
vector<ll> d(m + 1);
d[0] = 0;
while (now != x) {
d[cnt] = ref;
ref += now;
now = now * now % m;
++cnt;
}
ref = n / cnt * ref + d[n % cnt];
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll n, ll x, ll m) {
ll ref = x;
ll now = x * x % m;
int cnt = 1;
vector<ll> d(m + 1);
d[0] = 0;
while (now != x) {
d[cnt] = ref;
ref += now;
now = now * now % m;
++cnt;
}
ref = n / cnt * ref + d[n % cnt];
return ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | replace | 85 | 86 | 85 | 86 | 0 | Total time elapsed :20.696 ms
|
p02550 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>... | insert | 40 | 40 | 40 | 44 | 0 | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include... | replace | 37 | 38 | 37 | 38 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, X, M;
cin >> N >> X >> M;
long long sum1 = 0;
long long sum2 = 0;
vector<long long> L(M);
vector<long long> count(M, 0);
L.at(0) = X;
count.at(X)++;
long long A = -1;
long long B = -1;
long long Y = -1;
if (N == 1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, X, M;
cin >> N >> X >> M;
if (M == 1) {
cout << 0 << endl;
return 0;
}
long long sum1 = 0;
long long sum2 = 0;
vector<long long> L(M);
vector<long long> count(M, 0);
L.at(0) = X;
count.at(X)++;
long long A = -1;
l... | insert | 6 | 6 | 6 | 11 | 0 | |
p02550 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <qu... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <qu... | replace | 51 | 53 | 51 | 55 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int x, m;
cin >> n >> x >> m;
vector<int> cir;
int cur = x;
vector<bool> vis(m);
int start = -1;
long long ans = 0;
long long sum = 0;
while (n > 0) {
if (cur == 0) {
cout << ans << '\n';
exit(0);
}
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
int x, m;
cin >> n >> x >> m;
vector<int> cir;
int cur = x;
vector<bool> vis(m);
int start = -1;
long long ans = 0;
long long sum = 0;
while (n > 0) {
if (cur == 0) {
cout << ans << '\n';
exit(0);
}
if... | replace | 30 | 31 | 30 | 38 | -6 | double free or corruption (out)
|
p02550 | C++ | Runtime Error | // Bismillah Hir Rehmanir Rahim
// Allah knows best
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <... | // Bismillah Hir Rehmanir Rahim
// Allah knows best
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <... | replace | 49 | 50 | 49 | 50 | 0 | |
p02550 | C++ | Runtime Error | // Bismillah Hir Rehmanir Rahim
// Allah knows best
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <... | // Bismillah Hir Rehmanir Rahim
// Allah knows best
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <... | replace | 49 | 50 | 49 | 50 | 0 | |
p02550 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x, m;
cin >> n >> x >> m;
if (m == 0 || x == 0)
return cout << 0, 0;
ll ans = 0;
ll a = x % m;
vector<ll> v;
set<ll> s;
while (n > 0) {
if (s.f... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x, m;
cin >> n >> x >> m;
if (m == 0 || x == 0)
return cout << 0, 0;
ll ans = 0;
ll a = x % m;
vector<ll> v;
set<ll> s;
while (n > 0) {
if (s.f... | replace | 25 | 26 | 25 | 26 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, X, M, c = 0, lp, st, lpp;
cin >> N >> X >> M;
map<ll, ll> mp;
mp[X] = c;
vector<ll> A(M + 100), S(M + 100);
A[0] = X;
S[0] = X;
while (1) {
c++;
X = (X * X) % M;
if (mp.count(X)) {
lp = c - mp.at(X... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, X, M, c = 0, lp, st, lpp;
cin >> N >> X >> M;
map<ll, ll> mp;
mp[X] = c;
vector<ll> A(M + 100), S(M + 100);
A[0] = X;
S[0] = X;
while (1) {
c++;
X = (X * X) % M;
if (mp.count(X)) {
lp = c - mp.at(X... | replace | 35 | 36 | 35 | 37 | 0 | |
p02550 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
#define all(v) v.begin(), v.end()
#define all(v) v.begin(), v.end()
#define endl "\n"
#define clr(n, r) memset(n, r, sizeof(n))
typedef bitset<13> MASK;
typedef pair<int, int> ii;
typedef vector<ii> v... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
#define all(v) v.begin(), v.end()
#define all(v) v.begin(), v.end()
#define endl "\n"
#define clr(n, r) memset(n, r, sizeof(n))
typedef bitset<13> MASK;
typedef pair<int, int> ii;
typedef vector<ii> v... | replace | 75 | 76 | 75 | 76 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<ll, ll>... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<ll, ll>... | insert | 97 | 97 | 97 | 101 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | replace | 259 | 260 | 259 | 260 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;... | insert | 20 | 20 | 20 | 24 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | replace | 21 | 23 | 21 | 23 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, X, M;
cin >> N >> X >> M;
if (M > 1) {
vector<long int> vec(2 * M);
vec.at(0) = X % M;
for (long int i = 1; i <= 2 * M - 1; i++) {
long int k = vec.at(i - 1) % M;
long int l = (k * k) % M;
vec.at(i) = l;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, X, M;
cin >> N >> X >> M;
if (M > 1) {
vector<long int> vec(2 * M);
vec.at(0) = X % M;
for (long int i = 1; i <= 2 * M - 1; i++) {
long int k = vec.at(i - 1) % M;
long int l = (k * k) % M;
vec.at(i) = l;
}
... | replace | 56 | 61 | 56 | 57 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 998244353
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_bound
#define sum(a) (accumulate((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 998244353
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_bound
#define sum(a) (accumulate((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a)... | replace | 47 | 51 | 47 | 51 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9 + 7LL;
int main() {
ll N, X, M;
cin >> N >> X >> M;
ll f = X;
ll ans = 0;
map<ll, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.14159265358979
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1e9 + 7LL;
int main() {
ll N, X, M;
cin >> N >> X >> M;
ll f = X;
ll ans = 0;
map<ll, ... | replace | 36 | 38 | 36 | 41 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
const ll mod = (ll)998244353;
ll powmod(ll a, ll k, ll m) {
if (k == 0)
return 1;
ll t = powmod(a, k / 2, m);
t = (t * t) % mod;
if (k % 2 == 1)
t = (t * a) % mod;
return t;
}
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
const ll mod = (ll)998244353;
ll powmod(ll a, ll k, ll m) {
if (k == 0)
return 1;
ll t = powmod(a, k / 2, m);
t = (t * t) % mod;
if (k % 2 == 1)
t = (t * a) % mod;
return t;
}
int... | insert | 35 | 35 | 35 | 39 | 0 | |
p02550 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <io... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <io... | insert | 357 | 357 | 357 | 358 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | replace | 396 | 397 | 396 | 397 | TLE | |
p02550 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
const double eps = 1e-12;
template <typename ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
const double eps = 1e-12;
template <typename ... | insert | 84 | 84 | 84 | 86 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
#define all(v) v.begin(), v.end()
#define rall(x) (x).rbegin(), (x).rend()
... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
#define all(v) v.begin(), v.end()
#define rall(x) (x).rbegin(), (x).rend()
... | insert | 62 | 62 | 62 | 66 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define lwb lower_bound
#define upb upper_bound
#define Size(a) int((a).size())
#define reset(s, n) memset(s, n, sizeof(s))
#define bit(n, i) (((n) >> (i)) & 1)
#define cntbit(n) __builtin_popcountll(n)
#define all(a)... | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define lwb lower_bound
#define upb upper_bound
#define Size(a) int((a).size())
#define reset(s, n) memset(s, n, sizeof(s))
#define bit(n, i) (((n) >> (i)) & 1)
#define cntbit(n) __builtin_popcountll(n)
#define all(a)... | insert | 70 | 70 | 70 | 74 | 0 |
Time elapsed: 9ms
|
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define X \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed << std::setprecision(2) << (x)
void __print(int x) { cerr <<... | #include <bits/stdc++.h>
using namespace std;
#define X \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed << std::setprecision(2) << (x)
void __print(int x) { cerr <<... | replace | 154 | 155 | 154 | 155 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02550 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
int main() {
ll n, x, m;
cin >> n >> x >> m;
... | replace | 12 | 14 | 12 | 13 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
llint N, X, M;
cin >> N >> X >> M;
// ループするまで
vector<bool> sumi(M, false);
llint sum = 0;
llint A;
bool loop = false;
llint loop_start = -1;
for (int i = 1; i <= N; i++) {
if (i == 1) {
A = X;
... | #include <bits/stdc++.h>
#define llint long long int
using namespace std;
int main() {
llint N, X, M;
cin >> N >> X >> M;
if (N == 1) {
cout << X << endl;
return 0;
}
// ループするまで
vector<bool> sumi(M, false);
llint sum = 0;
llint A;
bool loop = false;
llint loop_start = -1;
for (int... | insert | 11 | 11 | 11 | 16 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define fbo find_by_order
#define ook order_of_key
#define fi first
#define se second
#define long long long
typedef pair<int, int> ii;
typedef pair<int, ii>... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define fbo find_by_order
#define ook order_of_key
#define fi first
#define se second
#define long long long
typedef pair<int, int> ii;
typedef pair<int, ii>... | replace | 30 | 31 | 30 | 31 | -8 | |
p02550 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cassert>
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cassert>
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <... | insert | 51 | 51 | 51 | 55 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<ll> vll;
#define all(v) v.begin(), v.end()
#de... | #include <bits/stdc++.h>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<ll> vll;
#define all(v) v.begin(), v.end()
#de... | replace | 38 | 39 | 38 | 39 | 0 | |
p02550 | C++ | Runtime Error | /*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
using pii = pair<int, int>;
const double PI = acos(-1.... | /*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
using pii = pair<int, int>;
const double PI = acos(-1.... | replace | 159 | 160 | 159 | 160 | 0 | |
p02550 | C++ | Runtime Error | #define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLINF... | #define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLINF... | replace | 119 | 120 | 119 | 120 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | replace | 91 | 92 | 91 | 92 | TLE | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#in... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#in... | replace | 86 | 87 | 86 | 87 | 0 | |
p02550 | C++ | Runtime Error | #include <cstdio>
#include <map>
using namespace std;
long long n, x, m;
long long a[200005];
map<long long, int> ma;
int l, r;
long long sum, asum;
int main() {
scanf("%lld%lld%lld", &n, &x, &m);
a[1] = x;
for (int i = 2;; ++i) {
a[i] = a[i - 1] * a[i - 1] % m;
if (ma.count(a[i])) {
l = ma[a[i]];
... | #include <cstdio>
#include <map>
using namespace std;
long long n, x, m;
long long a[200005];
map<long long, int> ma;
int l, r;
long long sum, asum;
int main() {
scanf("%lld%lld%lld", &n, &x, &m);
a[1] = x;
for (int i = 2;; ++i) {
a[i] = a[i - 1] * a[i - 1] % m;
if (ma.count(a[i])) {
l = ma[a[i]];
... | insert | 34 | 34 | 34 | 35 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
// using ll = long long;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = long double;
// #ifndef ONLINE_JU... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
// using ll = long long;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = long double;
// #ifndef ONLINE_JU... | replace | 468 | 469 | 468 | 469 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << #x << "]: " << (x) << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, x, MOD;
cin >> n >> x >> MOD;
vector<pair<ll, int>> m(MOD + 1);
ll ans = 0;
ll i = 1;
while (!m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << #x << "]: " << (x) << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, x, MOD;
cin >> n >> x >> MOD;
vector<pair<ll, int>> m(MOD + 1);
ll ans = 0;
ll i = 1;
while (!m... | replace | 16 | 17 | 16 | 17 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | replace | 42 | 44 | 42 | 43 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n))
x++;
return ... | #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n))
x++;
return ... | replace | 2,174 | 2,175 | 2,174 | 2,175 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
ll weight;
Edge(int t, ll w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector<... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
ll weight;
Edge(int t, ll w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector<... | replace | 31 | 32 | 31 | 32 | 0 | |
p02550 | C++ | Runtime Error |
#define INF 10000000000
#define MOD 1000000007
#if 1 // use_templates
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#includ... |
#define INF 10000000000
#define MOD 1000000007
#if 1 // use_templates
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#includ... | insert | 60 | 60 | 60 | 64 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
#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 F first
#define S second
#define int ll
#define sz(x) ((ll)x.size())
#define all(x) x.begin(), x.end()
#define eb emp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
#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 F first
#define S second
#define int ll
#define sz(x) ((ll)x.size())
#define all(x) x.begin(), x.end()
#define eb emp... | replace | 51 | 53 | 51 | 53 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, mod, x, ans;
int a[1000005];
int a2[1000005];
signed main() {
cin >> n >> x >> mod;
int pos = 0, len = 0, pos2 = n, sum = 0;
for (int i = 1; i <= n; i++) {
ans += x;
a[x] = i;
a2[i] = x;
x = (x * x) % mod;
if (a[x]) {
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, mod, x, ans;
int a[1000005];
int a2[1000005];
signed main() {
cin >> n >> x >> mod;
int pos = 0, len = 0, pos2 = n, sum = 0;
if (n <= 100000) {
for (int i = 1; i <= pos2; i++) {
ans += x;
x = (x * x) % mod;
}
cout <... | insert | 9 | 9 | 9 | 17 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define X first
#define Y second
#define nl '\n'
#define AC return 0
#define pb(a) push_back(a)
#define mst(a, b) memset(a, b, sizeof a)
#define rep(i, n) for (int i = 0; (i) < (n); i++)
#define rep1(i, n) for (int i = 1; (i) <= (n); ... | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define X first
#define Y second
#define nl '\n'
#define AC return 0
#define pb(a) push_back(a)
#define mst(a, b) memset(a, b, sizeof a)
#define rep(i, n) for (int i = 0; (i) < (n); i++)
#define rep1(i, n) for (int i = 1; (i) <= (n); ... | replace | 42 | 43 | 42 | 44 | -8 | |
p02550 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
N, X, M = [int(x) for x in input().split()]
x = {}
ruiseki = [0] * (M + 1)
cnt = 1
ans = X
c = X
ruiseki[1] = ans
while cnt < N:
next = c**2 % M
if next in x.keys():
y = x[ne... | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
N, X, M = [int(x) for x in input().split()]
x = {}
ruiseki = [0] * (M + 1)
cnt = 1
ans = X
c = X
ruiseki[1] = ans
while cnt < N:
if c == 0:
print(ans)
return
next... | insert | 19 | 19 | 19 | 22 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/// ----------------------------- (Debug) ------------------------------
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeo... | #include <bits/stdc++.h>
using namespace std;
/// ----------------------------- (Debug) ------------------------------
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeo... | replace | 96 | 97 | 96 | 97 | 0 | [x: 2] [s: [2]] [ -->Line: 68]
|
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<long, long>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
vll rem(1e5 + 5, 0), vec(1e5 + ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<long, long>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
vll rem(1e5 + 5, 0), vec(1e5 + ... | replace | 32 | 37 | 32 | 42 | 0 | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | replace | 39 | 40 | 39 | 42 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | replace | 273 | 274 | 273 | 274 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li, li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i, l, r) for (li i = l; i <= r; ++i)
#define fr(i, l, r... | #include <bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li, li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i, l, r) for (li i = l; i <= r; ++i)
#define fr(i, l, r... | replace | 42 | 43 | 42 | 43 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, x, m, ans = 0;
cin >> n >> x >> m;
vector<long> k, s(m);
map<long, long> mp;
long cur = x, d = 0, e = 0;
k.push_back(cur);
mp[cur] = 1;
for (int i = 2; i <= m; i++) {
cur = (cur * cur) % m;
k.push_back(cur);
if (1 <= mp[... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, x, m, ans = 0;
cin >> n >> x >> m;
if (x == 0) {
cout << 0 << endl;
return 0;
}
vector<long> k, s(m);
map<long, long> mp;
long cur = x, d = 0, e = 0;
k.push_back(cur);
mp[cur] = 1;
for (int i = 2; i <= m; i++) {
cur ... | insert | 6 | 6 | 6 | 10 | 0 | |
p02550 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class... | replace | 34 | 35 | 34 | 35 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.