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 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#i... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#i... | replace | 128 | 129 | 128 | 129 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll res = N;
for (int a = 1; a * a <= N; a++) {
if (N % a == 0)
res = min(res, a + N / a - 2);
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll res = N;
for (ll a = 1; a * a <= N; a++) {
if (N % a == 0)
res = min(res, a + N / a - 2);
}
cout << res;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b, res;
cin >> n;
res = 1000000000000;
for (long i = 2; i < n / 2; ++i) {
if (n % i == 0) {
a = n / i;
if (res > a + i - 2) {
res = a + i - 2;
} else if (res == a + i - 2) {
break;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b, res;
cin >> n;
res = 1000000000000;
for (long i = 2; i <= sqrt(n); ++i) {
if (n % i == 0) {
a = n / i;
if (res > a + i - 2) {
res = a + i - 2;
} else if (res == a + i - 2) {
break;
}
}
... | replace | 9 | 10 | 9 | 10 | 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;
int main() {
ll N;
cin >> N;
ll ans = N + 1 - 2;
for (int i = 2; i * i <= N; i++) {
if (N % i == 0) {
// cout << N/i << " " << i << endl;
ans = min(ans, N / i + i - 2);
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = N + 1 - 2;
for (ll i = 2; i * i <= N; i++) {
if (N % i == 0) {
// cout << N/i << " " << i << endl;
ans = min(ans, N / i + i - 2);
}
}
c... | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 1e9;
for (int i = 1; i * i <= n; i++)
if (n % i == 0)
ans = min(ans, i + n / i - 2);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
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)
ans = min(ans, i + n / i - 2);
cout << ans << endl;
return 0;
} | replace | 7 | 9 | 7 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long int a, b;
cin >> a;
long int min = 0, t;
for (int i = 1; i < a / 2 + 1; ++i) {
if (a % i == 0) {
t = i - 1 + a... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long int a, b;
cin >> a;
long int min = 0, t;
for (int i = 1; i <= sqrt(a); ++i) {
if (a % i == 0) {
t = i - 1 + a... | replace | 15 | 16 | 15 | 17 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
while (cin >> n) {
ll maxn = n - 1;
for (ll i = n / 2; i > 1; i--) {
for (ll j = 2; j <= n / i; j++) {
if (i * j == n) {
maxn = min(i + j - 2, maxn);
}
}
}
cout << maxn << end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
while (cin >> n) {
ll maxn = n - 1;
for (ll i = sqrt(n); i > 1; i--) {
if (i * (n / i) == n) {
maxn = min(i + (n / i) - 2, maxn);
break;
}
}
cout << maxn << endl;
}
} | replace | 7 | 12 | 7 | 11 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main(void) {
queue<long> que;
long N;
cin >> N;
long min = N;
for (long i = 1; i < sqrt(N); i++) {
for (long j = i; j <= N; j++) {
if (N == i * j) {
que.push(i + j - 2);
}
}
}
while (!que.empty()) {
if (mi... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
int main(void) {
queue<long> que;
long N;
cin >> N;
long min = N;
for (long i = 1; i <= sqrt(N); i++) {
if (!(N % i)) {
que.push(i + N / i - 2);
}
}
while (!que.empty()) {
if (min > que.front()) {
min = que.front();
... | replace | 9 | 14 | 9 | 12 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long ans = -1;
long i, j;
for (i = 1; i <= n; i++) {
if (n % i == 0) {
j = n / i;
if (ans != -1) {
if (ans > i - 1 + j - 1) {
ans = i - 1 + j - 1;
}
} else {
ans = i - 1 + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long ans = -1;
long i, j;
for (i = 1; i * i <= n; i++) {
if (n % i == 0) {
j = n / i;
if (ans != -1) {
if (ans > i - 1 + j - 1) {
ans = i - 1 + j - 1;
}
} else {
ans = i - ... | replace | 12 | 13 | 12 | 13 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make... | delete | 69 | 76 | 69 | 69 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n - 1;
for (long long i = 1; i <= n / 2; i++)
if (n % i == 0)
ans = min(ans, i + (n / i) - 2);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n - 1;
for (long long i = 1; i <= sqrt(n); i++)
if (n % i == 0)
ans = min(ans, i + (n / i) - 2);
cout << ans << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 0; i < n; i++)
using ll = long long;
int main() {
ll n, ans;
cin >> n;
ans = n;
rep(i, sqrt(n)) {
if (n % i == 0) {
ans = min(i + n / i - 2, ans);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 1; i <= n; i++)
using ll = long long;
int main() {
ll n, ans;
cin >> n;
ans = n;
rep(i, sqrt(n)) {
if (n % i == 0) {
ans = min(i + n / i - 2, ans);
}
}
cout << ans << endl;
}
| replace | 2 | 3 | 2 | 3 | -8 | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace ... | replace | 54 | 55 | 54 | 55 | TLE | |
p02881 | 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;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
ll N;
ll ans = 1e12;
cin >> N;
for (ll i = 1; i * 1 <= N; i++) {
if (N % i == 0) {
ans = min(ans, i + N / i -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
ll N;
ll ans = 1e12;
cin >> N;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ans = min(ans, i + N / i -... | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
bool in = false;
for (int i = sqrt(n); i <= n; i++) {
if (n % i == 0) {
cout << n / i + i - 2;
break;
}
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
bool in = false;
for (int i = sqrt(n); i >= 1; i--) {
if (n % i == 0) {
cout << n / i + i - 2;
break;
}
}
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long N, min;
cin >> N;
min = N - 1;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
if (N / i + i - 2 < min)
min = N / i + i - 2;
}
}
cout << min;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long N, min;
cin >> N;
min = N - 1;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
if (N / i + i - 2 < min)
min = N / i + i - 2;
}
}
cout << min;
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool is_Prime(long long N) {
if (N == 1)
return false;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0)
return false;
}
return true;
}
int main() {
long long N;
cin >> N;
if (is_Prime(N)) {
cout << N - 1 << endl;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
bool is_Prime(long long N) {
if (N == 1)
return false;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0)
return false;
}
return true;
}
int main() {
long long N;
cin >> N;
if (is_Prime(N)) {
cout << N - 1 << endl;
return 0;
}
... | replace | 22 | 23 | 22 | 23 | TLE | |
p02881 | Python | Time Limit Exceeded | n = int(input())
factor = []
tmp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
while tmp % i == 0:
factor.append(i)
tmp //= i
if tmp != 1:
factor.append(tmp)
w = len(factor)
if w == 0:
factor.append(n)
w = 1
if w == 1:
print(n - 1)
else:
ans = 1000000000000
for i in rang... | n = int(input())
ans = 1000000000000
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
a = i
b = n // i
ans = min(ans, a + b - 2)
print(ans)
| replace | 1 | 25 | 1 | 8 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
signed main() {
unsigned long long int N;
cin >> N;
unsigned long long int count = 0;
for (int i = 0; i < sqrt(N) + 1; i++) {
if (N % i == 0) {
if (count == 0) {
count = i + N / i - 2;
} else {
count = min(count, i + N / i - 2);
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
unsigned long long int N;
cin >> N;
unsigned long long int count = 0;
for (int i = 1; i < sqrt(N) + 1; i++) {
if (N % i == 0) {
if (count == 0) {
count = i + N / i - 2;
} else {
count = min(count, i + N / i - 2);
... | replace | 7 | 8 | 7 | 8 | -8 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
using namespace std;
int main() {
long l... | #include <bits/stdc++.h>
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
using namespace std;
int main() {
long l... | replace | 14 | 15 | 14 | 15 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
ll ans = 1e18;
for (ll i = 0; i * i <= n; i++) {
if (n % i != 0)
continue;
ll j = n / i;
ans = min(ans, i + j - 2);
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
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 = min(ans, i + j - 2);
}
... | replace | 10 | 11 | 10 | 11 | -8 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n - 1;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, (n / i) + i - 2);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n - 1;
for (long long i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ans = min(ans, (n / i) + i - 2);
}
}
cout << ans << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 10010010010
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long lon... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 10010010010
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long lon... | replace | 25 | 26 | 25 | 26 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
#define DEBUG
int main() {
ll n;
cin >> n;
ll min = (ll)1e18;
for (int i = 1; i < n; i++) {
if ((n % i) == 0 && ((n / i) +... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
#define DEBUG
int main() {
ll n;
cin >> n;
ll min = (ll)1e18;
for (ll i = 1; i <= sqrt(n); i++) {
if ((n % i) == 0 && ((n ... | replace | 16 | 17 | 16 | 17 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define lint long long int
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define arep(i, a, n) for (int i = a; i < n; i++)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define fill(a, x) fill(a.be... | #include <bits/stdc++.h>
#define lint long long int
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define arep(i, a, n) for (int i = a; i < n; i++)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define fill(a, x) fill(a.be... | replace | 121 | 122 | 121 | 122 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int int64;
int main() {
int64 n;
cin >> n;
int64 ans = 1e18;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, (i - 1) + ((n / i) - 1));
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int int64;
int main() {
int64 n;
cin >> n;
int64 ans = 1e18;
for (int64 i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, (i - 1) + ((n / i) - 1));
}
}
cout << ans << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
int ans = N;
for (int i = 1; i * i <= N; i++)
if (N % i == 0)
ans = i + N / i - 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = N;
for (int i = 1; i * i <= N; i++)
if (N % i == 0)
ans = i + N / i - 2;
cout << ans << endl;
}
| insert | 2 | 2 | 2 | 3 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
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;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
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;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, ans = 1e12 + 7;
cin >> n;
for (ll i = 1; i * 1 <= n; i++) {
if (n % i == 0)
ans = min(ans, i + n / i - 2);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, ans = 1e12 + 7;
cin >> n;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0)
ans = min(ans, i + n / i - 2);
}
cout << ans;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdint>
#include <iostream>
#include <limits>
int main() {
uint64_t target;
std::cin >> target;
uint64_t sq_target = std::sqrt(target);
uint64_t ans = std::numeric_limits<uint64_t>::max();
for (uint64_t i = 1; i <= sq_target; ++i) {
for (uint64_t j = i;; ++j) {
if (i *... | #include <cmath>
#include <cstdint>
#include <iostream>
#include <limits>
int main() {
uint64_t target;
std::cin >> target;
uint64_t sq_target = std::sqrt(target);
uint64_t ans = std::numeric_limits<uint64_t>::max();
for (uint64_t i = 1; i <= sq_target; ++i) {
if (target % i == 0) {
ans = std::mi... | replace | 13 | 19 | 13 | 15 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define EPS (1e-7)
#define gearup ... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define EPS (1e-7)
#define gearup ... | replace | 47 | 48 | 47 | 48 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long long n;
cin >> n;
long long mi = n - 1;
f... | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long long n;
cin >> n;
long long mi = n - 1;
f... | replace | 19 | 20 | 19 | 20 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef l... | replace | 39 | 40 | 39 | 40 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
int ans = n - 1;
for (int i = 1; i < n; ++i) {
if (n % i == 0)
ans = min(ans, i + n / i - 2);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n;
cin >> n;
int ans = n - 1;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0)
ans = min(ans, i + n / i - 2);
}
cout << ans << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
long long chmin(long long a, long long b) {
if (a > b) {
return b;
}
return a;
}
int main() {
long long n;
cin >> n;
long long min = n - 1;
for (long long i = 1; i <= (int)sqrt(n); i++) {
for (long long j = i; j <= n; j++) {
if (i * ... | #include <cmath>
#include <iostream>
using namespace std;
long long chmin(long long a, long long b) {
if (a > b) {
return b;
}
return a;
}
int main() {
long long n;
cin >> n;
long long min = n - 1;
for (long long i = 1; i <= (int)sqrt(n); i++) {
long long j = n / i;
if (n % i == 0) {
mi... | replace | 15 | 21 | 15 | 18 | TLE | |
p02881 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long dmax = sqrt(n);
while (dmax--)
if (n % dmax == 0)
break;
cout << dmax + n / dmax - 2 << endl;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long dmax = sqrt(n) + 1;
while (dmax--)
if (n % dmax == 0)
break;
cout << dmax + n / dmax - 2 << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = n - 1;
for (ll i = 1; i <= n; i++) {
ll j = (ll)(n / i);
if (i * j == n) {
if (i + j - 2 < ans) {
ans = i + j - 2;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = n - 1;
for (ll i = 1; i <= sqrt(n); i++) {
ll j = (ll)(n / i);
if (i * j == n) {
if (i + j - 2 < ans) {
ans = i + j - 2;
}
}
}
cout << ans << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 10000000000000;
for (ll i = 1; i <= n; i++) {
if (n % i == 0) {
ll x = i;
ll y = n / i;
ans = min(ans, x + y - 2);
}
}
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 10000000000000;
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
ll x = i;
ll y = n / i;
ans = min(ans, x + y - 2);
}
}
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long int i, j, N, min, flag;
flag = 0;
cin >> N;
if (N > 1000000) {
for (i = 1; i <= N / 1000; i++) {
if (0 == N % i) {
j = N / i;
// 初回
if (flag == 0) {
min = (j + i) - 2;
flag = flag + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int i, j, N, min, flag;
flag = 0;
cin >> N;
if (N > 1000000) {
for (i = 1; i <= N / 10000; i++) {
if (0 == N % i) {
j = N / i;
// 初回
if (flag == 0) {
min = (j + i) - 2;
flag = flag + 1;
... | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, a, b, res;
cin >> n;
res = n + 1;
for (int i = 2; i < n / 2; i++) {
if (n % i == 0) {
b = n / i;
a = i;
res = min(res, a + b);
}
}
cout << res - 2;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, a, b, res;
cin >> n;
res = n + 1;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
b = n / i;
a = i;
res = min(res, a + b);
}
}
cout << res - 2;
return 0;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<... | replace | 84 | 85 | 84 | 85 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <math.h>
#include <stdio.h>
int main() {
long N, ans = 0;
scanf("%ld", &N);
for (long i = sqrt(N); i < N; ++i) {
if (N % i == 0) {
ans = N / i + i - 2;
break;
}
}
printf("%ld", ans);
} | #include <math.h>
#include <stdio.h>
int main() {
long N, ans = 0;
scanf("%ld", &N);
for (long i = sqrt(N); i > 0; --i) {
if (N % i == 0) {
ans = N / i + i - 2;
break;
}
}
printf("%ld", ans);
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ld long double
#define ll long long int
#define f(i, g, n) for (int i = g; i <= n; i++)
#define rf(i, g, n) for (int i = n; i >= g; i--)
const int N = 1e3 + 1;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ld long double
#define ll long long int
#define f(i, g, n) for (int i = g; i <= n; i++)
#define rf(i, g, n) for (int i = n; i >= g; i--)
const int N = 1e3 + 1;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
... | delete | 16 | 21 | 16 | 16 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long a = 1, b = N;
long long M = a + b;
for (long long i = N / 2; i > 1; i--) {
if ((N % i == 0) && ((i + N / i) < M)) {
a = i;
b = N / i;
M = a + b;
}
}
if (a == 1 && b == 1)
cout << "0" << en... | #include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long a = 1, b = N;
long long M = a + b;
for (long long i = 2; i * i <= N; i++) {
if ((N % i == 0) && ((i + N / i) < M)) {
a = i;
b = N / i;
M = a + b;
}
}
if (a == 1 && b == 1)
cout << "0" << e... | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
ll a = 1000000000000;
for (ll i = 1; i < (N / 2 + 1); i++) {
if (N % i == 0) {
if (a > (i + (N / i) - 2)) {
a = i;
a += (N / i) - 2;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
ll a = 10000000000000;
for (ll i = 1; i < 5000001; i++) {
if (N % i == 0) {
if (a > (i + (N / i) - 2)) {
a = i;
a += (N / i) - 2;
... | replace | 12 | 14 | 12 | 14 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pp = pair<ll, ll>;
const ll amari = 1e9 + 7;
const char BC = 'A' - 'a';
#define ben(a) a.begin(), a.end() // 昇順
#define enb(a) a.rbegin(), a.rend() // 降順
#define pb(a, b) a.push_back(b)
// fixed << setprecision(20)
int main() {
ll n;
cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pp = pair<ll, ll>;
const ll amari = 1e9 + 7;
const char BC = 'A' - 'a';
#define ben(a) a.begin(), a.end() // 昇順
#define enb(a) a.rbegin(), a.rend() // 降順
#define pb(a, b) a.push_back(b)
// fixed << setprecision(20)
int main() {
ll n;
cin ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long a = N, b = 0;
for (long i = 1; i <= N / 2; i++) {
if (N % i == 0) {
b = (i - 1) + (N / i - 1);
a = min(a, b);
}
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long a = N, b = 0;
for (long i = 1; i <= sqrt(N); i++) {
if (N % i == 0) {
b = (i - 1) + (N / i - 1);
a = min(a, b);
}
}
cout << a << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int num, n;
int digits;
vector<long long int> vec;
cin >> n;
digits = int(floor(log10(n) + 1));
digits = (digits / 2);
for (int i = 1; i <= (int(pow(10, digits)) * int(pow(10, 2))); i++) {
if (n % i == 0 && vec.size() == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int num, n;
int digits;
vector<long long int> vec;
cin >> n;
digits = int(floor(log10(n) + 1));
digits = (digits / 2);
for (int i = 1; i <= int(pow(10, (digits + 1))); i++) {
if (n % i == 0 && vec.size() == 0) {
vec.push_back... | replace | 11 | 12 | 11 | 12 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#d... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#d... | delete | 50 | 54 | 50 | 50 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | replace | 37 | 38 | 37 | 38 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
long long MOD = 1e9 + 7;
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> ya;
ll ku = 0;
if (N % 2 == 0) {
ku = N / 2;
} else {
ku = (N + 1) / 2;
}
for (ll i = 1; i < ku + 1; i++) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
long long MOD = 1e9 + 7;
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> ya;
for (ll i = 1; i * i < N + 1; i++) {
if (N % i == 0) {
ya.push_back(i);
}
}
ll res = 1e12 + 1;
fo... | replace | 12 | 19 | 12 | 13 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
// f
int main(void) {
long long n;
cin >> n;
long long ans = n;
for (long long i = 1; i * i <= n; i++) {
for (long long j = i; i * j <= n; j++) {
if (i * j == n) {
ans = min(ans, i - 1 + j - 1);
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
// f
int main(void) {
long long n;
cin >> n;
long long ans = n;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, i - 1 + n / i - 1);
}
}
cout << ans << endl;
return 0;
}
| replace | 8 | 12 | 8 | 10 | TLE | |
p02881 | 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 | 219 | 220 | 219 | 220 | TLE | |
p02881 | C++ | Time Limit Exceeded | #ifndef LOCAL
#pragma GCC optimize("O2")
#endif
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int score;
score = 1e9;
for (int i = (int)sqrt(N); i <= N; i++) {
if (N % i == 0) {
// cout << score <<... | #ifndef LOCAL
#pragma GCC optimize("O2")
#endif
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int score;
score = __LONG_LONG_MAX__;
for (int i = 1; i <= (int)sqrt(N) + 1; i++) {
if (N % i == 0) {
/... | replace | 13 | 15 | 13 | 15 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int NMAX = 2e5 + 10;
const int MOD = 1e9 + 7;
int main(int argc, char const *argv[]) {
ll n;
ll ans;
scanf("%lld", &n);
ans = n;
for (register int i = 1; i * i <= n; i++)
if (n % i == 0)
ans = min(ans, i + n / i - 2);
print... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int NMAX = 2e5 + 10;
const int MOD = 1e9 + 7;
int main(int argc, char const *argv[]) {
ll n;
ll ans;
scanf("%lld", &n);
ans = n;
for (register ll i = 1; i * i <= n; i++)
if (n % i == 0)
ans = min(ans, i + n / i - 2);
printf... | replace | 11 | 12 | 11 | 12 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define pp pair<int, int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define mk(arr, n, type) type *arr = new type[n];
#define sl s1.length();
using namespace std;
void fastio() {
#ifndef ONLINE_JUDGE
freopen("INPUT.txt", "r", stdin);
... | #include <bits/stdc++.h>
#define int long long
#define pp pair<int, int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define mk(arr, n, type) type *arr = new type[n];
#define sl s1.length();
using namespace std;
void fastio() {
#ifndef ONLINE_JUDGE
freopen("INPUT.txt", "r", stdin);
... | replace | 34 | 35 | 34 | 35 | 0 | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long long int n;
cin >> n;
long long int a;
long long int c;
for (long long int i = 0; i < 1000000; i++) {
if (n <= i * i) {
a = i;
break;
}
}
long long int b;
for (long long int... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long long int n;
cin >> n;
long long int a;
long long int c;
for (long long int i = 0; i < 1000001; i++) {
if (n <= i * i) {
a = i;
break;
}
}
long long int b;
for (long long int... | replace | 8 | 9 | 8 | 9 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d", &a)
#define scc(a, b) scanf("%d %d", &a, &b)
#define sccc(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pf(a) printf("%d", a)
#define pff(a, b) printf("%d %d", a, b)
#define pfff(a, b, c) printf("%d %d %d", a, b, c)
#define pb(a) push_back(a)
#defi... | #include <bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d", &a)
#define scc(a, b) scanf("%d %d", &a, &b)
#define sccc(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pf(a) printf("%d", a)
#define pff(a, b) printf("%d %d", a, b)
#define pfff(a, b, c) printf("%d %d %d", a, b, c)
#define pb(a) push_back(a)
#defi... | replace | 30 | 31 | 30 | 31 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
long long n, a, b, c = 1;
int main() {
cin >> n;
for (a = 2; a * a <= n && c; a++)
c = (n % a != 0);
if (!c) {
c = n;
for (a = 2; a * 2 <= n; a++) {
if (n % a == 0) {
b = n / a;
if (a + b - 2 < c)
c = a + b - 2;
}
}
... | #include <iostream>
using namespace std;
long long n, a, b, c = 1;
int main() {
cin >> n;
for (a = 2; a * a <= n && c; a++)
c = (n % a != 0);
if (!c) {
c = n;
for (a = 2; a * a <= n; a++) {
if (n % a == 0) {
b = n / a;
if (a + b - 2 < c)
c = a + b - 2;
}
}
... | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int long long
int n;
vector<int> v;
void check(int a, int b) {
if (a * b == n)
v.push_back(a + b - 2);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int long long
int n;
vector<int> v;
void check(int a, int b) {
if (a * b == n)
v.push_back(a + b - 2);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i... | replace | 18 | 19 | 18 | 19 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b[1000], c = 0, d;
cin >> a;
for (int i = 1; i <= 1000000; i++) {
if (a % i == 0) {
d = a / i;
b[c] = d + i - 2;
c++;
}
}
sort(b, b + c);
cout << b[0] << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b[10000000], c = 0, d;
cin >> a;
for (int i = 1; i <= 1000000; i++) {
if (a % i == 0) {
d = a / i;
b[c] = d + i - 2;
c++;
}
}
sort(b, b + c);
cout << b[0] << endl;
return (0);
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
// int isalpha(char ch): ch がアルファベットな... | replace | 63 | 64 | 63 | 64 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<long long> division(long long n) {
vector<long long> v;
for (long long d = 1; d <= n / 2; d += 1)
if (n % d == 0)
v.push_back(d);
v.push_back(n);
return v;
}
int main() {
long long n;
cin >> n;
vector<long long> v = division(n);
vector<lo... | #include <bits/stdc++.h>
using namespace std;
vector<long long> division(long long n) {
vector<long long> v;
for (long long d = 1; d * d <= n; d += 1)
if (n % d == 0)
v.push_back(d);
v.push_back(n);
return v;
}
int main() {
long long n;
cin >> n;
vector<long long> v = division(n);
vector<lo... | replace | 6 | 7 | 6 | 7 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long m = sqrt(n);
long long i;
for (i = m; i <= n; i++) {
if (n % i == 0)
break;
}
cout << i + n / i - 2;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long m = sqrt(n);
long long i;
for (i = m; i >= 1; i--) {
if (n % i == 0)
break;
}
cout << i + n / i - 2;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n;
cin >> n;
long int ans = n;
for (int i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
long int a = (i - 1) + (n / i - 1);
ans = min(ans, a);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n;
cin >> n;
long int ans = n;
for (long int i = 1; i * i <= n; i++) {
if (n % i != 0)
continue;
long int a = (i - 1) + (n / i - 1);
ans = min(ans, a);
}
cout << ans << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t j = 1;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
j = i;
}
}
cout << j + (n / j) - 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t j = 1;
int z = sqrt(n);
for (int i = 1; i < z + 1; i++) {
if (n % i == 0) {
j = i;
}
}
cout << j + (n / j) - 2 << endl;
} | replace | 7 | 8 | 7 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdint.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
int64_t A;
cin >> A;
vector<pair<int64_t, int64_t>> v;
for (int64_t i = 1; i <= A / 2; i++) {
if (A % i == 0) {
v.push_back(pair<int64_t, int64_t>(i, A / i));
}
}
int64_t min = 1e12... | #include <iostream>
#include <stdint.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
int64_t A;
cin >> A;
vector<pair<int64_t, int64_t>> v;
for (int64_t i = 1; i * i <= A; i++) {
if (A % i == 0) {
v.push_back(pair<int64_t, int64_t>(i, A / i));
}
}
int64_t min = 1e12... | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | 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; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
const long long INF = 1e15;
using namespace std;
typedef long l... | #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; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
const long long INF = 1e15;
using namespace std;
typedef long l... | replace | 13 | 14 | 13 | 14 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, ans;
int main() {
cin >> n;
for (int i = 1; i * i <= n; i++)
if (n % i == 0)
ans = i + n / i;
cout << ans - 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, ans;
int main() {
cin >> n;
for (int i = 1; 1ll * i * i <= n; i++)
if (n % i == 0)
ans = i + n / i;
cout << ans - 2;
return 0;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 1e15;
for (int i = 1; i * i <= n; i++) {
long long int d = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 1e15;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
... | replace | 11 | 15 | 11 | 14 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int main() {
vector<ll> mass_i;
vector<ll> mass_j;
ll N, best_score;
cin >> N;
for (ll i = 1; i <= N; i++) {
if (N % i == 0) {
mass_i.push_back(i);
mass_j.push_back(N / i);
}
}
for (ll i = 0; i < mass_i.size()... | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int main() {
vector<ll> mass_i;
vector<ll> mass_j;
ll N, best_score;
cin >> N;
for (ll i = 1; i <= N; i++) {
if (i > N / i)
break;
if (N % i == 0) {
mass_i.push_back(i);
mass_j.push_back(N / i);
}
}
... | insert | 9 | 9 | 9 | 11 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | replace | 97 | 98 | 97 | 98 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int j = 1;
for (int i = 1; i * i <= N; i++)
if (N % i == 0)
j = i;
cout << j + N / j - 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int j = 1;
for (int i = 1; i <= N / i; i++)
if (N % i == 0)
j = i;
cout << j + N / j - 2 << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
const ll inff = 1000000000000000000; // 10^18
int main() {
ll n;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
const ll inff = 1000000000000000000; // 10^18
int main() {
ll n;
... | replace | 14 | 15 | 14 | 15 | -8 | |
p02881 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#include <math.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;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
// << fixed << setprecision(10) <<
int main() {
ll n;
cin ... |
#include <bits/stdc++.h>
#include <math.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;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
// << fixed << setprecision(10) <<
int main() {
ll n;
cin ... | replace | 15 | 17 | 15 | 17 | TLE | |
p02881 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 1ll * 10000 * 10000 * 10000;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, n / i + i - 2);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 1ll * 10000 * 10000 * 10000;
for (int i = 1; 1ll * i * i <= n; i++) {
if (n % i == 0) {
ans = min(ans, n / i + i - 2);
}
}
cout << ans << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | /*
Zeolim - An AC a day keeps the bug away
*/
// #pragma GCC optimize(2)
// #pragma GCC ("-W1,--stack=128000000")
#include <bits/stdc++.h>
using namespace std;
#define mp(x, y) make_pair(x, y)
#define fr(x, y, z) for (int x = y; x < z; ++x)
#define pb(x) push_back(x)
#define mem(x, y) memset(x, y, sizeof(x))
typed... | /*
Zeolim - An AC a day keeps the bug away
*/
// #pragma GCC optimize(2)
// #pragma GCC ("-W1,--stack=128000000")
#include <bits/stdc++.h>
using namespace std;
#define mp(x, y) make_pair(x, y)
#define fr(x, y, z) for (int x = y; x < z; ++x)
#define pb(x) push_back(x)
#define mem(x, y) memset(x, y, sizeof(x))
typed... | replace | 51 | 52 | 51 | 52 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
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;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
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;
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define f(i, x, n) for (ll int i = x; i < n; i++)
#define re(j, x, n) for (ll int j = x; j >= n; j--)
#define f1(k, x, n) for (ll int k = x; k <= n; k++)
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define MAX 1000001
usin... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define f(i, x, n) for (ll int i = x; i < n; i++)
#define re(j, x, n) for (ll int j = x; j >= n; j--)
#define f1(k, x, n) for (ll int k = x; k <= n; k++)
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define MAX 1000001
usin... | replace | 27 | 28 | 27 | 28 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll N;
cin >> N;
ll x = 1, y;
for (int i = 1; i * i <= N; i++) {
if (N % i == 0) {
x = i;
y = N / i;
}
}
cout << (x - 1) + (y - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll N;
cin >> N;
ll x = 1, y;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
x = i;
y = N / i;
}
}
cout << (x - 1) + (y - 1) << endl;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, min = 10000000000000000;
scanf("%lld", &n);
for (i = 1; i <= n / 2; ++i) {
if (n % i == 0) {
if (min > (i - 1 + n / i - 1))
min = (i - 1 + n / i - 1);
}
}
printf("%ld", min);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, min = 10000000000000000;
scanf("%lld", &n);
for (i = 1; i <= sqrt(n); ++i) {
if (n % i == 0) {
if (min > (i - 1 + n / i - 1))
min = (i - 1 + n / i - 1);
}
}
printf("%ld", min);
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, a = 10000000000000;
cin >> N;
for (int i = 1; i * i < N; i++) {
if (N % i == 0) {
a = min(a, N / i + i);
}
}
cout << a - 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, a = 10000000000000;
cin >> N;
for (int64_t i = 1; i * i <= N; i++) {
if (N % i == 0) {
a = min(a, N / i + i);
}
}
cout << a - 2 << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long minimum = N - 1;
for (long long i = 1; i < N / 2; i++) {
if (N % i == 0) {
minimum = min(minimum, N / i + i - 2);
}
}
cout << minimum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long minimum = N - 1;
for (long long i = 1; i <= sqrt(N); i++) {
if (N % i == 0) {
minimum = min(minimum, N / i + i - 2);
}
}
cout << minimum << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> factor(1000000, 1000000000003);
for (long long i = 1ll; i * i <= N; ++i) {
if (N % i == 0) {
factor.at(i) = i + N / i;
}
}
sort(factor.begin(), factor.end());
... | #include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> factor(1000001, 1000000000003);
for (long long i = 1ll; i * i <= N; ++i) {
if (N % i == 0) {
factor.at(i) = i + N / i;
}
}
sort(factor.begin(), factor.end());
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
unsigned long long n, minimum;
cin >> n;
minimum = n - 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
// if (((n / i) - 1) + (i - 1) < minimum)
// minimum = ((n / i) -... | #include <iostream>
using namespace std;
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
unsigned long long n, minimum;
cin >> n;
minimum = n - 1;
for (unsigned long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
// if (((n / i) - 1) + (i - 1) < minimum)
// minim... | replace | 11 | 12 | 11 | 12 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
double ans = -1 * INF;
for (double i = 1; i <= n / 2; ++i) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = -100100100;
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
ll ans = 1e18;
for (ll i = 1; i <= pow(n, 0.5); ++i) {
... | replace | 11 | 15 | 11 | 15 | TLE | |
p02881 | C++ | Time Limit Exceeded | #pragma GCC optimize( \
"O3,Ofast,inline,fast-math,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
#define in... | #pragma GCC optimize( \
"O3,Ofast,inline,fast-math,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
#define in... | replace | 2,471 | 2,472 | 2,471 | 2,473 | 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 a = 1;
ll b = 1;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
a = i;
}
}
b = n / a;
ll ans;
ans = a + b - 2;
cout << ans << 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 a = 1;
ll b = 1;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
a = i;
}
}
b = n / a;
ll ans;
ans = a + b - 2;
cout << ans << endl;... | replace | 11 | 12 | 11 | 12 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long i = 1; i <= n; i++)
using namespace std;
int main(void) {
long n;
double tmp;
long ans = 1000000000005;
cin >> n;
rep(i, n / 2 + 1) {
tmp = (double)n / i;
if (floor(tmp) != (tmp))
continue;
if (ans > i + tmp - 2)
ans = i + tmp - 2;
... | #include <bits/stdc++.h>
#define rep(i, n) for (long i = 1; i <= n; i++)
using namespace std;
int main(void) {
long n;
double tmp;
long ans = 1000000000005;
cin >> n;
rep(i, sqrt(n) + 1) {
tmp = (double)n / i;
if (floor(tmp) != (tmp))
continue;
if (ans > i + tmp - 2)
ans = i + tmp - 2;... | replace | 8 | 9 | 8 | 9 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
for (ll i = sqrt(N); i >= 1; i++) {
if (N % i == 0) {
cout << i + (N / i) - 2 << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
for (ll i = sqrt(N); i >= 1; i--) {
if (N % i == 0) {
cout << i + (N / i) - 2 << endl;
break;
}
}
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll n1, n2 = 0;
ll ans = 1e+13;
for (ll i = 1; i < floor(n / 2) + 1; i++) {
// cout << "i = " << i << " n/i = " << n/i << " ans = "<<ans<<endl;
if ((n / i) * i == n) {
n1 = i;
n2 = (n / i);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll n1, n2 = 0;
ll ans = 1e+13;
for (ll i = 1; i < sqrt(n) + 1; i++) {
if (ans > i + (n / i) - 2 && i * (n / i) == n) {
ans = i + (n / i) - 2;
}
}
cout << ans;
} | replace | 10 | 19 | 10 | 13 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000000
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vs vector<string>
#define psi pair<string, ll>
#define pii pair<ll, ll>
#define vsi vector<psi>
#define vii vector<pii>
#define mp make_pair
#define pb push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000000
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vs vector<string>
#define psi pair<string, ll>
#define pii pair<ll, ll>
#define vsi vector<psi>
#define vii vector<pii>
#define mp make_pair
#define pb push_back
#defin... | replace | 59 | 60 | 59 | 60 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
i = sqrt(n);
while (1) {
if (n % i == 0) {
cout << n / i + i - 2;
break;
}
i++;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
i = sqrt(n);
while (1) {
if (n % i == 0) {
cout << n / i + i - 2;
break;
}
i--;
}
return 0;
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02881 | C++ | Time Limit Exceeded |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T...... | replace | 54 | 55 | 54 | 55 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 10000... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 10000... | replace | 29 | 30 | 29 | 30 | TLE | |
p02881 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t start = int64_t(sqrt(n));
if (start * start == n) {
cout << 2 * (start - 1) << endl;
return 1;
}
while (n % start != 0)
start--;
int64_t ans = (start - 1) + (n / start - 1);
cout << ans << endl;
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t start = int64_t(sqrt(n));
// if(start*start == n) {
// cout<<2*(start-1)<<endl;
// return 1;
// }
while (n % start != 0)
start--;
int64_t ans = (start - 1) + (n / start - 1);
cout << ans << endl;
... | replace | 8 | 12 | 8 | 12 | 0 | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(n) n.begin(), n.end()
#define yn(x) cout << (x ? "Yes" : "No") << endl;
int main() {
ll n;
cin >> n;
ll ans = n;
rep(i, n + 1) {
rep(j, n + 1) {
if (n == i * j)
ans = m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(n) n.begin(), n.end()
#define yn(x) cout << (x ? "Yes" : "No") << endl;
int main() {
ll n;
cin >> n;
ll ans;
for (ll i = sqrt(n); i > 0; i--) {
if (n % i == 0) {
ans = i + n / ... | replace | 10 | 15 | 10 | 15 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
long long int a, b;
int main() {
cin >> a;
b = 0;
for (int i = 1; i * i <= a; i++) {
if (a % i == 0) {
b = i;
}
}
cout << a / b + b - 2 << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
using namespace std;
long long int a, b;
int main() {
cin >> a;
b = 0;
for (long long int i = 1; i * i <= a; i++) {
if (a % i == 0) {
b = i;
}
}
cout << a / b + b - 2 << endl;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b... | replace | 182 | 183 | 182 | 183 | TLE | |
p02881 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = N - 1;
for (ll i = 1; i * i <= N; i++) {
for (ll j = i; i * j <= N; j++) {
if (i * j == N) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = N - 1;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ll j = N / i;
ans = min(ans, j... | replace | 13 | 18 | 13 | 16 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.