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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long buf, n, ans;
cin >> n;
buf = 1;
std::vector<long long> vec;
while (buf <= n / 2) {
if (n % buf == 0) {
vec.push_back(n / buf + buf - 2);
// cout << n/buf;
// cout << " ";
// cout << buf;
// cout << " ";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long buf, n, ans;
cin >> n;
buf = 1;
std::vector<long long> vec;
while (buf <= sqrt(n)) {
if (n % buf == 0) {
vec.push_back(n / buf + buf - 2);
// cout << n/buf;
// cout << " ";
// cout << buf;
// cout << " ";
... | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define max 1e12
using namespace std;
int main() {
long long int n;
cin >> n;
long long int count = 0;
long long int min = max;
long long int j = 0;
for (long long int i = 1; i <= n / 2; i++) {
if (n % i == 0) {
j = n / i;
count = i + j - 2;
if (min > count)
... | #include <bits/stdc++.h>
#define max 1e12
using namespace std;
int main() {
long long int n;
cin >> n;
long long count = 0;
long long min = max;
long long j = 0;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
j = n / i;
count = i + j - 2;
if (min > count)
min = cou... | replace | 7 | 11 | 7 | 11 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
int main(void) {
ul n;
cin >> n;
ul ans = n - 1;
for (ul i = 0; i * i <= n; ++i) {
if (n % i != 0)
continue;
ans = min(ans, i + n / i - 2);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
int main(void) {
ul n;
cin >> n;
ul ans = n - 1;
for (ul i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
ans = min(ans, i + n / i - 2);
}
cout << ans << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | -8 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
string flag = "No";
int Max = pow(10, 6);
ll res = pow(10, 13);
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ll ans = n / i + i - 2;
res = min(res, ans);
}
}
cout << res << end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
string flag = "No";
int Max = pow(10, 6);
ll res = pow(10, 13);
for (int i = 1; i <= Max; i++) {
if (n % i == 0) {
ll ans = n / i + i - 2;
res = min(res, ans);
}
}
cout << res << endl;... | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main() {
ll n;
cin >> n;
int s = sqrt(n);
while (s--) {
if (n % s == 0) {
cout << s + (n / s) - 2 << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main() {
ll n;
cin >> n;
int s = sqrt(n) + 1;
while (s--) {
if (n % s == 0) {
cout << s + (n / s) - 2 << endl;
return 0;
}
}
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
stack<ll> S;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
S.push(i);
}
}
ll b = N / S.top();
cout << S.top() + b - 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
stack<ll> S;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
S.push(i);
}
}
ll b = N / S.top();
cout << S.top() + b - 2 << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
typedef vector<ii> vii;
typedef vector<ii> vpii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define Add1(a, b) ady[a].pb(b)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
typedef vector<ii> vii;
typedef vector<ii> vpii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define Add1(a, b) ady[a].pb(b)
#defi... | replace | 85 | 87 | 85 | 87 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | replace | 19 | 20 | 19 | 20 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
template <class T> void cout_vec(const vector<T> &vec1) {
rep(i, len(vec1)) { cout << vec1[i] << ' '; }
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
template <class T> void cout_vec(const vector<T> &vec1) {
rep(i, len(vec1)) { cout << vec1[i] << ' '; }
... | replace | 68 | 69 | 68 | 69 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
ll n;
cin >> n;
map<int, int> memo;
for (int i = 0; i <= sqrt(n); i++) {
if (n % i == 0)
memo[i]++;
}
ll ans = 1e13;
for (auto itr = memo.begi... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
ll n;
cin >> n;
map<int, int> memo;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)
memo[i]++;
}
ll ans = 1e13;
for (auto itr = memo.begi... | replace | 11 | 12 | 11 | 12 | -8 | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long n;
long i, mod, div, tmp;
long ans;
cin >> n;
ans = n - 1;
for (i = 1; i < n; i++) {
mod = n % i;
if (mod == 0) {
div = n / i;
tmp = (div - 1) + (i - 1);
ans = min(ans, tmp);
}
}
cout << ans <... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long n;
long i, mod, div, tmp;
long ans;
cin >> n;
ans = n - 1;
for (i = 1; i * i <= n; i++) {
mod = n % i;
if (mod == 0) {
div = n / i;
tmp = (div - 1) + (i - 1);
ans = min(ans, tmp);
}
}
cout << ... | replace | 11 | 12 | 11 | 12 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define s... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define s... | replace | 39 | 40 | 39 | 40 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long prime(long long a) {
long long y, i;
y = sqrt(a);
for (i = 2; i <= y; i++) {
if (a % i == 0) {
return -1;
}
}
if (i > y)
return 1;
}
int main() {
long long a, c, d;
cin >> a;
c = prime(a);
if (c == 1) {
cout << a - 1;
} el... | #include <bits/stdc++.h>
using namespace std;
long long prime(long long a) {
long long y, i;
y = sqrt(a);
for (i = 2; i <= y; i++) {
if (a % i == 0) {
return -1;
}
}
if (i > y)
return 1;
}
int main() {
long long a, c, d;
cin >> a;
c = prime(a);
if (c == 1) {
cout << a - 1;
} el... | replace | 22 | 23 | 22 | 23 | TLE | |
p02881 | 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;
int main() {
ll n, minv = 1000000000001;
cin >> n;
for (ll i = 1; i <= n; i++) {
if (n % i == 0) {
minv = min(i + (n / i) - 2, minv);
}
}
cout << minv << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, minv = 1000000000001;
cin >> n;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
minv = min(i + (n / i) - 2, minv);
}
}
cout << minv << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | 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;
int main() {
ll n;
cin >> n;
ll j = 1;
for (ll i = sqrt(n); i > 1; i++) {
if (n % i == 0) {
j = i;
break;
}
}
ll i = n / j;
cout << i - 1 + j - 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll j = 1;
for (ll i = sqrt(n); i > 1; i--) {
if (n % i == 0) {
j = i;
break;
}
}
ll i = n / j;
cout << i - 1 + j - 1 << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | C++ | Runtime Error | #include <bits //stdc++.h>
#define rep(i, k) for (int i = 0; i < k; i++)
#define int unsigned long long
using namespace std;
signed main(void) {
int n, m, a, b, c, ans;
cin >> n;
for (int i = 1; i < n; i++) {
if (i * i > n) {
ans = i;
break;
}
}
for (int i = ans; i > 0; i--) {
if (n ... | #include <bits //stdc++.h>
#define rep(i, k) for (int i = 0; i < k; i++)
#define int unsigned long long
using namespace std;
signed main(void) {
int n, m, a, b, c, ans;
cin >> n;
for (int i = 1; i < n; i++) {
if (i * i > n) {
ans = i;
break;
}
}
b = 1;
for (int i = ans; i > 0; i--) {
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02881 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 0; i < sqrt(n); i++) {
if (n... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 1e18;
for (ll i = 1; i * i <= n; i++) {
if ... | replace | 13 | 18 | 13 | 19 | -8 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long min = 10000000000000;
for (long long i = 1; i <= n / 2; i++) {
long long t;
if ((n % i) == 0) {
t = (i - 1) + ((n / i) - 1);
if (min > t) {
min = t;
}
}
}
cout << min << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long min = n - 1;
long long t;
for (long long i = 1; i <= sqrt(n); i++) {
if ((n % i) == 0) {
t = (i - 1) + ((n / i) - 1);
if (min > t) {
min = t;
}
}
}
cout << min << endl;
} | replace | 6 | 9 | 6 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
unsigned long long int min;
long long int ans1, ans2;
for (long long int i = 1; i <= n; i++) {
if (n % i == 0) {
long long int j = n / i;
unsigned long long int min1 = sqrt(pow(i - 1, 2) + pow(j - 1, 2));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
unsigned long long int min;
long long int ans1, ans2;
for (long long int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
long long int j = n / i;
unsigned long long int min1 = sqrt(pow(i - 1, 2) + pow(j - 1, 2)... | replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1e9 + 7
#define endl '\n'
void solve() {
ll n;
cin >> n;
ll ans = 1e12;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, i + n / i - 2);
}
}
cout << ans;
}
int main() {
ios_base::sync_with_... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1e9 + 7
#define endl '\n'
void solve() {
ll n;
cin >> n;
ll ans = 1e12;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, i + n / i - 2);
}
}
cout << ans;
}
int main() {
ios_base::sync_with_s... | replace | 13 | 14 | 13 | 14 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i, a, b) for (int i = (a); i <= (b); i++)
#define CIN \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i, a, b) for (int i = (a); i <= (b); i++)
#define CIN \
ios_base::sync_with_stdio(0); ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
vector<long long> NN;
cin >> N;
for (long long i = 1; i < N; i++) {
if ... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
vector<long long> NN;
cin >> N;
for (long long i = 1; i <= sqrt(N); i++) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02881 | C++ | Time Limit Exceeded | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | replace | 26 | 27 | 26 | 27 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^19 < 9223372036854775807
typedef unsigned long long ull; // 10^20 < 18446744073709551615
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 10^19 < 9223372036854775807
typedef unsigned long long ull; // 10^20 < 18446744073709551615
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b)... | replace | 20 | 21 | 20 | 21 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (long long i = init; i < (n); i++)
#define repd(i, n, init) for (long long i = (n); i >= init; i--)
#define repm(i, m) for (auto i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (long long i = init; i * i <= (n); i++)
#define repd(i, n, init) for (long long i = (n); i >= init; i--)
#define repm(i, m) for (a... | replace | 6 | 7 | 6 | 7 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, t, n) for (ll i = (t); i <= ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, t, n) for (ll i = (t); i <= ... | replace | 36 | 37 | 36 | 37 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
ans = i;
}
cout << n / ans + ans - 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 1;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
ans = i;
}
cout << n / ans + ans - 2 << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long n, ans = LONG_MAX;
cin >> n;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0)
ans = min(ans, n / i + i - 2);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long n, ans = LONG_MAX;
cin >> n;
for (long i = 1; i * i <= n; i++) {
if (n % i == 0)
ans = min(ans, n / i + i - 2);
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES // for C++
#include "bits/stdc++.h"
#define NUM ((long long)1000000007)
#define int unsigned long long
using namespace std;
signed main() {
int n;
cin >> n;
auto v = vector<int>();
for (size_t i = 1; i < n / 2 + 1; i++) {
if (n % i == 0) {
v.push_back(i + (n / i) - 2);
... | #define _USE_MATH_DEFINES // for C++
#include "bits/stdc++.h"
#define NUM ((long long)1000000007)
#define int unsigned long long
using namespace std;
signed main() {
int n;
cin >> n;
auto v = vector<int>();
for (size_t i = 1; i < sqrt(n) + 1; i++) {
if (n % i == 0) {
v.push_back(i + (n / i) - 2);
... | replace | 13 | 14 | 13 | 14 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <iomanip>
#include <iostream>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
void walk_on_multiplication_table() {
long long int n;
cin >> n;
long long int ans = n;
for (long long int i = 1; i <= n; ++i) {
if (n % i == 0 && ans > (i - 1) + (n / i - 1)) {
... | #include <iomanip>
#include <iostream>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
void walk_on_multiplication_table() {
long long int n;
cin >> n;
long long int ans = n;
for (int i = 1; i <= sqrt(n); ++i) {
if (n % i == 0 && ans > (i - 1) + (n / i - 1)) {
ans... | replace | 13 | 14 | 13 | 14 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<vector<LL>> VVL;
typedef vector<string> VS;
#de... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<vector<LL>> VVL;
typedef vector<string> VS;
#de... | replace | 160 | 166 | 160 | 192 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
ll p = N - 1;
... | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
ll p = N - 1;
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long n;
cin >> n;
long long min = n + 1;
long long tmp;
for (long long i = 1; i * 2 <= n; i++) {
long long j;
if (n % i == 0) {
j = n / i;
tmp = j + i - 2;
}
if (min > tmp)
min = tmp;
}
cout << min << endl;
... | #include <iostream>
using namespace std;
int main(void) {
long long n;
cin >> n;
long long min = n + 1;
long long tmp;
for (long long i = 1; i * i <= n; i++) {
long long j;
if (n % i == 0) {
j = n / i;
tmp = j + i - 2;
}
if (min > tmp)
min = tmp;
}
cout << min << endl;
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
long int c = N - 1;
for (long int i = N / 2; i > 0; i--) {
long int q;
q = N / i;
if (i * q == N && i + q - 2 <= c) {
c = i + q - 2;
}
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
long int c = N - 1;
for (long int i = (int)sqrt(N); i > 0; i--) {
long int q;
q = N / i;
if (i * q == N && i + q - 2 <= c) {
c = i + q - 2;
}
}
cout << c << endl;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll r = sqrt(n);
... | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll r = sqrt(n);
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using namespace std;
typedef lon... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using namespace std;
typedef lon... | replace | 19 | 24 | 19 | 22 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
#define all(a) a.begin(), a.end()
#define All(a) a.rbegin(), a.rend()
#define ios \
ios_base::sync_with_stdio(0), cin.tie(0), cout.precision(10), cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
#define all(a) a.begin(), a.end()
#define All(a) a.rbegin(), a.rend()
#define ios \
ios_base::sync_with_stdio(0), cin.tie(0), cout.precision(10), cou... | replace | 13 | 15 | 13 | 15 | TLE | |
p02881 | 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;
int main() {
ll n;
cin >> n;
ll ans = 1e18;
for (int i = 1; i * i < n; i++) {
if (n % i != 0)
continue;
ll j = n / i;
ans = min(ans, i + j - 2);
}
cout << ans << endl;
ret... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 1e18;
for (ll i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
ll j = n / i;
ans = min(ans, i + j - 2);
}
cout << ans << endl;
ret... | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long N;
cin >> N;
long long minum = N - 1;
for (long long i = 2; i <= N; i++) {
if (N % i == 0) {
minum = min(minum, i + N / i - 2);
}
}
cout << minum << endl;
} | #include <iostream>
using namespace std;
int main(void) {
long long N;
cin >> N;
long long minum = N - 1;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) {
minum = min(minum, i + N / i - 2);
}
}
cout << minum << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long n, max, sa;
cin >> n;
sa = n;
for (long i = 1; i <= n; i++) {
if (n % i == 0) {
long aho = n / i;
long sasa = abs(aho - i);
if (sasa <= sa) {
sa ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long n, max, sa;
cin >> n;
sa = n;
max = 1;
long jougen = n;
if (n > 1000000)
jougen = 1000000;
for (long i = 1; i <= jougen; i++) {
if (n % i == 0) {
long aho ... | replace | 12 | 13 | 12 | 17 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t ans = n - 1;
for (int i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
ans = min(ans, i + n / i - 2);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t ans = n - 1;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
ans = min(ans, i + n / i - 2);
}
cout << ans << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | replace | 38 | 39 | 38 | 39 | TLE | |
p02881 | C++ | Runtime Error | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int nn = (long long int)sqrt(n);
int ojisan;
for (long long int i = 1; i < nn; i++) {
if (n % i == 0)
ojisan = i;
}
long long int ojisan1 = n / ojisan;
// cout << ojisan << '\n';
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int nn = (long long int)sqrt(n);
int ojisan;
for (long long int i = 1; i <= nn; i++) {
if (n % i == 0)
ojisan = i;
}
long long int ojisan1 = n / ojisan;
// cout << ojisan << '\n';... | replace | 12 | 13 | 12 | 13 | 0 | |
p02881 | 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>;
int main() {
ll n;
cin >> n;
ll ans = 1e18;
for (int i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
ll j = n / i;
ans = (ans, i + j - 2);
}
co... | #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>;
int main() {
ll n;
cin >> n;
ll ans = 1e18;
for (ll i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
ll j = n / i;
ans = (ans, i + j - 2);
}
cou... | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const ... | replace | 41 | 42 | 41 | 42 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ll n;
cin >> n;
ll res = n - 1;
for (ll i = 1; i <= i * i; i++) {
if (n % i == 0)
res = min(res, i - 1 + n / i - 1);
}
cout << res << endl;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ll n;
cin >> n;
ll res = n - 1;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0)
res = min(res, i - 1 + n / i - 1);
}
cout << res << endl;
r... | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#in... | replace | 79 | 80 | 79 | 80 | -8 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long res;
for (int i = 1; i * i < N; i++) {
if (N % i == 0) {
res = N / i + i - 2;
}
}
cout << res;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long res;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
res = N / i + i - 2;
}
}
cout << res;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long ans = 1LL << 60;
for (int i = 1; i * i <= x; ++i) {
if (x % i)
continue;
ans = min(ans, i + x / i - 2);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long ans = 1LL << 60;
for (long long i = 1; i * i <= x; ++i) {
if (x % i)
continue;
ans = min(ans, i + x / i - 2);
}
cout << ans << endl;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
long long N;
cin >> N;
long long ans = MOD * MOD;... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
long long N;
cin >> N;
long long ans = MOD * MOD;... | replace | 21 | 22 | 21 | 22 | TLE | |
p02881 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long n, a = 0, b = 0;
cin >> n;
for (long long d = 2; d * d <= n; d++) {
if (n % d == 0)
a = d;
}
b = n / a;
cout << a - 1 + b - 1;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
unsigned long long n, a = 1, b = 0;
cin >> n;
for (long long d = 2; d * d <= n; d++) {
if (n % d == 0)
a = d;
}
b = n / a;
cout << a - 1 + b - 1;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
int m = sqrt(n);
for (int i = m; i >= 1; i++) {
if (n % i == 0) {
m = n / i;
ll sum = (i - 1) + (m - 1);
cout << sum << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll m = sqrt(n);
for (ll i = m; i >= 1; i--) {
if (n % i == 0) {
m = n / i;
ll sum = (i - 1) + (m - 1);
cout << sum << endl;
return 0;
}
}
return 0;
} | replace | 6 | 8 | 6 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repe(i, n) for (int i = 0; i <= n; ++i)
#define repr(i, n) for (int i = n - 1; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repe(i, n) for (int i = 0; i <= n; ++i)
#define repr(i, n) for (int i = n - 1; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) ... | replace | 34 | 35 | 34 | 35 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll N;
ll tmp, out;
out = 1000000000000;
cin >> N;
for (ll i = 2; i <= N / 2; i++) {
if (N % i == 0) {
tmp = N / i;
if (out > (tmp + i - 2))
... | #include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll N;
ll tmp, out;
out = 1000000000000;
cin >> N;
for (ll i = 2; i * i <= N; i++) {
if (N % i == 0) {
tmp = N / i;
if (out > (tmp + i - 2))
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll max = 0;
rep(i, sqrt(n)) {
if (n % i == 0)
max = i;
}
cout << max - 1 + n / max - 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll max = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)
max = i;
}
cout << max - 1 + n / max - 1 << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02882 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 100003, INF = 1 << 30;
int main() {
double A, B, X;
cin >> A >> B >> X;
double S = X / A;
if (A * A * B == X)
return 1;
double left = 0.0, right = M_PI / 2.0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 1000000007, MAX = 100003, INF = 1 << 30;
int main() {
double A, B, X;
cin >> A >> B >> X;
double S = X / A;
if (A * A * B == X) {
cout << 1.130863886742583809729988e-14 << endl;
r... | replace | 12 | 14 | 12 | 16 | 0 | |
p02882 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
double base, height, waterVolume;
cin >> base >> height >> waterVolume;
double waterHeight = waterVolume / base / base;
if (waterHeight * 2.0 > height) {
height = (height - waterHeight) * 2.0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
double base, height, waterVolume;
cin >> base >> height >> waterVolume;
double waterHeight = waterVolume / base / base;
if (waterHeight * 2.0 > height) {
height = (height - waterHeight) * 2.0;
... | replace | 13 | 15 | 13 | 16 | 0 | |
p02882 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, x;
cin >> a >> b >> x;
double delta = M_PI / pow(2, 28);
double capa;
double ans;
if (a * a * b / 2 < x) {
for (double theta = 0; tan(theta) <= (b / a); theta += delta) {
capa = a * a * b - 0.5 * a * a * a * tan(theta);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, x;
cin >> a >> b >> x;
double delta = M_PI / pow(2, 26);
double capa;
double ans;
if (a * a * b / 2 < x) {
for (double theta = 0; tan(theta) <= (b / a); theta += delta) {
capa = a * a * b - 0.5 * a * a * a * tan(theta);
... | replace | 6 | 7 | 6 | 7 | TLE | |
p02882 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ": " << x << endl;
#define iosbase ios_base::sync_with_stdio(false)
#define tie \
cin.tie(); \
cout.tie(... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << ": " << x << endl;
#define iosbase ios_base::sync_with_stdio(false)
#define tie \
cin.tie(); \
cout.tie(... | replace | 32 | 33 | 32 | 33 | TLE | |
p02882 | Python | Runtime Error | from math import atan, degrees
def main():
a, b, x = map(int, input().split())
full = a * a * b
half = full * 0.5
if x <= half:
s = x / a
ans = 90 - degrees(atan(2 * s / b**2))
else:
s = (full - x) / a
ans = 90 - degrees(atan(a**2 / (2 * s)))
print(ans)
if... | from math import atan, degrees
def main():
a, b, x = map(int, input().split())
full = a * a * b
half = full * 0.5
if x <= half:
s = x / a
ans = 90 - degrees(atan(2 * s / b**2))
else:
s = (full - x) / a
if s != 0:
ans = 90 - degrees(atan(a**2 / (2 * s)... | replace | 15 | 16 | 15 | 19 | 0 | |
p02882 | Python | Runtime Error | from sys import stdin
import math
a, b, x = [int(x) for x in stdin.readline().rstrip().split()]
if 2 * x >= (a**2) * b:
v = (a**2) * b - x
c = (2 * v) / (a**2)
print(90 - math.atan(a / c) * 180 / math.pi)
else:
c = 2 * x / (a * b)
print(math.atan(b / c) * 180 / math.pi)
| from sys import stdin
import math
a, b, x = [int(x) for x in stdin.readline().rstrip().split()]
if x == (a**2) * b:
print(0)
exit()
if 2 * x >= (a**2) * b:
v = (a**2) * b - x
c = (2 * v) / (a**2)
print(90 - math.atan(a / c) * 180 / math.pi)
else:
c = 2 * x / (a * b)
print(math.atan(b / c) ... | insert | 5 | 5 | 5 | 8 | 0 | |
p02882 | Python | Runtime Error | import math
a, b, x = map(int, input().split())
b_1 = x / (a**2)
area_1 = a * b_1
area_2 = (a * b) / 2
if area_2 > area_1:
# 三角形
h = (a * b_1 * 2) / b
ans = math.degrees(math.atan(h / b))
else:
# 梯形
upside_len = b_1 * 2 - b
ans = math.degrees(math.atan(a / (b - upside_len)))
print(90 - ans)
| import math
a, b, x = map(int, input().split())
b_1 = x / (a**2)
area_1 = a * b_1
area_2 = (a * b) / 2
if b_1 == b:
ans = 90
elif area_2 > area_1:
# 三角形
h = (a * b_1 * 2) / b
ans = math.degrees(math.atan(h / b))
else:
# 梯形
upside_len = b_1 * 2 - b
ans = math.degrees(math.atan(a / (b - ups... | replace | 8 | 9 | 8 | 11 | 0 | |
p02882 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
//****************************************************
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
//****************************************************
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp... | replace | 69 | 72 | 69 | 72 | 0 | |
p02882 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define EPS 0.0000000001
int main() {
cout << fixed;
cout << setprecision(10);
long double a, b;
long double x, y;
cin >> a >> b >> x;
y = a * a * b;
long double xx, yy;
xx = x / a;
yy = y / a;
long double h, w, theta;
h = b - x / (a * a);
if (... | #include <bits/stdc++.h>
using namespace std;
#define EPS 0.0000000001
int main() {
cout << fixed;
cout << setprecision(10);
long double a, b;
long double x, y;
cin >> a >> b >> x;
y = a * a * b;
long double xx, yy;
xx = x / a;
yy = y / a;
long double h, w, theta;
h = b - x / (a * a);
if (... | replace | 26 | 27 | 26 | 28 | TLE | |
p02882 | Python | Runtime Error | # -*- coding: utf-8 -*-
def main():
from math import degrees, atan
a, b, x = map(int, input().split())
h = x / (a**2)
y = 2 * h * a / b
z = 2 * b - 2 * h
if 2 * h >= b:
print(90 - degrees(atan(a / z)))
else:
print(degrees(atan(b / y)))
if __name__ == "__main__":
mai... | # -*- coding: utf-8 -*-
def main():
from math import degrees, atan
a, b, x = map(int, input().split())
h = x / (a**2)
y = 2 * h * a / b
z = 2 * b - 2 * h
if x == (a**2) * b:
print(0)
elif 2 * h >= b:
print(90 - degrees(atan(a / z)))
else:
print(degrees(atan(b ... | replace | 11 | 12 | 11 | 14 | 0 | |
p02882 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a > ... | replace | 54 | 56 | 54 | 56 | 1 | |
p02882 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const double PI = ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const double PI = ... | replace | 21 | 22 | 21 | 22 | TLE | |
p02882 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const double PI = ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const double PI = ... | replace | 21 | 22 | 21 | 22 | TLE | |
p02882 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
#define MOD 1000000007
#define int long long
signed main() {
int a, b, x;
cin >> a >> b >> x;
double v = a * a * b, s;
const double k = 360 / (2 * 3.141592653589793);
dou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
#define MOD 1000000007
#define int long long
signed main() {
int a, b, x;
cin >> a >> b >> x;
double v = a * a * b, s;
const double k = 360 / (2 * 3.141592653589793);
dou... | replace | 22 | 29 | 22 | 23 | TLE | |
p02883 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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) {
... | replace | 23 | 24 | 23 | 25 | 0 | |
p02883 | C++ | Runtime Error | /************************************************
*Author : xzj213
*Created Time : 2019.10.27.20:59
*Mail : xzj213@qq.com
*Problem : E
************************************************/
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 5;
int a[max... | /************************************************
*Author : xzj213
*Created Time : 2019.10.27.20:59
*Mail : xzj213@qq.com
*Problem : E
************************************************/
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5 + 5;
int a[max... | replace | 9 | 10 | 9 | 10 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 10000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 10000... | replace | 49 | 50 | 49 | 50 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define ll long long
#define vi vector<long long>
#define pi pair<long long, long long>
#define mp ma... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define ll long long
#define vi vector<long long>
#define pi pair<long long, long long>
#define mp ma... | replace | 47 | 48 | 47 | 48 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <tr1/unordered_map>
// #include "Bignum/bignum.h"
// #define big bignum
#define lowbit(x) (x & -x)
#define debug(x) (cout << "#x = " << (x) << endl)
#define Set(x, i) memset(x, i, sizeof(x))
#define R register
#define For(i, j, k) for (R int i = (j); i <= (int)(k); ++i)
#define Rep(... | #include <bits/stdc++.h>
// #include <tr1/unordered_map>
// #include "Bignum/bignum.h"
// #define big bignum
#define lowbit(x) (x & -x)
#define debug(x) (cout << "#x = " << (x) << endl)
#define Set(x, i) memset(x, i, sizeof(x))
#define R register
#define For(i, j, k) for (R int i = (j); i <= (int)(k); ++i)
#define Rep(... | replace | 13 | 14 | 13 | 14 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | replace | 17 | 18 | 17 | 18 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 100100;
int a[maxn], f[maxn];
ll check(int n, ll t) {
ll ret = 0;
for (int i = 1; i <= n; i++) {
ret += max(0ll, a[i] - t / f[n - i + 1]);
}
return ret;
}
int main(void) {
int n;
ll k;
scanf("%d%lld", &n, &k);
for ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 200100;
int a[maxn], f[maxn];
ll check(int n, ll t) {
ll ret = 0;
for (int i = 1; i <= n; i++) {
ret += max(0ll, a[i] - t / f[n - i + 1]);
}
return ret;
}
int main(void) {
int n;
ll k;
scanf("%d%lld", &n, &k);
for ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int N_MAX = 20000;
int main() {
long long a[N_MAX], f[N_MAX];
long long n, k, i, t, s = 0, p, l = 0, r = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
for (i = 0; i < n; i++)
cin >> f[i];
if (k >= s) {
co... | #include <algorithm>
#include <iostream>
using namespace std;
int N_MAX = 200000;
int main() {
long long a[N_MAX], f[N_MAX];
long long n, k, i, t, s = 0, p, l = 0, r = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
for (i = 0; i < n; i++)
cin >> f[i];
if (k >= s) {
c... | replace | 3 | 4 | 3 | 4 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxV = 90010;
const int maxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const ll INF = 1000000000000000010LL;
const int inf = 1e9 + 10;
#define X first;
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxV = 90010;
const int maxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const ll INF = 1000000000000000010LL;
const int inf = 1e9 + 10;
#define X first;
#define ... | replace | 57 | 58 | 57 | 58 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
typedef long long ll;
const int mn = 1e5 + 5;
typedef pair<ll, int> pii;
int n;
ll k, ans;
int a[mn], f[mn];
bool c(ll x) {
ll tk = k;
for (int i = 1; i <= n; i++) {
if (1ll * a[i] * ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
typedef long long ll;
const int mn = 1e6 + 5;
typedef pair<ll, int> pii;
int n;
ll k, ans;
int a[mn], f[mn];
bool c(ll x) {
ll tk = k;
for (int i = 1; i <= n; i++) {
if (1ll * a[i] * ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef unordered_set<int> si;
typedef pair<int, int> pp;
typedef vector<pp> vpp;
typedef unsigned int i64;
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef unordered_set<int> si;
typedef pair<int, int> pp;
typedef vector<pp> vpp;
typedef unsigned int i64;
#define ... | replace | 99 | 100 | 99 | 100 | TLE | |
p02883 | Python | Time Limit Exceeded | N, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
F = sorted(list(map(int, input().split())))
def binary_search(min_n, max_n):
while max_n - min_n != 1:
tn = (min_n + max_n) // 2
if judge(tn):
max_n = tn
else:
min_n = tn
... | import sys
input = lambda: sys.stdin.readline().rstrip()
N, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
F = sorted(list(map(int, input().split())))
def binary_search(min_n, max_n):
while max_n - min_n != 1:
tn = (min_n + max_n) // 2
if judge(tn):
... | insert | 0 | 0 | 0 | 4 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
// cout<<fixed<<setprecision(10);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
// cout<<fixed<<setprecision(10);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inl... | replace | 29 | 30 | 29 | 31 | 0 | |
p02883 | 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;
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) {
... | #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;
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) {
... | replace | 237 | 238 | 237 | 239 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<long long> a(n), d(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> d[i];
sort(a.begin(), a.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
long long n, k;
cin >> n >> k;
vector<long long> a(n), d(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> d[i];
sort(a.begin(), a.en... | replace | 9 | 10 | 9 | 10 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long... | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long... | delete | 1,518 | 1,521 | 1,518 | 1,518 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
Int N, K;
vector<Int> A(200010), F(100010);
bool possible(Int X) {
Int shugyo = 0;
for (int i = 0; i < N; i++) {
shugyo += max((Int)0, (A[i] - X / F[i]));
}
return (shugyo <= K);
}
int main() {
cin >> N >> K;
Int sum = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
Int N, K;
vector<Int> A(200010, 0), F(200010, 0);
bool possible(Int X) {
Int shugyo = 0;
for (int i = 0; i < N; i++) {
shugyo += max((Int)0, (A[i] - X / F[i]));
}
return (shugyo <= K);
}
int main() {
cin >> N >> K;
Int sum = 0;
fo... | replace | 5 | 6 | 5 | 6 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (n); ++i)
#define InitRep(i, begin, n) for (int i = (begin); i < (n); ++i)
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (n); ++i)
#define InitRep(i, begin, n) for (int i = (begin); i < (n); ++i)
#define... | replace | 20 | 21 | 20 | 21 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n;
int64_t k;
vector<int64_t> A;
vector<int64_t> F;
vector<int64_t> M;
bool check(int64_t ma) {
int64_t remain = k;
for (int i = 0; i < n; i++) {
if (M[i] <= ma)
continue;
remain -= A[i] - ma / F[i];
}
return remain >= 0;
}
int main() {
cin ... | #include <bits/stdc++.h>
using namespace std;
int n;
int64_t k;
vector<int64_t> A;
vector<int64_t> F;
vector<int64_t> M;
bool check(int64_t ma) {
int64_t remain = k;
for (int i = 0; i < n; i++) {
if (M[i] <= ma)
continue;
remain -= A[i] - ma / F[i];
}
return remain >= 0;
}
int main() {
cin ... | replace | 38 | 39 | 38 | 39 | TLE | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define P... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define P... | replace | 175 | 176 | 175 | 176 | TLE | |
p02883 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll n, k;
vector<int> a(1000001), f(1000001);
// 二分探索法
// index が条件を満たすかどうか
bool isOK(ll index) {
ll c = 0;
for (int i = 0; i < n; i++) {
c += max(0ll, (a[i] - ... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll n, k;
vector<int> a(1000001), f(1000001);
// 二分探索法
// index が条件を満たすかどうか
bool isOK(ll index) {
ll c = 0;
for (int i = 0; i < n; i++) {
c += max(0ll, (a[i] - ... | replace | 30 | 31 | 30 | 31 | TLE | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | replace | 45 | 46 | 45 | 46 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 200000, INF = 1e13;
ll n, k;
ll A[MAX], B[MAX], F[MAX];
bool C(ll x) {
ll cnt = 0;
sort(A, A + n);
sort(F, F + n, greater<>());
for (int i = 0; i < n; i++) {
B[i] = x / F[i];
}
for (int i = 0; i < n; i++) {
if (B[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 200000, INF = 1e13;
ll n, k;
ll A[MAX], B[MAX], F[MAX];
bool C(ll x) {
ll cnt = 0;
sort(A, A + n);
sort(F, F + n, greater<>());
for (int i = 0; i < n; i++) {
B[i] = x / F[i];
}
for (int i = 0; i < n; i++) {
if (B[... | replace | 29 | 30 | 29 | 30 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
vector<ll> a(n), f(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> f[i];
sort(a.begin(), a.end());
sort(f.rbegin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll K;
cin >> n >> K;
vector<ll> a(n), f(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> f[i];
sort(a.begin(), a.end());
sort(f.r... | replace | 9 | 10 | 9 | 11 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("sample3.in", "r", stdin);
int N, K;
cin >> N >> K;
vector<long> A(N), F(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> F[i];
}
sort(A.begin(), A.end());
sort(F.begin(), F.end(), gr... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N), F(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> F[i];
}
sort(A.begin(), A.end());
sort(F.begin(), F.end(), greater<long>());
long left = 0L, righ... | replace | 4 | 6 | 4 | 5 | 0 | |
p02883 | C++ | Runtime Error | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define il inline
#define rg register
#define gi read<int>
using namespace std;
const int O = 2e5 + 10, N = 1e6 + 10;
typedef long long ll;
template <class TT> il TT read() {
TT o = 0, fl = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar(... | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define il inline
#define rg register
#define gi read<int>
using namespace std;
const int O = 2e5 + 10, N = 1e6 + 10;
typedef long long ll;
template <class TT> il TT read() {
TT o = 0, fl = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar(... | replace | 25 | 26 | 25 | 26 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) \
{ \
for (auto i : x) { ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long
#define _for(i, a, b) for (int i = (a); i < (b); i++)
#define _rep(i, a, b) for (int i = (a); i <= (b); i++)
const int N = 1e5 + 100;
int a[N], f[N], n;
int main() {
ll k;
cin >> n >> k;
_for(i, 0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define ll long long
#define _for(i, a, b) for (int i = (a); i < (b); i++)
#define _rep(i, a, b) for (int i = (a); i <= (b); i++)
const int N = 2e5 + 100;
int a[N], f[N], n;
int main() {
ll k;
cin >> n >> k;
_for(i, 0... | replace | 8 | 9 | 8 | 9 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define mem0(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (int i = a; i < b;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define mem0(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (int i = a; i < b;... | replace | 22 | 23 | 22 | 23 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> veci;
typedef pair<int, int> pii;
typedef vector<pii> vecii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vecl;
typedef vector<pll> vecll;
#define EPS (1e-9)
#define MOD (1e9 + 7)
#define fi first
#define se second
#define endl '\n... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> veci;
typedef pair<int, int> pii;
typedef vector<pii> vecii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vecl;
typedef vector<pll> vecll;
#define EPS (1e-9)
#define MOD (1e9 + 7)
#define fi first
#define se second
#define endl '\n... | replace | 17 | 18 | 17 | 18 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
ll k, l, r, ans;
ll a[200010], f[200010];
bool cmp(int x, int y) { return x > y; }
bool check(ll x) {
ll kk = k;
for (int i = 1; i <= n; i++) {
ll res = 0;
while (res * f[i] <= x) {
res++;
}
res--;
kk -= a[i] - res;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
ll k, l, r, ans;
ll a[200010], f[200010];
bool cmp(int x, int y) { return x > y; }
bool check(ll x) {
ll kk = k;
for (int i = 1; i <= n; i++) {
ll res = x / f[i];
if (a[i] >= res)
kk -= a[i] - res;
}
return kk >= 0;
}
int ma... | replace | 10 | 16 | 10 | 13 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.