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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02548 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i < n; i++) {
int temp = n - i;
for (int f = 1; f * f <= temp; f++) {
if (temp % f == 0)
ans += 2;
if (f * f == temp)
ans -= 1;
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
long long temp = (i * j);
if (temp >= n)
break;
ans++;
}
}
cout << ans << endl;
}
| replace | 7 | 14 | 7 | 13 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef lo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef lo... | replace | 62 | 71 | 62 | 67 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
template <typename T1, typename T2> inline void chmin(T1 &a, T... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
template <typename T1, typename T2> inline void chmin(T1 &a, T... | replace | 23 | 44 | 23 | 27 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer(x) cout << endl << "answer : " << x << endl << endl;
#define op(x) cout << x << endl;
#define maxn 5000... | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer(x) cout << endl << "answer : " << x << endl << endl;
#define op(x) cout << x << endl;
#define maxn 5000... | replace | 26 | 36 | 26 | 28 | TLE | |
p02548 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto &e : a)
#ifdef LOCAL
#define logv(a) ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto &e : a)
#ifdef LOCAL
#define logv(a) ... | replace | 132 | 143 | 132 | 137 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
// -2.1e-9 <= int <= 2.1e9
// -9... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
// -2.1e-9 <= int <= 2.1e9
// -9... | replace | 31 | 33 | 31 | 33 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) fo... | replace | 25 | 36 | 25 | 28 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define pb push_back
#define mp mak... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define pb push_back
#define mp mak... | replace | 19 | 20 | 19 | 22 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int c = 1; c < n; c++) {
int num = n - c;
for (int i = 1; i <= sqrt(num); ++i) {
if (num % i == 0)
if (num / i == i) {
ans++;... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i < n; i++) {
ans += (n - 1) / i;
}
cout << ans << endl;
} | replace | 10 | 22 | 10 | 12 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2, 62);
ll yakusuu(ll x) {
ll sum = 0;
for (int... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2, 62);
ll yakusuu(ll x) {
ll sum = 0;
for (int... | replace | 28 | 30 | 28 | 37 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(... | replace | 119 | 132 | 119 | 121 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
int ab;
int m = 0;
for (c = 1; c < n; ++c) {
ab = n - c;
for (a = 1; a * a <= ab; ++a) {
b = ab / a;
if (a * b == ab) {
m += 2;
if (a == b)
m--;
}
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
int ab;
int m = 0;
for (c = 1; c < n; ++c) {
for (a = 1; a * a <= c; ++a) {
b = c / a;
if (a * b == c) {
m += 2;
if (a == b)
m--;
}
}
}
cout << m << ... | replace | 11 | 15 | 11 | 14 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int c = 1; c < N; c++) {
int T = N - c;
for (int b = 1; b <= T; b++) {
if (T % b == 0) {
count++;
}
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int a = 1; a < N; a++) {
count += (N - 1) / a;
}
cout << count << endl;
return 0;
} | replace | 8 | 15 | 8 | 10 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int ans = 0;
for (int a = 1; a < n; a++) {
for (int c = 1; c < n; c++) {
if ((n - c) % a == 0)
ans++;
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
ans += (n - 1) / i;
}
cout << ans << endl;
}
| replace | 6 | 11 | 6 | 9 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i * j < n)
ans++;
// for(int k=1;k<=n-i*j;k++)
// {
// if(i*j+k==n)ans++;
//// cout<<i<<' '<<j<<' '<<k ;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= int(n / i); j++) {
if (i * j != n)
ans++;
// for(int k=1;k<=n-i*j;k++)
// {
// if(i*j+k==n)ans++;
//// cout<<i<<' '<<j<<' '<<k... | replace | 5 | 8 | 5 | 8 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
constexpr int inf = 1 << 30;
constexpr int mo = 1e9 + 7;
constexpr ll infl = 1ll << 60;
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int pat = 0;
for (int c = 1; c <= n... | #include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
constexpr int inf = 1 << 30;
constexpr int mo = 1e9 + 7;
constexpr ll infl = 1ll << 60;
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int pat = 0;
for (int a = 1; a < n;... | replace | 16 | 25 | 16 | 18 | TLE | |
p02548 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1000005;
std::vector<ll> num_divisor(MAX_N, 0);
ll init_num_divisor() {
for (int i = 1; i < MAX_N; ++i) {
for (int j = i; j < MAX_N; j += i) {
num_divisor[j]++;
}
}
}
int main() {
init_num_divisor();
int N;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1000005;
std::vector<ll> num_divisor(MAX_N, 0);
void init_num_divisor() {
for (int i = 1; i < MAX_N; ++i) {
for (int j = i; j < MAX_N; j += i) {
num_divisor[j]++;
}
}
}
int main() {
init_num_divisor();
int N;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POS... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POS... | replace | 130 | 139 | 130 | 135 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int c = 1; c < n; c++) {
ll d = n - c;
for (int a = 1; a * a <= d; a++) {
if (d % a == 0 && d / a != a)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 1; i <= n - 1; i++) {
ans += (n - 1) / i;
}
cout << ans;
}
| replace | 10 | 18 | 10 | 12 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //PBDS
#include <ext/pb_ds/tree_policy.hpp> //PBDS
#define int long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pi pair<int, int>
#define deb(x) cerr << #x << " : " << x << endl;
#define fast ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //PBDS
#include <ext/pb_ds/tree_policy.hpp> //PBDS
#define int long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pi pair<int, int>
#define deb(x) cerr << #x << " : " << x << endl;
#define fast ... | replace | 37 | 45 | 37 | 41 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost:... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost:... | replace | 68 | 78 | 68 | 74 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
long long n;
cin >> n;
long long ans = 0;
f... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
long long n;
cin >> n;
long long ans = 0;
f... | replace | 16 | 21 | 16 | 18 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define sz(a) (int)(a.size())
#define pb push_back
#define all(c) c.begin(), c.end()
#define tr(it, a, c) for (auto it = c.begin() + a; it != c.end(); it++)
#define fr(i, a, n) for (int i = a; i < n; i++)
#define present(c, x) (c.f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define sz(a) (int)(a.size())
#define pb push_back
#define all(c) c.begin(), c.end()
#define tr(it, a, c) for (auto it = c.begin() + a; it != c.end(); it++)
#define fr(i, a, n) for (int i = a; i < n; i++)
#define present(c, x) (c.f... | replace | 82 | 90 | 82 | 83 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i < n; i++) {
int a = n - i;
for (int j = 1; j * j <= a; j++) {
if (j * (a / j) == a)
count += 2;
if (j * (a / j) == a && j == a / j)
count--;
}
}
cout << count... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i < n; i++) {
count += (n - 1) / i;
}
cout << count;
return 0;
}
| replace | 8 | 15 | 8 | 9 | TLE | |
p02548 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define FOA(x) for(int i=0;i<x;i++)
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i < N; i++) {
count = count + (N / i - 1);
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define FOA(x) for(int i=0;i<x;i++)
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i < N; i++) {
count = count + (N - 1) / i;
}
cout << count << endl;
} | replace | 8 | 10 | 8 | 10 | -8 | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i < N; i++) {
int n = N - i;
for (int j = 1; j <= sqrt(n); j++) {
if (n % j == 0) {
ans += 2;
}
}
if (sqrt(n) == floor(sqrt(n))) {
a... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N - 1; i++) {
ans += (N - 1) / i;
}
cout << ans << endl;
return 0;
}
| replace | 10 | 20 | 10 | 12 | TLE | |
p02548 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll ex... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll ex... | replace | 28 | 37 | 28 | 29 | -8 | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
time:
wa:
反省:
考察:
*/
int main() {
int n;
cin >> n;
long long count = 0;
for (int c = 1; c <= n - 1; c++) {
for (int a = 1; a <= sqrt(n - c); a++) {
if ((n - c) % a == 0 ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
time:
wa:
反省:
考察:
*/
int main() {
int n;
cin >> n;
long long count = 0;
for (int a = 1; a <= n - 1; a++) {
count += (n - 1) / a;
}
cout << count << endl;
return 0;
} | replace | 17 | 24 | 17 | 19 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int64_t i6;
typedef std::vector<std::vector<int64_t>> Graph;
#define rep(i, n) for (int64_t i = 0; i < n; ++i)
#define rep2(i, n) for (int64_t i = 1; i <= n; ++i)
#define repb(i, l, n) for (int64_t i = l; i < n; ++i)
#define repb2(i, l, n) fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int64_t i6;
typedef std::vector<std::vector<int64_t>> Graph;
#define rep(i, n) for (int64_t i = 0; i < n; ++i)
#define rep2(i, n) for (int64_t i = 1; i <= n; ++i)
#define repb(i, l, n) for (int64_t i = l; i < n; ++i)
#define repb2(i, l, n) fo... | replace | 86 | 87 | 86 | 90 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl ("\n")
#define pi (3.141592653589)
#define mod 1000000007
#define INF 1000000009
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define so sizeof
#define pii pair<ll, ll>
#define all(c) c.b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl ("\n")
#define pi (3.141592653589)
#define mod 1000000007
#define INF 1000000009
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define so sizeof
#define pii pair<ll, ll>
#define all(c) c.b... | replace | 29 | 40 | 29 | 31 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}... | replace | 184 | 186 | 184 | 186 | TLE | |
p02548 | C++ | Time Limit Exceeded | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;... | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;... | replace | 87 | 89 | 87 | 91 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>... | replace | 54 | 63 | 54 | 56 | TLE | |
p02548 | 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, s, n) for (int i = s; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main() {
ll n;
cin >> n;
ll ans = 0;
ll tmp,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = s; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main() {
ll n;
cin >> n;
ll ans = 0;
REP(i, ... | replace | 12 | 25 | 12 | 13 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// 整数の入力
int N;
int cnt = 0;
int a, b;
cin >> N;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= int(sqrt(N - i)); j++) {
a = (N - i) % j;
b = (N - i) / j;
// cout << i <<" "<< j <<" " << (N-i)%j<< endl;
if... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// 整数の入力
int N;
int cnt = 0;
int a, b;
cin >> N;
for (int i = 1; i < N; i++) {
for (int j = 1; j * j <= N - i; j++) {
a = (N - i) % j;
b = (N - i) / j;
// cout << i <<" "<< j <<" " << (N-i)%j<< endl;
if (a == ... | replace | 10 | 11 | 10 | 11 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD1 1000000007
#define MOD2 998244353
#define nl cout << endl
#define rt ll Q[100005] = {0}
#define mp make_pair
#define test() ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD1 1000000007
#define MOD2 998244353
#define nl cout << endl
#define rt ll Q[100005] = {0}
#define mp make_pair
#define test() ... | replace | 74 | 75 | 74 | 75 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int count = 0;
for (long long i = 1; i < N; i++) {
int a = sqrt(N - i);
for (int j = 1; j <= a; j++) {
if ((N - i) % j == 0) {
long long b = (N - i) / j;
if (b == j) {
count++;
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int count = 0;
for (int i = 1; i <= N - 1; i++) {
count += (N - 1) / i;
}
cout << count << endl;
} | replace | 7 | 20 | 7 | 9 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL << 60; // 仮想的な無限大の値;
using ll = long long;
using P = pair<int, in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL << 60; // 仮想的な無限大の値;
using ll = long long;
using P = pair<int, in... | replace | 57 | 74 | 57 | 66 | TLE | |
p02549 | C++ | Runtime Error | #include "bits/stdc++.h"
#define MOD 998244353
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << ... | #include "bits/stdc++.h"
#define MOD 998244353
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << ... | replace | 101 | 102 | 101 | 102 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##end = (b); i <= i##end; i++)
#define temT template <typename T>
using namespace std;
typedef long long ll;
const ll mo = 998244353;
const int N = int(2e5) + 10;
int n, K, a[11][2];
temT inline T add(T x, T y) { return (x += y, x >= mo) ? x -= mo : x; ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##end = (b); i <= i##end; i++)
#define temT template <typename T>
using namespace std;
typedef long long ll;
const ll mo = 998244353;
const int N = int(2e5) + 10;
int n, K, a[11][2];
temT inline T add(T x, T y) { return (x += y, x >= mo) ? x -= mo : x; ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
const ll mod = 998244353;
using namespace std;
#define int ll
struct node {
ll val = 0;
ll lz = 0;
} st[1 << 19];
void push(int p, int l = 0, int r = 0) {
st[p].val %= mod;
st[p].val += st[p].lz * (r - l + 1);
st[p].val %= mod;
st[p * 2].lz += st[p].lz;
st... | #include <bits/stdc++.h>
using ll = long long;
const ll mod = 998244353;
using namespace std;
#define int ll
struct node {
ll val = 0;
ll lz = 0;
} st[8000001];
void push(int p, int l = 0, int r = 0) {
st[p].val %= mod;
st[p].val += st[p].lz * (r - l + 1);
st[p].val %= mod;
st[p * 2].lz += st[p].lz;
st... | replace | 10 | 11 | 10 | 11 | 0 | |
p02549 | 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++)
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
... | replace | 61 | 62 | 61 | 62 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> t, ans(n + 100000, {0, 0});
for (ll _ = 0; _ < k; ++_) {
pair<ll, ll> p;
cin >> p.first >> p.second;
t.push_back(p);
}
ll f = 0;
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> t, ans(n + 250000, {0, 0});
for (ll _ = 0; _ < k; ++_) {
pair<ll, ll> p;
cin >> p.first >> p.second;
t.push_back(p);
}
ll f = 0;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
// Definitions
#define MAXN 210
// #define MAXN 200010
#define MOD 998244353
#define elif else if
typedef long long int64;
#define File(s) freopen(#s ".in", "r", stdin), freopen(#s ".out", "w", stdout)
// Variables
int n, k, l[MAXN], r[MAXN];
// Pynamic Pro... | #include <algorithm>
#include <cstdio>
using namespace std;
// Definitions
// #define MAXN 210
#define MAXN 200010
#define MOD 998244353
#define elif else if
typedef long long int64;
#define File(s) freopen(#s ".in", "r", stdin), freopen(#s ".out", "w", stdout)
// Variables
int n, k, l[MAXN], r[MAXN];
// Pynamic Pro... | replace | 5 | 7 | 5 | 7 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define r... | replace | 148 | 149 | 148 | 149 | -11 | |
p02549 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
struct _IO {
_IO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} _io;
typedef long long ll;
typedef long double db;
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1;
y = 0;
return a;
}... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
struct _IO {
_IO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} _io;
typedef long long ll;
typedef long double db;
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1;
y = 0;
return a;
}... | replace | 51 | 52 | 51 | 52 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
ll mod = 998244353;
ll inf = 1e18;
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
ll mod = 998244353;
ll inf = 1e18;
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
vector<ll> ... | replace | 14 | 16 | 14 | 16 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio ... | replace | 132 | 134 | 132 | 134 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { ... | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { ... | insert | 63 | 63 | 63 | 65 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | replace | 41 | 43 | 41 | 43 | 0 | |
p02549 | C++ | Runtime Error | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define... | replace | 80 | 81 | 80 | 81 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i... | replace | 243 | 244 | 243 | 244 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, k;
int l[200005], r[200005];
int dp[200005];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++) {
scanf("%d %d", &l[i], &r[i]);
}
dp[1] = 1;
dp[2] = -1;
for (int i = 1; i <= n; i++) {
dp[i] = (dp[i] + dp... | #include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, k;
int l[200005], r[200005];
int dp[2000005];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++) {
scanf("%d %d", &l[i], &r[i]);
}
dp[1] = 1;
dp[2] = -1;
for (int i = 1; i <= n; i++) {
dp[i] = (dp[i] + d... | replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 998244353
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> v, tmp;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
tmp.... | #include <algorithm>
#include <iostream>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 998244353
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> v, tmp;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
tmp.... | replace | 39 | 45 | 39 | 49 | -6 | munmap_chunk(): invalid pointer
|
p02549 | C++ | Runtime Error | /*
******
Author: Nguyen Phuc Chuong
******
*/
#include <bits/stdc++.h>
using namespace std;
long long a[10][2];
long long dp[200000];
const long long mod = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; ... | /*
******
Author: Nguyen Phuc Chuong
******
*/
#include <bits/stdc++.h>
using namespace std;
long long a[10][2];
long long dp[200000];
const long long mod = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; ... | replace | 31 | 35 | 31 | 39 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
// auto mod int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
// auto mod int... | replace | 85 | 86 | 85 | 86 | 0 | |
p02549 | 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 | 68 | 69 | 68 | 69 | 0 | Total time elapsed :20.829 ms
|
p02549 | C++ | Runtime Error | #include <iostream>
#include <set>
#define N_MAX (2 * 1000)
#define MOD (998244353)
unsigned int dp[N_MAX];
int main() {
int N, K;
std::cin >> N >> K;
int L[10], R[10];
for (int i = 0; i < K; i++) {
std::cin >> L[i] >> R[i];
}
dp[0] = 1;
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1];
for... | #include <iostream>
#include <set>
#define N_MAX (2 * 100000)
#define MOD (998244353)
unsigned int dp[N_MAX];
int main() {
int N, K;
std::cin >> N >> K;
int L[10], R[10];
for (int i = 0; i < K; i++) {
std::cin >> L[i] >> R[i];
}
dp[0] = 1;
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1];
f... | replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long N, K, l[11], r[11], memo[200010], prefix[400010];
void Input() {
cin >> N >> K;
for (long long i = 1; i <= K; i++) {
cin >> l[i] >> r[i];
}
}
void Solve() {
memset(prefix, 0, sizeof prefix);
prefix[N] = 1;
memo[N... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long N, K, l[11], r[11], memo[200010], prefix[400010];
void Input() {
cin >> N >> K;
for (long long i = 1; i <= K; i++) {
cin >> l[i] >> r[i];
}
}
void Solve() {
memset(prefix, 0, sizeof prefix);
prefix[N] = 1;
memo[N... | replace | 20 | 22 | 20 | 22 | 0 | |
p02549 | 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 = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) { cin >> l[i] >> r[i]; }
vector<int> dp(n + 10);
dp[1] = 1;
for (int i = 1; i < n; i++)... | #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 = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) { cin >> l[i] >> r[i]; }
vector<int> dp(n + 10);
dp[1] = 1;
for (int i = 1; i < n; i++)... | replace | 18 | 20 | 18 | 21 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, x, n) for (int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
// const ll mod = 1e9+7;
c... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, x, n) for (int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
// const ll mod = 1e9+7;
c... | replace | 15 | 16 | 15 | 16 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353
typedef long long ll;
using namespace std;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() { return mint(-x); }
mint operator+=(mint rhs) {
x += rhs.x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint operator-=(m... | #include <bits/stdc++.h>
#define MOD 998244353
typedef long long ll;
using namespace std;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() { return mint(-x); }
mint operator+=(mint rhs) {
x += rhs.x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint operator-=(m... | replace | 45 | 48 | 45 | 49 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define debug_value(x) \
cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x \
<< endl;
#define debug(x)... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define debug_value(x) \
cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x \
<< endl;
#define debug(x)... | replace | 22 | 23 | 22 | 23 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define N 200005
int n, k;
vector<pair<int, int>> d;
long dp[N], sumdp[N];
int dcnt = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
d.reserve(k + 1);
for (int i = 0; i < k; i++) {
int s, e;
cin >> s >> ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define N 200005
int n, k;
vector<pair<int, int>> d;
long dp[N], sumdp[N];
int dcnt = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
d.reserve(k + 1);
for (int i = 0; i < k; i++) {
int s, e;
cin >> s >> ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 998244353;
const int N = 200005;
int a[N], b[N];
LL f[N], c[20];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
f[1] = 1;
for (int i = 2; i <= n; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 998244353;
const int N = 200005;
int a[N], b[N];
LL f[N], c[20];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
f[1] = 1;
for (int i = 2; i <= n; i+... | replace | 19 | 20 | 19 | 20 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
const int MAXN = 1e5 + 5;
const int mod = 998244353;
LL tr[MAXN], dp[MAXN];
int n, k, L[15], R[15];
void update(int x, LL y) {
for (; x <= n; x += (x & (-x)))
tr[x] = (tr[x] + y) % mod;
}
LL find(int x) {
if (!... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
const int MAXN = 2e5 + 5;
const int mod = 998244353;
LL tr[MAXN], dp[MAXN];
int n, k, L[15], R[15];
void update(int x, LL y) {
for (; x <= n; x += (x & (-x)))
tr[x] = (tr[x] + y) % mod;
}
LL find(int x) {
if (!... | replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define mkp(x, y) make_pair(x, y)
#define L length()
#define int long long
#define bs binary_search
#define mod 1e9 + 7
#define IOS \
ios_base::sync... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define mkp(x, y) make_pair(x, y)
#define L length()
#define int long long
#define bs binary_search
#define mod 1e9 + 7
#define IOS \
ios_base::sync... | replace | 87 | 89 | 87 | 89 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | replace | 458 | 459 | 458 | 459 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
int n, k, lft[N], rgt[N];
int dp[N];
int add(int x, int y) {
if (x + y >= mod) {
return x + y - mod;
}
return x + y;
}
int sub(int x, int y) {
if (x - y < 0) {
return x - y + mod;
}
return x - y;
}
in... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
int n, k, lft[N], rgt[N];
int dp[N];
int add(int x, int y) {
if (x + y >= mod) {
return x + y - mod;
}
return x + y;
}
int sub(int x, int y) {
if (x - y < 0) {
return x - y + mod;
}
return x - y;
}
in... | replace | 41 | 43 | 41 | 47 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <map>
#include <set>
#include <vector>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMIT2 500010
#define L... | #include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <map>
#include <set>
#include <vector>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMIT2 500010
#define L... | replace | 103 | 104 | 103 | 104 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M 998244353
long long tree[400005], dp[200001], lazy[400005];
void build(int node, int start, int end) {
if (start == end) {
// Leaf node will have a single element
tree[node] = dp[start];
} else {
int mid = (start + end) / 2;
// Recurse on the l... | #include <bits/stdc++.h>
using namespace std;
#define M 998244353
long long tree[5000050], dp[3000005], lazy[5000050];
void build(int node, int start, int end) {
if (start == end) {
// Leaf node will have a single element
tree[node] = dp[start];
} else {
int mid = (start + end) / 2;
// Recurse on th... | replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
static const ll mod = 998244353;
ll N, K;
ll dp[100005];
ll sum[100005];
int main() {
cin >> N >> K;
vector<P> A(K);
for (ll i = 0; i < K; i++) {
ll l, r;
cin >> l >> r;
P p(l, r);
A[i] = p;
}
dp[0] = 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
static const ll mod = 998244353;
ll N, K;
ll dp[200005];
ll sum[200005];
int main() {
cin >> N >> K;
vector<P> A(K);
for (ll i = 0; i < K; i++) {
ll l, r;
cin >> l >> r;
P p(l, r);
A[i] = p;
}
dp[0] = 1... | replace | 6 | 8 | 6 | 8 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 998244353;
const long double PI = 3.14159265358979;
const ll MAX = 0;
ll DP[200020];
int main() {
ll N, K;
cin >> N >> K;
ll L[K];
ll R[K];
rep(i, K) { cin >> L[i] >> R[i]; }
DP... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 998244353;
const long double PI = 3.14159265358979;
const ll MAX = 0;
ll DP[600020];
int main() {
ll N, K;
cin >> N >> K;
ll L[K];
ll R[K];
rep(i, K) { cin >> L[i] >> R[i]; }
DP... | replace | 8 | 9 | 8 | 9 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long dp[200001];
long long pre[200001];
int main() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> S;
for (long long i = 0; i < k; i++) {
long long l, r;
cin >> l >> r;
S.push_back({l, r});
}
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long dp[200001];
long long pre[200001];
int main() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> S;
for (long long i = 0; i < k; i++) {
long long l, r;
cin >> l >> r;
S.push_back({l, r});
}
... | replace | 24 | 25 | 24 | 25 | 0 | |
p02549 | C++ | Runtime Error | // clear adj and visited vector declared globally after each test case
// check for long long overflow
// while adding and subs check if mod becomes -ve
// while using an integer directly in a builtin function add ll
// Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
// Dont keep array name as size or... | // clear adj and visited vector declared globally after each test case
// check for long long overflow
// while adding and subs check if mod becomes -ve
// while using an integer directly in a builtin function add ll
// Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
// Dont keep array name as size or... | replace | 41 | 42 | 41 | 42 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
const ll MOD = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<int, int>> imos(k);
rep(i, k) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
const ll MOD = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<int, int>> imos(k);
rep(i, k) {
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &op... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &op... | replace | 67 | 68 | 67 | 68 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t Q = 998244353;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> p(K);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end());
vector<int64_t> dp(N + 1);
vector<int64_t> rui(... | #include <bits/stdc++.h>
using namespace std;
int64_t Q = 998244353;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> p(K);
for (int i = 0; i < K; i++) {
int a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end());
vector<int64_t> dp(N + 1);
vector<int64_t> rui(... | replace | 9 | 10 | 9 | 10 | -6 | malloc(): corrupted top size
|
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX 200005
#define mod 998244353
ll tree[MAX] = {0};
ll lazy[MAX] = {0};
void updateRangeUtil(ll si, ll ss, ll se, ll us, ll ue, ll diff) {
if (lazy[si] != 0) {
tree[si] += (se - ss + 1) * lazy[si];
tree[si] %= mod;
if (ss != s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX 2000005
#define mod 998244353
ll tree[MAX] = {0};
ll lazy[MAX] = {0};
void updateRangeUtil(ll si, ll ss, ll se, ll us, ll ue, ll diff) {
if (lazy[si] != 0) {
tree[si] += (se - ss + 1) * lazy[si];
tree[si] %= mod;
if (ss != ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 998244353;
int l[10], r[10];
// dp[i] = 範囲 [1, i] に到着する場合の数
ll dp[201] = {};
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < k; ++i)
cin >> l[i] >> r[i];
dp[1] = 1;
for (int i = 2; i <= n; ++i) {
dp[i] = dp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 998244353;
int l[10], r[10];
// dp[i] = 範囲 [1, i] に到着する場合の数
ll dp[200001] = {};
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < k; ++i)
cin >> l[i] >> r[i];
dp[1] = 1;
for (int i = 2; i <= n; ++i) {
dp[i] =... | replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | replace | 92 | 94 | 92 | 96 | 0 | |
p02549 | C++ | Runtime Error | // {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(... | // {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(... | replace | 165 | 167 | 165 | 169 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll mod = 998244353;
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> lr(k);
for (auto &v : lr) {
ll l, r;
cin >> l >> r;
v = make_pair(l, r);
}
vector<ll> vec1(3e5, 0), vec2(3e5, 0), vec3(3e5, 0);
v... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll mod = 998244353;
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> lr(k);
for (auto &v : lr) {
ll l, r;
cin >> l >> r;
v = make_pair(l, r);
}
vector<ll> vec1(5e5, 0), vec2(5e5, 0), vec3(5e5, 0);
v... | replace | 19 | 20 | 19 | 20 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll N, K;
cin >> N >> K;
vector<pair<ll, ll>> ranges(K);
vector<ll> diffs(N + 1, 0);
vector<ll> paths(N + 1, 0);
paths[1] = 1;
ll cur = 0;
for (ll i = ... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll N, K;
cin >> N >> K;
vector<pair<ll, ll>> ranges(K);
vector<ll> diffs(N + 2, 0);
vector<ll> paths(N + 2, 0);
paths[1] = 1;
ll cur = 0;
for (ll i = ... | replace | 13 | 15 | 13 | 15 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define int long long
#define mod 998244353
int L[11], R[11];
int dp[100005];
int sum[100005];
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
for (int i = 1; i <= K; i++) {
cin >> L[i] >> R[i];
}
sum[1] = dp[1] = 1;
fo... | #include <iostream>
using namespace std;
#define int long long
#define mod 998244353
int L[11], R[11];
int dp[200005];
int sum[200005];
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
for (int i = 1; i <= K; i++) {
cin >> L[i] >> R[i];
}
sum[1] = dp[1] = 1;
fo... | replace | 5 | 7 | 5 | 7 | 0 | |
p02549 | C++ | Time Limit Exceeded | #ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> V... | #ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> V... | replace | 316 | 317 | 316 | 317 | TLE | |
p02549 | C++ | Runtime Error | // $%D%$.$%M%$.$%Y%$
// $%h%$:$%m%$:$%s%$
#pragma GCC optimize("O3")
#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 IOS \
ios::sync_wi... | // $%D%$.$%M%$.$%Y%$
// $%h%$:$%m%$:$%s%$
#pragma GCC optimize("O3")
#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 IOS \
ios::sync_wi... | replace | 38 | 39 | 38 | 39 | -6 | munmap_chunk(): invalid pointer
|
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <atcoder/all>
#define FOR(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for (int(i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for (int(i) = (int)(n); (i) >= (int)... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define FOR(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for (int(i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for (int(i) = (int)(n); (i) >= (int)... | replace | 103 | 107 | 103 | 107 | -6 | munmap_chunk(): invalid pointer
|
p02549 | Python | Runtime Error | p = 998244353
n, k = map(int, input().split())
LRs = [tuple(map(int, input().split())) for _ in range(k)]
A = [0] * (2 * n)
for lj, rj in LRs:
A[lj] += 1
A[rj + 1] -= 1
s = 0
for i in range(1, n):
s = (s + A[i]) % p
for lj, rj in LRs:
A[i + lj] += s
A[i + rj + 1] -= s
print(s)
| p = 998244353
n, k = map(int, input().split())
LRs = [tuple(map(int, input().split())) for _ in range(k)]
A = [0] * (2 * n + 1)
for lj, rj in LRs:
A[lj] += 1
A[rj + 1] -= 1
s = 0
for i in range(1, n):
s = (s + A[i]) % p
for lj, rj in LRs:
A[i + lj] += s
A[i + rj + 1] -= s
print(s)
| replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | Python | Runtime Error | p = 998244353
n, k = map(int, input().split())
LRs = []
for j in range(k):
lj, rj = map(int, input().split())
LRs.append((lj, rj))
A = [0] * n
i0 = min(lj for lj, rj in LRs)
A[0] = 1
A[i0] = 1
for i in range(i0 + 1, n):
A[i] = A[i - 1]
for j in range(k):
lj, rj = LRs[j]
if i - lj >= 0:
... | p = 998244353
n, k = map(int, input().split())
LRs = []
for j in range(k):
lj, rj = map(int, input().split())
LRs.append((lj, rj))
A = [0] * (n + 1)
i0 = min(lj for lj, rj in LRs)
A[0] = 1
A[i0] = 1
for i in range(i0 + 1, n):
A[i] = A[i - 1]
for j in range(k):
lj, rj = LRs[j]
if i - lj >... | replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | Python | Time Limit Exceeded | def main():
n, k = map(int, input().split())
mod = 998244353
dp = [0] * (n + 1)
dp[1] = 1
delta = []
for _ in range(k):
l, r = map(int, input().split())
for i in range(l, r + 1):
delta.append(i)
delta.sort()
for i in range(n):
for d in delta:
... | def main():
n, k = map(int, input().split())
mod = 998244353
dp = [0] * (n + 1)
dp[1] = 1
dp[2] = -1
left = [0] * k
right = [0] * k
for i in range(k):
left[i], right[i] = map(int, input().split())
right[i] += 1
for i in range(1, n + 1):
dp[i] += dp[i - 1]
... | replace | 5 | 17 | 5 | 19 | TLE | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long k;
cin >> k;
long long diff[200005];
memset(diff, 0, sizeof diff);
vector<pair<long long, long long>> v;
for (long long i = 0; i < k; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long k;
cin >> k;
long long diff[4 * 200005];
memset(diff, 0, sizeof diff);
vector<pair<long long, long long>> v;
for (long long i = 0; i < k; i++) {
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
... | insert | 359 | 359 | 359 | 361 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int N, K;
int L[15], R[15];
long long imos[202020];
long long now = 1;
int main() {
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> L[i] >> R[i];
}
for (int i = 1; i <= N; i++) {
now += imos[i];
now %= 998244353LL;
for (int j = 0;... | #include <iostream>
#include <vector>
using namespace std;
int N, K;
int L[15], R[15];
long long imos[202020];
long long now = 1;
int main() {
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> L[i] >> R[i];
}
for (int i = 1; i <= N; i++) {
now += imos[i];
now %= 998244353LL;
for (int j = 0;... | replace | 22 | 23 | 22 | 23 | 0 | |
p02549 | C++ | Runtime Error | #define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ... | #define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ... | insert | 95 | 95 | 95 | 97 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define en "\n"
#define INF (int)9e18
#define HELL 998244353LL
#define int long long
#define double long double
#define uint unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fs first
#define sc second
#define size(a) (int)a.size()
#define deb(x) c... | #include <bits/stdc++.h>
using namespace std;
#define en "\n"
#define INF (int)9e18
#define HELL 998244353LL
#define int long long
#define double long double
#define uint unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fs first
#define sc second
#define size(a) (int)a.size()
#define deb(x) c... | replace | 56 | 57 | 56 | 57 | 0 | |
p02549 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
... | insert | 63 | 63 | 63 | 64 | TLE | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | replace | 45 | 47 | 45 | 47 | 0 | |
p02549 | C++ | Runtime Error | // {{{ Boilerplate Code <--------------------------------------------------
// vim:filetype=cpp:foldmethod=marker:foldmarker={{{,}}}
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream... | // {{{ Boilerplate Code <--------------------------------------------------
// vim:filetype=cpp:foldmethod=marker:foldmarker={{{,}}}
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream... | replace | 45 | 46 | 45 | 46 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353
#define ll long long
using namespace std;
ll ff[200100];
#define MAXN 100010
int x[200100], y[200100];
unsigned ll n, m, ans[MAXN << 2], tag[MAXN << 2];
inline ll ls(ll x) { return x << 1; }
inline ll rs(ll x) { return x << 1 | 1; }
inline void push_up(ll p) { ans[p] = ans... | #include <bits/stdc++.h>
#define MOD 998244353
#define ll long long
using namespace std;
ll ff[200100];
#define MAXN 200010
int x[200100], y[200100];
unsigned ll n, m, ans[MAXN << 2], tag[MAXN << 2];
inline ll ls(ll x) { return x << 1; }
inline ll rs(ll x) { return x << 1 | 1; }
inline void push_up(ll p) { ans[p] = ans... | replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.