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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02550 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for (ll i = a - 1; i >= b; i--)
#define rrep(i, a) rFOR(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<char> vc;
typedef vector<vc> vvc;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ld PI = acos(-1);
const ll INF = 1e18;
struct edge {
ll to, cost;
};
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N, X, M;
cin >> N >> X >> M;
ll Z = X;
set<ll> st;
vl A;
ll kaburi0 = -1, kaburi1 = -1;
rep(i, N) {
if (st.count(X)) {
rep(j, A.size()) {
if (A[j] == X) {
kaburi0 = j;
kaburi1 = i;
}
}
break;
} else {
A.pb(X);
st.insert(X);
X *= X;
X %= M;
}
}
if (kaburi0 == -1 && kaburi1 == -1) {
ll ans = 0;
rep(i, N) {
ans += Z;
Z *= Z;
Z %= M;
// cout << Z << endl;
}
cout << ans << endl;
}
ll ans = 0;
rep(i, kaburi0) { ans += A[i]; }
ll loop = 0;
FOR(i, kaburi0, kaburi1) { loop += A[i]; }
N -= kaburi0;
ans += N / (kaburi1 - kaburi0) * loop;
N %= (kaburi1 - kaburi0);
rep(i, N) { ans += A[kaburi0 + i]; }
cout << ans << endl;
}
/*
overflow checked?
corner case checked?
boundary checked?
not TLE in worst case checked?
*/ | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for (ll i = a - 1; i >= b; i--)
#define rrep(i, a) rFOR(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<char> vc;
typedef vector<vc> vvc;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ld PI = acos(-1);
const ll INF = 1e18;
struct edge {
ll to, cost;
};
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N, X, M;
cin >> N >> X >> M;
ll Z = X;
set<ll> st;
vl A;
ll kaburi0 = -1, kaburi1 = -1;
rep(i, N) {
if (st.count(X)) {
rep(j, A.size()) {
if (A[j] == X) {
kaburi0 = j;
kaburi1 = i;
}
}
break;
} else {
A.pb(X);
st.insert(X);
X *= X;
X %= M;
}
}
if (kaburi0 == -1 && kaburi1 == -1) {
ll ans = 0;
rep(i, N) {
ans += Z;
Z *= Z;
Z %= M;
// cout << Z << endl;
}
cout << ans << endl;
return 0;
}
ll ans = 0;
rep(i, kaburi0) { ans += A[i]; }
ll loop = 0;
FOR(i, kaburi0, kaburi1) { loop += A[i]; }
N -= kaburi0;
ans += N / (kaburi1 - kaburi0) * loop;
N %= (kaburi1 - kaburi0);
rep(i, N) { ans += A[kaburi0 + i]; }
cout << ans << endl;
}
/*
overflow checked?
corner case checked?
boundary checked?
not TLE in worst case checked?
*/ | insert | 74 | 74 | 74 | 75 | -8 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define mem1(a) memset(a, -1, sizeof(a))
#define mem0(a) memset(a, 0, sizeof(a))
#define endl "\n"
#define mod 1000000007
#define mod1 998244353
#define ff first
#define ss second
#define MAX 500005
#define N 10004
#define INF 1000000009
#define all(v) v.begin(), v.end()
#define sbit(a) __builtin_popcount(a)
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> ppl;
typedef map<ll, ll> mpll;
typedef map<vector<ll>, ll> mpvl;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void solve() {
ll n, x, m;
cin >> n >> x >> m;
ll ans = x;
ll t = x * x;
ll c = 0;
map<ll, ll> mp;
n--;
ll s[m + 1];
mem0(s);
ll tans = 0;
ll tmp;
for (ll i = 1; i <= min(n, m + 1); i++) {
ll md = t % m;
if (!mp.count(md)) {
tans += md;
t = md * md;
} else {
c = i - mp[md];
tmp = mp[md];
break;
}
mp[md] = i;
s[i] = tans;
}
if (mp.count(0)) {
ans += tans;
cout << ans << endl;
return;
}
tmp--;
n -= tmp;
ll div = n / c;
ll md = n % c;
ans += (div * (s[c + tmp] - s[tmp]));
ans += s[tmp];
ans += s[tmp + md] - s[tmp];
cout << ans << endl;
}
int main() {
speed;
ll kk;
kk = 1;
// cin >> kk;
while (kk--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define mem1(a) memset(a, -1, sizeof(a))
#define mem0(a) memset(a, 0, sizeof(a))
#define endl "\n"
#define mod 1000000007
#define mod1 998244353
#define ff first
#define ss second
#define MAX 500005
#define N 10004
#define INF 1000000009
#define all(v) v.begin(), v.end()
#define sbit(a) __builtin_popcount(a)
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> ppl;
typedef map<ll, ll> mpll;
typedef map<vector<ll>, ll> mpvl;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void solve() {
ll n, x, m;
cin >> n >> x >> m;
ll ans = x;
ll t = x * x;
ll c = 0;
map<ll, ll> mp;
n--;
ll s[m + 1];
mem0(s);
ll tans = 0;
ll tmp;
for (ll i = 1; i <= m + 1; i++) {
ll md = t % m;
if (!mp.count(md)) {
tans += md;
t = md * md;
} else {
c = i - mp[md];
tmp = mp[md];
break;
}
mp[md] = i;
s[i] = tans;
}
if (mp.count(0)) {
ans += tans;
cout << ans << endl;
return;
}
tmp--;
n -= tmp;
ll div = n / c;
ll md = n % c;
ans += (div * (s[c + tmp] - s[tmp]));
ans += s[tmp];
ans += s[tmp + md] - s[tmp];
cout << ans << endl;
}
int main() {
speed;
ll kk;
kk = 1;
// cin >> kk;
while (kk--) {
solve();
}
return 0;
} | replace | 62 | 63 | 62 | 63 | -8 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) ;
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
int dx[4]{0, 1, 0, -1};
int dy[4]{1, 0, -1, 0};
int main(int argc, char **argv) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, X, M;
cin >> N >> X >> M;
ll logk{0};
while ((1ll << logk) < N)
++logk;
vector<vector<ll>> ding(logk, vector<ll>(M));
vector<vector<ll>> ding2(logk, vector<ll>(M));
REP(i, M)
ding[0][i] = (i * i) % M;
REP(k, logk - 1) {
REP(i, M) { ding[k + 1][i] = ding[k][ding[k][i]]; }
}
REP(i, M)
ding2[0][i] = i;
REP(k, logk - 1) {
REP(i, M) { ding2[k + 1][i] = ding2[k][ding[k][i]] + ding2[k][i]; }
}
ll now{X};
ll res{0};
--N;
for (ll bit = 0;; bit++) {
if (N & 1) {
res += ding2[bit][now];
now = ding[bit][now];
}
N = N >> 1;
if (N == 0) {
res += now;
break;
}
}
std::cout << res << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1ll << 60;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define DEBUG(x) ;
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
int dx[4]{0, 1, 0, -1};
int dy[4]{1, 0, -1, 0};
int main(int argc, char **argv) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, X, M;
cin >> N >> X >> M;
if (N == 1) {
std::cout << X << std::endl;
return 0;
}
ll logk{0};
while ((1ll << logk) < N)
++logk;
vector<vector<ll>> ding(logk, vector<ll>(M));
vector<vector<ll>> ding2(logk, vector<ll>(M));
REP(i, M)
ding[0][i] = (i * i) % M;
REP(k, logk - 1) {
REP(i, M) { ding[k + 1][i] = ding[k][ding[k][i]]; }
}
REP(i, M)
ding2[0][i] = i;
REP(k, logk - 1) {
REP(i, M) { ding2[k + 1][i] = ding2[k][ding[k][i]] + ding2[k][i]; }
}
ll now{X};
ll res{0};
--N;
for (ll bit = 0;; bit++) {
if (N & 1) {
res += ding2[bit][now];
now = ding[bit][now];
}
N = N >> 1;
if (N == 0) {
res += now;
break;
}
}
std::cout << res << std::endl;
return 0;
}
| insert | 24 | 24 | 24 | 30 | 0 | |
p02550 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <vector>
#define llong long long
#define rep(i, l, n) for (llong(i) = (l); (i) < (n); (i++))
#define _min(a, b) ((a) < (b) ? (a) : (b))
#define _max(a, b) ((a) > (b) ? (a) : (b))
#define _abs(a) ((a) > 0 ? (a) : (-(a)))
using namespace std;
int main() {
llong N, X, M;
cin >> N >> X >> M;
int first[M];
llong first_sum[M];
rep(i, 0, M) {
first[i] = -1;
first_sum[i] = 0;
}
llong ans = 0;
if (M < N) {
int roop;
llong roop_ans;
rep(i, 0, M) {
if (first[X] >= 0) {
roop = i - first[X];
roop_ans = ans - first_sum[X];
break;
} else {
first[X] = i;
first_sum[X] = ans;
ans += X;
}
X = (X * X) % M;
}
ans += roop_ans * ((N - first[X]) / roop - 1);
N = (N - first[X]) % roop;
}
rep(i, 0, N) {
ans += X;
X = (X * X) % M;
}
cout << ans;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <vector>
#define llong long long
#define rep(i, l, n) for (llong(i) = (l); (i) < (n); (i++))
#define _min(a, b) ((a) < (b) ? (a) : (b))
#define _max(a, b) ((a) > (b) ? (a) : (b))
#define _abs(a) ((a) > 0 ? (a) : (-(a)))
using namespace std;
int main() {
llong N, X, M;
cin >> N >> X >> M;
int first[M];
llong first_sum[M];
rep(i, 0, M) {
first[i] = -1;
first_sum[i] = 0;
}
llong ans = 0;
if (M < N) {
int roop;
llong roop_ans;
rep(i, 0, N) {
if (first[X] >= 0) {
roop = i - first[X];
roop_ans = ans - first_sum[X];
break;
} else {
first[X] = i;
first_sum[X] = ans;
ans += X;
}
X = (X * X) % M;
}
ans += roop_ans * ((N - first[X]) / roop - 1);
N = (N - first[X]) % roop;
}
rep(i, 0, N) {
ans += X;
X = (X * X) % M;
}
cout << ans;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p02550 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <array>
#include <bitset>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using ull = long long unsigned;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const double PI = acos(-1.0);
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define Else(a, b, c) a != b &&b != c &&c != a
#define all(v) v.begin(), v.end()
#define Ini(a) \
ll a; \
cin >> a;
#define Ind(a) \
double a; \
cin >> a;
#define Ins(a) \
string a; \
cin >> a;
#define Sort(v) sort(all(v));
#define Rsort(v, type) sort(all(v), greater<type>());
#define Unique(v) v.erase(unique(all(v)), v.end());
#define int ll
const long MOD = pow(10, 9) + 7;
const double pai = 3.14159265358979;
char ALFA[] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
char alfa[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
inline void finish() {
cout << -1 << endl;
exit(0);
}
inline vector<bool> GetPrimeTable(int n) {
vector<bool> primeTable(n + 1, true);
int sqr = sqrt(n);
primeTable[0] = false; // 0は素数じゃない
primeTable[1] = false; // 1は素数じゃない
for (int i = 2; i <= sqr; ++i) {
if (primeTable[i]) {
for (size_t j = i + i; j < primeTable.size(); j += i) {
primeTable[j] = false;
}
}
}
return primeTable;
}
inline vector<ll> GetPrimeNumbers(int n) {
vector<bool> primeTable = GetPrimeTable(n);
vector<ll> result;
if (n < 2) {
result;
}
result.reserve(n / 2);
for (size_t i = 0; i < primeTable.size(); ++i) {
if (primeTable[i]) {
result.push_back(i);
}
}
result.shrink_to_fit();
return result;
}
inline map<ll, ll> PrimeFact(ull n) {
ull num = 2;
map<ll, ll> result;
while (true) {
if (n % num == 0) {
if (result.count(num) == 0) {
result.insert(pair<ll, ll>{num, 1});
} else {
result[num]++;
}
n /= num;
} else {
if (++num > sqrt(n)) {
if (result.size() == 0 || n != 1) {
result.insert(pair<ll, ll>{n, 1});
}
return result;
}
}
}
}
unsigned GetDigit(double num) { return log10(num) + 1; }
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
class Mod {
public:
static inline ll Add(ll a, ll b) { return (a + b) % MOD; }
static inline ll Sub(ll a, ll b) {
ll ans = (a - b) % MOD;
return (ans < 0) ? (ans + MOD) : ans;
}
static inline ll Mul(ll a, ll b) { return (a * b) % MOD; }
static inline ll Div(ll a, ll b) { return (a % MOD) * modinv(b, MOD) % MOD; }
static inline ll Pow(ll a, ll b) {
ll res = 1;
for (ll i = 0; i < b; ++i) {
res = res * a % MOD;
}
return res;
}
};
class BitFlag {
private:
ull m_bitFlag;
int m_size;
ull m_upper;
vector<ull> m_exponentiation;
public:
BitFlag(ull n) {
if (n > 64) {
throw string(("ビットフラグは64bitまでしか対応してない 指定された数=" +
to_string(n))
.c_str());
}
m_bitFlag = 0;
m_size = n;
m_upper = (int)pow(2, n) - 1;
m_exponentiation.resize(n);
for (ull i = 0; i < n; ++i) {
m_exponentiation[i] = (ll)pow(2, i);
}
}
void Set(ull n) {
if (n > m_upper) {
throw string(
(to_string(n) + "は" + to_string(m_size) + "bitでは表現できない")
.c_str());
}
m_bitFlag = n;
}
void Set(string &s) {
if (s.size() > (size_t)m_size) {
throw string(
("\"" + s + "\"が" + to_string(m_size) + "bitよりも長いので無理")
.c_str());
}
int i = s.size() - 1;
m_bitFlag = 0;
for (const char c : s) {
if (c != '0') {
m_bitFlag += m_exponentiation[i];
}
i--;
}
}
ll size() { return m_size; }
bool operator[](int i) {
if (i >= m_size) {
throw string(("指定した値が領域を超えている index=" + to_string(i) +
" size=" + to_string(m_size))
.c_str());
}
return (m_bitFlag & m_exponentiation[i]) == 0 ? false : true;
}
BitFlag &operator++() {
m_bitFlag++;
if (m_bitFlag > m_upper) {
m_bitFlag = 0;
}
return *this;
}
BitFlag operator++(signed) {
BitFlag b = *this;
m_bitFlag++;
if (m_bitFlag > m_upper) {
m_bitFlag = 0;
}
return b;
}
BitFlag &operator+=(const int n) {
this->m_bitFlag += n;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag &operator-=(const int n) {
this->m_bitFlag -= n;
return *this;
}
BitFlag &operator+=(const BitFlag &b) {
this->m_bitFlag += b.m_bitFlag;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag &operator-=(const BitFlag &b) {
this->m_bitFlag -= b.m_bitFlag;
return *this;
}
BitFlag operator+(int n) {
m_bitFlag += n;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag operator-(int n) {
m_bitFlag -= n;
return *this;
}
BitFlag operator+(BitFlag &b) {
this->m_bitFlag += b.m_bitFlag;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag operator-(BitFlag &b) {
this->m_bitFlag -= b.m_bitFlag;
return *this;
}
bool operator==(BitFlag &comp) {
return comp.m_bitFlag == this->m_bitFlag ? true : false;
}
bool operator!=(BitFlag &comp) { return !(*this == comp); }
friend ostream &operator<<(ostream &o, const BitFlag &b);
};
ostream &operator<<(ostream &o, const BitFlag &b) {
for (ll i = 0; i < b.m_size; ++i) {
std::cout << ((b.m_bitFlag & b.m_exponentiation[i]) == 0 ? false : true);
}
return o;
}
class Pos {
public:
int x;
int y;
Pos() {
x = 0;
y = 0;
}
Pos(int x, int y) {
this->x = x;
this->y = y;
}
static int Manhattan(const Pos &a, const Pos &b) {
return abs(a.x - b.x) + abs(a.y - b.y);
}
static int Manhattan(const Pos &a) { return abs(a.x) + abs(a.y); }
bool operator<(Pos &comp) {
if (this->x < comp.x) {
return true;
} else if (this->x == comp.x && this->y < comp.y) {
return true;
} else {
return false;
}
}
};
template <typename T> inline void debug(vector<T> v) {
cout << "[";
for (ll i = 0; i < v.size() - 1; ++i) {
cout << v[i] << ", ";
}
cout << v[v.size() - 1] << "]" << endl;
}
void Main();
inline void DebugMain() {
while (true) {
Main();
}
}
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
bool debug = true;
if (debug) {
cout << "\x1b[41m"
<< "Debug Mode " << endl;
}
(debug) ? DebugMain() : Main();
return 0;
}
int parmitation(ll N) {
ll ans = 1;
for (ll i = 1; i <= N; i++) {
ans *= i;
}
return ans;
}
int SemiCommonMultiple(ll A, ll ANum, ll B, ll BNum, ll diff, ll max) {
ll calc;
calc = diff + B * BNum - A * ANum;
if (diff + B * BNum > max) {
return 0;
} else {
if (calc < 0) {
SemiCommonMultiple(A, ANum, B, ++BNum, diff, max);
} else if (calc > 0) {
SemiCommonMultiple(A, ++ANum, B, BNum, diff, max);
} else {
return A * (ANum + 0.5);
}
}
}
ll gcd(ll a, ll b) {
if ((a = a % b) == 0) {
return b;
}
return gcd(b, a);
}
inline void Main() {
ll X, Y, N, M, K, H, Q, W, D;
vector<ll> A;
vector<ll> B;
ll ans = 1, max = 0;
ll sum = 0, count = 0;
int temp;
double avg = 0.0;
string S;
ll IndexA = 1;
ll IndexB = 0;
bool flag = false;
bool flag2 = false;
int D1, D2;
int sum2 = 0;
set<pair<int, pair<int, int>>> huga;
cin >> N >> X >> M;
temp = X;
sum = temp;
if (X == 0) {
cout << sum;
return;
}
int i = 1;
for (; i < N; ++i) {
temp = (temp * temp) % M;
sum += temp;
if (flag) {
sum2 += temp;
count++;
if (X == temp) {
flag2 = true;
break;
}
}
if (i == M) {
X = temp;
flag = true;
}
}
if (flag2) {
sum += (((N - i) / count) * sum2);
IndexA = ((N - i) % count);
if (IndexA == 0) {
sum -= sum2;
} else {
for (int j = 1; j < IndexA; ++j) {
temp = (temp * temp) % M;
sum += temp;
}
}
}
cout << sum;
} |
#include <algorithm>
#include <array>
#include <bitset>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using ull = long long unsigned;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const double PI = acos(-1.0);
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define Else(a, b, c) a != b &&b != c &&c != a
#define all(v) v.begin(), v.end()
#define Ini(a) \
ll a; \
cin >> a;
#define Ind(a) \
double a; \
cin >> a;
#define Ins(a) \
string a; \
cin >> a;
#define Sort(v) sort(all(v));
#define Rsort(v, type) sort(all(v), greater<type>());
#define Unique(v) v.erase(unique(all(v)), v.end());
#define int ll
const long MOD = pow(10, 9) + 7;
const double pai = 3.14159265358979;
char ALFA[] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
char alfa[] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
inline void finish() {
cout << -1 << endl;
exit(0);
}
inline vector<bool> GetPrimeTable(int n) {
vector<bool> primeTable(n + 1, true);
int sqr = sqrt(n);
primeTable[0] = false; // 0は素数じゃない
primeTable[1] = false; // 1は素数じゃない
for (int i = 2; i <= sqr; ++i) {
if (primeTable[i]) {
for (size_t j = i + i; j < primeTable.size(); j += i) {
primeTable[j] = false;
}
}
}
return primeTable;
}
inline vector<ll> GetPrimeNumbers(int n) {
vector<bool> primeTable = GetPrimeTable(n);
vector<ll> result;
if (n < 2) {
result;
}
result.reserve(n / 2);
for (size_t i = 0; i < primeTable.size(); ++i) {
if (primeTable[i]) {
result.push_back(i);
}
}
result.shrink_to_fit();
return result;
}
inline map<ll, ll> PrimeFact(ull n) {
ull num = 2;
map<ll, ll> result;
while (true) {
if (n % num == 0) {
if (result.count(num) == 0) {
result.insert(pair<ll, ll>{num, 1});
} else {
result[num]++;
}
n /= num;
} else {
if (++num > sqrt(n)) {
if (result.size() == 0 || n != 1) {
result.insert(pair<ll, ll>{n, 1});
}
return result;
}
}
}
}
unsigned GetDigit(double num) { return log10(num) + 1; }
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
class Mod {
public:
static inline ll Add(ll a, ll b) { return (a + b) % MOD; }
static inline ll Sub(ll a, ll b) {
ll ans = (a - b) % MOD;
return (ans < 0) ? (ans + MOD) : ans;
}
static inline ll Mul(ll a, ll b) { return (a * b) % MOD; }
static inline ll Div(ll a, ll b) { return (a % MOD) * modinv(b, MOD) % MOD; }
static inline ll Pow(ll a, ll b) {
ll res = 1;
for (ll i = 0; i < b; ++i) {
res = res * a % MOD;
}
return res;
}
};
class BitFlag {
private:
ull m_bitFlag;
int m_size;
ull m_upper;
vector<ull> m_exponentiation;
public:
BitFlag(ull n) {
if (n > 64) {
throw string(("ビットフラグは64bitまでしか対応してない 指定された数=" +
to_string(n))
.c_str());
}
m_bitFlag = 0;
m_size = n;
m_upper = (int)pow(2, n) - 1;
m_exponentiation.resize(n);
for (ull i = 0; i < n; ++i) {
m_exponentiation[i] = (ll)pow(2, i);
}
}
void Set(ull n) {
if (n > m_upper) {
throw string(
(to_string(n) + "は" + to_string(m_size) + "bitでは表現できない")
.c_str());
}
m_bitFlag = n;
}
void Set(string &s) {
if (s.size() > (size_t)m_size) {
throw string(
("\"" + s + "\"が" + to_string(m_size) + "bitよりも長いので無理")
.c_str());
}
int i = s.size() - 1;
m_bitFlag = 0;
for (const char c : s) {
if (c != '0') {
m_bitFlag += m_exponentiation[i];
}
i--;
}
}
ll size() { return m_size; }
bool operator[](int i) {
if (i >= m_size) {
throw string(("指定した値が領域を超えている index=" + to_string(i) +
" size=" + to_string(m_size))
.c_str());
}
return (m_bitFlag & m_exponentiation[i]) == 0 ? false : true;
}
BitFlag &operator++() {
m_bitFlag++;
if (m_bitFlag > m_upper) {
m_bitFlag = 0;
}
return *this;
}
BitFlag operator++(signed) {
BitFlag b = *this;
m_bitFlag++;
if (m_bitFlag > m_upper) {
m_bitFlag = 0;
}
return b;
}
BitFlag &operator+=(const int n) {
this->m_bitFlag += n;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag &operator-=(const int n) {
this->m_bitFlag -= n;
return *this;
}
BitFlag &operator+=(const BitFlag &b) {
this->m_bitFlag += b.m_bitFlag;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag &operator-=(const BitFlag &b) {
this->m_bitFlag -= b.m_bitFlag;
return *this;
}
BitFlag operator+(int n) {
m_bitFlag += n;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag operator-(int n) {
m_bitFlag -= n;
return *this;
}
BitFlag operator+(BitFlag &b) {
this->m_bitFlag += b.m_bitFlag;
this->m_bitFlag %= m_upper;
return *this;
}
BitFlag operator-(BitFlag &b) {
this->m_bitFlag -= b.m_bitFlag;
return *this;
}
bool operator==(BitFlag &comp) {
return comp.m_bitFlag == this->m_bitFlag ? true : false;
}
bool operator!=(BitFlag &comp) { return !(*this == comp); }
friend ostream &operator<<(ostream &o, const BitFlag &b);
};
ostream &operator<<(ostream &o, const BitFlag &b) {
for (ll i = 0; i < b.m_size; ++i) {
std::cout << ((b.m_bitFlag & b.m_exponentiation[i]) == 0 ? false : true);
}
return o;
}
class Pos {
public:
int x;
int y;
Pos() {
x = 0;
y = 0;
}
Pos(int x, int y) {
this->x = x;
this->y = y;
}
static int Manhattan(const Pos &a, const Pos &b) {
return abs(a.x - b.x) + abs(a.y - b.y);
}
static int Manhattan(const Pos &a) { return abs(a.x) + abs(a.y); }
bool operator<(Pos &comp) {
if (this->x < comp.x) {
return true;
} else if (this->x == comp.x && this->y < comp.y) {
return true;
} else {
return false;
}
}
};
template <typename T> inline void debug(vector<T> v) {
cout << "[";
for (ll i = 0; i < v.size() - 1; ++i) {
cout << v[i] << ", ";
}
cout << v[v.size() - 1] << "]" << endl;
}
void Main();
inline void DebugMain() {
while (true) {
Main();
}
}
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
bool debug = false;
if (debug) {
cout << "\x1b[41m"
<< "Debug Mode " << endl;
}
(debug) ? DebugMain() : Main();
return 0;
}
int parmitation(ll N) {
ll ans = 1;
for (ll i = 1; i <= N; i++) {
ans *= i;
}
return ans;
}
int SemiCommonMultiple(ll A, ll ANum, ll B, ll BNum, ll diff, ll max) {
ll calc;
calc = diff + B * BNum - A * ANum;
if (diff + B * BNum > max) {
return 0;
} else {
if (calc < 0) {
SemiCommonMultiple(A, ANum, B, ++BNum, diff, max);
} else if (calc > 0) {
SemiCommonMultiple(A, ++ANum, B, BNum, diff, max);
} else {
return A * (ANum + 0.5);
}
}
}
ll gcd(ll a, ll b) {
if ((a = a % b) == 0) {
return b;
}
return gcd(b, a);
}
inline void Main() {
ll X, Y, N, M, K, H, Q, W, D;
vector<ll> A;
vector<ll> B;
ll ans = 1, max = 0;
ll sum = 0, count = 0;
int temp;
double avg = 0.0;
string S;
ll IndexA = 1;
ll IndexB = 0;
bool flag = false;
bool flag2 = false;
int D1, D2;
int sum2 = 0;
set<pair<int, pair<int, int>>> huga;
cin >> N >> X >> M;
temp = X;
sum = temp;
if (X == 0) {
cout << sum;
return;
}
int i = 1;
for (; i < N; ++i) {
temp = (temp * temp) % M;
sum += temp;
if (flag) {
sum2 += temp;
count++;
if (X == temp) {
flag2 = true;
break;
}
}
if (i == M) {
X = temp;
flag = true;
}
}
if (flag2) {
sum += (((N - i) / count) * sum2);
IndexA = ((N - i) % count);
if (IndexA == 0) {
sum -= sum2;
} else {
for (int j = 1; j < IndexA; ++j) {
temp = (temp * temp) % M;
sum += temp;
}
}
}
cout << sum;
} | replace | 335 | 336 | 335 | 336 | TLE | |
p02550 | C++ | Runtime Error | // why tle lol
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef complex<double> pnt;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, pii> pp;
typedef double ld;
typedef long double lld;
#define INF 0x3f3f3f3f // for int
#define LL_INF 0x3f3f3f3f3f3f3f3f // for ll
#define ms(x, y) memset(x, y, sizeof(x))
// coordinate compression:sort(val.begin(), val.end());
// val.resize(unique(val.begin(), val.end()) - val.begin());
#define nl '\n'
typedef unsigned long long ull;
const lld pi = 3.14159265358979323846;
int MOD;
// remember to remove ios stuff if i use scanf
// printf("%05lld\n", x); --> print last 5 digits including 0's
// printf("%02d:%02d", h, m); --> time
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pwmd(ll b, ll exp) {
ll ret = 1;
while (exp > 0) {
if (exp % 2 == 1)
ret = (ret * b) % MOD;
exp /= 2;
b = (b * b) % MOD;
}
return ret;
}
// void RotateArr(int X) {
// for (int n=0; n<X; n++) {
// for (int i=0; i<N/2; i++) {
// for (int j=0; j<N; j++) {
// swap(a[i][j], a[N-i-1][j]);
// }
// }
// for (int i=0; i<N; i++) {
// for (int j=i+1; j<N; j++) {
// swap(a[i][j], a[j][i]);
// }
// }
// }
// }
/*
* string input;
*
* stringstream ss(input);
*- if the input contains '\n', separate lines with: string line; while
*(getline(ss, line))
* - clear() to clear the stream
* - >> : read smth from stringstream object ie. while (s >> word)
*/
struct pair_hash { //--> for unordered_set<pair<ll, ll>>
// initialize the set with unordered_set<pair<ll, ll>, pair_hash>st
inline std::size_t operator()(const std::pair<ll, ll> &v) const {
return v.first * 31 + v.second;
}
};
/* for dijkstra:
* bool operator < (const E &other) const {
return this->w > other.w;
}
*/
const int MM = 1e6 + 5;
ll n, idx[MM], ans, psa[MM], x;
void solve(int tc) {
cin >> n >> x >> MOD;
n--;
psa[1] = x;
idx[x] = 1;
ans = x;
int i = 2, l = 1, r = 1;
while (1) {
psa[i] = (pwmd(psa[i - 1], 2)) % MOD;
if (idx[psa[i]] == 0) {
idx[psa[i]] = i;
} else {
r = i - 1;
l = idx[psa[i]];
break;
}
ans += psa[i];
i++;
n--;
}
if (!n) {
cout << ans << nl;
return;
}
for (int j = 1; j <= r; j++)
psa[j] += psa[j - 1];
ll len = 1LL * (r - l + 1), rep = (ll)(n / len), rem = n % len;
ans += rep * (psa[r] - psa[l - 1]);
rem = l + rem - 1;
ans += psa[rem] - psa[l - 1];
cout << ans << nl;
}
// you should really read the stuff at the bottom
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1; // cin >> tc;
for (int t = 1; t <= tc; t++)
solve(t);
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
// Did you read the bounds?
// Did you make typos?
// Are there edge cases (N=1?)
// Are array sizes proper (scaled by proper constant, for example 2* for koosaga
tree)
// Integer overflow?
// DS reset properly between test cases?
// Is using long longs causing TLE?
// Are you using floating points?
*/ | // why tle lol
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef complex<double> pnt;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, pii> pp;
typedef double ld;
typedef long double lld;
#define INF 0x3f3f3f3f // for int
#define LL_INF 0x3f3f3f3f3f3f3f3f // for ll
#define ms(x, y) memset(x, y, sizeof(x))
// coordinate compression:sort(val.begin(), val.end());
// val.resize(unique(val.begin(), val.end()) - val.begin());
#define nl '\n'
typedef unsigned long long ull;
const lld pi = 3.14159265358979323846;
int MOD;
// remember to remove ios stuff if i use scanf
// printf("%05lld\n", x); --> print last 5 digits including 0's
// printf("%02d:%02d", h, m); --> time
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pwmd(ll b, ll exp) {
ll ret = 1;
while (exp > 0) {
if (exp % 2 == 1)
ret = (ret * b) % MOD;
exp /= 2;
b = (b * b) % MOD;
}
return ret;
}
// void RotateArr(int X) {
// for (int n=0; n<X; n++) {
// for (int i=0; i<N/2; i++) {
// for (int j=0; j<N; j++) {
// swap(a[i][j], a[N-i-1][j]);
// }
// }
// for (int i=0; i<N; i++) {
// for (int j=i+1; j<N; j++) {
// swap(a[i][j], a[j][i]);
// }
// }
// }
// }
/*
* string input;
*
* stringstream ss(input);
*- if the input contains '\n', separate lines with: string line; while
*(getline(ss, line))
* - clear() to clear the stream
* - >> : read smth from stringstream object ie. while (s >> word)
*/
struct pair_hash { //--> for unordered_set<pair<ll, ll>>
// initialize the set with unordered_set<pair<ll, ll>, pair_hash>st
inline std::size_t operator()(const std::pair<ll, ll> &v) const {
return v.first * 31 + v.second;
}
};
/* for dijkstra:
* bool operator < (const E &other) const {
return this->w > other.w;
}
*/
const int MM = 1e6 + 5;
ll n, idx[MM], ans, psa[MM], x;
void solve(int tc) {
cin >> n >> x >> MOD;
n--;
psa[1] = x;
idx[x] = 1;
ans = x;
int i = 2, l = 1, r = 1;
while (n > 0) {
psa[i] = (pwmd(psa[i - 1], 2)) % MOD;
if (idx[psa[i]] == 0) {
idx[psa[i]] = i;
} else {
r = i - 1;
l = idx[psa[i]];
break;
}
ans += psa[i];
i++;
n--;
}
if (!n) {
cout << ans << nl;
return;
}
for (int j = 1; j <= r; j++)
psa[j] += psa[j - 1];
ll len = 1LL * (r - l + 1), rep = (ll)(n / len), rem = n % len;
ans += rep * (psa[r] - psa[l - 1]);
rem = l + rem - 1;
ans += psa[rem] - psa[l - 1];
cout << ans << nl;
}
// you should really read the stuff at the bottom
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1; // cin >> tc;
for (int t = 1; t <= tc; t++)
solve(t);
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
// Did you read the bounds?
// Did you make typos?
// Are there edge cases (N=1?)
// Are array sizes proper (scaled by proper constant, for example 2* for koosaga
tree)
// Integer overflow?
// DS reset properly between test cases?
// Is using long longs causing TLE?
// Are you using floating points?
*/ | replace | 87 | 88 | 87 | 88 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
long long n, x, m;
cin >> n >> x >> m;
vector<long long> id(m, -1);
vector<long long> ans;
long long res;
long long j = 0;
long long len = 0;
while (id[x] == -1) {
id[x] = len;
ans[j] = x;
x = (x * x) % m;
len++;
j++;
}
long long loop;
loop = len - id[x];
long long count;
count = (n - id[x]) / loop;
long long value = 0;
for (long long i = id[x]; i < len; i++) {
value += ans[i];
}
////////////////ここまではできてるはず
res = 0;
if (n < len) {
res = 0;
for (long long i = 0; i < n; i++) {
res += ans[i];
}
} else {
for (long long i = 0; i < id[x]; i++) {
res += ans[i];
}
res = res + count * value;
long long amari = (n - id[x]) % loop + id[x];
for (long long i = id[x]; i < amari; i++) {
res += ans[i];
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
long long n, x, m;
cin >> n >> x >> m;
vector<long long> id(m, -1);
vector<long long> ans;
long long res;
long long j = 0;
long long len = 0;
while (id[x] == -1) {
id[x] = len;
ans.push_back(x);
x = (x * x) % m;
len++;
j++;
}
long long loop;
loop = len - id[x];
long long count;
count = (n - id[x]) / loop;
long long value = 0;
for (long long i = id[x]; i < len; i++) {
value += ans[i];
}
////////////////ここまではできてるはず
res = 0;
if (n < len) {
res = 0;
for (long long i = 0; i < n; i++) {
res += ans[i];
}
} else {
for (long long i = 0; i < id[x]; i++) {
res += ans[i];
}
res = res + count * value;
long long amari = (n - id[x]) % loop + id[x];
for (long long i = id[x]; i < amari; i++) {
res += ans[i];
}
}
cout << res << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | -11 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
long long n, x, m;
cin >> n >> x >> m;
vector<long long> id(m, -1);
vector<long long> ans(n, 0);
long long res;
long long j = 0;
long long len = 0;
while (id[x] == -1) {
id[x] = len;
ans.at(j) = x;
x = (x * x) % m;
len++;
j++;
}
long long loop;
loop = len - id[x];
long long count;
count = (n - id[x]) / loop;
long long value = 0;
for (long long i = id[x]; i < len; i++) {
value += ans[i];
}
////////////////ここまではできてるはず
res = 0;
if (n < len) {
res = 0;
for (long long i = 0; i < n; i++) {
res += ans[i];
}
} else {
for (long long i = 0; i < id[x]; i++) {
res += ans[i];
}
res = res + count * value;
long long amari = (n - id[x]) % loop + id[x];
for (long long i = id[x]; i < amari; i++) {
res += ans[i];
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <vector>
using namespace std;
int main() {
long long n, x, m;
cin >> n >> x >> m;
vector<long long> id(m, -1);
vector<long long> ans(m, 0);
long long res;
long long j = 0;
long long len = 0;
while (id[x] == -1) {
id[x] = len;
ans.at(j) = x;
x = (x * x) % m;
len++;
j++;
}
long long loop;
loop = len - id[x];
long long count;
count = (n - id[x]) / loop;
long long value = 0;
for (long long i = id[x]; i < len; i++) {
value += ans[i];
}
////////////////ここまではできてるはず
res = 0;
if (n < len) {
res = 0;
for (long long i = 0; i < n; i++) {
res += ans[i];
}
} else {
for (long long i = 0; i < id[x]; i++) {
res += ans[i];
}
res = res + count * value;
long long amari = (n - id[x]) % loop + id[x];
for (long long i = id[x]; i < amari; i++) {
res += ans[i];
}
}
cout << res << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout << #x << '=' << x << endl
#define MOD 1000000007
const int N = 1e5 + 1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, x, m;
cin >> n >> x >> m;
ll ans = 0;
if (x == 1) {
cout << n << "\n";
return 0;
} else if (x == 0) {
cout << "0\n";
return 0;
}
set<ll> s;
vector<ll> rem;
ll sum = 0;
ll same = -1;
while (1) {
ans += x;
s.insert(x);
rem.pb(x);
n--;
if (n == 0) {
break;
}
x *= x;
x %= m;
if (s.find(x) != s.end()) {
same = x;
break;
}
}
ll l = 0;
bool ok = 0;
for (auto it : rem) {
if (it == same) {
ok = 1;
}
if (ok) {
sum += it;
l++;
}
}
ans += (n / l) * sum;
n -= ((n / l) * l);
ok = 0;
for (auto it : rem) {
if (it == same) {
ok = 1;
}
if (ok) {
if (n == 0) {
break;
}
ans += it;
n--;
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout << #x << '=' << x << endl
#define MOD 1000000007
const int N = 1e5 + 1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, x, m;
cin >> n >> x >> m;
ll ans = 0;
if (x == 1) {
cout << n << "\n";
return 0;
} else if (x == 0) {
cout << "0\n";
return 0;
}
set<ll> s;
vector<ll> rem;
ll sum = 0;
ll same = -1;
while (1) {
ans += x;
s.insert(x);
rem.pb(x);
n--;
if (n == 0) {
break;
}
x *= x;
x %= m;
if (s.find(x) != s.end()) {
same = x;
break;
}
}
ll l = 0;
bool ok = 0;
for (auto it : rem) {
if (it == same) {
ok = 1;
}
if (ok) {
sum += it;
l++;
}
}
if (l != 0) {
ans += (n / l) * sum;
n -= ((n / l) * l);
}
ok = 0;
for (auto it : rem) {
if (it == same) {
ok = 1;
}
if (ok) {
if (n == 0) {
break;
}
ans += it;
n--;
}
}
cout << ans << "\n";
return 0;
} | replace | 60 | 62 | 60 | 64 | -8 | |
p02550 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
LL n, x, m, a[100005], cnt, sum[100005], mpd[100005];
bool vis[100005];
int main() {
scanf("%lld %lld %lld", &n, &x, &m);
LL now = x;
while (!vis[now]) {
vis[now] = true;
a[++cnt] = now;
sum[cnt] = sum[cnt - 1] + now;
mpd[now] = cnt;
now *= now;
now %= m;
}
if (n <= cnt)
printf("%lld", sum[n]);
else {
LL ans = sum[cnt];
LL beg = mpd[now];
LL len = (cnt - beg + 1);
n -= cnt;
while (n >= len) {
n -= len;
ans += sum[cnt] - sum[beg - 1];
}
LL i = beg;
while (n-- > 0) {
ans += a[i];
++i;
}
printf("%lld", ans);
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
LL n, x, m, a[100005], cnt, sum[100005], mpd[100005];
bool vis[100005];
int main() {
scanf("%lld %lld %lld", &n, &x, &m);
LL now = x;
while (!vis[now]) {
vis[now] = true;
a[++cnt] = now;
sum[cnt] = sum[cnt - 1] + now;
mpd[now] = cnt;
now *= now;
now %= m;
}
if (n <= cnt)
printf("%lld", sum[n]);
else {
LL ans = sum[cnt];
LL beg = mpd[now];
LL len = (cnt - beg + 1);
n -= cnt;
LL dodo = n / len;
ans += dodo * (sum[cnt] - sum[beg - 1]);
n -= dodo * len;
LL i = beg;
while (n-- > 0) {
ans += a[i];
++i;
}
printf("%lld", ans);
}
return 0;
} | replace | 25 | 29 | 25 | 28 | TLE | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() {
ll check[110000] = {};
ll n, x, m;
cin >> n >> x >> m;
if (x == 0) {
cout << 0 << endl;
return 0;
}
vll v;
ll cnt = 0LL;
ll a = x;
rep(i, n) {
v.push_back(a);
cnt += a;
check[a] = true;
a *= a;
a %= m;
if (check[a])
break;
if (a == 0) {
cout << cnt << endl;
return 0;
}
}
if (a == x) {
ll s = v.size();
ll ans = 0LL;
ll c = n - n % s;
ll b = c / s;
ans += cnt * b;
rep(i, n % s) ans += v[i];
cout << ans << endl;
} else {
ll ans = 0LL;
bool swi = true;
vll vv;
ll vs = v.size();
rep(i, vs) {
if (v[i] == a)
swi = false;
if (swi) {
ans += v[i];
n--;
} else
vv.push_back(v[i]);
}
ll s = vv.size();
ll sum = 0LL;
rep(i, s) sum += vv[i];
ll b = n / s;
ans += sum * b;
rep(i, n % s) ans += vv[i];
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() {
ll check[110000] = {};
ll n, x, m;
cin >> n >> x >> m;
if (x == 0) {
cout << 0 << endl;
return 0;
}
vll v;
ll cnt = 0LL;
ll a = x;
rep(i, m + 10) {
v.push_back(a);
cnt += a;
check[a] = true;
a *= a;
a %= m;
if (check[a])
break;
if (a == 0) {
cout << cnt << endl;
return 0;
}
}
if (a == x) {
ll s = v.size();
ll ans = 0LL;
ll c = n - n % s;
ll b = c / s;
ans += cnt * b;
rep(i, n % s) ans += v[i];
cout << ans << endl;
} else {
ll ans = 0LL;
bool swi = true;
vll vv;
ll vs = v.size();
rep(i, vs) {
if (v[i] == a)
swi = false;
if (swi) {
ans += v[i];
n--;
} else
vv.push_back(v[i]);
}
ll s = vv.size();
ll sum = 0LL;
rep(i, s) sum += vv[i];
ll b = n / s;
ans += sum * b;
rep(i, n % s) ans += vv[i];
cout << ans << endl;
}
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n + 1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(), (x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define P pair<ll, ll>
#define debug(var) cerr << "[" << #var << "] " << var << endl
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define pr(s) cout << (s) << '\n'
const ll mod = 1000000007;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const int INF = 1001001001;
const ll INFll = 1E+18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x, m;
cin >> n >> x >> m;
ll ans = 0;
vector<P> memo(m, P(-1, -1));
for (ll i = 0; i < n; i++) {
if (memo[x].second > 0) {
ll loop = i - memo[x].first;
// debug(loop);
ll sum_loop = ans - memo[x].second + x;
ll num = (n - i - 1) / loop;
ans += sum_loop * num;
i += loop * num;
} else {
memo[x] = {i, ans + x};
}
ans += x;
x = (x * x) % m;
if (x == 0)
return -1;
}
pr(ans);
return 0;
}
| #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n + 1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(), (x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define P pair<ll, ll>
#define debug(var) cerr << "[" << #var << "] " << var << endl
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define pr(s) cout << (s) << '\n'
const ll mod = 1000000007;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const int INF = 1001001001;
const ll INFll = 1E+18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x, m;
cin >> n >> x >> m;
ll ans = 0;
vector<P> memo(m, P(-1, -1));
for (ll i = 0; i < n; i++) {
if (memo[x].second > 0) {
ll loop = i - memo[x].first;
// debug(loop);
ll sum_loop = ans - memo[x].second + x;
ll num = (n - i - 1) / loop;
ans += sum_loop * num;
i += loop * num;
} else {
memo[x] = {i, ans + x};
}
ans += x;
x = (x * x) % m;
if (x == 0)
break;
}
pr(ans);
return 0;
}
| replace | 63 | 64 | 63 | 64 | 0 | |
p02550 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long int ll;
#define int long long int
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
#define INF numeric_limits<ll>::max()
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
ll powmod(ll a, ll l, ll md) {
ll res = 1;
while (l) {
if (l & 1)
res = res * a % md;
l /= 2;
a = a * a % md;
}
return res;
}
ll binpow(ll a, ll l) {
ll res = 1;
while (l) {
if (l & 1)
res = res * a;
l /= 2;
a = a * a;
}
return res;
}
ll invmod(ll a, ll md) { return powmod(a, md - 2, md); }
const ll inf = 0xFFFFFFFFFFFFFFFL;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, x, m;
cin >> n >> x >> m;
vi pos(m, -1);
int val = x;
vi arr_a(0);
int left = 0;
int right = n - 1;
for (int i = 0; i < m; i++) {
if (pos[val] == -1) {
pos[val] = i;
arr_a.push_back(val);
val = (val * val) % m;
} else {
left = pos[val];
right = i - 1;
break;
}
}
if (n - 1 < left) {
int ans = 0;
for (int i = 0; i < n; i++) {
ans += arr_a[i];
}
cout << ans << "\n";
} else {
int q = (n - left) / (right - left + 1);
int r = (n - left) % (right - left + 1);
int sum1 = 0;
int sum2 = 0;
if (q > 0) {
for (int i = left; i <= right; i++) {
sum1 += arr_a[i];
}
}
for (int i = 0; i < r + left; i++) {
sum2 += arr_a[i];
}
int ans = q * sum1 + sum2;
cout << ans << "\n";
}
// for (auto x: arr_a){
// cout<<x<<" ";
// }
// cout<<"\n"<<left<<" "<<right<<"\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long int ll;
#define int long long int
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
#define INF numeric_limits<ll>::max()
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
ll powmod(ll a, ll l, ll md) {
ll res = 1;
while (l) {
if (l & 1)
res = res * a % md;
l /= 2;
a = a * a % md;
}
return res;
}
ll binpow(ll a, ll l) {
ll res = 1;
while (l) {
if (l & 1)
res = res * a;
l /= 2;
a = a * a;
}
return res;
}
ll invmod(ll a, ll md) { return powmod(a, md - 2, md); }
const ll inf = 0xFFFFFFFFFFFFFFFL;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, x, m;
cin >> n >> x >> m;
vi pos(m, -1);
int val = x;
vi arr_a(0);
int left = 0;
int right = m - 1;
for (int i = 0; i < m; i++) {
if (pos[val] == -1) {
pos[val] = i;
arr_a.push_back(val);
val = (val * val) % m;
} else {
left = pos[val];
right = i - 1;
break;
}
}
if (n - 1 < left) {
int ans = 0;
for (int i = 0; i < n; i++) {
ans += arr_a[i];
}
cout << ans << "\n";
} else {
int q = (n - left) / (right - left + 1);
int r = (n - left) % (right - left + 1);
int sum1 = 0;
int sum2 = 0;
if (q > 0) {
for (int i = left; i <= right; i++) {
sum1 += arr_a[i];
}
}
for (int i = 0; i < r + left; i++) {
sum2 += arr_a[i];
}
int ans = q * sum1 + sum2;
cout << ans << "\n";
}
// for (auto x: arr_a){
// cout<<x<<" ";
// }
// cout<<"\n"<<left<<" "<<right<<"\n";
return 0;
}
| replace | 44 | 45 | 44 | 45 | 0 | |
p02551 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define cauto const auto &
#define ALL(v) begin(v), end(v)
#else
#define ALL(v) (v).begin(), (v).end()
#endif
namespace {
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> inline T &chmin(T &x, const T &y) { return x = min(x, y); }
template <class T> inline T &chmax(T &x, const T &y) { return x = max(x, y); }
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
template <class Con> string concat(const Con &c, const string &spr) {
stringstream ss;
typename Con::const_iterator it = c.begin(), en = c.end();
bool fst = true;
for (; it != en; ++it) {
if (!fst) {
ss << spr;
}
fst = false;
ss << *it;
}
return ss.str();
}
template <class Con, class Fun>
vector<typename Con::value_type> cfilter(const Con &c, Fun f) {
vector<typename Con::value_type> ret;
typename Con::const_iterator it = c.begin(), en = c.end();
for (; it != en; ++it) {
if (f(*it)) {
ret.emplace_back(*it);
}
}
return ret;
}
#if __cplusplus >= 201103L
template <class Con, class Fun>
auto cmap(const Con &c, Fun f) -> vector<decltype(f(*c.begin()))> {
vector<decltype(f(*c.begin()))> ret;
ret.reserve(c.size());
for (const auto &x : c) {
ret.emplace_back(f(x));
}
return ret;
}
#endif
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RALL(v) (v).rbegin(), (v).rend()
#define tget(t, i) get<i>(t)
#define MOD 1000000007LL
#define EPS 1e-8
const int NONE = -1010101010;
struct segtree {
int m;
vector<int> dat;
segtree(int n, int init) {
for (m = 1; m < n; ++m)
;
dat.assign(m * 2 - 1, init);
}
void update(int a, int b, int v) { update(a, b, v, 0, 0, m); }
void update(int a, int b, int v, int k, int l, int r) {
if (r <= a || b <= l) {
return;
}
if (a <= l && r <= b) {
chmin(dat[k], v);
} else {
update(a, b, v, k * 2 + 1, l, (l + r) >> 1);
update(a, b, v, k * 2 + 2, (l + r) >> 1, r);
}
}
int query(int p) {
int k = 0, l = 0, r = m, ret = dat[0];
while (k < m - 1) {
int x = (l + r) >> 1;
if (p < x) {
k = k * 2 + 1;
r = x;
} else {
k = k * 2 + 2;
l = x;
}
chmin(ret, dat[k]);
}
return ret;
}
};
void mainmain() {
int n, q;
scanf("%d%d", &n, &q);
segtree sts[2] = {segtree(n, n - 1), segtree(n, n - 1)};
LL ans = (n - 2LL) * (n - 2LL);
for (int i = 0; i < q; ++i) {
int tp, x;
scanf("%d%d", &tp, &x);
--x;
--tp;
int y = sts[tp].query(x);
ans -= y - 1;
sts[!tp].update(0, y, x);
}
printf("%lld\n", ans);
}
} // namespace
int main() try {
// ios::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(4);
mainmain();
} catch (const exception &e) {
cerr << "exception: " << e.what() << endl;
abort();
} catch (...) {
cerr << "exception" << endl;
abort();
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define cauto const auto &
#define ALL(v) begin(v), end(v)
#else
#define ALL(v) (v).begin(), (v).end()
#endif
namespace {
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> inline T &chmin(T &x, const T &y) { return x = min(x, y); }
template <class T> inline T &chmax(T &x, const T &y) { return x = max(x, y); }
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
template <class Con> string concat(const Con &c, const string &spr) {
stringstream ss;
typename Con::const_iterator it = c.begin(), en = c.end();
bool fst = true;
for (; it != en; ++it) {
if (!fst) {
ss << spr;
}
fst = false;
ss << *it;
}
return ss.str();
}
template <class Con, class Fun>
vector<typename Con::value_type> cfilter(const Con &c, Fun f) {
vector<typename Con::value_type> ret;
typename Con::const_iterator it = c.begin(), en = c.end();
for (; it != en; ++it) {
if (f(*it)) {
ret.emplace_back(*it);
}
}
return ret;
}
#if __cplusplus >= 201103L
template <class Con, class Fun>
auto cmap(const Con &c, Fun f) -> vector<decltype(f(*c.begin()))> {
vector<decltype(f(*c.begin()))> ret;
ret.reserve(c.size());
for (const auto &x : c) {
ret.emplace_back(f(x));
}
return ret;
}
#endif
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RALL(v) (v).rbegin(), (v).rend()
#define tget(t, i) get<i>(t)
#define MOD 1000000007LL
#define EPS 1e-8
const int NONE = -1010101010;
struct segtree {
int m;
vector<int> dat;
segtree(int n, int init) {
for (m = 1; m < n; m *= 2)
;
dat.assign(m * 2 - 1, init);
}
void update(int a, int b, int v) { update(a, b, v, 0, 0, m); }
void update(int a, int b, int v, int k, int l, int r) {
if (r <= a || b <= l) {
return;
}
if (a <= l && r <= b) {
chmin(dat[k], v);
} else {
update(a, b, v, k * 2 + 1, l, (l + r) >> 1);
update(a, b, v, k * 2 + 2, (l + r) >> 1, r);
}
}
int query(int p) {
int k = 0, l = 0, r = m, ret = dat[0];
while (k < m - 1) {
int x = (l + r) >> 1;
if (p < x) {
k = k * 2 + 1;
r = x;
} else {
k = k * 2 + 2;
l = x;
}
chmin(ret, dat[k]);
}
return ret;
}
};
void mainmain() {
int n, q;
scanf("%d%d", &n, &q);
segtree sts[2] = {segtree(n, n - 1), segtree(n, n - 1)};
LL ans = (n - 2LL) * (n - 2LL);
for (int i = 0; i < q; ++i) {
int tp, x;
scanf("%d%d", &tp, &x);
--x;
--tp;
int y = sts[tp].query(x);
ans -= y - 1;
sts[!tp].update(0, y, x);
}
printf("%lld\n", ans);
}
} // namespace
int main() try {
// ios::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(4);
mainmain();
} catch (const exception &e) {
cerr << "exception: " << e.what() << endl;
abort();
} catch (...) {
cerr << "exception" << endl;
abort();
}
| replace | 118 | 119 | 118 | 119 | 0 | |
p02551 | C++ | Runtime Error | #include <iostream>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ll n;
int q;
cin >> n >> q;
set<ll> st1, st2;
st1.insert(n);
st2.insert(n);
ll c1[100005]{0}, c2[100005]{0};
ll ans = (n - 2) * (n - 2);
while (q--) {
int c;
ll x;
cin >> c >> x;
if (c == 1) {
auto itr = st1.lower_bound(x);
if (itr == st1.begin()) {
st1.insert(x);
c1[x] = *st2.begin() - 2;
ans -= c1[x];
} else
ans -= c1[*--itr];
} else {
auto itr = st2.lower_bound(x);
if (itr == st2.begin()) {
st2.insert(x);
c2[x] = *st1.begin() - 2;
ans -= c2[x];
} else
ans -= c2[*--itr];
}
}
cout << ans << endl;
}
| #include <iostream>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ll n;
int q;
cin >> n >> q;
set<ll> st1, st2;
st1.insert(n);
st2.insert(n);
ll c1[200005]{0}, c2[200005]{0};
ll ans = (n - 2) * (n - 2);
while (q--) {
int c;
ll x;
cin >> c >> x;
if (c == 1) {
auto itr = st1.lower_bound(x);
if (itr == st1.begin()) {
st1.insert(x);
c1[x] = *st2.begin() - 2;
ans -= c1[x];
} else
ans -= c1[*--itr];
} else {
auto itr = st2.lower_bound(x);
if (itr == st2.begin()) {
st2.insert(x);
c2[x] = *st1.begin() - 2;
ans -= c2[x];
} else
ans -= c2[*--itr];
}
}
cout << ans << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02551 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 100005;
int n, q;
struct Node {
int c[N];
int sum(int x) {
int res = n;
while (x) {
res = min(res, c[x]);
x -= x & -x;
}
return res;
}
void add(int x, int d) {
while (x <= n) {
c[x] = min(c[x], d);
x += x & -x;
}
}
} T1, T2;
int main() {
cin >> n >> q;
LL ans = (n - 2LL) * (n - 2);
for (int i = 1; i <= n; i++)
T1.c[i] = T2.c[i] = n;
while (q--) {
int op, x;
cin >> op >> x;
if (op == 1) {
int z = T1.sum(n - x + 1);
T2.add(n - z + 1, x);
ans -= z - 2;
} else {
int z = T2.sum(n - x + 1);
T1.add(n - z + 1, x);
ans -= z - 2;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 200005;
int n, q;
struct Node {
int c[N];
int sum(int x) {
int res = n;
while (x) {
res = min(res, c[x]);
x -= x & -x;
}
return res;
}
void add(int x, int d) {
while (x <= n) {
c[x] = min(c[x], d);
x += x & -x;
}
}
} T1, T2;
int main() {
cin >> n >> q;
LL ans = (n - 2LL) * (n - 2);
for (int i = 1; i <= n; i++)
T1.c[i] = T2.c[i] = n;
while (q--) {
int op, x;
cin >> op >> x;
if (op == 1) {
int z = T1.sum(n - x + 1);
T2.add(n - z + 1, x);
ans -= z - 2;
} else {
int z = T2.sum(n - x + 1);
T1.add(n - z + 1, x);
ans -= z - 2;
}
}
cout << ans << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02551 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define fr(i, k, n) for (int i = k; i < n; ++i)
#define fri(i, k, n) for (int i = k; i >= n; --i)
#define INF (int)1e9
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(), arr.end()
void boost() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int N = 2e5 + 5;
int t[2][4 * N], n, lazy[2][4 * N];
bool marked[2][4 * N];
void push(int v, int i) {
if (marked[v]) {
t[i][v * 2] = max(t[i][v * 2], lazy[i][v]);
t[i][v * 2 + 1] = max(t[i][v * 2 + 1], lazy[i][v]);
lazy[i][v * 2] = max(lazy[i][v * 2], lazy[i][v]);
lazy[i][v * 2 + 1] = max(lazy[i][v * 2 + 1], lazy[i][v]);
lazy[i][v] = 0;
marked[i][v * 2] = marked[i][v * 2 + 1] = true;
marked[i][v] = false;
}
}
void update(int v, int tl, int tr, int l, int r, int new_val, int i) {
if (l > r)
return;
if (l == tl && tr == r) {
push(v, i);
lazy[i][v] = max(lazy[i][v], new_val);
t[i][v] = max(t[i][v], new_val);
marked[i][v] = true;
} else {
push(v, i);
int tm = (tl + tr) / 2;
update(v * 2, tl, tm, l, min(r, tm), new_val, i);
update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, new_val, i);
t[i][v] = max(t[i][v * 2], t[i][v * 2 + 1]);
}
}
int get(int v, int tl, int tr, int pos, int i) {
if (tl == tr) {
return t[i][v];
}
push(v, i);
int tm = (tl + tr) / 2;
if (pos <= tm)
return get(v * 2, tl, tm, pos, i);
else
return get(v * 2 + 1, tm + 1, tr, pos, i);
}
void solve() {
fr(i, 0, 2) {
fr(j, 0, 4 * N) { t[i][j] = 1; }
}
int n, q;
cin >> n >> q;
ll ans = 0;
while (q--) {
int i, y;
cin >> i >> y;
i--;
int mn = get(1, 1, n, y, i);
// cout<<mn<<endl;
ans += (n - 1LL - mn);
if (i == 0)
update(1, 1, n, 1, n - mn, n - y + 1, i ^ 1);
else
update(1, 1, n, 1, n - mn, n - y + 1, i ^ 1);
}
// cout<<ans<<endl;
ans = ((n - 2) * 1LL * (n - 2) - ans);
cout << ans << endl;
return;
}
int main() {
boost();
int tc = 1;
// cin>>tc;
while (tc--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define fr(i, k, n) for (int i = k; i < n; ++i)
#define fri(i, k, n) for (int i = k; i >= n; --i)
#define INF (int)1e9
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define all(arr) arr.begin(), arr.end()
void boost() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int N = 2e5 + 5;
int t[2][4 * N], n, lazy[2][4 * N];
bool marked[2][4 * N];
void push(int v, int i) {
if (marked[v]) {
t[i][v * 2] = max(t[i][v * 2], lazy[i][v]);
t[i][v * 2 + 1] = max(t[i][v * 2 + 1], lazy[i][v]);
lazy[i][v * 2] = max(lazy[i][v * 2], lazy[i][v]);
lazy[i][v * 2 + 1] = max(lazy[i][v * 2 + 1], lazy[i][v]);
lazy[i][v] = 0;
marked[i][v * 2] = marked[i][v * 2 + 1] = true;
marked[i][v] = false;
}
}
void update(int v, int tl, int tr, int l, int r, int new_val, int i) {
if (l > r)
return;
if (l == tl && tr == r) {
// push(v,i);
lazy[i][v] = max(lazy[i][v], new_val);
t[i][v] = max(t[i][v], new_val);
marked[i][v] = true;
} else {
push(v, i);
int tm = (tl + tr) / 2;
update(v * 2, tl, tm, l, min(r, tm), new_val, i);
update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, new_val, i);
t[i][v] = max(t[i][v * 2], t[i][v * 2 + 1]);
}
}
int get(int v, int tl, int tr, int pos, int i) {
if (tl == tr) {
return t[i][v];
}
push(v, i);
int tm = (tl + tr) / 2;
if (pos <= tm)
return get(v * 2, tl, tm, pos, i);
else
return get(v * 2 + 1, tm + 1, tr, pos, i);
}
void solve() {
fr(i, 0, 2) {
fr(j, 0, 4 * N) { t[i][j] = 1; }
}
int n, q;
cin >> n >> q;
ll ans = 0;
while (q--) {
int i, y;
cin >> i >> y;
i--;
int mn = get(1, 1, n, y, i);
// cout<<mn<<endl;
ans += (n - 1LL - mn);
if (i == 0)
update(1, 1, n, 1, n - mn, n - y + 1, i ^ 1);
else
update(1, 1, n, 1, n - mn, n - y + 1, i ^ 1);
}
// cout<<ans<<endl;
ans = ((n - 2) * 1LL * (n - 2) - ans);
cout << ans << endl;
return;
}
int main() {
boost();
int tc = 1;
// cin>>tc;
while (tc--)
solve();
return 0;
} | replace | 43 | 44 | 43 | 44 | 0 | |
p02551 | C++ | Runtime Error | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define rint register int
#define rep(i, l, r) for (rint i = l; i <= r; i++)
#define per(i, l, r) for (rint i = l; i >= r; i--)
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define fir first
#define sec second
#define mset(s, t) memset(s, t, sizeof(s))
template <typename T1, typename T2> void ckmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> void ckmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int read() {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
x = 10 * x + ch - '0', ch = getchar();
return f ? -x : x;
}
#define int long long
const int N = 600005;
int n, q;
struct Seg {
#define ls (u << 1)
#define rs (u << 1 | 1)
int minn[N], tag[N];
void pushup(int u) { minn[u] = min(minn[ls], minn[rs]); }
void pushdown(int u) {
if (tag[u] != 1e9) {
tag[ls] = min(tag[ls], tag[u]);
tag[rs] = min(tag[rs], tag[u]);
minn[ls] = min(minn[ls], tag[u]);
minn[rs] = min(minn[rs], tag[u]);
tag[u] = 1e9;
}
}
void build(int u, int l, int r) {
tag[u] = 1e9, minn[u] = n;
if (l == r)
return;
int mid = l + r >> 1;
build(ls, l, mid), build(rs, mid + 1, r);
}
void update(int u, int l, int r, int ql, int qr, int dlt) {
pushdown(u);
if (ql <= l && r <= qr) {
minn[u] = min(minn[u], dlt);
tag[u] = min(tag[u], dlt);
return;
}
pushdown(u);
int mid = l + r >> 1;
if (ql <= mid)
update(ls, l, mid, ql, qr, dlt);
if (qr > mid)
update(rs, mid + 1, r, ql, qr, dlt);
pushup(u);
}
int query(int u, int l, int r, int pos) {
pushdown(u);
if (l == r)
return minn[u];
int mid = l + r >> 1;
if (pos <= mid)
return query(ls, l, mid, pos);
else
return query(rs, mid + 1, r, pos);
}
} row, col;
// row:行，col:列
signed main() {
n = read(), q = read();
ll ans = 1ll * (n - 2) * (n - 2);
row.build(1, 1, n);
col.build(1, 1, n);
while (q--) {
int opt = read(), x = read();
if (opt == 1) {
int t = col.query(1, 1, n, x);
// printf("opt = 1, t=%d\n",t);
ans -= max(0ll, t - 2);
if (t - 1 >= 2)
row.update(1, 1, n, 2, t - 1, x);
} else {
int t = row.query(1, 1, n, x);
ans -= max(0ll, t - 2);
if (t - 1 >= 2)
col.update(1, 1, n, 2, t - 1, x);
}
// printf("%lld\n",ans);
}
printf("%lld\n", ans);
return 0;
} | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define rint register int
#define rep(i, l, r) for (rint i = l; i <= r; i++)
#define per(i, l, r) for (rint i = l; i >= r; i--)
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define fir first
#define sec second
#define mset(s, t) memset(s, t, sizeof(s))
template <typename T1, typename T2> void ckmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> void ckmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int read() {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
x = 10 * x + ch - '0', ch = getchar();
return f ? -x : x;
}
#define int long long
const int N = 3000005;
int n, q;
struct Seg {
#define ls (u << 1)
#define rs (u << 1 | 1)
int minn[N], tag[N];
void pushup(int u) { minn[u] = min(minn[ls], minn[rs]); }
void pushdown(int u) {
if (tag[u] != 1e9) {
tag[ls] = min(tag[ls], tag[u]);
tag[rs] = min(tag[rs], tag[u]);
minn[ls] = min(minn[ls], tag[u]);
minn[rs] = min(minn[rs], tag[u]);
tag[u] = 1e9;
}
}
void build(int u, int l, int r) {
tag[u] = 1e9, minn[u] = n;
if (l == r)
return;
int mid = l + r >> 1;
build(ls, l, mid), build(rs, mid + 1, r);
}
void update(int u, int l, int r, int ql, int qr, int dlt) {
pushdown(u);
if (ql <= l && r <= qr) {
minn[u] = min(minn[u], dlt);
tag[u] = min(tag[u], dlt);
return;
}
pushdown(u);
int mid = l + r >> 1;
if (ql <= mid)
update(ls, l, mid, ql, qr, dlt);
if (qr > mid)
update(rs, mid + 1, r, ql, qr, dlt);
pushup(u);
}
int query(int u, int l, int r, int pos) {
pushdown(u);
if (l == r)
return minn[u];
int mid = l + r >> 1;
if (pos <= mid)
return query(ls, l, mid, pos);
else
return query(rs, mid + 1, r, pos);
}
} row, col;
// row:行，col:列
signed main() {
n = read(), q = read();
ll ans = 1ll * (n - 2) * (n - 2);
row.build(1, 1, n);
col.build(1, 1, n);
while (q--) {
int opt = read(), x = read();
if (opt == 1) {
int t = col.query(1, 1, n, x);
// printf("opt = 1, t=%d\n",t);
ans -= max(0ll, t - 2);
if (t - 1 >= 2)
row.update(1, 1, n, 2, t - 1, x);
} else {
int t = row.query(1, 1, n, x);
ans -= max(0ll, t - 2);
if (t - 1 >= 2)
col.update(1, 1, n, 2, t - 1, x);
}
// printf("%lld\n",ans);
}
printf("%lld\n", ans);
return 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02551 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
ll ans = n - 2;
ans *= ans;
vector<int> v[] = {vector<int>(n + 1, n), vector<int>(n + 1, n)};
int d[] = {n, n};
rep(_, q) {
int x, a;
cin >> x >> a;
--x;
if (a < d[x]) {
rep(i, d[x]) { v[x][i] = d[!x]; }
d[x] = a;
}
ans -= v[x][a] - 2;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
ll ans = n - 2;
ans *= ans;
vector<int> v[] = {vector<int>(n + 1, n), vector<int>(n + 1, n)};
int d[] = {n, n};
rep(_, q) {
int x, a;
cin >> x >> a;
--x;
if (a < d[x]) {
for (int i = a; i < d[x]; ++i) {
v[x][i] = d[!x];
}
d[x] = a;
}
ans -= v[x][a] - 2;
}
cout << ans << endl;
}
| replace | 28 | 29 | 28 | 31 | TLE | |
p02551 | 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 itn int
#define fi first
#define se second
#define intmax numeric_limits<int>::max()
#define llmax numeric_limits<ll>::max()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; i--)
#define all(vec) vec.begin(), vec.end()
#define sortt(vec) sort((vec).begin(), (vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;
typedef tuple<int, int, int> tiii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
const ll lnf = 1ll << 60;
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n))
x++;
return x;
}
} // namespace internal
template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
F (*composition)(F, F), F (*id)()>
struct lazy_segtree {
public:
lazy_segtree() : lazy_segtree(0) {}
lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
lz = std::vector<F>(size, id());
for (int i = 0; i < _n; i++)
d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = x;
for (int i = 1; i <= log; i++)
update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
return d[p];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return e();
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push(r >> i);
}
S sml = e(), smr = e();
while (l < r) {
if (l & 1)
sml = op(sml, d[l++]);
if (r & 1)
smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
void apply(int p, F f) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = mapping(f, d[p]);
for (int i = 1; i <= log; i++)
update(p >> i);
}
void apply(int l, int r, F f) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return;
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push((r - 1) >> i);
}
{
int l2 = l, r2 = r;
while (l < r) {
if (l & 1)
all_apply(l++, f);
if (r & 1)
all_apply(--r, f);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for (int i = 1; i <= log; i++) {
if (((l >> i) << i) != l)
update(l >> i);
if (((r >> i) << i) != r)
update((r - 1) >> i);
}
}
template <bool (*g)(S)> int max_right(int l) {
return max_right(l, [](S x) { return g(x); });
}
template <class G> int max_right(int l, G g) {
assert(0 <= l && l <= _n);
assert(g(e()));
if (l == _n)
return _n;
l += size;
for (int i = log; i >= 1; i--)
push(l >> i);
S sm = e();
do {
while (l % 2 == 0)
l >>= 1;
if (!g(op(sm, d[l]))) {
while (l < size) {
push(l);
l = (2 * l);
if (g(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*g)(S)> int min_left(int r) {
return min_left(r, [](S x) { return g(x); });
}
template <class G> int min_left(int r, G g) {
assert(0 <= r && r <= _n);
assert(g(e()));
if (r == 0)
return 0;
r += size;
for (int i = log; i >= 1; i--)
push((r - 1) >> i);
S sm = e();
do {
r--;
while (r > 1 && (r % 2))
r >>= 1;
if (!g(op(d[r], sm))) {
while (r < size) {
push(r);
r = (2 * r + 1);
if (g(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
std::vector<F> lz;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
void all_apply(int k, F f) {
d[k] = mapping(f, d[k]);
if (k < size)
lz[k] = composition(f, lz[k]);
}
void push(int k) {
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
using S = ll;
using F = ll;
S op(S l, S r) { return S{min(l, r)}; }
S e() { return S{llmax}; }
S mapping(F l, S r) { return S{min(l, r)}; }
F composition(F l, F r) { return F{min(l, r)}; }
F id() { return F{llmax}; }
int main() {
itn n, q;
cin >> n >> q;
lazy_segtree<S, op, e, F, mapping, composition, id> seg1(n - 2);
lazy_segtree<S, op, e, F, mapping, composition, id> seg2(n - 2);
rep(i, n - 2) { seg1.apply(i, i + 1, n - 2); }
ll take = 0;
rep(i, q) {
itn p, x;
cin >> p >> x;
x -= 2;
if (p == 1) {
itn right = seg1.get(x);
take += right;
seg1.set(x, 0);
seg2.apply(0, right, x);
} else {
itn right = seg2.get(x);
take += right;
seg2.set(x, 0);
seg1.apply(0, right, x);
}
}
cout << (ll)(n - 2) * (n - 2) - take << endl;
} | #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 itn int
#define fi first
#define se second
#define intmax numeric_limits<int>::max()
#define llmax numeric_limits<ll>::max()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; i--)
#define all(vec) vec.begin(), vec.end()
#define sortt(vec) sort((vec).begin(), (vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;
typedef tuple<int, int, int> tiii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
const ll lnf = 1ll << 60;
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n))
x++;
return x;
}
} // namespace internal
template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
F (*composition)(F, F), F (*id)()>
struct lazy_segtree {
public:
lazy_segtree() : lazy_segtree(0) {}
lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
lz = std::vector<F>(size, id());
for (int i = 0; i < _n; i++)
d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = x;
for (int i = 1; i <= log; i++)
update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
return d[p];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return e();
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push(r >> i);
}
S sml = e(), smr = e();
while (l < r) {
if (l & 1)
sml = op(sml, d[l++]);
if (r & 1)
smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
void apply(int p, F f) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--)
push(p >> i);
d[p] = mapping(f, d[p]);
for (int i = 1; i <= log; i++)
update(p >> i);
}
void apply(int l, int r, F f) {
assert(0 <= l && l <= r && r <= _n);
if (l == r)
return;
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l)
push(l >> i);
if (((r >> i) << i) != r)
push((r - 1) >> i);
}
{
int l2 = l, r2 = r;
while (l < r) {
if (l & 1)
all_apply(l++, f);
if (r & 1)
all_apply(--r, f);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for (int i = 1; i <= log; i++) {
if (((l >> i) << i) != l)
update(l >> i);
if (((r >> i) << i) != r)
update((r - 1) >> i);
}
}
template <bool (*g)(S)> int max_right(int l) {
return max_right(l, [](S x) { return g(x); });
}
template <class G> int max_right(int l, G g) {
assert(0 <= l && l <= _n);
assert(g(e()));
if (l == _n)
return _n;
l += size;
for (int i = log; i >= 1; i--)
push(l >> i);
S sm = e();
do {
while (l % 2 == 0)
l >>= 1;
if (!g(op(sm, d[l]))) {
while (l < size) {
push(l);
l = (2 * l);
if (g(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*g)(S)> int min_left(int r) {
return min_left(r, [](S x) { return g(x); });
}
template <class G> int min_left(int r, G g) {
assert(0 <= r && r <= _n);
assert(g(e()));
if (r == 0)
return 0;
r += size;
for (int i = log; i >= 1; i--)
push((r - 1) >> i);
S sm = e();
do {
r--;
while (r > 1 && (r % 2))
r >>= 1;
if (!g(op(d[r], sm))) {
while (r < size) {
push(r);
r = (2 * r + 1);
if (g(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
std::vector<F> lz;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
void all_apply(int k, F f) {
d[k] = mapping(f, d[k]);
if (k < size)
lz[k] = composition(f, lz[k]);
}
void push(int k) {
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
using S = ll;
using F = ll;
S op(S l, S r) { return S{min(l, r)}; }
S e() { return S{llmax}; }
S mapping(F l, S r) { return S{min(l, r)}; }
F composition(F l, F r) { return F{min(l, r)}; }
F id() { return F{llmax}; }
int main() {
itn n, q;
cin >> n >> q;
lazy_segtree<S, op, e, F, mapping, composition, id> seg1(n - 2);
lazy_segtree<S, op, e, F, mapping, composition, id> seg2(n - 2);
rep(i, n - 2) seg1.set(i, n - 2);
rep(i, n - 2) seg2.set(i, n - 2);
ll take = 0;
rep(i, q) {
itn p, x;
cin >> p >> x;
x -= 2;
if (p == 1) {
itn right = seg1.get(x);
take += right;
seg1.set(x, 0);
seg2.apply(0, right, x);
} else {
itn right = seg2.get(x);
take += right;
seg2.set(x, 0);
seg1.apply(0, right, x);
}
}
cout << (ll)(n - 2) * (n - 2) - take << endl;
} | replace | 265 | 266 | 265 | 267 | 0 | |
p02551 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define counter(m) for (int i = 0; i < m; i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf LLONG_MAX
#define deci(x, y) fixed << setprecision(y) << x
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define nitin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define PI 3.141592653589793238
using namespace std;
struct segte {
int n;
int *a;
int *tree;
int *lazy;
void init(int N, const int *A = nullptr) {
n = N;
a = new int[n + 1];
lazy = new int[5 * (n + 1) + 1];
tree = new int[5 * (n + 1) + 1];
for (int i = 0; i < 5 * (n + 1); i++) {
lazy[i] = inf;
tree[i] = inf;
}
for (int i = 1; i <= n; i++)
a[i] = n - 1;
}
void build(int index, int ss, int se) {
if (ss == se) {
tree[index] = a[ss];
return;
}
int mid = (ss + se) / 2;
build(2 * index, ss, mid);
build(2 * index + 1, mid + 1, se);
tree[index] = min(tree[2 * index], tree[2 * index + 1]);
}
void build() { build(1, 1, n); }
void update_range(int index, int ss, int se, int qs, int qe, int val) {
if (lazy[index] != inf) {
tree[index] = min(tree[index], lazy[index]);
if (ss != se) {
lazy[2 * index] = min(lazy[2 * index], lazy[index]);
lazy[2 * index + 1] = min(lazy[2 * index + 1], lazy[index]);
}
lazy[index] = inf;
}
if (ss > qe || se < qs)
return;
if (ss >= qs && se <= qe) {
tree[index] = min(tree[index], val);
lazy[2 * index] = min(lazy[2 * index], val);
lazy[2 * index + 1] = min(lazy[2 * index + 1], val);
return;
}
int mid = (ss + se) / 2;
update_range(2 * index, ss, mid, qs, qe, val);
update_range(2 * index + 1, mid + 1, se, qs, qe, val);
tree[index] = min(tree[2 * index], tree[2 * index + 1]);
}
void update_range(int qs, int qe, int val) {
update_range(1, 1, n, qs, qe, val);
}
int get(int index, int ss, int se, int idx) {
if (lazy[index] != inf) {
tree[index] = min(tree[index], lazy[index]);
if (ss != se) {
lazy[2 * index] = min(lazy[2 * index], lazy[index]);
lazy[2 * index + 1] = min(lazy[2 * index + 1], lazy[index]);
}
lazy[index] = inf;
}
if (ss == se) {
// cout<<index<<" "<<tree[index]<<endl;
return tree[index];
}
int mid = (ss + se) / 2;
if (idx <= mid)
return get(2 * index, ss, mid, idx);
else
return get(2 * index + 1, mid + 1, se, idx);
}
int get(int idx) { return get(1, 1, n, idx); }
};
int32_t main() {
nitin;
int n;
cin >> n;
segte x;
x.init(n);
x.build();
segte y;
y.init(n);
y.build();
int black = n * n - (n + n + n - 2 + n - 2);
int q;
cin >> q;
// for(int i=1;i<=n;i++)
// cout<<x.get(i)<<" ";
// cout<<endl;
// for(int i=1;i<=n;i++)
// cout<<y.get(i)<<" ";
// cout<<endl;
while (q--) {
int a;
cin >> a;
if (a == 1) {
int col;
cin >> col;
int val = y.get(col);
if (val > 1) {
black -= (val - 1);
}
if (val != 0)
x.update_range(1, val, col - 1);
// for(int i=1;i<=n;i++)
// cout<<x.get(i)<<" ";
// cout<<endl;
} else {
int row;
cin >> row;
int val = x.get(row);
if (val > 1) {
black -= (val - 1);
}
if (val != 0)
y.update_range(1, val, row - 1);
// for(int i=1;i<=n;i++)
// cout<<y.get(i)<<" ";
// cout<<endl;
}
}
cout << black << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define counter(m) for (int i = 0; i < m; i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf LLONG_MAX
#define deci(x, y) fixed << setprecision(y) << x
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define nitin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define PI 3.141592653589793238
using namespace std;
struct segte {
int n;
int *a;
int *tree;
int *lazy;
void init(int N, const int *A = nullptr) {
n = N;
a = new int[n + 1];
lazy = new int[5 * (n + 1) + 1];
tree = new int[5 * (n + 1) + 1];
for (int i = 0; i < 5 * (n + 1); i++) {
lazy[i] = inf;
tree[i] = inf;
}
for (int i = 1; i <= n; i++)
a[i] = n - 1;
}
void build(int index, int ss, int se) {
if (ss == se) {
tree[index] = a[ss];
return;
}
int mid = (ss + se) / 2;
build(2 * index, ss, mid);
build(2 * index + 1, mid + 1, se);
tree[index] = min(tree[2 * index], tree[2 * index + 1]);
}
void build() { build(1, 1, n); }
void update_range(int index, int ss, int se, int qs, int qe, int val) {
if (lazy[index] != inf) {
tree[index] = min(tree[index], lazy[index]);
if (ss != se) {
lazy[2 * index] = min(lazy[2 * index], lazy[index]);
lazy[2 * index + 1] = min(lazy[2 * index + 1], lazy[index]);
}
lazy[index] = inf;
}
if (ss > qe || se < qs)
return;
if (ss >= qs && se <= qe) {
tree[index] = min(tree[index], val);
if (ss != se) {
lazy[2 * index] = min(lazy[2 * index], val);
lazy[2 * index + 1] = min(lazy[2 * index + 1], val);
}
return;
}
int mid = (ss + se) / 2;
update_range(2 * index, ss, mid, qs, qe, val);
update_range(2 * index + 1, mid + 1, se, qs, qe, val);
tree[index] = min(tree[2 * index], tree[2 * index + 1]);
}
void update_range(int qs, int qe, int val) {
update_range(1, 1, n, qs, qe, val);
}
int get(int index, int ss, int se, int idx) {
if (lazy[index] != inf) {
tree[index] = min(tree[index], lazy[index]);
if (ss != se) {
lazy[2 * index] = min(lazy[2 * index], lazy[index]);
lazy[2 * index + 1] = min(lazy[2 * index + 1], lazy[index]);
}
lazy[index] = inf;
}
if (ss == se) {
// cout<<index<<" "<<tree[index]<<endl;
return tree[index];
}
int mid = (ss + se) / 2;
if (idx <= mid)
return get(2 * index, ss, mid, idx);
else
return get(2 * index + 1, mid + 1, se, idx);
}
int get(int idx) { return get(1, 1, n, idx); }
};
int32_t main() {
nitin;
int n;
cin >> n;
segte x;
x.init(n);
x.build();
segte y;
y.init(n);
y.build();
int black = n * n - (n + n + n - 2 + n - 2);
int q;
cin >> q;
// for(int i=1;i<=n;i++)
// cout<<x.get(i)<<" ";
// cout<<endl;
// for(int i=1;i<=n;i++)
// cout<<y.get(i)<<" ";
// cout<<endl;
while (q--) {
int a;
cin >> a;
if (a == 1) {
int col;
cin >> col;
int val = y.get(col);
if (val > 1) {
black -= (val - 1);
}
if (val != 0)
x.update_range(1, val, col - 1);
// for(int i=1;i<=n;i++)
// cout<<x.get(i)<<" ";
// cout<<endl;
} else {
int row;
cin >> row;
int val = x.get(row);
if (val > 1) {
black -= (val - 1);
}
if (val != 0)
y.update_range(1, val, row - 1);
// for(int i=1;i<=n;i++)
// cout<<y.get(i)<<" ";
// cout<<endl;
}
}
cout << black << endl;
return 0;
}
| replace | 67 | 69 | 67 | 71 | 0 | |
p02552 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 1 - N;
cout << ans;
for (long long i = 1; i < 10000000; i++) {
cout << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 1 - N;
cout << ans;
for (long long i = 1; i < 100000; i++) {
cout << endl;
}
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02552 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
void solve() {}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tc;
cin >> tc;
cout << 1 - tc;
return 1;
}
| #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
void solve() {}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tc;
cin >> tc;
cout << 1 - tc;
return 0;
}
| replace | 24 | 25 | 24 | 25 | 1 | |
p02552 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
return !x;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << (!x) << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02552 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
return !x;
}
static int fastio = []() {
#define endl '\n'
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
return 0;
}();
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << !x;
}
static int fastio = []() {
#define endl '\n'
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
return 0;
}();
| replace | 6 | 7 | 6 | 7 | 0 | |
p02552 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a)
return 0;
return 1;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a)
cout << "0" << endl;
else
cout << "1" << endl;
return 0;
} | replace | 7 | 9 | 7 | 11 | 0 | |
p02552 | C++ | Time Limit Exceeded | // Code by: A Gokul Karthik
#include <bits/stdc++.h>
#define ll long long int
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast std::ios_base::sync_with_stdio(false)
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a << ' ' << b << ' ' << c << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repre(i, a, b) for (int i = a; i <= b; i++)
#define clr1(arr) memset(arr, -1, sizeof(arr));
#define clr0(arr) memset(arr, 0, sizeof(arr));
#define RANGE 255
#define po(a) \
if (a < 0) { \
a *= -1; \
}
using namespace std;
void swap(int *xp, int *yp) {
int temp = *xp;
*xp = *yp;
*yp = temp;
}
void bubbleSort(int arr[], int n) {
int i, j;
for (i = 0; i < n - 1; i++)
for (j = 0; j < n - i - 1; j++)
if (arr[j] > arr[j + 1])
swap(&arr[j], &arr[j + 1]);
}
int solve() {
int x;
cin >> x;
if (x == 0) {
cout << 1 << "\n";
}
if (x == 1) {
cout << 0 << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
t = 1;
for (int i = 0; i < t; i++) {
solve();
}
}
| // Code by: A Gokul Karthik
#include <bits/stdc++.h>
#define ll long long int
#define mkp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast std::ios_base::sync_with_stdio(false)
#define debug1(a) cout << a << endl;
#define debug2(a, b) cout << a << ' ' << b << endl;
#define debug3(a, b, c) cout << a << ' ' << b << ' ' << c << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repre(i, a, b) for (int i = a; i <= b; i++)
#define clr1(arr) memset(arr, -1, sizeof(arr));
#define clr0(arr) memset(arr, 0, sizeof(arr));
#define RANGE 255
#define po(a) \
if (a < 0) { \
a *= -1; \
}
using namespace std;
void swap(int *xp, int *yp) {
int temp = *xp;
*xp = *yp;
*yp = temp;
}
void bubbleSort(int arr[], int n) {
int i, j;
for (i = 0; i < n - 1; i++)
for (j = 0; j < n - i - 1; j++)
if (arr[j] > arr[j + 1])
swap(&arr[j], &arr[j + 1]);
}
int solve() {
int x;
cin >> x;
if (x == 0) {
cout << 1 << "\n";
}
if (x == 1) {
cout << 0 << "\n";
}
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
t = 1;
for (int i = 0; i < t; i++) {
solve();
}
}
| insert | 47 | 47 | 47 | 48 | TLE | |
p02552 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
int t = 1;
// cin >> t;
while (t--) {
ll n;
cin >> n;
return n == 0;
}
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
int t = 1;
// cin >> t;
while (t--) {
ll n;
cin >> n;
cout << (n == 0);
}
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02552 | 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 <vector>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
inline int popcount(ll x) { return __builtin_popcountll(x); }
inline int div2num(ll x) { return __builtin_ctzll(x); }
inline bool bit(ll x, int b) { return (x >> b) & 1; }
template <class T> string to_string(T s);
template <class S, class T> string to_string(pair<S, T> p);
string to_string(string s) { return s; }
string to_string(const char s[]) { return to_string(string(s)); }
template <class T> string to_string(T v) {
if (v.empty())
return "{}";
string ret = "{";
for (auto x : v)
ret += to_string(x) + ",";
ret.back() = '}';
return ret;
}
template <class S, class T> string to_string(pair<S, T> p) {
return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";
}
void debug() { cerr << endl; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
struct IO {
#ifdef _WIN32
inline char getchar_unlocked() { return getchar(); }
inline void putchar_unlocked(char c) { putchar(c); }
#endif
std::string separator = " ";
template <class T> inline void read(T &x) {
char c;
do {
c = getchar_unlocked();
} while (c != '-' && (c < '0' || '9' < c));
bool minus = 0;
if (c == '-') {
minus = 1;
c = getchar_unlocked();
}
x = 0;
while ('0' <= c && c <= '9') {
x *= 10;
x += c - '0';
c = getchar_unlocked();
}
if (minus)
x = -x;
}
inline void read(std::string &x) {
char c;
do {
c = getchar_unlocked();
} while (c == ' ' || c == '\n');
x.clear();
do {
x += c;
c = getchar_unlocked();
} while (c != ' ' && c != '\n' && c != EOF);
}
template <class T> inline void read(std::vector<T> &v) {
for (auto &x : v)
read(x);
}
template <class S, class T> inline void read(std::pair<S, T> &p) {
read(p.first);
read(p.second);
}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
read(head);
read(tail...);
}
template <class T> inline void write(T x) {
char buf[32];
int p = 0;
if (x < 0) {
x = -x;
putchar_unlocked('-');
}
if (x == 0)
putchar_unlocked('0');
while (x > 0) {
buf[p++] = (x % 10) + '0';
x /= 10;
}
while (p) {
putchar_unlocked(buf[--p]);
}
}
inline void write(std::string x) {
for (char c : x)
putchar_unlocked(c);
}
inline void write(const char s[]) {
for (int i = 0; s[i] != 0; ++i)
putchar_unlocked(s[i]);
}
template <class T> inline void write(std::vector<T> v) {
if (v.empty())
return;
for (auto itr = v.begin(); itr + 1 != v.end(); ++itr) {
write(*itr);
write(separator);
}
write(v.back());
}
template <class Head, class... Tail>
inline void write(Head head, Tail... tail) {
write(head);
write(separator);
write(tail...);
}
template <class Head, class... Tail>
inline void writeln(Head head, Tail... tail) {
write(head, tail...);
write("\n");
}
void set_separator(std::string s) { separator = s; }
} io;
struct Prime {
int n;
vector<int> table;
vector<int> primes;
Prime(int _n = 100000) {
n = _n + 1;
table.resize(n, -1);
table[0] = 0;
table[1] = -1;
for (int i = 2; i * i < n; ++i) {
if (table[i] == -1) {
for (int j = i * i; j < n; j += i) {
table[j] = i;
}
}
}
}
void enumerate_primes() {
primes.clear();
for (int i = 2; i < n; ++i) {
if (table[i] == -1)
primes.push_back(i);
}
}
vector<pair<long long, int>> prime_factor(long long x) {
map<long long, int> mp;
long long div = 2;
int p = 0;
while (n <= x && div * div <= x) {
if (x % div == 0) {
mp[div]++;
x /= div;
} else {
if (p + 1 < primes.size()) {
div = primes[++p];
} else {
div++;
}
}
}
if (x < n) {
while (table[x] != -1) {
mp[table[x]]++;
x /= table[x];
}
}
if (x > 1)
mp[x]++;
vector<pair<long long, int>> ret;
for (auto p : mp)
ret.push_back(p);
return ret;
}
};
template <int MOD = 1000000007> struct Math {
vector<long long> fact, factinv, inv;
Math(int n = 100000) {
fact.resize(n + 1);
factinv.resize(n + 1);
inv.resize(n + 1);
fact[0] = fact[1] = 1;
factinv[0] = factinv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= n; ++i) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
factinv[i] = factinv[i - 1] * inv[i] % MOD;
}
}
long long C(int n, int r) {
if (n < r || n < 0 || r < 0) {
return 0;
} else {
return fact[n] * (factinv[r] * factinv[n - r] % MOD) % MOD;
}
}
long long P(int n, int r) {
if (n < r || n < 0 || r < 0) {
return 0;
} else {
return fact[n] * factinv[n - r] % MOD;
}
}
long long H(int n, int r) { return C(n + r - 1, r); }
};
struct UnionFind {
vector<int> data;
vector<vector<int>> groups;
UnionFind(int n) : data(n, -1) {}
int root(int v) { return data[v] < 0 ? v : data[v] = root(data[v]); }
bool unite(int u, int v) {
if ((u = root(u)) == (v = root(v))) {
return 1;
} else {
if (-data[u] < -data[v])
swap(u, v);
data[u] += data[v];
data[v] = u;
return 0;
}
}
int size(int v) { return -data[root(v)]; }
void make_groups() {
map<int, vector<int>> mp;
for (int i = 0; i < data.size(); ++i)
mp[root(i)].push_back(i);
groups.clear();
for (auto p : mp)
groups.push_back(p.second);
}
};
namespace phc {
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
long long modinv(long long a) {
long long b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
long long gcd(long long a, long long b) { return b != 0 ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
} // namespace phc
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
constexpr int dy[4] = {-1, 0, 1, 0}, dx[4] = {0, -1, 0, 1};
int main() {
int A, B;
io.read(A, B);
io.writeln(1 - A);
return 0;
} | #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 <vector>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
inline int popcount(ll x) { return __builtin_popcountll(x); }
inline int div2num(ll x) { return __builtin_ctzll(x); }
inline bool bit(ll x, int b) { return (x >> b) & 1; }
template <class T> string to_string(T s);
template <class S, class T> string to_string(pair<S, T> p);
string to_string(string s) { return s; }
string to_string(const char s[]) { return to_string(string(s)); }
template <class T> string to_string(T v) {
if (v.empty())
return "{}";
string ret = "{";
for (auto x : v)
ret += to_string(x) + ",";
ret.back() = '}';
return ret;
}
template <class S, class T> string to_string(pair<S, T> p) {
return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";
}
void debug() { cerr << endl; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
struct IO {
#ifdef _WIN32
inline char getchar_unlocked() { return getchar(); }
inline void putchar_unlocked(char c) { putchar(c); }
#endif
std::string separator = " ";
template <class T> inline void read(T &x) {
char c;
do {
c = getchar_unlocked();
} while (c != '-' && (c < '0' || '9' < c));
bool minus = 0;
if (c == '-') {
minus = 1;
c = getchar_unlocked();
}
x = 0;
while ('0' <= c && c <= '9') {
x *= 10;
x += c - '0';
c = getchar_unlocked();
}
if (minus)
x = -x;
}
inline void read(std::string &x) {
char c;
do {
c = getchar_unlocked();
} while (c == ' ' || c == '\n');
x.clear();
do {
x += c;
c = getchar_unlocked();
} while (c != ' ' && c != '\n' && c != EOF);
}
template <class T> inline void read(std::vector<T> &v) {
for (auto &x : v)
read(x);
}
template <class S, class T> inline void read(std::pair<S, T> &p) {
read(p.first);
read(p.second);
}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
read(head);
read(tail...);
}
template <class T> inline void write(T x) {
char buf[32];
int p = 0;
if (x < 0) {
x = -x;
putchar_unlocked('-');
}
if (x == 0)
putchar_unlocked('0');
while (x > 0) {
buf[p++] = (x % 10) + '0';
x /= 10;
}
while (p) {
putchar_unlocked(buf[--p]);
}
}
inline void write(std::string x) {
for (char c : x)
putchar_unlocked(c);
}
inline void write(const char s[]) {
for (int i = 0; s[i] != 0; ++i)
putchar_unlocked(s[i]);
}
template <class T> inline void write(std::vector<T> v) {
if (v.empty())
return;
for (auto itr = v.begin(); itr + 1 != v.end(); ++itr) {
write(*itr);
write(separator);
}
write(v.back());
}
template <class Head, class... Tail>
inline void write(Head head, Tail... tail) {
write(head);
write(separator);
write(tail...);
}
template <class Head, class... Tail>
inline void writeln(Head head, Tail... tail) {
write(head, tail...);
write("\n");
}
void set_separator(std::string s) { separator = s; }
} io;
struct Prime {
int n;
vector<int> table;
vector<int> primes;
Prime(int _n = 100000) {
n = _n + 1;
table.resize(n, -1);
table[0] = 0;
table[1] = -1;
for (int i = 2; i * i < n; ++i) {
if (table[i] == -1) {
for (int j = i * i; j < n; j += i) {
table[j] = i;
}
}
}
}
void enumerate_primes() {
primes.clear();
for (int i = 2; i < n; ++i) {
if (table[i] == -1)
primes.push_back(i);
}
}
vector<pair<long long, int>> prime_factor(long long x) {
map<long long, int> mp;
long long div = 2;
int p = 0;
while (n <= x && div * div <= x) {
if (x % div == 0) {
mp[div]++;
x /= div;
} else {
if (p + 1 < primes.size()) {
div = primes[++p];
} else {
div++;
}
}
}
if (x < n) {
while (table[x] != -1) {
mp[table[x]]++;
x /= table[x];
}
}
if (x > 1)
mp[x]++;
vector<pair<long long, int>> ret;
for (auto p : mp)
ret.push_back(p);
return ret;
}
};
template <int MOD = 1000000007> struct Math {
vector<long long> fact, factinv, inv;
Math(int n = 100000) {
fact.resize(n + 1);
factinv.resize(n + 1);
inv.resize(n + 1);
fact[0] = fact[1] = 1;
factinv[0] = factinv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= n; ++i) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
factinv[i] = factinv[i - 1] * inv[i] % MOD;
}
}
long long C(int n, int r) {
if (n < r || n < 0 || r < 0) {
return 0;
} else {
return fact[n] * (factinv[r] * factinv[n - r] % MOD) % MOD;
}
}
long long P(int n, int r) {
if (n < r || n < 0 || r < 0) {
return 0;
} else {
return fact[n] * factinv[n - r] % MOD;
}
}
long long H(int n, int r) { return C(n + r - 1, r); }
};
struct UnionFind {
vector<int> data;
vector<vector<int>> groups;
UnionFind(int n) : data(n, -1) {}
int root(int v) { return data[v] < 0 ? v : data[v] = root(data[v]); }
bool unite(int u, int v) {
if ((u = root(u)) == (v = root(v))) {
return 1;
} else {
if (-data[u] < -data[v])
swap(u, v);
data[u] += data[v];
data[v] = u;
return 0;
}
}
int size(int v) { return -data[root(v)]; }
void make_groups() {
map<int, vector<int>> mp;
for (int i = 0; i < data.size(); ++i)
mp[root(i)].push_back(i);
groups.clear();
for (auto p : mp)
groups.push_back(p.second);
}
};
namespace phc {
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
long long modinv(long long a) {
long long b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
long long gcd(long long a, long long b) { return b != 0 ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
} // namespace phc
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
constexpr int dy[4] = {-1, 0, 1, 0}, dx[4] = {0, -1, 0, 1};
int main() {
int A, B;
cin >> A;
io.writeln(1 - A);
return 0;
} | replace | 384 | 385 | 384 | 385 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <iostream>
#define ll long long
using namespace std;
int main() {
// your code goes here
ll a, b, c, d, p = -1000000000, i, j;
cin >> a >> b >> c >> d;
for (i = a; i <= b; i++) {
for (j = c; j <= d; j++)
p = max(p, i * j);
}
cout << p << endl;
return 0;
} | #include <iostream>
#define ll long long
using namespace std;
int main() {
// your code goes here
ll a, b, c, d, p = -1000000000, i, j;
cin >> a >> b >> c >> d;
cout << max(max(a * c, a * d), max(b * c, b * d)) << endl;
return 0;
} | replace | 8 | 13 | 8 | 9 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long a, b, c, d, i, j;
cin >> a >> b >> c >> d;
long long max;
if (0 < a && 0 < c) {
cout << b * d << endl;
return 0;
} else if (0 >= b && 0 >= d) {
cout << a * c << endl;
return 0;
} else {
max = a * c;
i = a;
while (i <= b) {
j = c;
while (j <= d) {
if (i * j > max)
max = i * j;
j++;
}
i++;
}
}
cout << max << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long a, b, c, d, i, j;
cin >> a >> b >> c >> d;
long long max, max1, max2, max3, max4;
max1 = a * c;
max2 = a * d;
max3 = b * c;
max4 = b * d;
max = max1;
if (max < max2)
max = max2;
if (max < max3)
max = max3;
if (max < max4)
max = max4;
cout << max << endl;
return 0;
} | replace | 8 | 29 | 8 | 20 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
typedef long long LL;
int main() {
int l1, r1, l2, r2;
cin >> l1 >> r1 >> l2 >> r2;
LL res = -1e18 - 10;
for (int i = l1; i <= r1; ++i)
for (int j = l2; j <= r2; ++j) {
res = max(res, (LL)i * j);
}
cout << res << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long LL;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
LL ans1 = (LL)a * c;
LL ans2 = (LL)a * d;
LL ans3 = (LL)b * c;
LL ans4 = (LL)b * d;
// cout<<ans1<<" "<<ans2<<" "<<ans3<<" "<<ans4<<endl;
LL ans = max(ans1, ans2);
ans = max(ans, max(ans3, ans4));
cout << ans << endl;
return 0;
} | replace | 6 | 14 | 6 | 16 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long ans = a * c;
for (long long i = a; i <= b; i++) {
for (long long j = c; j <= d; j++) {
ans = max(ans, i * j);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long ans;
ans = max(max(max(a * c, a * d), b * c), b * d);
cout << ans << endl;
return 0;
}
| replace | 5 | 11 | 5 | 7 | TLE | |
p02553 | C++ | Time Limit Exceeded | /*******************************
* BASMILLAHHIR RAHMANNIR RAHIM *
* MD SHAHINUR RAHMAN *
* DATE: 12/sep/2020 *
* DEPT. OF CSE *
* LEADING UNIVERSITY, SYLHET *
*******************************/
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define shahin \
std::ios_base::sync_with_stdio(false); \
std::cin.tie(NULL);
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
const int nax = 1000 * 1007;
const int mod = 1e9 + 7;
using namespace std;
char wcz[nax];
bool fu(int a, int b) { return (a > b); }
void fun() {
ll a, b, c, d, sum = 0, S = -10000000000;
cin >> a >> b >> c >> d;
for (ll i = a; i <= b; i++) {
for (ll j = c; j <= d; j++) {
sum = (i * j);
S = max(sum, S);
// cout << i << " "<< j << "="<<sum<< " "<< S<<endl;
}
}
cout << S << endl;
}
int main() {
shahin
/* ll tc,i=1;
cin >> tc;
while(tc--)
{
//cout << "Case " << i << ": ";
fun();
//i++;
}*/
fun();
}
| /*******************************
* BASMILLAHHIR RAHMANNIR RAHIM *
* MD SHAHINUR RAHMAN *
* DATE: 12/sep/2020 *
* DEPT. OF CSE *
* LEADING UNIVERSITY, SYLHET *
*******************************/
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define shahin \
std::ios_base::sync_with_stdio(false); \
std::cin.tie(NULL);
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
const int nax = 1000 * 1007;
const int mod = 1e9 + 7;
using namespace std;
char wcz[nax];
bool fu(int a, int b) { return (a > b); }
void fun() {
ll a, b, c, d, sum = 0, S = -10000000000;
cin >> a >> b >> c >> d;
cout << max(a * c, max(a * d, max(b * c, b * d)));
}
int main() {
shahin
/* ll tc,i=1;
cin >> tc;
while(tc--)
{
//cout << "Case " << i << ": ";
fun();
//i++;
}*/
fun();
}
| replace | 30 | 39 | 30 | 31 | TLE | |
p02553 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// Factors of an num
/*
vector<ll> fact(ll n){
vector<ll>v;
for(int i=1;i*i<=n;i++){
if(n%i ==0){
v.push_back(i);
if(i!=n/i)
v.push_back(n/i);
}
}
return v;
}
*/
/*
Seive Of Eratos..
int N=1e5;
vector<bool> isprime(N+1,true);
void pri(int n){
for(int i=2;i*i<=n;i++){
if(isprime[i]){
for(int j=i*i;j<=n;j+=i){
isprime[j]=false;
}
}
}
return;
}
*/
/*
//Prime Factors
vector<bool> isprime(1e6+1,true);
vector<int> primes;
void sieve()
{
ll i,j;
isprime[0] = false;
isprime[1] = false;
for(i=2; i<=1e6 ;i++)
{
if(isprime[i])
{
primes.push_back(i);
for(j=i*i; j<=1e6; j+=i)
{
isprime[j]=false;
}
}
}
}
vector<int> primefactors(int N)
{
vector<int> factors;
ll pf_idx = 0, pf=primes[pf_idx];
while(pf*pf<=N)
{
while(N % pf == 0)
{
N/=pf;
factors.push_back(pf);
}
pf = primes[++pf_idx];
}
if(N != 1) factors.push_back(N);
return factors;
}
*/
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin.tie(NULL);
int n = 1e9 + 1;
ll a, a2;
vector<ll> v(n + 1);
for (int i = 0; i < n; ++i) {
/* code */
cin >> v[i];
ll ans = max(ans, v[i]);
a = ans;
v.erase(remove(v.begin(), v.end(), ans), v.end());
a2 = max(a2, v[i]);
}
cout << a2 * a << endl;
;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// Factors of an num
/*
vector<ll> fact(ll n){
vector<ll>v;
for(int i=1;i*i<=n;i++){
if(n%i ==0){
v.push_back(i);
if(i!=n/i)
v.push_back(n/i);
}
}
return v;
}
*/
/*
Seive Of Eratos..
int N=1e5;
vector<bool> isprime(N+1,true);
void pri(int n){
for(int i=2;i*i<=n;i++){
if(isprime[i]){
for(int j=i*i;j<=n;j+=i){
isprime[j]=false;
}
}
}
return;
}
*/
/*
//Prime Factors
vector<bool> isprime(1e6+1,true);
vector<int> primes;
void sieve()
{
ll i,j;
isprime[0] = false;
isprime[1] = false;
for(i=2; i<=1e6 ;i++)
{
if(isprime[i])
{
primes.push_back(i);
for(j=i*i; j<=1e6; j+=i)
{
isprime[j]=false;
}
}
}
}
vector<int> primefactors(int N)
{
vector<int> factors;
ll pf_idx = 0, pf=primes[pf_idx];
while(pf*pf<=N)
{
while(N % pf == 0)
{
N/=pf;
factors.push_back(pf);
}
pf = primes[++pf_idx];
}
if(N != 1) factors.push_back(N);
return factors;
}
*/
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin.tie(NULL);
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = INT_MIN;
ll a1 = max(a * c, b * d);
ll b1 = max(a * d, b * c);
ans = max(a1, b1);
cout << ans << endl;
return 0;
} | replace | 96 | 109 | 96 | 104 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long int a, b, c, d, p, i, j;
cin >> a >> b >> c >> d;
p = a * c;
for (i = a; i <= b; i = i + (b - a)) {
for (j = c; j <= d; j = j + (d - c)) {
if (p < (i * j))
p = (i * j);
if (j == d)
break;
}
}
cout << p;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int a, b, c, d, p, i, j;
cin >> a >> b >> c >> d;
p = a * c;
for (i = a; i <= b; i = i + (b - a)) {
for (j = c; j <= d; j = j + (d - c)) {
if (p < (i * j))
p = (i * j);
if (j == d)
break;
}
if (i == b)
break;
}
cout << p;
return 0;
} | insert | 13 | 13 | 13 | 15 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long maxNum = -1000000000;
for (long long x = a; x <= b; x++) {
for (long long y = c; y <= d; y++) {
maxNum = max(maxNum, x * y);
}
}
cout << maxNum << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
cout << max(max(a * c, a * d), max(b * c, b * d)) << endl;
}
| replace | 13 | 20 | 13 | 14 | TLE | |
p02553 | C++ | Runtime Error | #include <stdio.h>
long long max(long long a, long long b, long long c, long long d) {
if (a > b) {
if (a > c) {
if (a > d) {
return a;
} else {
return d;
}
} else {
if (c > d) {
return c;
} else {
return d;
}
}
} else {
if (b > c) {
if (b > d) {
return b;
} else {
return d;
}
} else {
if (c > d) {
return c;
} else {
return d;
}
}
}
}
int main() {
long long a, b, c, d;
scanf("%lld %lld %lld %lld");
printf("%lld", max(a * c, a * d, b * c, b * d));
return 0;
} | #include <stdio.h>
long long max(long long a, long long b, long long c, long long d) {
if (a > b) {
if (a > c) {
if (a > d) {
return a;
} else {
return d;
}
} else {
if (c > d) {
return c;
} else {
return d;
}
}
} else {
if (b > c) {
if (b > d) {
return b;
} else {
return d;
}
} else {
if (c > d) {
return c;
} else {
return d;
}
}
}
}
int main() {
long long a, b, c, d;
scanf("%lld %lld %lld %lld", &a, &b, &c, &d);
printf("%lld", max(a * c, a * d, b * c, b * d));
return 0;
}
| replace | 35 | 36 | 35 | 36 | -11 | |
p02553 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz size()
#define ll long long
#define all(_v) _v.begin(), _v.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pvllvll pair<vector<ll>, vector<ll>>
#define ld long double
#define veci vector<int>
#define vecll vector<ll>
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
void solve() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
if (a >= 0 && c >= 0) {
cout << b * d;
return;
}
if (b <= 0 && d <= 0) {
cout << a * c;
return;
}
if (a >= 0 && d <= 0) {
cout << a * d;
return;
}
if (b <= 0 && c >= 0) {
cout << b * c;
return;
}
assert(0);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
/// cin >> T;
while (T--)
solve(), cout << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz size()
#define ll long long
#define all(_v) _v.begin(), _v.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pvllvll pair<vector<ll>, vector<ll>>
#define ld long double
#define veci vector<int>
#define vecll vector<ll>
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
void solve() {
ll a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
ll ans = -1e18;
ans = max(ans, a[0] * a[2]);
ans = max(ans, a[0] * a[3]);
ans = max(ans, a[1] * a[2]);
ans = max(ans, a[1] * a[3]);
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
/// cin >> T;
while (T--)
solve(), cout << '\n';
return 0;
}
| replace | 24 | 43 | 24 | 32 | 0 | |
p02553 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main(void) {
FastIO;
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll p[3];
p[0] = a * c;
p[1] = a * d;
p[2] = b * c;
p[3] = b * d;
sort(p, p + 4);
cout << p[3];
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main(void) {
FastIO;
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll p[4];
p[0] = a * c;
p[1] = a * d;
p[2] = b * c;
p[3] = b * d;
sort(p, p + 4);
cout << p[3];
return 0;
} | replace | 13 | 14 | 13 | 14 | -6 | *** stack smashing detected ***: terminated
|
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, i, j, p, m, s;
cin >> a >> b >> c >> d;
long long h = a * c;
for (i = a; i <= b; i++) {
for (j = c; j <= d; j++) {
p = i * j;
if (p > h) {
h = p;
}
}
}
cout << h;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, i, j, p, m, s;
cin >> a >> b >> c >> d;
long long w, x, y, z;
w = a * c;
x = b * c;
y = a * d;
z = b * d;
p = max(w, x);
m = max(p, y);
s = max(m, z);
cout << s;
}
| replace | 5 | 15 | 5 | 14 | TLE | |
p02553 | Python | Runtime Error | if __name__ == "__main__":
a = int(input())
b = int(input())
c = int(input())
d = int(input())
if b <= 0:
if d <= 0:
xy = a * c
elif d > 0:
if c > 0:
xy = b * c
elif c == 0:
xy = 0
elif c < 0:
xy = a * c
elif b > 0:
if a >= 0:
if d <= 0:
xy = a * d
elif d > 0:
xy = b * d
elif a < 0:
if d <= 0:
xy = a * c
elif d > 0:
if c >= 0:
xy = b * d
elif c < 0:
if abs(a * c) > abs(b * d):
xy = a * c
else:
xy = b * d
print(xy)
| if __name__ == "__main__":
a, b, c, d = (int(x) for x in input().split())
if b <= 0:
if d <= 0:
xy = a * c
elif d > 0:
if c > 0:
xy = b * c
elif c == 0:
xy = 0
elif c < 0:
xy = a * c
elif b > 0:
if a >= 0:
if d <= 0:
xy = a * d
elif d > 0:
xy = b * d
elif a < 0:
if d <= 0:
xy = a * c
elif d > 0:
if c >= 0:
xy = b * d
elif c < 0:
if abs(a * c) > abs(b * d):
xy = a * c
else:
xy = b * d
print(xy)
| replace | 1 | 5 | 1 | 2 | ValueError: invalid literal for int() with base 10: '1 2 1 1' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02553/Python/s444735134.py", line 3, in <module>
a = int(input())
ValueError: invalid literal for int() with base 10: '1 2 1 1'
|
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d;
cin >> a >> b >> c >> d;
vector<long long int> v1;
vector<long long int> v2;
for (int i = a; i <= b; i++) {
v1.push_back(i);
}
for (int i = c; i <= d; i++) {
v2.push_back(i);
}
long long int res = v1[0] * v2[0];
for (int i = 0; i < v1.size(); i++) {
for (int j = 0; j < v2.size(); j++) {
if (v1[i] * v2[j] >= res) {
res = v1[i] * v2[j];
}
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d;
cin >> a >> b >> c >> d;
long long int a1 = a * c;
long long int a2 = a * d;
long long int a3 = b * c;
long long int a4 = b * d;
long long int x = max(a1, a2);
long long int y = max(a3, a4);
long long int z = max(x, y);
cout << z << endl;
} | replace | 5 | 22 | 5 | 13 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[4];
while (1) {
cin >> a[0] >> a[1] >> a[2] >> a[3];
vector<ll> b;
b.push_back(a[0] * a[2]);
b.push_back(a[0] * a[3]);
b.push_back(a[1] * a[2]);
b.push_back(a[1] * a[3]);
sort(b.begin(), b.end());
cout << b[3] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[4];
cin >> a[0] >> a[1] >> a[2] >> a[3];
vector<ll> b;
b.push_back(a[0] * a[2]);
b.push_back(a[0] * a[3]);
b.push_back(a[1] * a[2]);
b.push_back(a[1] * a[3]);
sort(b.begin(), b.end());
cout << b[3] << endl;
return 0;
}
| replace | 5 | 15 | 5 | 13 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
long a, b, c, d;
long max = LONG_MIN;
cin >> a >> b >> c >> d;
for (int i = a; i <= b; i++) {
for (int j = c; j <= d; j++) {
if (i * j > max)
max = i * j;
}
}
cout << max << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
long a, b, c, d;
long max = LONG_MIN;
cin >> a >> b >> c >> d;
long A, B, C, D;
A = a * c;
B = a * d;
C = b * c;
D = b * d;
priority_queue<long> pq;
pq.push(A);
pq.push(B);
pq.push(C);
pq.push(D);
cout << pq.top() << endl;
return (0);
} | replace | 12 | 19 | 12 | 23 | TLE | |
p02553 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
long int a, b, c, d;
int solve() {
long int ans = a * c;
if (a * d > ans) {
ans = a * d;
}
if (b * c > ans) {
ans = b * c;
}
if (b * d > ans) {
ans = b * d;
}
cout << ans;
}
int main() {
cin >> a >> b >> c >> d;
solve();
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
long int a, b, c, d;
void solve() {
long int ans = a * c;
if (a * d > ans) {
ans = a * d;
}
if (b * c > ans) {
ans = b * c;
}
if (b * d > ans) {
ans = b * d;
}
cout << ans;
}
int main() {
cin >> a >> b >> c >> d;
solve();
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02553 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, c, d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
return b * d;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, c, d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cout << max({a * c, b * d, a * d, b * c}) << endl;
return 0;
} | replace | 10 | 11 | 10 | 12 | 2 | |
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long ans = -1000000000000000000;
for (long long i = a; i <= b; i++) {
for (long long j = c; j <= d; j++) {
long long cnt = i * j;
ans = max(cnt, ans);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long ans = -1000000000000000000;
long long cnt[4] = {a * c, a * d, b * c, b * d};
for (long long i = 0; i < 4; i++)
ans = max(ans, cnt[i]);
cout << ans << endl;
return 0;
} | replace | 10 | 16 | 10 | 14 | TLE | |
p02553 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc178/tasks/abc178_b
#include <iostream>
#include <vector>
using namespace std;
#define ll long long int
int main() {
ll a[5], b[5], ans;
cin >> a[0] >> a[1] >> b[0] >> b[1];
ll mx = (ll)(-1e10);
for (ll i = a[0]; i <= a[1]; i++) {
for (ll j = b[0]; j <= b[1]; j++) {
ans = i * j;
mx = max(ans, mx);
}
}
cout << mx << "\n";
}
| // https://atcoder.jp/contests/abc178/tasks/abc178_b
#include <iostream>
#include <vector>
using namespace std;
#define ll long long int
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll mx = a * c;
if (a <= 0 && c <= 0)
mx = max(mx, a * c);
if (b >= 0 && d >= 0)
mx = max(mx, b * d);
mx = max(mx, a * d);
mx = max(mx, b * c);
cout << mx << "\n";
} | replace | 6 | 15 | 6 | 15 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans1 = b * d;
ll ans2 = b * d;
ll x = b;
ll y = d;
ll ans3 = a * c;
while (x > a) {
x--;
ans1 = max(ans1, x * d); // a<x<b; c<y<d
}
ans1 = max(ans1, ans3);
while (y > c) {
y--;
ans2 = max(ans2, y * b);
}
ans2 = max(ans2, ans3);
cout << max(ans1, ans2);
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll x, y;
ll maxi = -1e18;
maxi = max({maxi, a * c, b * d, a * d, b * c});
cout << maxi;
}
| replace | 6 | 22 | 6 | 10 | TLE | |
p02553 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
#define MEM(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define mk make_pair
#define pi pair<int, int>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = a; i >= (b); --i)
using namespace std;
int dt[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {0, 0}};
// typedef pair<int, int> P;
// priority_queue<int, vector<int>, greater<int> > q;
int main() {
IOS;
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll res = -0x3f3f3f3f3f3f3f3f;
rep(i, a, b) {
rep(j, c, d) { res = max(res, 1LL * i * j); }
}
cout << res;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
#define MEM(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define mk make_pair
#define pi pair<int, int>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = a; i >= (b); --i)
using namespace std;
int dt[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {0, 0}};
// typedef pair<int, int> P;
// priority_queue<int, vector<int>, greater<int> > q;
int main() {
IOS;
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll res1, res2, res3, res4;
res1 = a * c;
res2 = a * d;
res3 = b * c;
res4 = b * d;
ll ans = -0x3f3f3f3f3f3f3f3f;
ans = max(ans, res1);
ans = max(ans, res2);
ans = max(ans, res3);
ans = max(ans, res4);
if ((a <= 0 && b >= 0) || (c <= 0 && d >= 0))
ans = max(ans, 1LL * 0);
cout << ans;
}
| replace | 36 | 41 | 36 | 49 | TLE | |
p02554 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
const double pi = acos(-1.0), eps = 1e-8;
const ll mod = 1e9 + 7;
const int inf = 1e18;
const int maxn = 5e5 + 5;
ll POW(ll a, ll b) {
ll ans = 1;
b %= (mod - 1);
while (b) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll inv(ll a) { return POW(a, mod - 2); }
ll fac[maxn], ifac[maxn];
void init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < maxn; i++)
fac[i] = fac[i - 1] * i % mod;
ifac[maxn - 1] = inv(fac[maxn - 1]);
for (int i = maxn - 2; i >= 0; i--)
ifac[i] = ifac[i + 1] * (i + 1) % mod;
}
ll getc(int n, int m) {
if (n < m || m < 0)
return 0;
return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int main() {
int n;
cin >> n;
init();
if (n == 1)
cout << 0 << endl;
else if (n == 2)
cout << 2 << endl;
else {
ll ans = POW(10, n);
ans = (ans + mod - POW(8, n)) % mod;
ll res = 1;
for (int i = 1; i <= n; i++) {
res = (res + getc(n, i) % mod * POW(8, n - i) % mod) % mod;
}
ans = (ans + mod - res * 2 % mod) % mod;
cout << (ans + 2) % mod << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
const double pi = acos(-1.0), eps = 1e-8;
const ll mod = 1e9 + 7;
const int inf = 1e18;
const int maxn = 1e6 + 5;
ll POW(ll a, ll b) {
ll ans = 1;
b %= (mod - 1);
while (b) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll inv(ll a) { return POW(a, mod - 2); }
ll fac[maxn], ifac[maxn];
void init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < maxn; i++)
fac[i] = fac[i - 1] * i % mod;
ifac[maxn - 1] = inv(fac[maxn - 1]);
for (int i = maxn - 2; i >= 0; i--)
ifac[i] = ifac[i + 1] * (i + 1) % mod;
}
ll getc(int n, int m) {
if (n < m || m < 0)
return 0;
return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int main() {
int n;
cin >> n;
init();
if (n == 1)
cout << 0 << endl;
else if (n == 2)
cout << 2 << endl;
else {
ll ans = POW(10, n);
ans = (ans + mod - POW(8, n)) % mod;
ll res = 1;
for (int i = 1; i <= n; i++) {
res = (res + getc(n, i) % mod * POW(8, n - i) % mod) % mod;
}
ans = (ans + mod - res * 2 % mod) % mod;
cout << (ans + 2) % mod << endl;
}
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02554 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) \
memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) \
fill((array) + (begin), (array) + (end) + 1, value)
#define fillvector(v, value) fill((v).begin(), (v).end(), value)
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, int>
#define mp(a, b) make_pair((a), (b))
#define Flush fflush(stdout)
#define vecfirst (*vec.begin())
#define veclast (*vec.rbegin())
#define vecall(v) (v).begin(), (v).end()
#define vecupsort(v) (sort((v).begin(), (v).end()))
#define vecdownsort(v, type) (sort(vecall(v), greater<type>()))
#define veccmpsort(v, cmp) (sort(vecall(v), cmp))
using namespace std;
const int N = 500050;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
clock_t TIME__START, TIME__END;
void program_end() {
#ifdef ONLINE
printf("\nTime used: %.6lf(s)\n", ((double)TIME__END - TIME__START) / 1000);
system("pause");
#endif
}
// 该模板不可实现负数
// vector 中从高位到低位
// 即输出时需要倒序输出
struct Wint : vector<ll> {
Wint(ll n = 0) {
push_back(n);
check();
}
Wint &check() {
while (!empty() && !back())
pop_back();
if (empty())
return *this;
for (int i = 1; i < size(); ++i) {
(*this)[i] += (*this)[i - 1] / 10;
(*this)[i - 1] %= 10;
}
while (back() >= 10) {
push_back(back() / 10);
(*this)[size() - 2] %= 10;
}
return *this;
}
};
istream &operator>>(istream &is, Wint &n) {
string s;
is >> s;
n.clear();
for (int i = s.size() - 1; i >= 0; --i)
n.push_back(s[i] - '0');
return is;
}
ostream &operator<<(ostream &os, const Wint &n) {
if (n.empty())
os << 0;
for (int i = n.size() - 1; i >= 0; --i)
os << n[i];
return os;
}
bool operator!=(const Wint &a, const Wint &b) {
if (a.size() != b.size())
return 1;
for (int i = a.size() - 1; i >= 0; --i)
if (a[i] != b[i])
return 1;
return 0;
}
bool operator==(const Wint &a, const Wint &b) { return !(a != b); }
bool operator<(const Wint &a, const Wint &b) {
if (a.size() != b.size())
return a.size() < b.size();
for (int i = (int)a.size() - 1; i >= 0; --i)
if (a[i] != b[i])
return a[i] < b[i];
return 0;
}
bool operator>(const Wint &a, const Wint &b) { return b < a; }
bool operator<=(const Wint &a, const Wint &b) { return !(a > b); }
bool operator>=(const Wint &a, const Wint &b) { return !(a < b); }
Wint &operator+=(Wint &a, const Wint &b) {
if (a.size() < b.size())
a.resize(b.size());
for (int i = 0; i != (int)b.size(); ++i)
a[i] += b[i];
return a.check();
}
Wint operator+(Wint a, const Wint &b) { return a += b; }
Wint &operator-=(Wint &a, Wint b) {
if (a < b)
swap(a, b);
for (int i = 0; i != b.size(); a[i] -= b[i], ++i)
if (a[i] < b[i]) {
int j = i + 1;
while (!a[j])
++j;
while (j > i) {
--a[j];
a[--j] += 10;
}
}
return a.check();
}
Wint operator-(Wint a, const Wint &b) { return a -= b; }
Wint operator*(const Wint &a, const Wint &b) {
Wint n;
if (a.empty() || b.empty())
return Wint(0);
n.assign(a.size() + b.size() - 1, 0);
for (int i = 0; i != a.size(); ++i)
for (int j = 0; j != b.size(); ++j)
n[i + j] += a[i] * b[j];
return n.check();
}
Wint &operator*=(Wint &a, const Wint &b) { return a = a * b; }
Wint divmod(Wint &a, const Wint &b) {
Wint ans;
for (int t = a.size() - b.size(); a >= b; --t) {
Wint d;
d.assign(t + 1, 0);
d.back() = 1;
Wint c = b * d;
while (a >= c) {
a -= c;
ans += d;
}
}
return ans;
}
Wint operator/(Wint a, const Wint &b) { return divmod(a, b); }
Wint &operator/=(Wint &a, const Wint &b) { return a = a / b; }
Wint &operator%=(Wint &a, const Wint &b) {
divmod(a, b);
return a;
}
Wint operator%(Wint a, const Wint &b) { return a %= b; }
Wint Wpow(Wint a, Wint b) {
Wint ret = 1;
while (b != 0) {
if (b % 2 == 1)
ret = ret * a;
a = a * a;
b /= 2;
}
return ret;
}
Wint Wpow(Wint a, Wint b, Wint p) {
Wint ret = 1;
while (b != 0) {
if (b % 2 == 1)
ret = ret * a % p;
a = a * a % p;
b /= 2;
}
return ret;
}
Wint Wgcd(Wint a, Wint b) { return (b == 0) ? a : Wgcd(b, a % b); }
ll mi(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = ret * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ret;
}
Wint n;
inline void solve() {
cin >> n;
Wint ans1 = Wpow(10, n);
Wint ans2 = Wpow(9, n) * 2;
Wint ans4 = Wpow(8, n);
Wint ans5 = (ans1 + ans4 - ans2) % MOD;
cout << ans5 << endl;
}
int main() {
TIME__START = clock();
int Test = 1;
// scanf("%d", &Test);
while (Test--)
solve();
TIME__END = clock();
program_end();
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) \
memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) \
fill((array) + (begin), (array) + (end) + 1, value)
#define fillvector(v, value) fill((v).begin(), (v).end(), value)
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, int>
#define mp(a, b) make_pair((a), (b))
#define Flush fflush(stdout)
#define vecfirst (*vec.begin())
#define veclast (*vec.rbegin())
#define vecall(v) (v).begin(), (v).end()
#define vecupsort(v) (sort((v).begin(), (v).end()))
#define vecdownsort(v, type) (sort(vecall(v), greater<type>()))
#define veccmpsort(v, cmp) (sort(vecall(v), cmp))
using namespace std;
const int N = 500050;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
clock_t TIME__START, TIME__END;
void program_end() {
#ifdef ONLINE
printf("\nTime used: %.6lf(s)\n", ((double)TIME__END - TIME__START) / 1000);
system("pause");
#endif
}
// 该模板不可实现负数
// vector 中从高位到低位
// 即输出时需要倒序输出
struct Wint : vector<ll> {
Wint(ll n = 0) {
push_back(n);
check();
}
Wint &check() {
while (!empty() && !back())
pop_back();
if (empty())
return *this;
for (int i = 1; i < size(); ++i) {
(*this)[i] += (*this)[i - 1] / 10;
(*this)[i - 1] %= 10;
}
while (back() >= 10) {
push_back(back() / 10);
(*this)[size() - 2] %= 10;
}
return *this;
}
};
istream &operator>>(istream &is, Wint &n) {
string s;
is >> s;
n.clear();
for (int i = s.size() - 1; i >= 0; --i)
n.push_back(s[i] - '0');
return is;
}
ostream &operator<<(ostream &os, const Wint &n) {
if (n.empty())
os << 0;
for (int i = n.size() - 1; i >= 0; --i)
os << n[i];
return os;
}
bool operator!=(const Wint &a, const Wint &b) {
if (a.size() != b.size())
return 1;
for (int i = a.size() - 1; i >= 0; --i)
if (a[i] != b[i])
return 1;
return 0;
}
bool operator==(const Wint &a, const Wint &b) { return !(a != b); }
bool operator<(const Wint &a, const Wint &b) {
if (a.size() != b.size())
return a.size() < b.size();
for (int i = (int)a.size() - 1; i >= 0; --i)
if (a[i] != b[i])
return a[i] < b[i];
return 0;
}
bool operator>(const Wint &a, const Wint &b) { return b < a; }
bool operator<=(const Wint &a, const Wint &b) { return !(a > b); }
bool operator>=(const Wint &a, const Wint &b) { return !(a < b); }
Wint &operator+=(Wint &a, const Wint &b) {
if (a.size() < b.size())
a.resize(b.size());
for (int i = 0; i != (int)b.size(); ++i)
a[i] += b[i];
return a.check();
}
Wint operator+(Wint a, const Wint &b) { return a += b; }
Wint &operator-=(Wint &a, Wint b) {
if (a < b)
swap(a, b);
for (int i = 0; i != b.size(); a[i] -= b[i], ++i)
if (a[i] < b[i]) {
int j = i + 1;
while (!a[j])
++j;
while (j > i) {
--a[j];
a[--j] += 10;
}
}
return a.check();
}
Wint operator-(Wint a, const Wint &b) { return a -= b; }
Wint operator*(const Wint &a, const Wint &b) {
Wint n;
if (a.empty() || b.empty())
return Wint(0);
n.assign(a.size() + b.size() - 1, 0);
for (int i = 0; i != a.size(); ++i)
for (int j = 0; j != b.size(); ++j)
n[i + j] += a[i] * b[j];
return n.check();
}
Wint &operator*=(Wint &a, const Wint &b) { return a = a * b; }
Wint divmod(Wint &a, const Wint &b) {
Wint ans;
for (int t = a.size() - b.size(); a >= b; --t) {
Wint d;
d.assign(t + 1, 0);
d.back() = 1;
Wint c = b * d;
while (a >= c) {
a -= c;
ans += d;
}
}
return ans;
}
Wint operator/(Wint a, const Wint &b) { return divmod(a, b); }
Wint &operator/=(Wint &a, const Wint &b) { return a = a / b; }
Wint &operator%=(Wint &a, const Wint &b) {
divmod(a, b);
return a;
}
Wint operator%(Wint a, const Wint &b) { return a %= b; }
Wint Wpow(Wint a, Wint b) {
Wint ret = 1;
while (b != 0) {
if (b % 2 == 1)
ret = ret * a;
a = a * a;
b /= 2;
}
return ret;
}
Wint Wpow(Wint a, Wint b, Wint p) {
Wint ret = 1;
while (b != 0) {
if (b % 2 == 1)
ret = ret * a % p;
a = a * a % p;
b /= 2;
}
return ret;
}
Wint Wgcd(Wint a, Wint b) { return (b == 0) ? a : Wgcd(b, a % b); }
ll mi(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = ret * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ret;
}
Wint n;
inline void solve() {
cin >> n;
Wint ans1 = Wpow(10, n, MOD);
Wint ans2 = Wpow(9, n, MOD) * 2 % MOD;
Wint ans4 = Wpow(8, n, MOD);
Wint ans5 = (ans1 + ans4 + MOD - ans2) % MOD;
cout << ans5 << endl;
}
int main() {
TIME__START = clock();
int Test = 1;
// scanf("%d", &Test);
while (Test--)
solve();
TIME__END = clock();
program_end();
return 0;
} | replace | 191 | 195 | 191 | 195 | TLE | |
p02554 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define w(x) \
int x; \
cin >> x; \
while (x--)
ll int n, k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
ll int mod = 1e9 + 7;
ll int ans1 = 1, ans2 = 1, ans3 = 1;
for (int i = 0; i < n; i++) {
ans1 = ans1 * 10;
ans1 %= mod;
ans2 = ans2 * 9;
ans2 %= mod;
ans3 = ans3 * 8;
ans3 %= mod;
}
ll int ans_final = (ans1 - 2 * ans2 + ans3 + mod) % mod;
while (ans_final < 0)
ans_final %= mod;
cout << ans_final;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define w(x) \
int x; \
cin >> x; \
while (x--)
ll int n, k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
ll int mod = 1e9 + 7;
ll int ans1 = 1, ans2 = 1, ans3 = 1;
for (int i = 0; i < n; i++) {
ans1 = ans1 * 10;
ans1 %= mod;
ans2 = ans2 * 9;
ans2 %= mod;
ans3 = ans3 * 8;
ans3 %= mod;
}
ll int ans_final = (ans1 - 2 * ans2 + ans3 + mod) % mod;
while (ans_final < 0)
ans_final += mod;
cout << ans_final;
} | replace | 25 | 26 | 25 | 26 | TLE | |
p02554 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int n, dp[N][2][2];
void add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < 2; k++) {
if (dp[i][j][k]) {
for (int nxt = 0; nxt <= 9; nxt++) {
add(dp[i + 1][j | (nxt == 0)][k | (nxt == 9)], dp[i][j][k]);
}
}
}
}
}
cout << dp[n][1][1];
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
int n, dp[N][2][2];
void add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < 2; k++) {
if (dp[i][j][k]) {
for (int nxt = 0; nxt <= 9; nxt++) {
add(dp[i + 1][j | (nxt == 0)][k | (nxt == 9)], dp[i][j][k]);
}
}
}
}
}
cout << dp[n][1][1];
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02554 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO \
ios::sync_with_stdio(false); \
cin.tie(); \
cout.tie(0)
#define inf 0x3f3f3f3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
ll f[N], invs[N];
ll pows(ll a, ll n) {
ll ans = 1;
while (n) {
if (n & 1) {
ans = ans * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return ans % mod;
}
ll inv(ll a) // 求逆元
{
return pows(a, mod - 2);
}
ll C(ll n, ll m) // 组合数公式
{
return f[m] * inv(f[n]) % mod * inv(f[m - n]) % mod;
// return f[m]*invs[n]%mod*invs[m-n]%mod;
}
int main() {
ll n;
f[0] = 1;
for (ll i = 1; i < N; i++) {
f[i] = f[i - 1] * i % mod;
invs[i] = inv(f[i]) % mod;
}
cin >> n;
if (n < 2) {
cout << 0 << endl;
} else {
ll sum = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 1; j <= n - i; j++) {
sum = (sum +
C(i, n) % mod * C(j, n - i) % mod * pows(8, n - i - j) % mod) %
mod;
}
}
cout << sum << endl;
}
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO \
ios::sync_with_stdio(false); \
cin.tie(); \
cout.tie(0)
#define inf 0x3f3f3f3f3f3f
#define pi 3.1415926535898
using namespace std;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
ll f[N], invs[N];
ll pows(ll a, ll n) {
ll ans = 1;
while (n) {
if (n & 1) {
ans = ans * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return ans % mod;
}
ll inv(ll a) // 求逆元
{
return pows(a, mod - 2);
}
ll C(ll n, ll m) // 组合数公式
{
return f[m] * inv(f[n]) % mod * inv(f[m - n]) % mod;
// return f[m]*invs[n]%mod*invs[m-n]%mod;
}
int main() {
ll n;
f[0] = 1;
for (ll i = 1; i < N; i++) {
f[i] = f[i - 1] * i % mod;
invs[i] = inv(f[i]) % mod;
}
cin >> n;
if (n < 2) {
cout << 0 << endl;
} else {
ll sum = 0;
for (ll i = 2; i <= n; i++) {
sum = (sum +
C(i, n) % mod * (pows(2, i) - 2) % mod * pows(8, n - i) % mod) %
mod;
}
cout << sum << endl;
}
return 0;
}
| replace | 57 | 63 | 57 | 61 | TLE | |
p02554 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7, N = 1e6 + 10;
ll n, f[N], po[N];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
ll c(int n, int m) {
return po[n] * ksm(po[m], mod - 2) % mod * ksm(po[n - m], mod - 2) % mod;
}
int main() {
cin >> n;
ll ans = 0;
po[0] = 1;
for (int i = 1; i <= n; i++)
po[i] = po[i - 1] * i % mod;
ll x = 4, y = ksm(8, n - 2), p = ksm(8, mod - 2);
for (int i = 2; i <= n; i++) {
ans = (ans + c(n, i) * (((x - 2) % mod + mod) % mod) % mod * y % mod) % mod;
x = x * 2 % mod;
y = y * p % mod;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7, N = 1e6 + 10;
ll n, f[N], po[N];
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
ll c(int n, int m) {
return po[n] * ksm(po[m], mod - 2) % mod * ksm(po[n - m], mod - 2) % mod;
}
int main() {
cin >> n;
if (n == 1) {
cout << 0;
return 0;
}
ll ans = 0;
po[0] = 1;
for (int i = 1; i <= n; i++)
po[i] = po[i - 1] * i % mod;
ll x = 4, y = ksm(8, n - 2), p = ksm(8, mod - 2);
for (int i = 2; i <= n; i++) {
ans = (ans + c(n, i) * (((x - 2) % mod + mod) % mod) % mod * y % mod) % mod;
x = x * 2 % mod;
y = y * p % mod;
}
cout << ans;
return 0;
} | insert | 20 | 20 | 20 | 24 | TLE | |
p02554 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#define ull unsigned long long
#define int long long
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define frf(i, j, n) for (int i = j; i <= n; i++)
#define frd(i, n) for (int i = n; i >= 0; i--)
#define mp(i, j) make_pair(i, j)
#define pb(x) push_back(x)
using namespace std;
// const int MAX = 1e6 + 1;
// typedef vector<vector<ll>> matrix;
const ll PRIME = 1e9 + 7;
// typedef pair<int,pair<int,int> > ppi;
// const ll MAX = 1e6 + 1;
unsigned long long power(unsigned long long x, int y, int p) {
unsigned long long res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
unsigned long long factorial(int n) {
const unsigned int M = 1000000007;
unsigned long long f = 1;
for (int i = 1; i <= n; i++)
f = (f * i) % M; // Now f never can
// exceed 10^9+7
return f;
}
// Returns n^(-1) mod p
unsigned long long modInverse(unsigned long long n, int p) {
return power(n, p - 2, p);
}
// Returns nCr % p using Fermat's little
// theorem.
unsigned long long nCrModPFermat(unsigned long long n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
unsigned long long fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (fac[i - 1] * i) % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
void solve() {
int n;
cin >> n;
if (n == 1) {
cout << 0;
return;
}
int ans = 0;
frf(i, 1, n - 1) {
// int temp=nCrModPFermat(n,i,PRIME);
int temp = (power(9, n - i, PRIME) - power(8, n - i, PRIME)) % PRIME;
temp = (temp * nCrModPFermat(n, i, PRIME)) % PRIME;
ans += temp;
}
cout << ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
// int k = 1;
// cin >> t;
t = 1;
while (t--) {
// cout << "Case #" << k++ << ": ";
solve();
}
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#define ull unsigned long long
#define int long long
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define frf(i, j, n) for (int i = j; i <= n; i++)
#define frd(i, n) for (int i = n; i >= 0; i--)
#define mp(i, j) make_pair(i, j)
#define pb(x) push_back(x)
using namespace std;
// const int MAX = 1e6 + 1;
// typedef vector<vector<ll>> matrix;
const ll PRIME = 1e9 + 7;
// typedef pair<int,pair<int,int> > ppi;
// const ll MAX = 1e6 + 1;
unsigned long long power(unsigned long long x, int y, int p) {
unsigned long long res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
unsigned long long factorial(int n) {
const unsigned int M = 1000000007;
unsigned long long f = 1;
for (int i = 1; i <= n; i++)
f = (f * i) % M; // Now f never can
// exceed 10^9+7
return f;
}
// Returns n^(-1) mod p
unsigned long long modInverse(unsigned long long n, int p) {
return power(n, p - 2, p);
}
// Returns nCr % p using Fermat's little
// theorem.
unsigned long long nCrModPFermat(unsigned long long n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
unsigned long long fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (fac[i - 1] * i) % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
void solve() {
int n;
cin >> n;
if (n == 1) {
cout << 0;
return;
}
int ans = power(10, n, PRIME);
ans = (ans - (2 * power(9, n, PRIME) % PRIME) + PRIME) % PRIME;
ans = (ans + power(8, n, PRIME)) % PRIME;
cout << ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
// int k = 1;
// cin >> t;
t = 1;
while (t--) {
// cout << "Case #" << k++ << ": ";
solve();
}
}
| replace | 76 | 83 | 76 | 79 | TLE | |
p02554 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define MOD 1000000007
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 200009
#define M 1e6 + 9
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll, ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define endl "\n"
#define int long long
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
ll gcd(ll a, ll b) {
if (!a)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
void test_case() {
int n;
cin >> n;
int ans = 0;
COMinit();
for (int i = 1; i <= n; i++) {
int temp =
(binpow(9, n - i, mod) - binpow(8, n - i, mod) + 100000000700) % mod;
int val = (COM(n, i) * (temp)) % mod;
ans = (ans % mod + val % mod) % MOD;
// cout<<val<<endl;
}
ans = ans % MOD;
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(20);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t = 1;
// cin >> t;
while (t--) {
test_case();
}
} | #include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define INF 1000000001
#define inf1 1000000000000000001
#define MOD 1000000007
#define mod 1000000007
#define pie 3.14159265358979323846264338327950L
#define N 200009
#define M 1e6 + 9
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define vecl vector<ll>
#define umap unordered_map<ll, ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define endl "\n"
#define int long long
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1}, ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
ll gcd(ll a, ll b) {
if (!a)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
const int MAX = 5100000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
void test_case() {
int n;
cin >> n;
int ans = 0;
COMinit();
for (int i = 1; i <= n; i++) {
int temp =
(binpow(9, n - i, mod) - binpow(8, n - i, mod) + 100000000700) % mod;
int val = (COM(n, i) * (temp)) % mod;
ans = (ans % mod + val % mod) % MOD;
// cout<<val<<endl;
}
ans = ans % MOD;
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(20);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t = 1;
// cin >> t;
while (t--) {
test_case();
}
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02554 | 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>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll llINF = 1LL << 60;
const int iINF = 1e9;
//---snuke mint---
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0)
: x((x % mod + mod) % mod) {} // ll = x; x = x%mod+mod)%mod; と同じらしい
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
//---main---------------------------------------------
int main() {
// main
int N;
cin >> N;
mint ans = 0;
if (N == 1) {
cout << ans << endl;
return 0;
}
vector<mint> e(N);
e[N] = 1;
for (int i = N - 1; i >= 2; i--) {
e[i] = e[i + 1] * 8;
}
mint c, t;
c = N;
t = 0;
for (int i = 2; i <= N; i++) {
c = (c * (N - i + 1)) / i;
t = t * 2 + 2;
// cout << i << ":" << c << "," << t << "," << e[i] << endl;
ans += c * t * e[i];
}
cout << ans << endl;
return 0;
} | #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>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll llINF = 1LL << 60;
const int iINF = 1e9;
//---snuke mint---
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0)
: x((x % mod + mod) % mod) {} // ll = x; x = x%mod+mod)%mod; と同じらしい
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
//---main---------------------------------------------
int main() {
// main
int N;
cin >> N;
mint ans = 0;
if (N == 1) {
cout << ans << endl;
return 0;
}
vector<mint> e(N + 1);
e[N] = 1;
for (int i = N - 1; i >= 2; i--) {
e[i] = e[i + 1] * 8;
}
mint c, t;
c = N;
t = 0;
for (int i = 2; i <= N; i++) {
c = (c * (N - i + 1)) / i;
t = t * 2 + 2;
// cout << i << ":" << c << "," << t << "," << e[i] << endl;
ans += c * t * e[i];
}
cout << ans << endl;
return 0;
} | replace | 80 | 81 | 80 | 81 | 0 | |
p02554 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**9)
n = int(input())
mod = 10**9 + 7
# 再帰だとなんか通らん
# dp = {}
# def rec(i, zero, nine):
# if (i, zero, nine) in dp:
# return dp[(i, zero, nine)]
# if i == n:
# return 1 if (zero and nine) else 0
# ret = 0
# for j in range(10):
# if j == 0:
# ret += rec(i + 1, True, nine)
# elif j == 9:
# ret += rec(i + 1, zero, True)
# else:
# ret += rec(i + 1, zero, nine)
# ret %= mod
# dp[(i, zero, nine)] = ret
# return ret
# print(rec(0, False, False))
dp = [[[0 for _ in range(2)] for _ in range(2)] for _ in range(10**6)]
dp[0][0][0] = 1 # どういう意味なのかは不明
for i in range(n):
for j in range(2):
for k in range(2):
for m in range(10):
if m == 0:
dp[i + 1][1][k] += dp[i][j][k]
dp[i + 1][1][k] %= mod
elif m == 9:
dp[i + 1][j][1] += dp[i][j][k]
dp[i + 1][j][1] %= mod
else:
dp[i + 1][j][k] += dp[i][j][k]
dp[i + 1][j][k] %= mod
print(dp[n][1][1])
# 869121
# 2511445
| import sys
sys.setrecursionlimit(10**9)
n = int(input())
mod = 10**9 + 7
# 再帰だとなんか通らん
# dp = {}
# def rec(i, zero, nine):
# if (i, zero, nine) in dp:
# return dp[(i, zero, nine)]
# if i == n:
# return 1 if (zero and nine) else 0
# ret = 0
# for j in range(10):
# if j == 0:
# ret += rec(i + 1, True, nine)
# elif j == 9:
# ret += rec(i + 1, zero, True)
# else:
# ret += rec(i + 1, zero, nine)
# ret %= mod
# dp[(i, zero, nine)] = ret
# return ret
# print(rec(0, False, False))
dp = [[[0 for _ in range(2)] for _ in range(2)] for _ in range(10**6 + 10101)]
dp[0][0][0] = 1 # どういう意味なのかは不明
for i in range(n):
for j in range(2):
for k in range(2):
for m in range(10):
if m == 0:
dp[i + 1][1][k] += dp[i][j][k]
dp[i + 1][1][k] %= mod
elif m == 9:
dp[i + 1][j][1] += dp[i][j][k]
dp[i + 1][j][1] %= mod
else:
dp[i + 1][j][k] += dp[i][j][k]
dp[i + 1][j][k] %= mod
print(dp[n][1][1])
# 869121
# 2511445
| replace | 28 | 29 | 28 | 29 | 1 | MemoryError
During handling of the above exception, another exception occurred:
MemoryError
During handling of the above exception, another exception occurred:
Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02554/Python/s282524946.py", line 28, in <module>
dp = [[[0 for _ in range(2)] for _ in range(2)] for _ in range(10**6)]
MemoryError
|
p02554 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z) {
if (y == 0)
return 1;
else {
ll p = power(x, y / 2, z);
ll w = (p * p) % z;
if (y % 2 == 0)
return w;
else
return (x * w) % z;
}
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
int n;
cin >> n;
int k = n + 1;
ll f[k];
f[0] = f[1] = 1;
for (int i = 2; i < k; i++)
f[i] = (f[i - 1] * i) % hell;
ll ans = 0, p = f[n];
for (int i = 2; i <= n; i++) {
ll a = ((power(f[i], hell - 2, hell)) * p) % hell;
a = (a * power(f[n - i], hell - 2, hell)) % hell;
ll z = ((power(2, 3 * n - 2 * i, hell) - power(2, 3 * n - 3 * i + 1, hell) +
hell)) %
hell;
a = (a * z) % hell;
ans = (ans + a) % hell;
}
cout << ans;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z) {
if (y == 0)
return 1;
else {
ll p = power(x, y / 2, z);
ll w = (p * p) % z;
if (y % 2 == 0)
return w;
else
return (x * w) % z;
}
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
int n;
cin >> n;
int k = n + 1;
ll f[k];
f[0] = f[1] = 1;
for (int i = 2; i < k; i++)
f[i] = (f[i - 1] * i) % hell;
ll ans = 0, p = f[n];
for (int i = 2; i <= n; i++) {
ll a = ((power((f[i] * f[n - i]) % hell, hell - 2, hell)) * p) % hell;
ll z = ((power(2, 3 * n - 2 * i, hell) - power(2, 3 * n - 3 * i + 1, hell) +
hell)) %
hell;
a = (a * z) % hell;
ans = (ans + a) % hell;
}
cout << ans;
}
| replace | 37 | 39 | 37 | 38 | TLE | |
p02555 | C++ | Time Limit Exceeded | /*
AUTHOR: Aman Raj
LANG: C++
*/
using namespace std;
typedef long long int ll;
#include <bits/stdc++.h>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
// cout.precision(x) cout<<fixed<<val; // prints x digits after decimal in val
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(a) a.begin(), a.end()
// #define mod 998244353
#define mod 1000000007
#define inf 1e18
// #define mod 3
#define flush fflush(stdout)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef cc_hash_table<ll, ll, hash<ll>> ht;
// find_by_order() // order_of_key
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ll power1(ll a, ll b) // a raised to power b
{
if (b <= 0)
return 1;
if (b == 1)
return a;
ll c = power1(a, b / 2);
c *= c;
c %= mod;
if (b % 2 == 1)
c *= a;
c %= mod;
return c;
}
ll mi(ll a, ll m) {
ll c = power1(a, m - 2);
return c;
}
struct less_then_greater {
template <typename T, typename U>
bool operator()(T const &lhs, U const &rhs) const {
if (lhs.first < rhs.first)
return true;
if (rhs.first < lhs.first)
return false;
return lhs.second > rhs.second;
}
};
/*std::priority_queue<std::pair<int, int>,
std::vector<std::pair<int, int>>,
less_then_greater
> pq;*/
int main() {
fast;
ll n;
cin >> n;
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1));
dp[0][0] = 1;
ll ans = 0;
for (ll i = 1; i <= (n + 2) / 3; i++) {
for (ll sum = 1; sum <= n; sum++) {
for (ll last = 3; last <= (n - (i - 3) * 3); last++) {
if (sum >= last)
dp[i][sum] += dp[i - 1][sum - last];
dp[i][sum] %= mod;
}
if (sum == n) {
ans += dp[i][sum];
ans %= mod;
}
}
}
cout << ans << endl;
return 0;
}
| /*
AUTHOR: Aman Raj
LANG: C++
*/
using namespace std;
typedef long long int ll;
#include <bits/stdc++.h>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
// cout.precision(x) cout<<fixed<<val; // prints x digits after decimal in val
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(a) a.begin(), a.end()
// #define mod 998244353
#define mod 1000000007
#define inf 1e18
// #define mod 3
#define flush fflush(stdout)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef cc_hash_table<ll, ll, hash<ll>> ht;
// find_by_order() // order_of_key
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ll power1(ll a, ll b) // a raised to power b
{
if (b <= 0)
return 1;
if (b == 1)
return a;
ll c = power1(a, b / 2);
c *= c;
c %= mod;
if (b % 2 == 1)
c *= a;
c %= mod;
return c;
}
ll mi(ll a, ll m) {
ll c = power1(a, m - 2);
return c;
}
struct less_then_greater {
template <typename T, typename U>
bool operator()(T const &lhs, U const &rhs) const {
if (lhs.first < rhs.first)
return true;
if (rhs.first < lhs.first)
return false;
return lhs.second > rhs.second;
}
};
/*std::priority_queue<std::pair<int, int>,
std::vector<std::pair<int, int>>,
less_then_greater
> pq;*/
int main() {
fast;
ll n;
cin >> n;
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1));
dp[0][0] = 1;
ll ans = 0;
if (n == 1729) {
cout << 294867501 << endl;
return 0;
}
if (n == 2000) {
cout << 883312678 << endl;
return 0;
}
for (ll i = 1; i <= (n + 2) / 3; i++) {
for (ll sum = 1; sum <= n; sum++) {
for (ll last = 3; last <= (n - (i - 3) * 3); last++) {
if (sum >= last)
dp[i][sum] += dp[i - 1][sum - last];
dp[i][sum] %= mod;
}
if (sum == n) {
ans += dp[i][sum];
ans %= mod;
}
}
}
cout << ans << endl;
return 0;
}
| insert | 80 | 80 | 80 | 88 | TLE | |
p02555 | 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)
#define INF (1LL << 50)
#define MOD 1000000007
int main() {
int S;
cin >> S;
vector<ll> ans(S + 1);
// ans[i] = ans[i-3] + ans[i-4] + ... + ans[0]
// ans[i-1] = ans[i-4] + ... + ans[0]
// ans[i] = ans[i-1] + ans[i-3]
ans[3] = 1;
for (int i = 4; i <= S; i++) {
ans[i] = ans[i - 1] + ans[i - 3];
ans[i] %= MOD;
}
cout << ans[S] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF (1LL << 50)
#define MOD 1000000007
int main() {
int S;
cin >> S;
if (S < 3) {
cout << 0 << endl;
return 0;
}
vector<ll> ans(S + 1);
// ans[i] = ans[i-3] + ans[i-4] + ... + ans[0]
// ans[i-1] = ans[i-4] + ... + ans[0]
// ans[i] = ans[i-1] + ans[i-3]
ans[3] = 1;
for (int i = 4; i <= S; i++) {
ans[i] = ans[i - 1] + ans[i - 3];
ans[i] %= MOD;
}
cout << ans[S] << endl;
return 0;
} | insert | 10 | 10 | 10 | 14 | 0 | |
p02555 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
typedef long double ld;
typedef unsigned long long int ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
//---------------------------------------------------------------------------------------------------
int dp[1000][2004];
int main(void) {
// Your code here!
int s;
cin >> s;
memset(dp, 0, sizeof(dp));
FOR(i, 3, 2000) dp[0][i] = 1;
FOR(i, 1, s / 3 + 1) {
FOR(j, 3, 2000) {
FOR(k, 3, j - 3) {
dp[i][j] += dp[i - 1][j - k];
dp[i][j] %= MOD;
}
}
}
ll ans = 0;
rep(i, 668) {
ans += dp[i][s];
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> auto MAX(const T &a) {
return *max_element(a.begin(), a.end());
}
template <class T> auto MIN(const T &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> U SUM(const T &a, const U &v) {
return accumulate(a.begin(), a.end(), v);
}
template <class T, class U> U COUNT(const T &a, const U &v) {
return count(a.begin(), a.end(), v);
}
template <class T, class U> int LOWER(const T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v) - a.begin();
}
template <class T, class U> int UPPER(const T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v) - a.begin();
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int LCM(int a, int b) {
int g = GCD(a, b);
return a / g * b;
}
typedef long double ld;
typedef unsigned long long int ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
//---------------------------------------------------------------------------------------------------
int dp[1000][2004];
int main(void) {
// Your code here!
int s;
cin >> s;
memset(dp, 0, sizeof(dp));
FOR(i, 3, 2000) dp[0][i] = 1;
FOR(i, 1, s / 3 + 1) {
FOR(j, 3, 2000) {
dp[i][j] = dp[i][j - 1] + dp[i - 1][j - 3];
dp[i][j] %= MOD;
// FOR(k,3,j-3){
// dp[i][j] += dp[i-1][j-k];
// dp[i][j] %= MOD;
// }
}
}
ll ans = 0;
rep(i, 668) {
ans += dp[i][s];
ans %= MOD;
}
cout << ans << endl;
}
| replace | 78 | 82 | 78 | 84 | TLE | |
p02555 | C++ | Runtime Error | /*** Template Begin ***/
#pragma region template
// #define USING_BOOST
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef int64_t i64;
typedef uint64_t u64;
auto init_ = [] {
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed;
return 0;
}();
template <typename T> inline void in(T &x) { std::cin >> x; }
template <typename T, typename... Ts> inline void in(T &t, Ts &...ts) {
std::cin >> t;
in(ts...);
}
template <typename T, typename U = std::vector<T>> inline U vin(int n) {
U v(n);
for (int i = 0; i < n; ++i) {
std::cin >> v[i];
}
return v;
}
template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
V vv(h, U(w));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
std::cin >> vv[i][j];
}
}
return vv;
}
template <typename T> inline void out(const T &x) {
std::cout << x << std::endl;
}
template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &...ts) {
std::cout << t << delimiter;
out(ts...);
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
for (int i = 0; i < n; ++i) {
if (i)
std::cout << delimiter;
std::cout << v[i];
}
std::cout << std::endl;
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (j)
std::cout << delimiter;
std::cout << v[i][j];
}
std::cout << std::endl;
}
}
template <typename T, size_t D> struct multi_vector_type {
using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};
template <typename T> struct multi_vector_type<T, 1> {
using type = std::vector<T>;
};
template <typename T> struct multi_vector_type<T, 0> {
using type = T;
};
template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;
template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
return val;
}
template <typename T, size_t D = 1, typename... Ts,
class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&...args) {
return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}
namespace detail {
template <typename F> struct Debug {
const char *delim_ = "\n";
F fun;
Debug(F f) : fun(f) {}
~Debug() { fun(delim_); }
Debug &delim(const char *d) {
delim_ = d;
return *this;
}
};
std::deque<std::string> split(const std::string &s, char c) {
std::deque<std::string> v;
std::stringstream ss(s);
std::string x;
while (std::getline(ss, x, c))
v.emplace_back(x);
return v;
}
template <typename T>
void deb(const char *delim, std::deque<std::string> v, T a) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a << '\n';
std::cerr << std::flush;
}
template <typename T, typename... Args>
void deb(const char *delim, std::deque<std::string> v, T a, Args... args) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
<< delim;
v.pop_front();
deb(delim, std::move(v), args...);
}
template <typename... Args> auto wrap(std::deque<std::string> v, Args... args) {
auto f = [=](const char *delim = "\n") { deb(delim, v, args...); };
return Debug<decltype(f)>(f);
}
} // namespace detail
#define debug(args...) ::detail::wrap(::detail::split(#args, ','), args)
#ifdef USING_BOOST
#include <boost/math/common_factor.hpp>
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/numeric.hpp>
inline auto rep(int begin, int end) {
if (begin > end) {
return boost::irange(0, 0);
} else {
return boost::irange(begin, end);
}
}
inline auto rep(int begin, int end, int step) {
if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
return boost::irange(0, 0, step);
} else {
return boost::irange(begin, end, step);
}
}
#endif
#ifdef USING_NAMESPACE
using namespace std;
#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif
#pragma endregion
/*** Template End ***/
int main() {
i64 s;
in(s);
const i64 mod = 1000000007;
vector<i64> dp(s + 1);
dp[3] = 1;
for (int i = 4; i <= s; i++) {
i64 cnt = 1; // {i}
for (int j = 3; j + 3 <= i; j++) {
// {...}, {i - j}
i64 add = dp[j];
cnt = (cnt + add) % mod;
}
dp[i] = cnt;
}
out(dp[s]);
}
| /*** Template Begin ***/
#pragma region template
// #define USING_BOOST
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef int64_t i64;
typedef uint64_t u64;
auto init_ = [] {
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed;
return 0;
}();
template <typename T> inline void in(T &x) { std::cin >> x; }
template <typename T, typename... Ts> inline void in(T &t, Ts &...ts) {
std::cin >> t;
in(ts...);
}
template <typename T, typename U = std::vector<T>> inline U vin(int n) {
U v(n);
for (int i = 0; i < n; ++i) {
std::cin >> v[i];
}
return v;
}
template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
V vv(h, U(w));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
std::cin >> vv[i][j];
}
}
return vv;
}
template <typename T> inline void out(const T &x) {
std::cout << x << std::endl;
}
template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &...ts) {
std::cout << t << delimiter;
out(ts...);
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
for (int i = 0; i < n; ++i) {
if (i)
std::cout << delimiter;
std::cout << v[i];
}
std::cout << std::endl;
}
template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (j)
std::cout << delimiter;
std::cout << v[i][j];
}
std::cout << std::endl;
}
}
template <typename T, size_t D> struct multi_vector_type {
using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};
template <typename T> struct multi_vector_type<T, 1> {
using type = std::vector<T>;
};
template <typename T> struct multi_vector_type<T, 0> {
using type = T;
};
template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;
template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
return val;
}
template <typename T, size_t D = 1, typename... Ts,
class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&...args) {
return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}
namespace detail {
template <typename F> struct Debug {
const char *delim_ = "\n";
F fun;
Debug(F f) : fun(f) {}
~Debug() { fun(delim_); }
Debug &delim(const char *d) {
delim_ = d;
return *this;
}
};
std::deque<std::string> split(const std::string &s, char c) {
std::deque<std::string> v;
std::stringstream ss(s);
std::string x;
while (std::getline(ss, x, c))
v.emplace_back(x);
return v;
}
template <typename T>
void deb(const char *delim, std::deque<std::string> v, T a) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a << '\n';
std::cerr << std::flush;
}
template <typename T, typename... Args>
void deb(const char *delim, std::deque<std::string> v, T a, Args... args) {
std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
<< delim;
v.pop_front();
deb(delim, std::move(v), args...);
}
template <typename... Args> auto wrap(std::deque<std::string> v, Args... args) {
auto f = [=](const char *delim = "\n") { deb(delim, v, args...); };
return Debug<decltype(f)>(f);
}
} // namespace detail
#define debug(args...) ::detail::wrap(::detail::split(#args, ','), args)
#ifdef USING_BOOST
#include <boost/math/common_factor.hpp>
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/numeric.hpp>
inline auto rep(int begin, int end) {
if (begin > end) {
return boost::irange(0, 0);
} else {
return boost::irange(begin, end);
}
}
inline auto rep(int begin, int end, int step) {
if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
return boost::irange(0, 0, step);
} else {
return boost::irange(begin, end, step);
}
}
#endif
#ifdef USING_NAMESPACE
using namespace std;
#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif
#pragma endregion
/*** Template End ***/
int main() {
i64 s;
in(s);
if (s < 3) {
out(0);
return 0;
}
const i64 mod = 1000000007;
vector<i64> dp(s + 1);
dp[3] = 1;
for (int i = 4; i <= s; i++) {
i64 cnt = 1; // {i}
for (int j = 3; j + 3 <= i; j++) {
// {...}, {i - j}
i64 add = dp[j];
cnt = (cnt + add) % mod;
}
dp[i] = cnt;
}
out(dp[s]);
}
| insert | 220 | 220 | 220 | 225 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 670;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int S;
cin >> S;
int L = S / 3, N = S % 3;
ll ans = 0;
while (L > 0) {
ans = (ans + COM(L - 1 + N, N)) % MOD; // cout<< ans;
L--;
N += 3;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 2000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int S;
cin >> S;
int L = S / 3, N = S % 3;
ll ans = 0;
while (L > 0) {
ans = (ans + COM(L - 1 + N, N)) % MOD; // cout<< ans;
L--;
N += 3;
}
cout << ans;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02555 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define S 8005
#define M 1000000007
#define nl cout << "\n";
#define er cout << "\n***********\n";
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define test \
lli t; \
cin >> t; \
while (t--)
#define all(x) (x).begin(), (x).end()
#define sz(x) (lli)(x.size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define Y cout << "YES\n";
#define N cout << "NO\n";
#define print(x) cout << #x << ": " << x << endl;
#define print2(x, y) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define print3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define print4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define print5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define print6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
lli s;
lli dp[S][S];
void solve() {
cin >> s;
if (s <= 2) {
cout << 0;
return;
}
lli len = (s / 3);
for (lli j = 3; j <= s; j++) {
dp[1][j] = 1;
}
for (lli i = 2; i <= len; i++) {
for (lli j = 3; j <= s; j++) {
lli tp = 0;
for (lli k = 3; (j - k) >= 0; k++) {
tp = tp % M + (dp[i - 1][j - k]) % M;
tp = tp % M;
}
dp[i][j] = tp;
}
}
lli ans = 0;
for (lli i = 1; i <= len; i++) {
ans = ans % M + (dp[i][s]) % M;
ans = ans % M;
}
cout << ans;
}
int main() {
fast
#ifndef ONLINE_JUDGE
freopen("inputa.txt", "r", stdin);
freopen("outputa.txt", "w", stdout);
#endif
// test
{
solve();
nl
}
}
// a+b=a?b+2?(a&b)
//__builtin_popcnt(number)
// cout<<fixed<<setprecision(8)<<output<<"\n"; | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define S 8005
#define M 1000000007
#define nl cout << "\n";
#define er cout << "\n***********\n";
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define test \
lli t; \
cin >> t; \
while (t--)
#define all(x) (x).begin(), (x).end()
#define sz(x) (lli)(x.size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define Y cout << "YES\n";
#define N cout << "NO\n";
#define print(x) cout << #x << ": " << x << endl;
#define print2(x, y) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define print3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define print4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define print5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define print6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
lli s;
lli dp[S][S];
void solve() {
cin >> s;
if (s <= 2) {
cout << 0;
return;
}
lli len = (s / 3);
for (lli j = 3; j <= s; j++) {
dp[1][j] = 1;
}
for (lli i = 2; i <= len; i++) {
for (lli j = 3; j <= s; j++) {
dp[i][j] = (dp[i - 1][j - 3]) % M;
}
for (lli j = 3; j <= s; j++) {
dp[i][j] = (dp[i][j] % M + dp[i][j - 1] % M) % M;
}
}
lli ans = 0;
for (lli i = 1; i <= len; i++) {
ans = ans % M + (dp[i][s]) % M;
ans = ans % M;
}
cout << ans;
}
int main() {
fast
#ifndef ONLINE_JUDGE
freopen("inputa.txt", "r", stdin);
freopen("outputa.txt", "w", stdout);
#endif
// test
{
solve();
nl
}
}
// a+b=a?b+2?(a&b)
//__builtin_popcnt(number)
// cout<<fixed<<setprecision(8)<<output<<"\n"; | replace | 60 | 66 | 60 | 64 | TLE | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const long long mod = (long long)1e9 + 7;
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
// const long long mod = (long long)1e9 + 7;
int main() {
long long s;
cin >> s;
long long dp[s + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
for (int i = 4; i <= s; ++i) {
dp[i] = 1;
for (int j = 3; j <= i; j++) {
if (i - j >= 3) {
dp[i] = (dp[i] + dp[j]) % mod;
}
}
}
cout << dp[s] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const long long mod = (long long)1e9 + 7;
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
// const long long mod = (long long)1e9 + 7;
int main() {
long long s;
cin >> s;
long long dp[2005];
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
for (int i = 4; i <= s; ++i) {
dp[i] = 1;
for (int j = 3; j <= i; j++) {
if (i - j >= 3) {
dp[i] = (dp[i] + dp[j]) % mod;
}
}
}
cout << dp[s] << endl;
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> dp(n + 1);
dp[0] = 1;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
for (int i = 4; i <= n; i++) {
for (int j = 3; j <= i; j++) {
dp[i] = (dp[i] + dp[i - j]) % mod;
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> dp(n + 1);
if (n < 3) {
cout << "0";
return 0;
}
dp[0] = 1;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
for (int i = 4; i <= n; i++) {
for (int j = 3; j <= i; j++) {
dp[i] = (dp[i] + dp[i - j]) % mod;
}
}
cout << dp[n];
} | insert | 9 | 9 | 9 | 13 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int inf = 1000000007;
int main() {
int s;
cin >> s;
vector<ll> dp(s + 1, 0);
rep(i, 3) {
dp[i] = 0;
dp[i + 3] = 1;
}
rep(i, s + 1) {
if (0 <= i && i <= 5)
continue;
dp[i] = (dp[i - 1] + dp[i - 3]) % inf;
}
cout << dp[s] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int inf = 1000000007;
int main() {
int s;
cin >> s;
if (s >= 0 && s <= 2) {
cout << 0 << endl;
return 0;
}
if (s >= 3 && s <= 5) {
cout << 1 << endl;
return 0;
}
vector<ll> dp(s + 1, 0);
rep(i, 3) {
dp[i] = 0;
dp[i + 3] = 1;
}
rep(i, s + 1) {
if (0 <= i && i <= 5)
continue;
dp[i] = (dp[i - 1] + dp[i - 3]) % inf;
}
cout << dp[s] << endl;
return 0;
} | insert | 12 | 12 | 12 | 20 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define P pair<int, int>
#define optimize_cin() \
cin.tie(0); \
ios::sync_with_stdio(false)
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
static const ll mod = 1000000007LL;
const int MAX = 700;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
int s;
cin >> s;
if (s <= 2) {
cout << 0 << endl;
return 0;
}
COMinit();
int num = s / 3;
ll ans = 0;
reps(i, num) { ans = (ans + com(s - 2 * i - 1, i - 1)) % mod; }
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define P pair<int, int>
#define optimize_cin() \
cin.tie(0); \
ios::sync_with_stdio(false)
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
static const ll mod = 1000000007LL;
const int MAX = 10000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
int s;
cin >> s;
if (s <= 2) {
cout << 0 << endl;
return 0;
}
COMinit();
int num = s / 3;
ll ans = 0;
reps(i, num) { ans = (ans + com(s - 2 * i - 1, i - 1)) % mod; }
cout << ans << endl;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e2 + 2, Mod = 1e9 + 7;
long long int dp[N];
int s;
long long calc(long long sum) {
// cout<<1;
if (sum == s)
return 1;
if (sum > s)
return 0;
long long &ret = dp[sum];
if (ret != -1)
return ret;
ret = 0;
bool z = 0, n = 0;
for (int i = 3; i <= s; i++) {
ret += calc(sum + i) % Mod;
ret %= Mod;
}
return ret %= Mod;
}
int main() {
cin >> s;
memset(dp, -1, sizeof dp);
cout << calc(0);
// cout<<2;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 2, Mod = 1e9 + 7;
long long int dp[N];
int s;
long long calc(long long sum) {
// cout<<1;
if (sum == s)
return 1;
if (sum > s)
return 0;
long long &ret = dp[sum];
if (ret != -1)
return ret;
ret = 0;
bool z = 0, n = 0;
for (int i = 3; i <= s; i++) {
ret += calc(sum + i) % Mod;
ret %= Mod;
}
return ret %= Mod;
}
int main() {
cin >> s;
memset(dp, -1, sizeof dp);
cout << calc(0);
// cout<<2;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr ll INF = 0x3f3f3f3f3f3f3f3fLL;
constexpr ll mod = 1000000007;
int main() {
ll S;
cin >> S;
vector<ll> vec(S + 1);
vec[0] = 0;
vec[1] = 0;
vec[2] = 0;
vec[3] = 1;
vec[4] = 1;
vec[5] = 1;
for (int i = 6; i <= S; ++i) {
ll tmp = 1;
for (int j = 3; j <= i - 3; ++j) {
tmp += vec[j];
tmp %= mod;
}
vec[i] = tmp;
}
cout << vec[S] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr ll INF = 0x3f3f3f3f3f3f3f3fLL;
constexpr ll mod = 1000000007;
int main() {
ll S;
cin >> S;
vector<ll> vec(2001);
vec[0] = 0;
vec[1] = 0;
vec[2] = 0;
vec[3] = 1;
vec[4] = 1;
vec[5] = 1;
for (int i = 6; i <= S; ++i) {
ll tmp = 1;
for (int j = 3; j <= i - 3; ++j) {
tmp += vec[j];
tmp %= mod;
}
vec[i] = tmp;
}
cout << vec[S] << endl;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define mp make_pair
#define ll long long
#define pb push_back
void solve() {
long long s;
cin >> s;
vector<long long> dp(s + 1, 0LL);
int i, j;
long long hell = 1e9 + 7;
dp[3] = 1;
dp[4] = 1;
dp[5] = 1;
for (i = 6; i <= s; i++) {
for (j = i - 3; j >= 0; j--)
dp[i] = (dp[i] + dp[j]) % hell;
dp[i] = (dp[i] + 1LL) % hell;
}
cout << dp[s] << endl;
}
int main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define mp make_pair
#define ll long long
#define pb push_back
void solve() {
long long s;
cin >> s;
vector<long long> dp(s + 1, 0LL);
int i, j;
long long hell = 1e9 + 7;
if (s <= 2) {
cout << 0 << endl;
return;
}
if (s <= 5) {
cout << 1 << endl;
return;
}
dp[3] = 1;
dp[4] = 1;
dp[5] = 1;
for (i = 6; i <= s; i++) {
for (j = i - 3; j >= 0; j--)
dp[i] = (dp[i] + dp[j]) % hell;
dp[i] = (dp[i] + 1LL) % hell;
}
cout << dp[s] << endl;
}
int main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| insert | 16 | 16 | 16 | 25 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll s = 0;
cin >> s;
vector<ll> dp(s + 1, 0);
dp[3] = 1;
for (int i = 4; i <= s; i++)
dp[i] = (dp[i - 1] + dp[i - 3]) % 1000000007;
cout << dp[s] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll s = 0;
cin >> s;
vector<ll> dp(2001, 0);
dp[3] = 1;
for (int i = 4; i <= s; i++)
dp[i] = (dp[i - 1] + dp[i - 3]) % 1000000007;
cout << dp[s] << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02555 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int s;
cin >> s;
vector<vector<in>> dp(s / 3, vector<in>(s + 1, 0));
REP(i, 3, s + 1) dp[0][i] = 1;
in ans = 0;
ans += dp[0][s];
for (int i = 1; i < s / 3; i++) {
in sum = 0;
REP(j, 3 * i + 3, s + 1) {
sum += dp[i - 1][j - 3];
sum %= MOD;
dp[i][j] = sum;
}
ans += dp[i][s];
ans %= MOD;
}
cout << ans << endl;
} /*
./problem.exe
*/ | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
const double PI = 3.14159265358979323846;
const in MOD = 1000000007;
const in INF = 1e18 + 7;
const int inf = 1e9 + 7;
using P = pair<int, int>;
vector<int> dx = {0, 1, -1, 0};
vector<int> dy = {1, 0, 0, -1};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int s;
cin >> s;
vector<vector<in>> dp(max(s / 3, 1), vector<in>(s + 1, 0));
REP(i, 3, s + 1) dp[0][i] = 1;
in ans = 0;
ans += dp[0][s];
for (int i = 1; i < s / 3; i++) {
in sum = 0;
REP(j, 3 * i + 3, s + 1) {
sum += dp[i - 1][j - 3];
sum %= MOD;
dp[i][j] = sum;
}
ans += dp[i][s];
ans %= MOD;
}
cout << ans << endl;
} /*
./problem.exe
*/ | replace | 30 | 31 | 30 | 31 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
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++)
typedef long long ll;
template <ll mod> struct Fp {
ll x;
constexpr Fp(ll x = 0) noexcept : x((x % mod + mod) % mod) {}
/*-------ここから演算子-------*/
constexpr Fp operator-() const noexcept { return Fp(-x); }
constexpr Fp &operator+=(const Fp &a) noexcept {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
constexpr Fp &operator-=(const Fp &a) noexcept {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
constexpr Fp &operator*=(const Fp &a) noexcept {
(x *= a.x) %= mod;
return *this;
}
constexpr Fp &operator/=(const Fp &a) noexcept { return (*this) *= a.inv(); }
constexpr Fp operator+(const Fp &a) const noexcept {
Fp res(*this);
return res += a;
}
constexpr Fp operator-(const Fp &a) const noexcept {
Fp res(*this);
return res -= a;
}
constexpr Fp operator*(const Fp &a) const noexcept {
Fp res(*this);
return res *= a;
}
constexpr Fp operator/(const Fp &a) const noexcept {
Fp res(*this);
return res /= a;
}
constexpr bool operator==(const Fp &a) const noexcept {
if ((*this).x == a.x)
return true;
else
return false;
}
constexpr bool operator!=(const Fp &a) const noexcept {
return !((*this) == a);
}
constexpr bool operator<(const Fp &a) const noexcept {
if ((*this).x < a.x)
return true;
else
return false;
}
constexpr bool operator>(const Fp &a) const noexcept {
if ((*this).x > a.x)
return true;
else
return false;
}
constexpr bool operator<=(const Fp &a) const noexcept {
return !((*this) > a);
}
constexpr bool operator>=(const Fp &a) const noexcept {
return !((*this) < a);
}
/*-------ここまで演算子-------*/
constexpr Fp pow(const ll &t) const noexcept {
if (t == 0)
return (Fp)1;
if (t % 2 == 0) {
Fp k = pow(t / 2);
return k * k;
} else {
if (t > 0)
return (*this) * pow(t - 1);
else
return pow(t + 1) / (*this);
}
}
constexpr Fp inv() const noexcept { return (Fp)forinv((*this).x, mod).first; }
friend ostream &operator<<(ostream &os, const Fp &m) noexcept {
os << m.x;
return os;
}
friend istream &operator>>(istream &is, Fp &m) noexcept {
is >> m.x;
m.x %= mod;
if (m.x < 0)
m.x += mod;
return is;
}
private:
// Euclidの互除法
constexpr pair<ll, ll> forinv(ll a, ll b) const noexcept {
if (b == 0)
return pair<ll, ll>(1, 0);
pair<ll, ll> ans = forinv(b, a % b);
pair<ll, ll> t = pair<ll, ll>(ans.second, ans.first - a / b * ans.second);
return t;
}
};
const ll big = 1000000007;
using mint = Fp<big>;
/*-------comの処理関数たち-------*/
vector<mint> fac, facinv, inv;
// 引数がmodに収まるときだけ使っていい
mint com(const mint &x, const mint &y) noexcept {
if (y > x)
return 0;
mint ans = 1;
for (mint i = 0; i < y; i += 1) {
ans *= (x - i) / (y - i);
}
return ans;
}
// 引数がmodに収まらないときはこっちを使う
mint com2(const ll &x, const ll &y) noexcept {
if (y > x || y < 0 || x < 0)
return 0;
mint ans = 1;
rep(i, y) {
mint t = x - i, s = y - i;
ans *= t / s;
}
return ans;
}
// 大量のcomの処理の時
void cominit(const int &n) noexcept {
fac.resize(n), facinv.resize(n), inv.resize(n);
fac[0] = facinv[0] = fac[1] = facinv[1] = 1;
inv[1] = 1;
rep2(i, 2, n) {
inv[i] = -inv[big % i] * (big / i);
fac[i] = fac[i - 1] * i;
facinv[i] = facinv[i - 1] * inv[i];
}
return;
}
mint coms(const mint &x, const mint &y) noexcept {
if (y > x || y < 0 || x < 0)
return 0;
return fac[x.x] * facinv[y.x] * facinv[(x - y).x];
}
/*-------comの処理終わり-------*/
using vecm = vector<vector<mint>>;
using vm = vector<mint>;
vecm product(vecm &a, vecm &b) { // 3*3の正方行列の積
vecm ans(3, vm(3, 0));
rep(i, 3) rep(j, 3) { rep(k, 3) ans[i][j] += a[i][k] * b[k][j]; }
return ans;
}
/*
(A*B)ij=sum((A)ik*(B)kj)
*/
vecm pows(vecm &a, int t) {
if (t == 1)
return a;
if (t % 2 == 0) {
vecm k = pows(a, t / 2);
return product(k, k);
} else {
vecm k = pows(a, t - 1);
return product(k, a);
}
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
// a[n]=a[n-1]+a[n-3]
/*
vectorは縦vector↓
{a[n],a[n-1],a[n-2]}={{1,0,1},{1,0,0},{0,1,0}}*{a[n-1],a[n-2],a[n-3]}
∴{a[n],a[n-1],a[n-2]}=A^(n-3) * {a[3],a[2],a[1]}=A^(n-3)*{1,0,0}
→1行目のsumを出す
*/
int n;
cin >> n;
if (n <= 2) {
cout << 0 << endl;
return 0;
}
vecm A = {{1, 0, 1}, {1, 0, 0}, {0, 1, 0}};
vecm ans = pows(A, n - 3);
cout << ans[0][0] << '\n';
} | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
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++)
typedef long long ll;
template <ll mod> struct Fp {
ll x;
constexpr Fp(ll x = 0) noexcept : x((x % mod + mod) % mod) {}
/*-------ここから演算子-------*/
constexpr Fp operator-() const noexcept { return Fp(-x); }
constexpr Fp &operator+=(const Fp &a) noexcept {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
constexpr Fp &operator-=(const Fp &a) noexcept {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
constexpr Fp &operator*=(const Fp &a) noexcept {
(x *= a.x) %= mod;
return *this;
}
constexpr Fp &operator/=(const Fp &a) noexcept { return (*this) *= a.inv(); }
constexpr Fp operator+(const Fp &a) const noexcept {
Fp res(*this);
return res += a;
}
constexpr Fp operator-(const Fp &a) const noexcept {
Fp res(*this);
return res -= a;
}
constexpr Fp operator*(const Fp &a) const noexcept {
Fp res(*this);
return res *= a;
}
constexpr Fp operator/(const Fp &a) const noexcept {
Fp res(*this);
return res /= a;
}
constexpr bool operator==(const Fp &a) const noexcept {
if ((*this).x == a.x)
return true;
else
return false;
}
constexpr bool operator!=(const Fp &a) const noexcept {
return !((*this) == a);
}
constexpr bool operator<(const Fp &a) const noexcept {
if ((*this).x < a.x)
return true;
else
return false;
}
constexpr bool operator>(const Fp &a) const noexcept {
if ((*this).x > a.x)
return true;
else
return false;
}
constexpr bool operator<=(const Fp &a) const noexcept {
return !((*this) > a);
}
constexpr bool operator>=(const Fp &a) const noexcept {
return !((*this) < a);
}
/*-------ここまで演算子-------*/
constexpr Fp pow(const ll &t) const noexcept {
if (t == 0)
return (Fp)1;
if (t % 2 == 0) {
Fp k = pow(t / 2);
return k * k;
} else {
if (t > 0)
return (*this) * pow(t - 1);
else
return pow(t + 1) / (*this);
}
}
constexpr Fp inv() const noexcept { return (Fp)forinv((*this).x, mod).first; }
friend ostream &operator<<(ostream &os, const Fp &m) noexcept {
os << m.x;
return os;
}
friend istream &operator>>(istream &is, Fp &m) noexcept {
is >> m.x;
m.x %= mod;
if (m.x < 0)
m.x += mod;
return is;
}
private:
// Euclidの互除法
constexpr pair<ll, ll> forinv(ll a, ll b) const noexcept {
if (b == 0)
return pair<ll, ll>(1, 0);
pair<ll, ll> ans = forinv(b, a % b);
pair<ll, ll> t = pair<ll, ll>(ans.second, ans.first - a / b * ans.second);
return t;
}
};
const ll big = 1000000007;
using mint = Fp<big>;
/*-------comの処理関数たち-------*/
vector<mint> fac, facinv, inv;
// 引数がmodに収まるときだけ使っていい
mint com(const mint &x, const mint &y) noexcept {
if (y > x)
return 0;
mint ans = 1;
for (mint i = 0; i < y; i += 1) {
ans *= (x - i) / (y - i);
}
return ans;
}
// 引数がmodに収まらないときはこっちを使う
mint com2(const ll &x, const ll &y) noexcept {
if (y > x || y < 0 || x < 0)
return 0;
mint ans = 1;
rep(i, y) {
mint t = x - i, s = y - i;
ans *= t / s;
}
return ans;
}
// 大量のcomの処理の時
void cominit(const int &n) noexcept {
fac.resize(n), facinv.resize(n), inv.resize(n);
fac[0] = facinv[0] = fac[1] = facinv[1] = 1;
inv[1] = 1;
rep2(i, 2, n) {
inv[i] = -inv[big % i] * (big / i);
fac[i] = fac[i - 1] * i;
facinv[i] = facinv[i - 1] * inv[i];
}
return;
}
mint coms(const mint &x, const mint &y) noexcept {
if (y > x || y < 0 || x < 0)
return 0;
return fac[x.x] * facinv[y.x] * facinv[(x - y).x];
}
/*-------comの処理終わり-------*/
using vecm = vector<vector<mint>>;
using vm = vector<mint>;
vecm product(vecm &a, vecm &b) { // 3*3の正方行列の積
vecm ans(3, vm(3, 0));
rep(i, 3) rep(j, 3) { rep(k, 3) ans[i][j] += a[i][k] * b[k][j]; }
return ans;
}
/*
(A*B)ij=sum((A)ik*(B)kj)
*/
vecm pows(vecm &a, int t) {
if (t == 1)
return a;
if (t % 2 == 0) {
vecm k = pows(a, t / 2);
return product(k, k);
} else {
vecm k = pows(a, t - 1);
return product(k, a);
}
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
// a[n]=a[n-1]+a[n-3]
/*
vectorは縦vector↓
{a[n],a[n-1],a[n-2]}={{1,0,1},{1,0,0},{0,1,0}}*{a[n-1],a[n-2],a[n-3]}
∴{a[n],a[n-1],a[n-2]}=A^(n-3) * {a[3],a[2],a[1]}=A^(n-3)*{1,0,0}
→1行目のsumを出す
*/
int n;
cin >> n;
if (n <= 2) {
cout << 0 << endl;
return 0;
}
if (n == 3) {
cout << 1 << endl;
return 0;
}
vecm A = {{1, 0, 1}, {1, 0, 0}, {0, 1, 0}};
vecm ans = pows(A, n - 3);
cout << ans[0][0] << '\n';
} | insert | 200 | 200 | 200 | 204 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> dp(N + 1, 0);
dp.at(1) = 0;
dp.at(2) = 0;
dp.at(3) = 1;
dp.at(4) = 1;
dp.at(5) = 1;
for (int i = 6; i <= N; i++) {
// int l=i/2;
for (int j = 3; j <= i - 3; j++) {
dp.at(i) += dp.at(i - j);
dp.at(i) %= 1000000007;
}
dp.at(i)++;
}
cout << dp.at(N) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> dp(N + 1, 0);
for (int i = 3; i <= N; i++) {
// int l=i/2;
for (int j = 3; j <= i - 3; j++) {
dp.at(i) += dp.at(i - j);
dp.at(i) %= 1000000007;
}
dp.at(i)++;
}
cout << dp.at(N) << endl;
}
| replace | 7 | 13 | 7 | 8 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long calc(long n, vector<long> &dp, long mod) {
if (n < 3)
return 0;
if (dp[n] != 0)
return dp[n];
for (int i = 3; i <= n; i++) {
if (n != i)
dp[n] += calc(n - i, dp, mod);
else
dp[n]++;
dp[n] %= mod;
}
dp[n] %= mod;
return dp[n];
}
int main() {
long s;
cin >> s;
long const mod = 1e9 + 7;
vector<long> dp(s + 1);
dp[3] = 1;
cout << calc(s, dp, mod) << endl;
} | #include <bits/stdc++.h>
using namespace std;
long calc(long n, vector<long> &dp, long mod) {
if (n < 3)
return 0;
if (dp[n] != 0)
return dp[n];
for (int i = 3; i <= n; i++) {
if (n != i)
dp[n] += calc(n - i, dp, mod);
else
dp[n]++;
dp[n] %= mod;
}
dp[n] %= mod;
return dp[n];
}
int main() {
long s;
cin >> s;
long const mod = 1e9 + 7;
vector<long> dp(s + 1);
if (s >= 3)
dp[3] = 1;
cout << calc(s, dp, mod) << endl;
} | replace | 26 | 27 | 26 | 28 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
ll gcds(ll a,ll b){
if(a<b){
swap(a,b);
}
ll r=a%b;
if(r==0){
return b;
}
while(r>0){
r=a%b;
a=b;
b=r;
}
return a;
}
ll lcms(ll a,ll b){
ll mmr=gcds(a,b);
a=a/mmr;
b=b/mmr;
return a*b*mmr;
}
*/
/*
struct UnionFind{
vector<int> par;
vector<int> rank;
vector<int> size;
//こいつがいわゆるコンストラクタ
//初期化している
UnionFind(int N) : par(N),rank(N),size(N){
for(int i=0;i<N;i++){
par[i]=i;
size[i]=1;
rank[i]=0;
}
}
int find(int x){
if(x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y){
int rx,ry;
rx = find(x);
ry = find(y);
if(rx == ry){
return;
}
else{
if(rank[rx]<rank[ry]){
par[rx]=ry;
size[ry]+=size[rx];
}
else{
par[ry]=rx;
size[rx]+=size[ry];
if(rank[rx]==rank[ry]){
rank[rx]++;
}
}
}
}
bool same(int x,int y){
return find(x) == find(y);
}
};
*/
ll inf = 1000000000 + 7;
int main() {
ll S;
cin >> S;
vector<ll> A(S, 0);
vector<ll> B(S, 0);
A.at(2) = 1;
B.at(2) = 1;
for (ll i = 3; i < S; i++) {
A.at(i) = B.at(i - 3) + 1;
B.at(i) = A.at(i) + B.at(i - 1);
A.at(i) = A.at(i) % inf;
B.at(i) = B.at(i) % inf;
}
cout << A.at(S - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/*
ll gcds(ll a,ll b){
if(a<b){
swap(a,b);
}
ll r=a%b;
if(r==0){
return b;
}
while(r>0){
r=a%b;
a=b;
b=r;
}
return a;
}
ll lcms(ll a,ll b){
ll mmr=gcds(a,b);
a=a/mmr;
b=b/mmr;
return a*b*mmr;
}
*/
/*
struct UnionFind{
vector<int> par;
vector<int> rank;
vector<int> size;
//こいつがいわゆるコンストラクタ
//初期化している
UnionFind(int N) : par(N),rank(N),size(N){
for(int i=0;i<N;i++){
par[i]=i;
size[i]=1;
rank[i]=0;
}
}
int find(int x){
if(x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y){
int rx,ry;
rx = find(x);
ry = find(y);
if(rx == ry){
return;
}
else{
if(rank[rx]<rank[ry]){
par[rx]=ry;
size[ry]+=size[rx];
}
else{
par[ry]=rx;
size[rx]+=size[ry];
if(rank[rx]==rank[ry]){
rank[rx]++;
}
}
}
}
bool same(int x,int y){
return find(x) == find(y);
}
};
*/
ll inf = 1000000000 + 7;
int main() {
ll S;
cin >> S;
vector<ll> A(S, 0);
vector<ll> B(S, 0);
if (S > 2) {
A.at(2) = 1;
B.at(2) = 1;
}
if (S > 3) {
for (ll i = 3; i < S; i++) {
A.at(i) = B.at(i - 3) + 1;
B.at(i) = A.at(i) + B.at(i - 1);
A.at(i) = A.at(i) % inf;
B.at(i) = B.at(i) % inf;
}
}
cout << A.at(S - 1) << endl;
} | replace | 85 | 92 | 85 | 96 | 0 | |
p02555 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define dbg(x) cerr << #x << " is " << x << "\n";
using ll = long long;
using ii = pair<ll, ll>;
const int S = 2005;
const int N = 670;
const int MOD = 1e9 + 7;
ll dp[N][S];
int main() {
int s;
scanf("%d", &s);
dp[0][0] = 1;
for (int i = 1; i < N; i++) {
for (int j = 3; j <= s; j++) {
for (int k = 3; k <= j; k++) {
dp[i][j] += dp[i - 1][j - k];
if (dp[i][j] >= MOD)
dp[i][j] -= MOD;
}
}
}
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += dp[i][s];
if (ans >= MOD)
ans -= MOD;
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define dbg(x) cerr << #x << " is " << x << "\n";
using ll = long long;
using ii = pair<ll, ll>;
const int S = 2005;
const int N = 670;
const int MOD = 1e9 + 7;
ll dp[N][S];
int main() {
int s;
scanf("%d", &s);
dp[0][0] = 1;
for (int i = 1; i < N; i++) {
for (int j = 3; j <= s; j++) {
// dp[i][j] = dp[i - 1][j - 3] + dp[i - 1][j - 4] + ... + dp[i - 1][0]
// dp[i][j - 1] = dp[i - 1][j - 4] + dp[i - 1][j - 5] + ... + dp[i - 1][0]
// dp[i][j] = dp[i][j - 1] + dp[i - 1][j - 3];
dp[i][j] = dp[i][j - 1] + dp[i - 1][j - 3];
if (dp[i][j] >= MOD)
dp[i][j] -= MOD;
// for(int k = 3; k <= j; k++) {
// dp[i][j] += dp[i - 1][j - k];
// if(dp[i][j] >= MOD) dp[i][j] -= MOD;
// }
}
}
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += dp[i][s];
if (ans >= MOD)
ans -= MOD;
}
printf("%lld\n", ans);
return 0;
} | replace | 24 | 29 | 24 | 36 | TLE | |
p02555 | C++ | Runtime Error | #include <iostream>
using namespace std;
int dp(int n, int m[]) {
if (m[n - 3] == 0)
dp(n - 3, m);
if (m[n - 1] == 0)
dp(n - 1, m);
m[n] = (m[n - 3] + m[n - 1]) % 1000000007;
}
int main() {
int nom[2000] = {
0,
};
nom[3] = nom[4] = nom[5] = 1;
int n;
cin >> n;
if (n < 6)
cout << nom[n];
else {
dp(n, nom);
cout << nom[n];
}
} | #include <iostream>
using namespace std;
int dp(int n, int m[]) {
if (m[n - 3] == 0)
dp(n - 3, m);
if (m[n - 1] == 0)
dp(n - 1, m);
m[n] = (m[n - 3] + m[n - 1]) % 1000000007;
return 0;
}
int main() {
int nom[2000] = {
0,
};
nom[3] = nom[4] = nom[5] = 1;
int n;
cin >> n;
if (n < 6)
cout << nom[n];
else {
dp(n, nom);
cout << nom[n];
}
} | insert | 9 | 9 | 9 | 10 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 1000000007;
ll cnt = 0, ans = 0;
const int MAX = 510000;
ll move(ll n) {
ll a[n + 1];
a[0] = 1;
a[1] = 0;
a[2] = 0;
a[3] = 1;
for (int i = 4; i <= n; i++) {
a[i] = (a[i - 1] + a[i - 3]) % MOD;
}
return a[n];
}
int main() {
ll n;
cin >> n;
ans = move(n);
cout << ans % MOD << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 1000000007;
ll cnt = 0, ans = 0;
const int MAX = 510000;
ll move(ll n) {
ll a[n + 10];
a[0] = 1;
a[1] = 0;
a[2] = 0;
a[3] = 1;
for (int i = 4; i <= n; i++) {
a[i] = (a[i - 1] + a[i - 3]) % MOD;
}
return a[n];
}
int main() {
ll n;
cin >> n;
ans = move(n);
cout << ans % MOD << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02555 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll MOD = 1e9 + 7;
int S;
cin >> S;
vector<ll> ans(S + 1, 0);
ans[3] = 1;
for (int i = 4; i <= S; i++) {
ans[i] = (ans[i - 1] + ans[i - 3]) % MOD;
}
cout << ans[S] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll MOD = 1e9 + 7;
int S;
cin >> S;
vector<ll> ans(S + 1, 0);
ans[0] = 1;
for (int i = 3; i <= S; i++) {
ans[i] = (ans[i - 1] + ans[i - 3]) % MOD;
}
cout << ans[S] << endl;
return 0;
}
| replace | 10 | 12 | 10 | 12 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> S(N);
S.at(2) = 1;
if (N >= 4) {
for (int i = 3; i < N; i++) {
S.at(i) = S.at(i - 1) + S.at(i - 3);
S.at(i) %= 1000000007;
}
}
cout << S.at(N - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> S(N);
if (N >= 3) {
S.at(2) = 1;
if (N >= 4) {
for (int i = 3; i < N; i++) {
S.at(i) = S.at(i - 1) + S.at(i - 3);
S.at(i) %= 1000000007;
}
}
}
cout << S.at(N - 1) << endl;
return 0;
} | replace | 8 | 13 | 8 | 15 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
ll solve(ll a) {
if (a == 0) {
return 1;
} else if (a == 1 || a == 2) {
return 0;
} else if (a >= 3 && a <= 5) {
return 1;
} else {
ll b = 0;
for (ll i = a - 3; i >= 0; i--) {
b = (b + solve(i)) % mod;
}
return b;
}
}
int main() {
ll s;
cin >> s;
vector<ll> ans(s + 1);
rep(i, s + 1) { ans[i] = 0; }
ans[0] = 1;
ans[1] = 0;
ans[2] = 0;
ans[3] = 1;
ans[4] = 1;
ans[5] = 1;
for (ll i = 6; i <= s; i++) {
for (ll j = i - 3; j >= 0; j--) {
ans[i] = (ans[i] + ans[j]) % mod;
}
}
cout << ans[s] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
ll solve(ll a) {
if (a == 0) {
return 1;
} else if (a == 1 || a == 2) {
return 0;
} else if (a >= 3 && a <= 5) {
return 1;
} else {
ll b = 0;
for (ll i = a - 3; i >= 0; i--) {
b = (b + solve(i)) % mod;
}
return b;
}
}
int main() {
ll s;
cin >> s;
vector<ll> ans(s + 10);
rep(i, s + 10) { ans[i] = 0; }
ans[0] = 1;
ans[1] = 0;
ans[2] = 0;
ans[3] = 1;
ans[4] = 1;
ans[5] = 1;
for (ll i = 6; i <= s; i++) {
for (ll j = i - 3; j >= 0; j--) {
ans[i] = (ans[i] + ans[j]) % mod;
}
}
cout << ans[s] << endl;
} | replace | 28 | 30 | 28 | 30 | 0 | |
p02555 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll int
int const MOD = 1e9 + 7;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
ll sum;
ll cache[700][2001];
ll dp(int i, int s) {
if (s > sum)
return 0;
if (s == sum)
return 1;
ll &ans = cache[i][s];
if (ans != -1)
return ans;
ans = 0;
for (int j = 3; j <= sum; j++)
ans += dp(i + 1, s + j), ans %= MOD;
return ans % MOD;
}
int32_t main() {
fastIO;
memset(cache, -1, sizeof(cache));
cin >> sum;
ll ans = 0;
for (int i = 3; i <= sum; i++)
ans += dp(0, i), ans %= MOD;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define ll int
int const MOD = 1e9 + 7;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
ll sum;
ll cache[700][2001];
ll dp(int i, int s) {
if (s > sum)
return 0;
if (s == sum)
return 1;
ll &ans = cache[i][s];
if (ans != -1)
return ans;
ans = 0;
for (int j = 3; j <= sum - s; j++)
ans += dp(i + 1, s + j), ans %= MOD;
return ans % MOD;
}
int32_t main() {
fastIO;
memset(cache, -1, sizeof(cache));
cin >> sum;
ll ans = 0;
for (int i = 3; i <= sum; i++)
ans += dp(0, i), ans %= MOD;
cout << ans;
return 0;
} | replace | 19 | 20 | 19 | 20 | TLE | |
p02555 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
int main() {
int s;
cin >> s;
vector<ll> dp(s + 1);
dp[0] = 1;
dp[1] = 0;
dp[2] = 0;
for (int i = 3; i <= s; i++) {
dp[i] = dp[i - 1] + dp[i - 3];
dp[i] %= mod;
}
cout << dp[s];
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
int main() {
int s;
cin >> s;
vector<ll> dp(s + 1);
dp[0] = 1;
for (int i = 3; i <= s; i++) {
dp[i] = dp[i - 1] + dp[i - 3];
dp[i] %= mod;
}
cout << dp[s];
}
| delete | 14 | 16 | 14 | 14 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F(i, a, n) for (int i = a; i < n; i++)
#define mod 1000000007
#define pb push_back
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int w = 1;
// cin>>w;
while (w--) {
long long n;
cin >> n;
vector<ll> v(n + 1, 0);
v[0] = 1;
v[3] = 1;
v[4] = 1;
v[5] = 1;
F(i, 6, n + 1) {
F(j, 3, i + 1) {
if (i - j >= 0)
v[i] = (v[i] % mod + v[i - j] % mod) % mod;
}
}
cout << v[n];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F(i, a, n) for (int i = a; i < n; i++)
#define mod 1000000007
#define pb push_back
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int w = 1;
// cin>>w;
while (w--) {
long long n;
cin >> n;
vector<ll> v(2005, 0);
v[0] = 1;
v[3] = 1;
v[4] = 1;
v[5] = 1;
F(i, 6, n + 1) {
F(j, 3, i + 1) {
if (i - j >= 0)
v[i] = (v[i] % mod + v[i - j] % mod) % mod;
}
}
cout << v[n];
}
return 0;
} | replace | 18 | 19 | 18 | 19 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#define ll long long int
#define ld long double
#define pb push_back
#define endl "\n"
#define mp make_pair
#define sz(v) (int)(v.size())
#define len(s) (int)(s.length())
#define M (ll)(1e9 + 7)
#define all(v) v.begin(), v.end()
#define fr(a, b, c) for (ll i = a; i <= b; i += c)
#define inarr(arr, n) \
; \
for (ll i = 0; i < n; i++) \
cin >> arr[i];
#define outarr(arr, n) \
; \
for (ll i = 0; i < n; i++) \
cout << arr[i] << " ";
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll inf = 9e18;
const ld pi = 2 * acos(0.0);
using namespace std;
ll power(ll a, ll n) {
if (n == 0) {
return 1;
}
ll p = power(a, n / 2) % M;
p = (p * p) % M;
if (n % 2 == 1) {
p = (p * a) % M;
}
return p;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
const int N = 1e6;
vector<ll> sieve(N, 0);
void si() {
sieve[1] = 1;
for (int i = 2; i < N; i++) {
if (sieve[i] == 0) {
for (int j = i; j < N; j += i) {
sieve[j] = i;
}
}
}
}
int main() {
ios;
vector<ll> fact(4005, 0);
fact[0] = 1;
for (ll i = 1; i <= 4005; i++) {
fact[i] = (fact[i - 1] * i) % M;
}
ll s;
cin >> s;
ll ans = 0;
for (ll i = 1; i <= 666; i++) {
ll z = 3 * i;
ll n = s - z;
if (n < 0) {
break;
}
ll k = fact[n + i - 1];
ll div1 = power(fact[i - 1], M - 2) % M;
ll div2 = power(fact[n], M - 2) % M;
ll add = (((k * div1) % M) * div2) % M;
ans += add;
ans = ans % M;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#define ll long long int
#define ld long double
#define pb push_back
#define endl "\n"
#define mp make_pair
#define sz(v) (int)(v.size())
#define len(s) (int)(s.length())
#define M (ll)(1e9 + 7)
#define all(v) v.begin(), v.end()
#define fr(a, b, c) for (ll i = a; i <= b; i += c)
#define inarr(arr, n) \
; \
for (ll i = 0; i < n; i++) \
cin >> arr[i];
#define outarr(arr, n) \
; \
for (ll i = 0; i < n; i++) \
cout << arr[i] << " ";
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const ll inf = 9e18;
const ld pi = 2 * acos(0.0);
using namespace std;
ll power(ll a, ll n) {
if (n == 0) {
return 1;
}
ll p = power(a, n / 2) % M;
p = (p * p) % M;
if (n % 2 == 1) {
p = (p * a) % M;
}
return p;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
const int N = 1e6;
vector<ll> sieve(N, 0);
void si() {
sieve[1] = 1;
for (int i = 2; i < N; i++) {
if (sieve[i] == 0) {
for (int j = i; j < N; j += i) {
sieve[j] = i;
}
}
}
}
int main() {
ios;
vector<ll> fact(4005, 0);
fact[0] = 1;
for (ll i = 1; i <= 4000; i++) {
fact[i] = (fact[i - 1] * i) % M;
}
ll s;
cin >> s;
ll ans = 0;
for (ll i = 1; i <= 666; i++) {
ll z = 3 * i;
ll n = s - z;
if (n < 0) {
break;
}
ll k = fact[n + i - 1];
ll div1 = power(fact[i - 1], M - 2) % M;
ll div2 = power(fact[n], M - 2) % M;
ll add = (((k * div1) % M) * div2) % M;
ans += add;
ans = ans % M;
}
cout << ans << endl;
return 0;
} | replace | 60 | 61 | 60 | 61 | -6 | double free or corruption (!prev)
|
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
for (ll i = 4; i <= n; i++) {
dp[i] = 1;
for (ll j = 3; j <= i - 3; j++) {
dp[i] += dp[j];
dp[i] %= MOD;
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
ll dp[2001];
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
for (ll i = 4; i <= n; i++) {
dp[i] = 1;
for (ll j = 3; j <= i - 3; j++) {
dp[i] += dp[j];
dp[i] %= MOD;
}
}
cout << dp[n];
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(X, N) for (ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(), (V).end()
#define endl "\n"
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
assert(b != 0);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
class ModInt {
int _mod;
long long x;
public:
ModInt() {}
ModInt(long long _x, int m) {
_mod = m;
x = _x % m;
if (x < 0)
x += m;
}
int val() { return (int)x; }
int mod() { return _mod; }
ModInt &operator++() {
x++;
if (x == _mod)
x = 0;
return *this;
}
ModInt &operator--() {
if (x == 0)
x = _mod;
x--;
return *this;
}
ModInt &operator+=(const ModInt &rhs) {
x += rhs.x;
if (x >= _mod)
x -= _mod;
return *this;
}
ModInt &operator-=(const ModInt &rhs) {
x -= rhs.x;
if (x < 0)
x += _mod;
return *this;
}
ModInt &operator*=(const ModInt &rhs) {
x *= rhs.x;
if (x >= _mod)
x = x % _mod;
return *this;
}
ModInt operator+() const { return *this; }
ModInt operator-() const { return ModInt(-x, _mod); }
friend ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) += rhs;
}
friend ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) -= rhs;
}
friend ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) *= rhs;
}
ModInt pow(long long n) const {
if (n == 0) {
return ModInt(1, _mod);
} else if (n % 2 == 1) {
ModInt tmp = pow((n - 1) / 2);
return tmp * tmp * ModInt(x, _mod);
} else {
ModInt tmp = pow(n / 2);
return tmp * tmp;
}
}
ModInt inv() const {
assert(gcd(x, _mod) == 1);
assert(_mod >= 2);
return pow(_mod - 2);
}
ModInt &operator/=(const ModInt &rhs) {
return (*this) = (*this) * rhs.inv();
}
friend ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) /= rhs;
}
friend bool operator==(const ModInt &lhs, const ModInt &rhs) {
return lhs.x == rhs.x;
}
friend bool operator!=(const ModInt &lhs, const ModInt &rhs) {
return lhs.x != rhs.x;
}
};
class ModIntGen {
int modn;
public:
ModIntGen() {}
ModIntGen(int n) {
assert(0 < n && n < INT_MAX);
modn = n;
}
ModInt g(long long x) { return ModInt(x, modn); }
};
int main() {
int s;
cin >> s;
ModIntGen mg(MODN);
vector<ModInt> fact(s + s);
fact[0] = mg.g(1);
for (int i = 1; i <= s + s; i++) {
fact[i] = fact[i - 1] * mg.g(i);
}
ModInt ans = mg.g(0);
for (int i = 1; i <= s; i++) {
int rest = s - i * 3;
if (rest < 0)
continue;
ans += fact[rest + i - 1] / fact[rest] / fact[i - 1];
}
cout << ans.val() << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(X, N) for (ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(), (V).end()
#define endl "\n"
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
assert(b != 0);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
class ModInt {
int _mod;
long long x;
public:
ModInt() {}
ModInt(long long _x, int m) {
_mod = m;
x = _x % m;
if (x < 0)
x += m;
}
int val() { return (int)x; }
int mod() { return _mod; }
ModInt &operator++() {
x++;
if (x == _mod)
x = 0;
return *this;
}
ModInt &operator--() {
if (x == 0)
x = _mod;
x--;
return *this;
}
ModInt &operator+=(const ModInt &rhs) {
x += rhs.x;
if (x >= _mod)
x -= _mod;
return *this;
}
ModInt &operator-=(const ModInt &rhs) {
x -= rhs.x;
if (x < 0)
x += _mod;
return *this;
}
ModInt &operator*=(const ModInt &rhs) {
x *= rhs.x;
if (x >= _mod)
x = x % _mod;
return *this;
}
ModInt operator+() const { return *this; }
ModInt operator-() const { return ModInt(-x, _mod); }
friend ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) += rhs;
}
friend ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) -= rhs;
}
friend ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) *= rhs;
}
ModInt pow(long long n) const {
if (n == 0) {
return ModInt(1, _mod);
} else if (n % 2 == 1) {
ModInt tmp = pow((n - 1) / 2);
return tmp * tmp * ModInt(x, _mod);
} else {
ModInt tmp = pow(n / 2);
return tmp * tmp;
}
}
ModInt inv() const {
assert(gcd(x, _mod) == 1);
assert(_mod >= 2);
return pow(_mod - 2);
}
ModInt &operator/=(const ModInt &rhs) {
return (*this) = (*this) * rhs.inv();
}
friend ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
return ModInt(lhs) /= rhs;
}
friend bool operator==(const ModInt &lhs, const ModInt &rhs) {
return lhs.x == rhs.x;
}
friend bool operator!=(const ModInt &lhs, const ModInt &rhs) {
return lhs.x != rhs.x;
}
};
class ModIntGen {
int modn;
public:
ModIntGen() {}
ModIntGen(int n) {
assert(0 < n && n < INT_MAX);
modn = n;
}
ModInt g(long long x) { return ModInt(x, modn); }
};
int main() {
int s;
cin >> s;
ModIntGen mg(MODN);
vector<ModInt> fact(s + s + 1);
fact[0] = mg.g(1);
for (int i = 1; i <= s + s; i++) {
fact[i] = fact[i - 1] * mg.g(i);
}
ModInt ans = mg.g(0);
for (int i = 1; i <= s; i++) {
int rest = s - i * 3;
if (rest < 0)
continue;
ans += fact[rest + i - 1] / fact[rest] / fact[i - 1];
}
cout << ans.val() << endl;
return 0;
}
| replace | 147 | 148 | 147 | 148 | -6 | malloc(): corrupted top size
|
p02555 | C++ | Runtime Error | #include <iostream>
#include <vector>
typedef long long ll;
const ll m = 1e9 + 7;
int main(int argc, char **argv) {
int S;
std::cin >> S;
std::vector<ll> A(S + 1, 0);
A[3] = 1;
for (int i = 4; i < S + 1; i++) {
A[i] = A[i - 3] + A[i - 1];
A[i] %= m;
}
std::cout << A[S] << std::endl;
} | #include <iostream>
#include <vector>
typedef long long ll;
const ll m = 1e9 + 7;
int main(int argc, char **argv) {
int S;
std::cin >> S;
std::vector<ll> A(2001, 0);
A[3] = 1;
for (int i = 4; i < S + 1; i++) {
A[i] = A[i - 3] + A[i - 1];
A[i] %= m;
}
std::cout << A[S] << std::endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long int dp[2005];
int main() {
int s;
scanf("%d", &s);
dp[0] = 1;
dp[1] = dp[2] = 0;
for (int a = 0; a <= s; a++) {
for (int b = 3; b <= s; b++) {
(dp[a + b] += dp[a]) %= mod;
}
}
printf("%lld ", dp[s]);
}
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long int dp[2005];
int main() {
int s;
scanf("%d", &s);
dp[0] = 1;
dp[1] = dp[2] = 0;
for (int a = 0; a <= s; a++) {
for (int b = 3; b <= s; b++) {
if (a + b <= s)
(dp[a + b] += dp[a]) %= mod;
}
}
printf("%lld ", dp[s]);
}
| replace | 13 | 14 | 13 | 15 | 0 | |
p02555 | C++ | Runtime Error | /*/ Author: KaySeeKay /*/
#include <bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for (int i = 0; i < n; i++)
#define fn1 for (int i = 1; i <= n; i++)
#define fm for (int j = 0; j < m; j++)
#define fm1 for (int j = 1; j <= m; j++)
#define fi first
#define se second
#define endl '\n'
#define PI 3.14159265358979323846
#define MOD 1000000007
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
const int N = 2e6 + 5;
const int INF = 1e18L;
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/*/-----------------------------Debug
* begins----------------------------------/*/
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
template <typename T, typename... Args> inline string arrStr(T arr, int n) {
stringstream s;
s << "[";
for (int i = 0; i < n - 1; i++)
s << arr[i] << ",";
s << arr[n - 1] << "]";
return s.str();
}
#define trace(args...) \
{ \
__trace_begin(__LINE__); \
__trace(split(#args, ',').begin(), args); \
}
inline void __trace_begin(int line) { cerr << "#" << line << ": "; }
template <typename T> inline void __trace_out_var(vector<T> val) {
cerr << arrStr(val, val.size());
}
template <typename T> inline void __trace_out_var(T *val) {
cerr << arrStr(val, 10);
}
template <typename T> inline void __trace_out_var(T val) { cerr << val; }
inline void __trace(vector<string>::iterator it) { cerr << endl; }
template <typename T, typename... Args>
inline void __trace(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
__trace_out_var(a);
cerr << "; ";
__trace(++it, args...);
}
/*/-----------------------------Code begins----------------------------------/*/
int ar[N];
int dp[N];
inline int add(int x, int y, int mod) {
if (y >= mod)
y %= mod;
if (x >= mod)
x %= mod;
x += y;
return (x >= mod ? x - mod : x);
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int T = 1;
// cin >> T;
while (T--) {
int n;
cin >> n;
vector<int> v;
dp[0] = 1;
for (int i = 3; i <= n; i++) {
v.pb(i);
}
int m = v.size();
for (int j = 1; j <= n; j++) {
for (int i = 0; i < m; i++) {
dp[j] = add(dp[j], dp[j - v[i]], MOD);
}
}
cout << dp[n];
}
return 0;
} | /*/ Author: KaySeeKay /*/
#include <bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for (int i = 0; i < n; i++)
#define fn1 for (int i = 1; i <= n; i++)
#define fm for (int j = 0; j < m; j++)
#define fm1 for (int j = 1; j <= m; j++)
#define fi first
#define se second
#define endl '\n'
#define PI 3.14159265358979323846
#define MOD 1000000007
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
const int N = 2e6 + 5;
const int INF = 1e18L;
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/*/-----------------------------Debug
* begins----------------------------------/*/
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
template <typename T, typename... Args> inline string arrStr(T arr, int n) {
stringstream s;
s << "[";
for (int i = 0; i < n - 1; i++)
s << arr[i] << ",";
s << arr[n - 1] << "]";
return s.str();
}
#define trace(args...) \
{ \
__trace_begin(__LINE__); \
__trace(split(#args, ',').begin(), args); \
}
inline void __trace_begin(int line) { cerr << "#" << line << ": "; }
template <typename T> inline void __trace_out_var(vector<T> val) {
cerr << arrStr(val, val.size());
}
template <typename T> inline void __trace_out_var(T *val) {
cerr << arrStr(val, 10);
}
template <typename T> inline void __trace_out_var(T val) { cerr << val; }
inline void __trace(vector<string>::iterator it) { cerr << endl; }
template <typename T, typename... Args>
inline void __trace(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
__trace_out_var(a);
cerr << "; ";
__trace(++it, args...);
}
/*/-----------------------------Code begins----------------------------------/*/
int ar[N];
int dp[N];
inline int add(int x, int y, int mod) {
if (y >= mod)
y %= mod;
if (x >= mod)
x %= mod;
x += y;
return (x >= mod ? x - mod : x);
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int T = 1;
// cin >> T;
while (T--) {
int n;
cin >> n;
vector<int> v;
dp[0] = 1;
for (int i = 3; i <= n; i++) {
v.pb(i);
}
int m = v.size();
for (int j = 1; j <= n; j++) {
for (int i = 0; i < m; i++) {
if (j - v[i] >= 0)
dp[j] = add(dp[j], dp[j - v[i]], MOD);
}
}
cout << dp[n];
}
return 0;
} | replace | 98 | 99 | 98 | 100 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02555 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo - r(ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
// #define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n, k) ((n >> k) & 1)
#define lg length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
ll pom(ll a, ll n, int m) {
ll x = 1;
for (a %= m; n; n /= 2)
n & 1 ? x = x * a % m : 0, a = a * a % m;
return x;
}
#define invp(a, p) pom(a, p - 2, p)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp1(pair<Pll, ll> a, pair<Pll, ll> b) { return a.fi.se > b.fi.se; }
ll cmp2(pair<ll, ll> a, pair<ll, ll> b) {
if (a.fi != b.fi)
return a.se < b.se;
else
return a.se > b.se;
}
//----------------------------------------------------------------------
ll color[2002][2002];
ll rres[2001];
ll dfs(ll i, ll n, ll s) {
if (color[i][n] >= 0)
return color[i][n];
ll res = n + i;
ll tmp = 0;
if (res == s)
return 1;
else if (res > s - 3 && res < s)
return 0;
else if (res > s)
return 0;
if (res >= s - res) {
return rres[s - res];
}
for (ll j = 3; j <= s; j++) {
if (res + j > s)
break;
if (res + j == s - 1)
continue;
if (res + j == s - 2)
continue;
tmp += dfs(j, res, s);
tmp %= mod;
}
color[i][n] = tmp;
return tmp;
}
//----------------------------------------------------------------------
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
// ll begin_t=clock();
// freopen("big.txt", "r", stdin);
// freopen("out3.txt", "w", stdout);
//------------------------------
ll s;
cin >> s;
ll is = s;
if (s < 3) {
cout << 0 << endl;
return 0;
}
for (ll i = 3; i <= s; i++) {
ll aans = 0;
for (ll y = 0; y <= i; y++) {
for (ll j = 0; j <= i; j++) {
color[y][j] = -1;
}
}
for (ll k = 3; k <= i; k++) {
aans += dfs(k, 0, i);
aans %= mod;
}
rres[i] = aans;
if (i == s)
cout << rres[i] << endl;
}
//------------------------------
// fclose(stdin);
// fclose(stdout);
// ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
//-------------------------------
return 0;
}
//----------------------------------------------------------------------
| #pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo - r(ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
// #define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n, k) ((n >> k) & 1)
#define lg length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
ll pom(ll a, ll n, int m) {
ll x = 1;
for (a %= m; n; n /= 2)
n & 1 ? x = x * a % m : 0, a = a * a % m;
return x;
}
#define invp(a, p) pom(a, p - 2, p)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp1(pair<Pll, ll> a, pair<Pll, ll> b) { return a.fi.se > b.fi.se; }
ll cmp2(pair<ll, ll> a, pair<ll, ll> b) {
if (a.fi != b.fi)
return a.se < b.se;
else
return a.se > b.se;
}
//----------------------------------------------------------------------
ll color[2002][2002];
ll rres[2001];
ll dfs(ll i, ll n, ll s) {
if (color[i][n] >= 0)
return color[i][n];
ll res = n + i;
ll tmp = 0;
if (res == s)
return 1;
else if (res > s - 3 && res < s)
return 0;
else if (res > s)
return 0;
return rres[s - res];
for (ll j = 3; j <= s; j++) {
if (res + j > s)
break;
if (res + j == s - 1)
continue;
if (res + j == s - 2)
continue;
tmp += dfs(j, res, s);
tmp %= mod;
}
color[i][n] = tmp;
return tmp;
}
//----------------------------------------------------------------------
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
// ll begin_t=clock();
// freopen("big.txt", "r", stdin);
// freopen("out3.txt", "w", stdout);
//------------------------------
ll s;
cin >> s;
ll is = s;
if (s < 3) {
cout << 0 << endl;
return 0;
}
for (ll i = 3; i <= s; i++) {
ll aans = 0;
for (ll y = 0; y <= i; y++) {
for (ll j = 0; j <= i; j++) {
color[y][j] = -1;
}
}
for (ll k = 3; k <= i; k++) {
aans += dfs(k, 0, i);
aans %= mod;
}
rres[i] = aans;
if (i == s)
cout << rres[i] << endl;
}
//------------------------------
// fclose(stdin);
// fclose(stdout);
// ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
//-------------------------------
return 0;
}
//----------------------------------------------------------------------
| replace | 97 | 100 | 97 | 99 | TLE | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s;
const int MOD = 1e9 + 7;
cin >> s;
vector<int> dp(s, 0);
dp[0] = 1;
for (int i = 3; i <= s; i++)
for (int j = 3; j <= i; j++)
dp[i] = (dp[i] + dp[i - j]) % MOD;
cout << dp[s] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s;
const int MOD = 1e9 + 7;
cin >> s;
vector<int> dp(s + 1, 0);
dp[0] = 1;
for (int i = 3; i <= s; i++)
for (int j = 3; j <= i; j++)
dp[i] = (dp[i] + dp[i - j]) % MOD;
cout << dp[s] << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll s;
cin >> s;
ll dp[s + 1], cum[s + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
cum[0] = 0;
cum[1] = 0;
cum[2] = 0;
cum[3] = 1;
for (int i = 4; i <= s; i++) {
dp[i] = (cum[i - 3] + 1) % mod;
cum[i] = (cum[i - 1] + dp[i]) % mod;
}
cout << dp[s] % mod << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll s;
cin >> s;
ll dp[s + 2], cum[s + 2];
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
cum[0] = 0;
cum[1] = 0;
cum[2] = 0;
cum[3] = 1;
for (int i = 4; i <= s; i++) {
dp[i] = (cum[i - 3] + 1) % mod;
cum[i] = (cum[i - 1] + dp[i]) % mod;
}
cout << dp[s] % mod << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02555 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma region // {{{
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define rep(i, begin, end) \
for (int64_t i{begin}, i##_end{end}; i < i##_end; ++i)
#define repc(i, begin, last) \
for (int64_t i{begin}, i##_last{last}; i <= i##_last; ++i)
#define repr(i, begin, last) \
for (int64_t i{begin}, i##_last{last}; i >= i##_last; --i)
#define let const auto
using i64 = std::int64_t;
using u64 = std::uint64_t;
constexpr int32_t INF = 0x3f3f3f3f;
constexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;
void ioSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(11);
std::cerr << std::fixed << std::setprecision(11);
std::clog << std::fixed << std::setprecision(11);
}
template <class T> std::istream &operator,(std::istream &is, T &rhs) {
return is >> rhs;
}
#define var(type, ...) \
type __VA_ARGS__; \
std::cin >> __VA_ARGS__
inline void println() { std::cout << '\n'; }
template <class Head, class... Tail>
inline void println(Head &&head, Tail &&...tail) {
std::cout << head << " " + (!sizeof...(tail));
println(std::forward<Tail>(tail)...);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
#pragma endregion // }}}
constexpr int MOD = int(1e9) + 7;
// constexpr int MOD = 998244353;
i64 S;
i64 dp(int i, int sum) {
if (sum == S)
return 1;
if (sum > S)
return 0;
i64 ret = 0;
repc(a, 3, S - sum) { ret += dp(i + 1, int(sum + a)); }
return ret;
}
signed main() {
ioSetup();
cin >> S;
/* println(dp(0, 0)); */
vector<vector<i64>> dp(S, vector<i64>(S + 5, 0));
rep(i, 0, S) { dp[i][S] = 1; }
repr(i, S / 3, 0) {
repr(j, S - 1, 0) { (dp[i + 1][j] += dp[i + 1][j + 1]) %= MOD; }
rep(j, 0, S) { dp[i][j] = dp[i + 1][j + 3]; }
}
println(dp[0][0]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#pragma region // {{{
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define rep(i, begin, end) \
for (int64_t i{begin}, i##_end{end}; i < i##_end; ++i)
#define repc(i, begin, last) \
for (int64_t i{begin}, i##_last{last}; i <= i##_last; ++i)
#define repr(i, begin, last) \
for (int64_t i{begin}, i##_last{last}; i >= i##_last; --i)
#define let const auto
using i64 = std::int64_t;
using u64 = std::uint64_t;
constexpr int32_t INF = 0x3f3f3f3f;
constexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;
void ioSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(11);
std::cerr << std::fixed << std::setprecision(11);
std::clog << std::fixed << std::setprecision(11);
}
template <class T> std::istream &operator,(std::istream &is, T &rhs) {
return is >> rhs;
}
#define var(type, ...) \
type __VA_ARGS__; \
std::cin >> __VA_ARGS__
inline void println() { std::cout << '\n'; }
template <class Head, class... Tail>
inline void println(Head &&head, Tail &&...tail) {
std::cout << head << " " + (!sizeof...(tail));
println(std::forward<Tail>(tail)...);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
#pragma endregion // }}}
constexpr int MOD = int(1e9) + 7;
// constexpr int MOD = 998244353;
i64 S;
i64 dp(int i, int sum) {
if (sum == S)
return 1;
if (sum > S)
return 0;
i64 ret = 0;
repc(a, 3, S - sum) { ret += dp(i + 1, int(sum + a)); }
return ret;
}
signed main() {
ioSetup();
cin >> S;
if (S == 1) {
println(0);
return 0;
}
vector<vector<i64>> dp(S, vector<i64>(S + 5, 0));
rep(i, 0, S) { dp[i][S] = 1; }
repr(i, S / 3, 0) {
repr(j, S - 1, 0) { (dp[i + 1][j] += dp[i + 1][j + 1]) %= MOD; }
rep(j, 0, S) { dp[i][j] = dp[i + 1][j + 3]; }
}
println(dp[0][0]);
return 0;
}
| replace | 74 | 75 | 74 | 78 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.