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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02792 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#ifndef M_PI
#define M_PI 3.14159265... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#ifndef M_PI
#define M_PI 3.14159265... | replace | 37 | 39 | 37 | 41 | 0 | |
p02792 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Rishabhdeep Singh
*/
// doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.h... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Rishabhdeep Singh
*/
// doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.h... | replace | 106 | 112 | 106 | 109 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<vector<int>> kazu(10, vector<int>(10));
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
kazu[i][j] = 0;
}
}
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<vector<int>> kazu(10, vector<int>(10));
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
kazu[i][j] = 0;
}
}
for (int k = 1; k <= n; k++) {
string moji;
mo... | replace | 13 | 26 | 13 | 19 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | replace | 81 | 82 | 81 | 82 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
const long long mod = 1000000007;
#define dump(x) \
if (dbg) { \
cout << #x << " = " << (x) << endl; ... | #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
const long long mod = 1000000007;
#define dump(x) \
if (dbg) { \
cout << #x << " = " << (x) << endl; ... | replace | 28 | 40 | 28 | 32 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define debug(x) cout << #x << " = " << x << endl
#define print(x) cout << x << endl;
int main() {
int N;
cin >> N;
vector<vector<ll>> table(9, vector<ll>(9, 0));
ll n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define debug(x) cout << #x << " = " << x << endl
#define print(x) cout << x << endl;
int main() {
int N;
cin >> N;
vector<vector<ll>> table(9, vector<ll>(9, 0));
ll n... | insert | 19 | 19 | 19 | 22 | -6 | munmap_chunk(): invalid pointer
|
p02792 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> count(10, vector<int>(10, 0));
for (int i = 1; i <= N; i++) {
int a = i % 10;
int b = i;
while (b > 10) {
b /= 10;
}
count[a][b]++;
}
long long ans = 0;
for (int i = 1; i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> count(10, vector<int>(10, 0));
for (int i = 1; i <= N; i++) {
int a = i % 10;
int b = i;
while (b >= 10) {
b /= 10;
}
count[a][b]++;
}
long long ans = 0;
for (int i = 1; ... | replace | 11 | 12 | 11 | 12 | -6 | munmap_chunk(): invalid pointer
|
p02792 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | replace | 134 | 149 | 134 | 143 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define print(x) cout << x << endl
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll MOD = 1000000007;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define print(x) cout << x << endl
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll MOD = 1000000007;
int main(... | replace | 16 | 17 | 16 | 17 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | replace | 371 | 373 | 371 | 374 | 0 | |
p02792 | C++ | Time Limit Exceeded | /*
Template from @50m_regent
https://note.mu/50m_regent/n/na84b255e8679
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INIT \
cin.tie(0); ... | /*
Template from @50m_regent
https://note.mu/50m_regent/n/na84b255e8679
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INIT \
cin.tie(0); ... | replace | 226 | 239 | 226 | 233 | TLE | |
p02792 | C++ | Runtime Error | /*
Name:
Author: xiaruize
Date:
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ll long long
#define form(i, j, n) for (int i = int(j); i <= int(n); i++)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pi... | /*
Name:
Author: xiaruize
Date:
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ll long long
#define form(i, j, n) for (int i = int(j); i <= int(n); i++)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pi... | replace | 34 | 35 | 34 | 35 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
ll int aditya(ll int x) {
while (x / 10 > 0) {
x /= 10;
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt",... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
ll int aditya(ll int x) {
while (x / 10 > 0) {
x /= 10;
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll int c[10][10];
memset(c, 0, sizeof(... | delete | 17 | 21 | 17 | 17 | 0 | |
p02792 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | replace | 177 | 178 | 177 | 178 | 0 | |
p02792 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | replace | 150 | 171 | 150 | 172 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull firstDigit(ull n) {
while (n >= 10)
n /= 10;
return n;
}
int lastDigit(int n) { return (n % 10); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<vector<ull>> arr = vector<vector<ull>>(n ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull firstDigit(ull n) {
while (n >= 10)
n /= 10;
return n;
}
int lastDigit(int n) { return (n % 10); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<vector<ull>> arr = vector<vector<ull>>(10... | replace | 20 | 21 | 20 | 21 | 0 | |
p02792 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define FOR(i, a, b) for (lint i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define FOR(i, a, b) for (lint i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)... | insert | 39 | 39 | 39 | 41 | -6 | double free or corruption (out)
|
p02792 | C++ | Time Limit Exceeded | // 5/14
// 過去問ガリガリ
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dp[10][10];
int main() {
int N;
cin >> N;
for (int i = 1; i < 10; i++) {
for (int j = 1; ... | // 5/14
// 過去問ガリガリ
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dp[10][10];
int main() {
int N;
cin >> N;
memset(dp, 0, sizeof(dp));
// for (int i = 1; i ... | replace | 16 | 26 | 16 | 35 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m - 1; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define FILL2D(A, c) fill(A[0], A[0] + siz... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m - 1; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define FILL2D(A, c) fill(A[0], A[0] + siz... | replace | 89 | 90 | 89 | 90 | 0 | |
p02792 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cou... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cou... | replace | 82 | 83 | 82 | 86 | -6 | terminate called after throwing an instance of 'std::invalid_argument'
what(): stoi
|
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | replace | 167 | 168 | 167 | 168 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9 + 7;
P freq(int x) {
int a = x % 10;
int b;
while (x) {
b = x;
b /= 10;
}
return P(a, b);
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9 + 7;
P freq(int x) {
int a = x % 10;
int b;
while (x) {
b = x;
x /= 10;
}
return P(a, b);
}... | replace | 14 | 15 | 14 | 15 | TLE | |
p02793 | C++ | Time Limit Exceeded | /**
* @author: Mackenzie
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_w... | /**
* @author: Mackenzie
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_w... | replace | 55 | 56 | 55 | 56 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include "algorithm"
#include "cmath"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
const ll ... | #include "algorithm"
#include "cmath"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
const ll ... | replace | 33 | 34 | 33 | 34 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef... | replace | 244 | 259 | 244 | 256 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define emp emplace
#define ins insert
#define mp make_pair
#define mt make_tuple
#define sz(s) (int)s.size()
#define forp(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define emp emplace
#define ins insert
#define mp make_pair
#define mt make_tuple
#define sz(s) (int)s.size()
#define forp(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0... | replace | 113 | 114 | 113 | 114 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FILE
#define fr first
#define se second
using namespace std;
const long long N = 2e5 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
int n;
int a[N];
int cnt[N];
int pw(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) {
res = res * 1ll * a % m... | #include <bits/stdc++.h>
#define FILE
#define fr first
#define se second
using namespace std;
const long long N = 1e6 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
int n;
int a[N];
int cnt[N];
int pw(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) {
res = res * 1ll * a % m... | replace | 8 | 9 | 8 | 9 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
const int N = 1000009, MOD = 1000000007;
int n, a[N];
struct mint {
int val;
mint(int v = 0) {
val = v % MOD;
if (val < 0)
val += MOD;
}
static int mod_inv(int a, int m = M... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
const int N = 1000009, MOD = 1000000007;
int n, a[N];
struct mint {
int val;
mint(int v = 0) {
val = v % MOD;
if (val < 0)
val += MOD;
}
static int mod_inv(int a, int m = M... | replace | 113 | 114 | 113 | 114 | 0 | |
p02793 | C++ | Runtime Error | #include <iostream>
#define lim 100000
typedef long long ll;
using namespace std;
const long long M = 1e9 + 7;
ll p[lim];
ll _pow(ll no, ll p, ll m) {
ll ans = 1;
while (p != 0) {
if (p & 1)
ans = ans * no % m;
no = (no % m * no % m) % m;
p = p >> 1;
// cout<<ans<<endl;
// cout<<p<<endl;
... | #include <iostream>
#define lim 1000001
typedef long long ll;
using namespace std;
const long long M = 1e9 + 7;
ll p[lim];
ll _pow(ll no, ll p, ll m) {
ll ans = 1;
while (p != 0) {
if (p & 1)
ans = ans * no % m;
no = (no % m * no % m) % m;
p = p >> 1;
// cout<<ans<<endl;
// cout<<p<<endl;... | replace | 1 | 2 | 1 | 2 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 1e4 + 4;
const int V = 1e6;
int n, lim;
int a[N];
int mx[V + 4];
ll ans;
int prime[V + 4], tot;
bool vis[V + 4], has[V + 4];
int q[V + 4], cnt;
inline void linea... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 1e4 + 4;
const int V = 1e6;
int n, lim;
int a[N];
int mx[V + 4];
ll ans;
int prime[V + 4], tot;
bool vis[V + 4], has[V + 4];
int q[V + 4], cnt;
inline void linea... | replace | 69 | 72 | 69 | 77 | TLE | |
p02793 | Python | Time Limit Exceeded | from fractions import gcd
import sys
input = sys.stdin.buffer.readline
mod = 10**9 + 7
def modinv(a, mod):
return pow(a, mod - 2, mod)
n = int(input())
if n == 1:
print(1)
exit()
A = list(map(int, input().split()))
lcm = A[0]
for i in range(n):
g = gcd(lcm, A[i])
lcm = lcm * A[i] // g
ans = 0
f... | from fractions import gcd
import sys
input = sys.stdin.buffer.readline
mod = 10**9 + 7
def modinv(a, mod):
return pow(a, mod - 2, mod)
n = int(input())
if n == 1:
print(1)
exit()
A = list(map(int, input().split()))
lcm = A[0]
for i in range(n):
g = gcd(lcm, A[i])
lcm *= A[i] // g
ans = 0
for i ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02793 | Python | Time Limit Exceeded | from fractions import gcd
n = int(input())
aaa = list(map(int, input().split()))
MOD = 10**9 + 7
lcm = aaa[0]
for a in aaa[1:]:
lcm = lcm * a // gcd(lcm, a)
ans = 0
for a in aaa:
ans = (ans + lcm // a) % MOD
print(ans)
| from fractions import gcd
n = int(input())
aaa = list(map(int, input().split()))
MOD = 10**9 + 7
lcm = aaa[0]
for a in aaa[1:]:
lcm = lcm * a // gcd(lcm, a)
ans = sum(lcm // a for a in aaa) % MOD
print(ans)
| replace | 9 | 12 | 9 | 10 | TLE | |
p02793 | Python | Time Limit Exceeded | from collections import Counter
MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
... | from collections import Counter
MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
... | replace | 36 | 37 | 36 | 37 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespac... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespac... | insert | 36 | 36 | 36 | 41 | TLE | |
p02793 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | replace | 59 | 60 | 59 | 60 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
const int MOD = 1000000007;... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
const int MOD = 1000000007;... | insert | 41 | 41 | 41 | 43 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using PL = pair<ll, ll>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using PL = pair<ll, ll>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int... | insert | 60 | 60 | 60 | 66 | TLE | |
p02793 | C++ | Time Limit Exceeded | // This template was last modified on 1/20/2020.
// Define many functions and words.
// The functions I have defined start with a capital letter.
#include <bits/stdc++.h>
using namespace std;
// C++ words.
#define MOD 1000000007 // 998244353
typedef long long ll;
typedef vector<ll> vl;
typedef vector<double> vd;
typede... | // This template was last modified on 1/20/2020.
// Define many functions and words.
// The functions I have defined start with a capital letter.
#include <bits/stdc++.h>
using namespace std;
// C++ words.
#define MOD 1000000007 // 998244353
typedef long long ll;
typedef vector<ll> vl;
typedef vector<double> vd;
typede... | replace | 197 | 199 | 197 | 199 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
... | replace | 102 | 111 | 102 | 103 | TLE | |
p02793 | C++ | Runtime Error | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | replace | 290 | 291 | 290 | 291 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD (1000000007LL)
using namespace std;
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long ans = 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1)
e *= b;
e %= MOD;
return e;
}
long long inv(long long n) { return e... | #include <bits/stdc++.h>
#define MOD (1000000007LL)
using namespace std;
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long ans = 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1)
e *= b;
e %= MOD;
return e;
}
long long inv(long long n) { return e... | insert | 51 | 51 | 51 | 55 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
struct eratosthenes {
int n;
vector<int> f;
vector<pair<int, int>> primes;
eratosthenes(int n) : f(n + 1) {
ll i, j;
f[0] = f[1] = -1;
for (i = 2; i <= n; i++) {
if (!f[i]... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
struct eratosthenes {
int n;
vector<int> f;
vector<pair<int, int>> primes;
eratosthenes(int n) : f(n + 1) {
ll i, j;
f[0] = f[1] = -1;
for (i = 2; i <= n; i++) {
if (!f[i]... | insert | 90 | 90 | 90 | 94 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 10010, M = 100010, mod = 1e9 + 7;
int n;
int a[N], f[M]... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 10010, M = 1000010, mod = 1e9 + 7;
int n;
int a[N], f[M... | replace | 13 | 14 | 13 | 14 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll MAX = 10000 + 2;
const ll MOD = 1000000007;
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 < M... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll MAX = 1000000 + 2;
const ll MOD = 1000000007;
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 <... | replace | 5 | 6 | 5 | 6 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for... | #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>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for... | replace | 100 | 113 | 100 | 107 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-10; // 微調整用（EPSより小さいと0と判定など）
int ii() {
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-10; // 微調整用（EPSより小さいと0と判定など）
int ii() {
int ... | replace | 305 | 306 | 305 | 306 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct min... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct min... | replace | 87 | 88 | 87 | 88 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long mod = pow(10, 9) + 7;
long long pow_mod(long long a, long long b) {
if (b == 0)
return 1;
long long k = pow_mod(a, b / 2);
long long kk = k * k % mod;
if (b & 1) {
return kk * a % mod;
} else {
return kk;
}
}
int MA = pow(10, 6);
vector<boo... | #include <bits/stdc++.h>
using namespace std;
long long mod = pow(10, 9) + 7;
long long pow_mod(long long a, long long b) {
if (b == 0)
return 1;
long long k = pow_mod(a, b / 2);
long long kk = k * k % mod;
if (b & 1) {
return kk * a % mod;
} else {
return kk;
}
}
int MA = pow(10, 6);
vector<boo... | insert | 41 | 41 | 41 | 45 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | insert | 105 | 105 | 105 | 108 | TLE | |
p02793 | C++ | Runtime Error | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[1005], f[1000005], mod = 1e9 + 7;
int inv[1000005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
int t = a[i];
for (int j = 2; j * j <= a[i]; j++) {
if (t % j == 0) {
... | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[10005], f[1000005], mod = 1e9 + 7;
int inv[1000005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
int t = a[i];
for (int j = 2; j * j <= a[i]; j++) {
if (t % j == 0) {
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02793 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define repe(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define mst(a, b) memset((a), (b), sizeof(a))
#define gc() gutchar()
#define fi first
#define se second
usin... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define repe(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define mst(a, b) memset((a), (b), sizeof(a))
#define gc() gutchar()
#define fi first
#define se second
usin... | replace | 19 | 20 | 19 | 20 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | insert | 199 | 199 | 199 | 202 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = 1000001;
const double PI = acos(-1);
bitset<1000010> isprime;
vector<int> primos;
int v[maxn];
void... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = 1000001;
const double PI = acos(-1);
bitset<1000010> isprime;
vector<int> primos;
int v[maxn];
void... | insert | 61 | 61 | 61 | 66 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
typedef long long ll;
const int MOD = 1000000007;
ll a_n(ll a, ll n);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
map<int, int> lcm;
rep(i, n) {
map<int, int> prime =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
typedef long long ll;
const int MOD = 1000000007;
ll a_n(ll a, ll n);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
map<int, int> lcm;
rep(i, n) {
map<int, int> prime =... | replace | 26 | 27 | 26 | 27 | TLE | |
p02793 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int mod = 10... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int mod = 10... | replace | 98 | 99 | 98 | 99 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD 1000000007
#define int long long
using namespace std;
int n = 0;
int arr[10001];
map<int, int> mm[10001];
map<int, int> Map;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i... | #include <bits/stdc++.h>
#define MOD 1000000007
#define int long long
using namespace std;
int n = 0;
int arr[10001];
unordered_map<int, int> mm[10001];
unordered_map<int, int> Map;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for ... | replace | 7 | 9 | 7 | 9 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DIV 1000000007
#define MAX 1000001
long long inv[MAX];
int mypow(int x, int n) {
long long ret = 1, p;
int p2 = 1;
p = x;
while (1) {
if (n & p2)
ret *= p;
p *= p;
ret %= DIV;
p %= DIV;
p2 *= 2;
if (p2 > n)
break;
}
... | #include <bits/stdc++.h>
using namespace std;
#define DIV 1000000007
#define MAX 1000001
long long inv[MAX];
int mypow(int x, int n) {
long long ret = 1, p;
int p2 = 1;
p = x;
while (1) {
if (n & p2)
ret *= p;
p *= p;
ret %= DIV;
p %= DIV;
p2 *= 2;
if (p2 > n)
break;
}
... | replace | 83 | 84 | 83 | 84 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a[2000], b[2000], MOD = 1000000007, A, B, ans, d[1000], cnt;
map<ll, ll> mp;
vector<ll> v, so;
ll f(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2 == 0)
return f(x, y / 2) * f(x, y / 2) % MOD;
return x * f(x, y - ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a[10000], b[10000], MOD = 1000000007, A, B, ans, d[1000], cnt;
map<ll, ll> mp;
vector<ll> v, so;
ll f(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2 == 0)
return f(x, y / 2) * f(x, y / 2) % MOD;
return x * f(x, y ... | replace | 4 | 5 | 4 | 5 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int p = 1e9 + 7;
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
if (b % 2 == 1)
return (a * powmod(a, b - 1)) % p;
else {
ll x = powmod(a, b / 2);
return (x * x) % p;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int p = 1e9 + 7;
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
if (b % 2 == 1)
return (a * powmod(a, b - 1)) % p;
else {
ll x = powmod(a, b / 2);
return (x * x) % p;
}
... | replace | 36 | 39 | 36 | 59 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e4 + 5;
const int maxv = 1e6 + 1;
const int MOD = 1e9 + 7;
int n, t;
int A[N];
int p[maxv];
int cnt[maxv];
ll ans;
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e4 + 5;
const int maxv = 1e6 + 1;
const int MOD = 1e9 + 7;
int n, t;
int A[N];
int p[maxv];
int cnt[maxv];
ll ans;
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % ... | insert | 28 | 28 | 28 | 29 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (au... | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (au... | replace | 115 | 116 | 115 | 116 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (au... | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (au... | insert | 97 | 97 | 97 | 98 | TLE | |
p02793 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, mod = 1e9 + 7;
ll arr[N], arr2[N];
bool found[N] = {};
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
int n, mod = 1e9 + 7;
ll arr[N], arr2[N];
bool found[N] = {};
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
... | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
... | delete | 26 | 31 | 26 | 26 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cou... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cou... | insert | 174 | 174 | 174 | 175 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
... | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
... | delete | 26 | 31 | 26 | 26 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
vector<long long> primes;
void gen_primes() {
primes.push_back(2);
for (long long i = 3; i * i <= 1e6; i += 2) {
bool is_ok = true;
for (int j = 0; j < primes.size(); j++) {
if (i % primes[j] == 0) {
is_ok = false;... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
vector<long long> primes;
void gen_primes() {
primes.push_back(2);
for (long long i = 3; i * i <= 1e7; i += 2) {
bool is_ok = true;
for (int j = 0; j < primes.size(); j++) {
if (i % primes[j] == 0) {
is_ok = false;... | replace | 9 | 10 | 9 | 10 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | replace | 220 | 226 | 220 | 223 | TLE | |
p02793 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begi... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begi... | replace | 510 | 519 | 510 | 517 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const {... | replace | 137 | 138 | 137 | 138 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll spf[1000005], hell = pow(10, 9) + 7, res;
map<ll, ll> m;
ll exp(ll x, ll y) {
ll res = 1;
x %= hell;
while (y > 0) {
if (y & 1)
res = (res * x) % hell;
y >>= 1;
x = (x * x) % hell;
}
return res;
}
int main() {
ios_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll spf[1000005], hell = pow(10, 9) + 7, res;
map<ll, ll> m;
ll exp(ll x, ll y) {
ll res = 1;
x %= hell;
while (y > 0) {
if (y & 1)
res = (res * x) % hell;
y >>= 1;
x = (x * x) % hell;
}
return res;
}
int main() {
ios_b... | insert | 28 | 28 | 28 | 31 | 0 | |
p02793 | C++ | Time Limit Exceeded | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#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 repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R... | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#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 repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R... | replace | 232 | 243 | 232 | 249 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(... | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(... | replace | 93 | 94 | 93 | 94 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const int MAX_N = 2000005;
const long long MOD = 1000000007;
int n;
long long ans;
int arr[MAX_N];
std::map<int, int> mp;
void update(int val) {
int d, exp;
d = 2;
while (d * d <= val) {
exp = 0;
while (val % d == 0) {
++exp;
val /= d;
}
if (exp > 0) {
... | #include <bits/stdc++.h>
const int MAX_N = 2000005;
const long long MOD = 1000000007;
int n;
long long ans;
int arr[MAX_N];
std::unordered_map<int, int> mp;
void update(int val) {
int d, exp;
d = 2;
while (d * d <= val) {
exp = 0;
while (val % d == 0) {
++exp;
val /= d;
}
if (exp... | replace | 11 | 12 | 11 | 12 | TLE | |
p02793 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL... | replace | 182 | 184 | 182 | 184 | 0 | |
p02793 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define ... | replace | 166 | 168 | 166 | 168 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
vector<ll> calc_primes(ll n) {
vector<ll> primes;
vector<bool> filtered(n + 1);
for (ll i = 2; i <= n; i++) {
filtered[i] = false;
}
for (ll i = 2; i <= n; i++) {
if (!filtered[i]) {
primes.push_back(i);
for (l... | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
vector<ll> calc_primes(ll n) {
vector<ll> primes;
vector<bool> filtered(n + 1);
for (ll i = 2; i <= n; i++) {
filtered[i] = false;
}
for (ll i = 2; i <= n; i++) {
if (!filtered[i]) {
primes.push_back(i);
for (l... | replace | 56 | 57 | 56 | 57 | TLE | |
p02793 | C++ | Time Limit Exceeded | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 130 | 131 | 130 | 131 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define maxnkp make_pair
#define fi first
#define se second
#define eps 1e-6
using namespace std;
typedef long long l... | #include <bits/stdc++.h>
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define maxnkp make_pair
#define fi first
#define se second
#define eps 1e-6
using namespace std;
typedef long long l... | replace | 37 | 38 | 37 | 38 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
int main() {
ll n;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
int main() {
ll n;
c... | replace | 30 | 31 | 30 | 31 | TLE | |
p02793 | Python | Runtime Error | def lcm(a, b):
from math import gcd
return a // gcd(a, b) * b
def main():
_ = int(input())
a = list(map(int, input().split()))
x = 1
for e in a:
x = lcm(x, e)
ans = 0
for e in a:
ans += x // e
print(ans % int(1e9 + 7))
main()
| def lcm(a, b):
from fractions import gcd
return a // gcd(a, b) * b
def main():
_ = int(input())
a = list(map(int, input().split()))
x = 1
for e in a:
x = lcm(x, e)
ans = 0
for e in a:
ans += x // e
print(ans % int(1e9 + 7))
main()
| replace | 1 | 2 | 1 | 2 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb pus... | insert | 220 | 220 | 220 | 221 | TLE | |
p02793 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#define REP(i, x, y) for (ll i = (x); i < (y); i++)
#define RREP(i, x, y) for (ll i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#define REP(i, x, y) for (ll i = (x); i < (y); i++)
#define RREP(i, x, y) for (ll i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// ... | insert | 123 | 123 | 123 | 127 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// const ll mod = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// const ll mod = ... | replace | 164 | 171 | 164 | 167 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
fo... | #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
fo... | replace | 104 | 107 | 104 | 113 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define de(x) cout << #x << "=" << x << endl;
template <class T> boo... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define de(x) cout << #x << "=" << x << endl;
template <class T> boo... | replace | 35 | 36 | 35 | 36 | 0 | |
p02793 | C++ | Runtime Error | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
wh... | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
wh... | replace | 57 | 58 | 57 | 58 | 0 | |
p02793 | C++ | Runtime Error | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
wh... | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
wh... | replace | 57 | 58 | 57 | 58 | 0 | |
p02793 | C++ | Time Limit Exceeded | /* lcm_prime.cpp
素因数分解の形で最小公倍数を求めるアルゴリズム
(オーバーフローする場合などに使える)
*/
#include <bits/stdc++.h>
using namespace std;
map<long long, int> prime_factor(long long n) { // 素因数分解
map<long long, int> ret;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n ... | /* lcm_prime.cpp
素因数分解の形で最小公倍数を求めるアルゴリズム
(オーバーフローする場合などに使える)
*/
#include <bits/stdc++.h>
using namespace std;
map<long long, int> prime_factor(long long n) { // 素因数分解
map<long long, int> ret;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n ... | replace | 115 | 125 | 115 | 119 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll gcd(ll x, ll y)... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll gcd(ll x, ll y)... | replace | 48 | 49 | 48 | 49 | TLE | |
p02793 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i ... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i ... | replace | 44 | 45 | 44 | 45 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = b; a <= c; a++)
#define per(a, b, c) for (int a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 0x3f3f3f3f
#define eps 1e-11
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = b; a <= c; a++)
#define per(a, b, c) for (int a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 0x3f3f3f3f
#define eps 1e-11
using namespace std;
typedef long long ll;
... | replace | 33 | 34 | 33 | 34 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | replace | 210 | 212 | 210 | 211 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 1e4 + 10;
long long n;
long long ans;
long long lca;
long long a[maxn];
long long alpha[maxn];
void in();
void solve();
void upd_lca(long long);
long long pwr(long long, long long);
void out();
int main() {
in();
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 1e6 + 10;
long long n;
long long ans;
long long lca;
long long a[maxn];
long long alpha[maxn];
void in();
void solve();
void upd_lca(long long);
long long pwr(long long, long long);
void out();
int main() {
in();
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define lli long long int
#define rep(i, a, b) for (i = a; i < b; i++)
#define M 1000000007
#define vll vector<long long int>
#define mll map<long long int, long long int>
#define pi 3.1415926535897932384626433832795028841971
using namespace std;
lli mpower(lli a, lli b, lli m) {
if (b == 0)... | #include <bits/stdc++.h>
#define lli long long int
#define rep(i, a, b) for (i = a; i < b; i++)
#define M 1000000007
#define vll vector<long long int>
#define mll map<long long int, long long int>
#define pi 3.1415926535897932384626433832795028841971
using namespace std;
lli mpower(lli a, lli b, lli m) {
if (b == 0)... | replace | 64 | 70 | 64 | 66 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | replace | 76 | 78 | 76 | 78 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | replace | 63 | 64 | 63 | 68 | TLE | |
p02794 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
vector<pll> abv[55];
ll mk[22];
ll dp[50][1 << 21];
ll i, j, k;
bool dfs(ll a, ll p, ... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
vector<pll> abv[55];
ll mk[55];
ll dp[55][1 << 21];
ll i, j, k;
bool dfs(ll a, ll p, ... | replace | 13 | 15 | 13 | 15 | -11 | |
p02794 | C++ | Runtime Error | #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 <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <... | #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 <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <... | replace | 35 | 37 | 35 | 37 | 0 | |
p02794 | C++ | Runtime Error | // QWsin
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, x, y) for (int i = x; i <= y; ++i)
#define out(i, u) for (int i = first[u]; i != -1; i = nxt[i])
#define repvc(i, vc) for (int i = 0, Sz = vc.size(); i < Sz; ++i)
using namespace std;
inline int read() {
char ch = ge... | // QWsin
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, x, y) for (int i = x; i <= y; ++i)
#define out(i, u) for (int i = first[u]; i != -1; i = nxt[i])
#define repvc(i, vc) for (int i = 0, Sz = vc.size(); i < Sz; ++i)
using namespace std;
inline int read() {
char ch = ge... | replace | 28 | 29 | 28 | 29 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.