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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, k;
cin >> n >> k;
long long kk;
kk = k;
long long nn = 1000000000000000000;
if (n % k == 0) {
cout << 0 << endl;
return (0);
}
while (1) {
n = labs(n - k);
if (n > nn)
break;
nn = n;
}
cout << min(... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, k;
cin >> n >> k;
long long kk;
kk = k;
long long nn = 1000000000000000000;
if (n % k == 0) {
cout << 0 << endl;
return (0);
}
n = n % k;
while (1) {
n = labs(n - k);
if (n > nn)
break;
nn = n;
}
... | insert | 12 | 12 | 12 | 13 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
return 0;
}
for (ll i = 0; i < 1e17; ++i) {
if ((abs(n - k)) < n) {
n = abs(n - k);
} else {
break;
}
}
... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll flag = n / k;
n -= flag * k;
if (n % k == 0) {
cout << 0 << endl;
return 0;
}
for (ll i = 0; i < 1e17; ++i) {
if ((abs(n - k)) < n) {
n = abs(n - k);
... | insert | 7 | 7 | 7 | 9 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (k >= n) {
cout << min(n, k - n) << '\n';
} else {
cout << min(n % k, k - (n % k)) << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
long long n, k;
int main() {
cin >> n >> k;
if (k >= n) {
cout << min(n, k - n) << '\n';
} else {
cout << min(n % k, k - (n % k)) << '\n';
}
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
LL n, k;
cin >> n >> k;
LL d = abs(n - k);
LL x = n / d;
LL ans = min(n - x * d, abs(n - x * (d + 1)));
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
LL n, k;
cin >> n >> k;
cout << min(n % k, abs(n % k - k)) << endl;
}
| replace | 10 | 15 | 10 | 11 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t;
cin >> n >> k;
t = n % k;
cout << min(t, k - t);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, t;
cin >> n >> k;
t = n % k;
cout << min(t, k - t);
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define foi(i, k, n) for (int i = (int)k; i < (int)n; ++i)
using namespace std;
using ii = pair<int, int>;
using ll = long long;
constexpr int MAXN = 5 + 1000;
int a[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll a, b;
cin >> a >> b;
cout... | #include <bits/stdc++.h>
#define foi(i, k, n) for (int i = (int)k; i < (int)n; ++i)
using namespace std;
using ii = pair<int, int>;
using ll = long long;
constexpr int MAXN = 5 + 1000;
int a[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll n, k;
cin >> n >> k;
ll a... | replace | 14 | 17 | 14 | 26 | 0 | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
cout << min(n % k, k - (n % k));
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
long long n, k;
int main() {
cin >> n >> k;
cout << min(n % k, k - (n % k));
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, k;
int main() {
cin >> n >> k;
while (n > k)
n -= k;
n = min(n, k - n);
cout << n;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, k;
int main() {
cin >> n >> k;
if (n > k)
n %= k;
n = min(n, k - n);
cout << n;
return 0;
} | replace | 6 | 8 | 6 | 8 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
using namespace std;
long long n, k, ans;
map<int, int> mp;
int main() {
scanf("%lld%lld", &n, &k);
if (n % k == 0)
ans = 0;
else {
while (n > k) {
n -= ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
using namespace std;
long long n, k, ans;
map<int, int> mp;
int main() {
scanf("%lld%lld", &n, &k);
if (n % k == 0)
ans = 0;
else {
if (n > k) {
n %= k;
... | replace | 16 | 18 | 16 | 18 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k, mn;
cin >> n >> k;
mn = n;
if (n % k > 0) {
while (n > 0) {
n = n - k;
mn = min(abs(n), mn);
}
} else {
mn = 0;
}
cout << mn << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k, mn;
cin >> n >> k;
mn = n;
if (n % k > 0) {
mn = min(n - (n / k * k), abs(n - (n / k * k + k)));
} else {
mn = 0;
}
cout << mn << endl;
} | replace | 7 | 11 | 7 | 8 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << min(n % m, m - (n % m)) << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
cout << min(n % m, m - (n % m)) << '\n';
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, abs(n % k - k)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
cout << min(n % k, abs(n % k - k)) << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, abs(k - n % k));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
cout << min(n % k, abs(k - n % k));
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
typedef std::pair<int, int> ipair;
bool lessPair(const ipair &l, const ipair &r) { return l.second < r.second; }
bool greater... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
typedef std::pair<int, int> ipair;
bool lessPair(const ipair &l, const ipair &r) { return l.second < r.second; }
bool greater... | replace | 86 | 87 | 86 | 87 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, sur, ans;
cin >> N >> K;
sur = N % K;
ans = min(sur, K - sur);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K, sur, ans;
cin >> N >> K;
sur = N % K;
ans = min(sur, K - sur);
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define PI 3.14159265358979
typedef long long int ll... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define PI 3.14159265358979
typedef long long int ll... | replace | 23 | 24 | 23 | 24 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, k, a, b;
cin >> n >> k;
a = n % k;
if (a - k >= 0) {
b = a - k;
} else {
b = k - a;
}
if (a >= b) {
cout << b << endl;
} else {
cout << a << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n, k, a, b;
cin >> n >> k;
a = n % k;
if (a - k >= 0) {
b = a - k;
} else {
b = k - a;
}
if (a >= b) {
cout << b << endl;
} else {
cout << a << endl;
}
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
ll n, k;
cin >> n >> k;
while (n > abs(n - k)) {... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
ll n, k;
cin >> n >> k;
if (n > k)
n = n - (... | insert | 15 | 15 | 15 | 17 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
int main() {
lld N, K;
cin >> N >> K;
while (N > K)
N = N - K;
cout << min(N, K - N) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
int main() {
lld N, K;
cin >> N >> K;
if (N > K)
N %= K;
cout << min(N, K - N) << endl;
} | replace | 7 | 9 | 7 | 9 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long unsigned x, y, anti_rem;
cin >> x >> y;
if (x % y == 0) {
cout << 0 << endl;
} else if (x < y) {
anti_rem = labs(x - y);
cout << min(x, anti_rem) << endl;
} else {
while (x > y) {
x = x - y;
}
long long unsigned... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long unsigned x, y, anti_rem;
cin >> x >> y;
if (x % y == 0) {
cout << 0 << endl;
} else if (x < y) {
anti_rem = labs(x - y);
cout << min(x, anti_rem) << endl;
} else {
x = x % y;
long long unsigned xx = labs(x - y);
cout ... | replace | 11 | 14 | 11 | 12 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define R(i, n) for (int i = 0; i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SL(a) scanf("%lld", &a)
#... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define R(i, n) for (int i = 0; i < n; i++)
#define S(a) scanf("%d", &a)
#define S2(a, b) scanf("%d%d", &a, &b)
#define S3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SL(a) scanf("%lld", &a)
#... | replace | 25 | 36 | 25 | 28 | TLE | |
p02719 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD ... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD ... | delete | 110 | 111 | 110 | 110 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
N = N % K;
if (K / 2 < N) {
N = abs(N - K);
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
N = N % K;
if (K / 2 < N) {
N = abs(N - K);
}
cout << N << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
const int mod = 1'000'000'007;
ll factor(ll n, ll k) {
ll x = abs(n - k);
if (x > n) {
return n;
}... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, x, n) for (int i = x; i < n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
const int mod = 1'000'000'007;
ll factor(ll n, ll k) {
ll x = abs(n - k);
if (x > n) {
return n;
}... | replace | 24 | 26 | 24 | 28 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
ll x;
int i = 2;
while (i) {
if (N - K < 0) {
i--;
}
x = N;
N = labs(N - K);
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
ll x;
int i = 2;
N = N % K;
while (i) {
if (N - K < 0) {
i--;
}
x = N;
N = l... | insert | 14 | 14 | 14 | 15 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
while (1) {
if (N < abs(N - K))
break;
N = abs(N - K);
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
N %= K;
cout << min(N, abs(N - K)) << endl;
} | replace | 6 | 17 | 6 | 8 | TLE | |
p02719 | 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;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
constexpr int mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
constexpr int mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x ... | insert | 78 | 78 | 78 | 81 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
while (true) {
long long oldN = N;
N = min(N, abs(N - K));
if (oldN == N) {
break;
}
}
cout << N;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long amari = N % K;
long long ans = min(amari, K - amari);
cout << ans;
} | replace | 5 | 13 | 5 | 10 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define BIGINF (int)4e18 + 7
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define INF (int)2e9 + 7
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) ... | #include <bits/stdc++.h>
using namespace std;
#define BIGINF (int)4e18 + 7
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define INF (int)2e9 + 7
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) ... | replace | 22 | 27 | 22 | 27 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
k = k % n;
ll ans_2 = 0;
ans_2 = abs(n - k);
ans = min(ans_2, min(n, k));
cout... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
n = n % k;
ans = min(n, k - n);
cout << ans << endl;
return 0;
}
| replace | 11 | 15 | 11 | 13 | 0 | |
p02719 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
using namespace std;
int main() {
int N, K;
int a, b;
cin >> N >> K;
if (N > K) {
a = N % K;
b = K - a;
if (a <= b)
cout << a << endl;
else
cout << b << endl;
} else if (N ... | #include <iostream>
#include <map>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <time.h>
using namespace std;
int main() {
long long N, K;
long long a, b;
cin >> N >> K;
if (N > K) {
a = N % K;
b = K - a;
if (a <= b)
cout << a << endl;
else
cout << b << endl;
}... | replace | 9 | 11 | 9 | 11 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << min(N % K, K - (N % K));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
cout << min(N % K, K - (N % K));
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef priority_queue... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef priority_queue... | replace | 56 | 57 | 56 | 57 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
ll n, k;
cin >> n >> k;
if (k == 1 or n == k)
cout << 0;
else {
if (n < k)
cout << min(n, k - n);
else if (n % k == 0)
cout << 0;
else {
set<ll> xs;
while (true)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
ll n, k;
cin >> n >> k;
if (k == 1 or n == k)
cout << 0;
else {
if (n < k)
cout << min(n, k - n);
else if (n % k == 0)
cout << 0;
else
cout << min(n % k, k - (n % k));... | replace | 18 | 29 | 18 | 20 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long tmp = abs(n - k);
if (n % k == 0)
n = 0;
while (n > tmp) {
n = tmp;
tmp = abs(n - k);
}
cout << n << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
n = n % k;
long long ans = min(n, k - n);
cout << ans << endl;
return 0;
} | replace | 8 | 16 | 8 | 11 | TLE | |
p02719 | 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 | 18 | 24 | 18 | 19 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
long long ans = N;
while (1) {
if (ans >= K) {
ans = ans - K;
} else {
break;
}
}
ans = min(ans, K - ans);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
long long ans = N % K;
ans = min(ans, K - ans);
cout << ans << endl;
return 0;
} | replace | 7 | 15 | 7 | 8 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<i... | replace | 63 | 77 | 63 | 64 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (n % k == 0 || n == k) {
cout << "0";
return 0;
} else {
if (k > 2 * n) {
cout << n;
} else {
while (1) {
long long m = n;
n = abs(n - k);
if (m < n) {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
cout << min(n % k, abs(n % k - k));
} | replace | 6 | 23 | 6 | 7 | TLE | |
p02719 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, int(n) + 1)
#define RREP(i, n) RFOR(i, 0, n)
#define RREP1(i, n) RFOR(i, 1, int(n) + 1)
#def... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, int(n) + 1)
#define RREP(i, n) RFOR(i, 0, n)
#define RREP1(i, n) RFOR(i, 1, int(n) + 1)
#def... | replace | 26 | 36 | 26 | 29 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
template <class A> void pr(A a) { cout << a << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b,... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
template <class A> void pr(A a) { cout << a << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b,... | replace | 25 | 29 | 25 | 29 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
n = n % k;
if (n == 0 || (n < k && n < abs(n - k))) {
cout << n << endl;
return 0;
} else
cout << abs(n - k) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
n = n % k;
if (n == 0 || (n < k && n < abs(n - k))) {
cout << n << endl;
return 0;
} else
cout << abs(n - k) << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long m = abs(a - b);
long long i = 1;
for (;;) {
if (m < abs(a - i * b))
break;
else {
m = abs(a - i * b);
i++;
continue;
}
}
cout << min(a, ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long m = min(abs(b - (a % b)), a % b);
cout << min(a, m) << endl;
return 0;
}
| replace | 8 | 19 | 8 | 9 | TLE | |
p02719 | C++ | Runtime Error | // vector<vector<int>> data(3,
// vector<int>(4));//int型の2次元配列(3×4要素の)の宣言 int64_t a; 10のi乗pow(10,
// i);
#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() {
/* code */
int N, K;
cin >> N >> K;
cout << min(N % K, K - N % K) << end... | // vector<vector<int>> data(3,
// vector<int>(4));//int型の2次元配列(3×4要素の)の宣言 int64_t a; 10のi乗pow(10,
// i);
#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() {
int64_t n, k;
cin >> n >> k;
// int a;
cout << min(n % k, abs(n % k - ... | replace | 10 | 15 | 10 | 18 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
int t = 0;
if (k == 1) {
cout << 0 << endl;
return 0;
}
while (t == 0) {
if (n > abs(n - k)) {
n = abs(n - k);
} else {
break;
}
}
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
int t = 0;
if (k == 1) {
cout << 0 << endl;
return 0;
}
n = n % k;
while (t == 0) {
if (n > abs(n - k)) {
n = abs(n - k);
} else {
break;
}
}
cout << n << endl;
}
| insert | 12 | 12 | 12 | 13 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k, m;
cin >> n >> k;
while (true) {
m = abs(n - k);
if (m >= n) {
break;
} else {
n = m;
}
}
cout << n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, k, m;
cin >> n >> k;
if (n > k) {
n %= k;
}
while (true) {
m = abs(n - k);
if (m >= n) {
break;
} else {
n = m;
}
}
cout << n << endl;
return 0;
} | insert | 8 | 8 | 8 | 12 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
long long ans = N;
while (1) {
long long tmp = llabs(llabs(N) - llabs(K));
N = tmp;
if (N < ans) {
ans = N;
} else {
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
N = N % K;
long long ans = N;
while (1) {
long long tmp = llabs(llabs(N) - llabs(K));
N = tmp;
if (N < ans) {
ans = N;
} else {
bre... | insert | 11 | 11 | 11 | 13 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
unsigned long long k, n;
int main() {
cin >> n >> k;
if (max(n, k) % min(n, k) != 0)
if (n > k)
cout << k - n % k;
else
cout << max(n, k) - min(n, k);
if (max(n, k) % min(n, k) == 0)
if (n < k)
cout << n;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
unsigned long long k, n;
int main() {
cin >> n >> k;
if (n == 0)
cout << 0, exit(0);
n %= k;
cout << min(n, k - n);
} | replace | 5 | 15 | 5 | 9 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, k - n % k);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long n, k;
cin >> n >> k;
cout << min(n % k, k - n % k);
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
cout << min(n % k, k - (n % k)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, k;
int main() {
cin >> n >> k;
cout << min(n % k, k - (n % k)) << endl;
return 0;
}
| replace | 2 | 3 | 2 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % b == 0) {
cout << 0 << endl;
} else if (a % b <= b - a % b) {
cout << a % b << endl;
} else
cout << b - a % b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a % b == 0) {
cout << 0 << endl;
} else if (a % b <= b - a % b) {
cout << a % b << endl;
} else
cout << b - a % b << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, k;
cin >> x >> k;
long long remainder = max(x, k) % min(x, k);
long long ans = min(remainder, k - remainder);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, k;
cin >> x >> k;
long long remainder = x % k;
long long ans = min(remainder, k - remainder);
cout << ans << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, k;
vector<long long> v;
cin >> n >> k;
long long m = n;
v.push_back(n);
bool ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, k;
vector<long long> v;
cin >> n >> k;
long long m = n;
v.push_back(n);
bool ... | replace | 20 | 21 | 20 | 24 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll maxv = max(a, b);
ll minv = min(a, b)... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll maxv = max(a, b);
ll minv = min(a, b)... | replace | 27 | 28 | 27 | 28 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int n, k, min;
cin >> n >> k;
if (n % k == 0) {
cout << 0;
} else {
do {
min = n;
n = abs(n - k);
} while (n < min);
cout << min;
}
// system("pa... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int n, k, min;
cin >> n >> k;
if (n % k == 0) {
cout << 0;
} else {
n %= k;
do {
min = n;
n = abs(n - k);
} while (n < min);
cout << min;
}
/... | insert | 13 | 13 | 13 | 14 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, K;
cin >> N >> K;
long long x = N;
long long tmp = abs(N - K);
bool isExist = (x > tmp);
while (isExist) {
x = tmp;
tmp = abs(tmp - K);
if (x <= tmp) {
break;
}
}
cout << x << endl;
}
int main() {
std::cou... | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, K;
cin >> N >> K;
cout << min(N % K, abs(K - N % K)) << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
} | replace | 6 | 17 | 6 | 8 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
const int INF = 1e9 + 10;
long long N, K;
cin >> N >> K;
int chk = 0;
long long min = INF;
N = N - K * (N / K);
while (chk == 0) {
N = abs(N - K);
if (N == min)
chk++;
if (N ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
const long long INF = 1e18 + 10;
long long N, K;
cin >> N >> K;
int chk = 0;
long long min = INF;
N = N - K * (N / K);
while (chk == 0) {
N = abs(N - K);
if (N == min)
chk++;
... | replace | 5 | 6 | 5 | 6 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | replace | 161 | 162 | 161 | 162 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
while (N > abs(N - K)) {
N = abs(N - K);
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
N %= K;
while (N > abs(N - K)) {
N = abs(N - K);
}
cout << N << endl;
} | insert | 6 | 6 | 6 | 7 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <math.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
map<long long, bool> mp;
long long ans = n;
while (!mp[abs(n - k)]) {
mp[abs(n - k)] = 1;
ans = min(ans, abs(n - k));
n = abs(n - k);
}
cout << ans;
}
| #include <iostream>
#include <map>
#include <math.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
n %= k;
cout << min(n, abs(k - n));
}
| replace | 8 | 16 | 8 | 10 | TLE | |
p02719 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define nl "\n"... | #include "bits/stdc++.h"
using namespace std;
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define nl "\n"... | replace | 15 | 18 | 15 | 21 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
ll diff = abs(n - k);
ll mod = n % diff;
if (mod == k) {
cout << 0 << endl;
} else {
cout << mo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
ll mod = n % k;
ll modEdit = k - mod;
cout << min(mod, modEdit) << endl;
return 0;
} | replace | 11 | 18 | 11 | 14 | 0 | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const ll maxn = 1005;
const ll mod = 1e9 + 7;
const ll inf = 1 <... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const ll maxn = 1005;
const ll mod = 1e9 + 7;
const ll inf = 1 <... | replace | 18 | 22 | 18 | 22 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
if (n == k) {
cout << 0 << endl;
} else if (n < k) {
cout << min(n, k - n) << endl;
} else {
bool f = true;
while (f) {
n = n - k;
if (n <= k) {
f = false;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
if (n == k) {
cout << 0 << endl;
} else if (n < k) {
cout << min(n, k - n) << endl;
} else {
cout << min(n % k, k - n % k) << endl;
}
} | replace | 12 | 20 | 12 | 13 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
typedef int ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a, h) memset(a, (h), sizeof(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define F first
#define S s... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a, h) memset(a, (h), sizeof(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define F first
#defi... | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | /* Author - thiolhub */
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define db double
#define pi 3.1415926535897932384626
#define PI acos(-1.0)
#define endl "\n"
#define mod 1000000007
#define mk make_pair
#define pb push_back
#define pii pair<int, int>
#define vi ve... | /* Author - thiolhub */
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define db double
#define pi 3.1415926535897932384626
#define PI acos(-1.0)
#define endl "\n"
#define mod 1000000007
#define mk make_pair
#define pb push_back
#define pii pair<int, int>
#define vi ve... | replace | 38 | 39 | 38 | 39 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main() {
ll N, K;
cin >> N >> K;
while (1) {
if (N > abs(N - K)) {
N = abs(N - K);
} else {
break;
}
}
cout << N << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef long double ld;
int main() {
ll N, K;
cin >> N >> K;
N = N - (N / K) * K;
while (1) {
if (N > abs(N - K)) {
N = abs(N - K);
} else {
break;
}
}
cout ... | insert | 11 | 11 | 11 | 13 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
while (n > abs(n - k)) {
n = abs(n - k);
}
cout << n << endl;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
n = n % k;
while (n > abs(n - k)) {
n = abs(n - k);
}
cout << n << endl;
} | insert | 10 | 10 | 10 | 11 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int((a).size())
#define int long long
#define all(c) c.begin(), c.end()
#define FAST ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define present(c, x) ((c).find(x) != (c).end())
#defi... | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int((a).size())
#define int long long
#define all(c) c.begin(), c.end()
#define FAST ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define present(c, x) ((c).find(x) != (c).end())
#defi... | replace | 30 | 31 | 30 | 31 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, m;
int main() {
cin >> n >> m;
if (n % m == 0)
cout << "0";
else {
while (n > abs(n - m)) {
n = abs(n - m);
// cout<<abs(n-m)<<endl;
}
cout << n << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, m;
int main() {
cin >> n >> m;
if (n % m == 0)
cout << "0";
else if (n < m) {
if (n < m - n)
cout << n;
if (n >= m - n)
cout << m - n;
} else {
n %= m;
if (n > m - n) {
n = m - n;
// cout<<abs(n-m)<<endl;
... | replace | 7 | 10 | 7 | 16 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
scanf("%lli%lli", &n, &k);
if (n % k == 0) {
printf("0\n");
} else {
long long int mini;
mini = n;
while (1) {
n = abs(n - k);
if (n < mini) {
mini = n;
} else if (n == mini) {
printf... | #include <bits/stdc++.h>
using namespace std;
main() {
unsigned long long n, k, m, ans;
cin >> n >> k;
m = n % k;
if ((k - m) < m)
cout << k - m << '\n';
else
cout << m << '\n';
} | replace | 2 | 20 | 2 | 10 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll i, j, k, l, m, n, o, p, q, r, s, t, x, a[500], tt = 0;
cin >> n >> m;
p = (n % m);
q = m % n;
r = m - p;
s = n - q;
cout << min({p, q, r, s}) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll i, j, k, l, m, n, o, p, q, r, s, t, x, a[500], tt = 0;
cin >> n >> m;
p = (n % m);
q = m % n;
r = m - p;
s = n - q;
cout << min({p, r}) << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | replace | 27 | 32 | 27 | 28 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int n, k;
int left, right;
cin >> n >> k;
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll n, k;
ll left, right;
cin >> n >> k;
le... | replace | 14 | 16 | 14 | 16 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
if (k == 1)
n = 0;
while (abs(n - k) < n)
n = abs(n - k);
cout << n;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
n = n % k;
if (2 * n > k)
cout << abs(n - k);
else
cout << n;
}
| replace | 6 | 11 | 6 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
while (n > k) {
n = n - k;
}
if (n <= k / 2) {
cout << n;
} else {
n = k - n;
cout << n << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
n = n % k;
if (n <= k / 2) {
cout << n;
} else {
n = k - n;
cout << n << endl;
}
return 0;
} | replace | 7 | 10 | 7 | 8 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | replace | 23 | 35 | 23 | 26 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, k - n % k);
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
cout << min(n % k, k - n % k);
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase = 1;
// cin>>testcase;
for (int p = 0; p < testcase; p++) {
ll n = 0, k = 0;
cin >> n >> k;
cout << min((n) % (abs(n - k)), (n % k));
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase = 1;
// cin>>testcase;
for (int p = 0; p < testcase; p++) {
ll n = 0, k = 0;
cin >> n >> k;
n = n % k;
cout << min(n, abs(n - k));
}
return 0;
}
| replace | 12 | 13 | 12 | 14 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << "\n"
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define _sort(a) sort(a.begin(), a.end())
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<int, int>;
int main() {
ios::sync_with_st... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << "\n"
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define _sort(a) sort(a.begin(), a.end())
using namespace std;
using ll = long long;
using vi = vector<int>;
using vii = vector<int, int>;
int main() {
ios::sync_with_st... | replace | 17 | 20 | 17 | 18 | TLE | |
p02719 | C++ | Time Limit Exceeded | // Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define add(x) accumulate(x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = a; i ... | // Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define add(x) accumulate(x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = a; i ... | replace | 31 | 38 | 31 | 33 | TLE | |
p02719 | C++ | Runtime Error | /*
Author : Nishant Gupta 2.0
*/
#include <bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 100005
#define LOG_MAX 20
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define chk(a) cer... | /*
Author : Nishant Gupta 2.0
*/
#include <bits/stdc++.h>
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 100005
#define LOG_MAX 20
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18))
#define chk(a) cer... | replace | 66 | 79 | 66 | 73 | 0 | |
p02719 | 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, k;
cin >> n >> k;
while (true) {
ll tmp = n;
if (abs(n - k) < n)
n = abs(n - k);
if (tmp == n)
break;
}
cout << n << endl;
return 0;
}
| #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, k;
cin >> n >> k;
if (n >= k)
n = n % k;
while (true) {
ll tmp = n;
if (abs(n - k) < n)
n = abs(n - k);
if (tmp == n)
break;
}
cout << n << e... | insert | 8 | 8 | 8 | 11 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int K;
int min;
cin >> N >> K;
min = N % K;
if (min > K - min) {
min = K - min;
}
cout << min << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long K;
long min;
cin >> N >> K;
min = N % K;
if (min > K - min) {
min = K - min;
}
cout << min << endl;
}
| replace | 4 | 7 | 4 | 7 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll ans = N;
while (true) {
if (abs(ans - K) >= ans) {
break;
}
ans = abs(ans - K);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll ans;
ans = min(N % K, abs(N % K - K));
cout << ans << endl;
} | replace | 6 | 13 | 6 | 8 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << min(N % K, K - N % K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
cout << min(N % K, K - N % K) << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits... | replace | 40 | 42 | 40 | 42 | 0 | |
p02719 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
Int n, k;
cin >> n >> k;
Int ans = 0;
if (n < k) {
ans = n;
} else {
an... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
Int n, k;
cin >> n >> k;
n = n - (n / k * k);
Int ans = min(n, abs(n - k));
cou... | replace | 14 | 21 | 14 | 16 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << min(N % K, K - N % K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
cout << min(N % K, K - N % K) << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e16;
signed main() {
int N, K;
cin >> N >> K;
int ans;
if (K == 1)
ans = 0;
if (N > K) {
while (N > K) {
N -= K;
ans = min(N, K - N);
}
}
if (N < K)
ans = min(N, K - N);
if (N == K)
ans ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e16;
signed main() {
int N, K;
cin >> N >> K;
int ans;
if (K == 1)
ans = 0;
if (N > K) {
int x = N / K;
N -= x * K;
ans = min(N, K - N);
}
if (N < K)
ans = min(N, K - N);
if (N == K)
ans = 0;
... | replace | 12 | 16 | 12 | 15 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, K;
cin >> N >> K;
long int num1, num2;
if (N > K) {
if (N % K == 0) {
num1 = 0;
num2 = 0;
} else {
while (N > K) {
N = N - K;
}
num1 = N;
N = K - N;
num2 = N;
}
} else if (N... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, K;
cin >> N >> K;
long int num1, num2;
if (N > K) {
num1 = N % K;
num2 = K - num1;
} else if (N < K) {
num1 = N;
N = K - N;
num2 = N;
} else {
num1 = N;
num2 = N - K;
}
if (num1 <= num2) {
cout <<... | replace | 11 | 22 | 11 | 13 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int a, k, q = -1;
for (long long int i = 1; i <= 1000000000000000000; i++) {
a = abs(a - k);
q = min(q, a);
}
cout << q << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int x, k, x3 = 0, x4 = 0;
cin >> x >> k;
cout << min(x % k, abs((x % k) - k)) << endl;
}
| replace | 6 | 12 | 6 | 9 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int n, t, k;
cin >> n >> k;
if (n % k == 0)
cout << "0" << endl;
else {
do {
t = n;
n = n - k;
if (n < 0)
n = -n;
} while (n < t);
cout << t << endl;
}
} | #include <iostream>
using namespace std;
int main() {
long long int n, t, k;
cin >> n >> k;
if (n % k == 0)
cout << "0" << endl;
else {
n = n % k;
do {
t = n;
n = n - k;
if (n < 0)
n = -n;
} while (n < t);
cout << t << endl;
}
} | insert | 8 | 8 | 8 | 9 | TLE | |
p02719 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, k, a;
int main() {
cin >> n >> k;
a = n % k;
if (k - a >= a)
cout << a;
else
cout << k - a;
return 0;
} | #include <iostream>
using namespace std;
long long n, k, a;
int main() {
cin >> n >> k;
a = n % k;
if (k - a >= a)
cout << a;
else
cout << k - a;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll... | replace | 64 | 69 | 64 | 66 | 0 | |
p02719 | C++ | Time Limit Exceeded | // C - Replacing Integer
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll n, k;
cin >> n >> k;
if (n == 0)
cout << 0 << endl;
else if (n % k == 0)
cout << 0 << endl;
else {
while (1)... | // C - Replacing Integer
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll n, k;
cin >> n >> k;
ll t = n % k;
ll ans = min(t, k - t);
cout << ans << endl;
return 0;
} | replace | 10 | 23 | 10 | 13 | TLE | |
p02719 | C++ | Time Limit Exceeded |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
typedef long long ll;
#define int ll
#define fori(n) for (int i = 0; i < int(n); i++)
#define cins(s) \... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
typedef long long ll;
#define int ll
#define fori(n) for (int i = 0; i < int(n); i++)
#define cins(s) \... | replace | 49 | 50 | 49 | 54 | TLE | |
p02719 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k, x, y, f;
cin >> n >> k;
f = (n / k) + 1;
n = n - (k * f);
x = -n;
y = n + k;
if (x < y) {
cout << x;
} else {
cout << y;
}
} | #include <iostream>
using namespace std;
int main() {
long long int n, k, x, y, f;
cin >> n >> k;
f = (n / k) + 1;
n = n - (k * f);
x = -n;
y = n + k;
if (x < y) {
cout << x;
} else {
cout << y;
}
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, y;
cin >> x >> y;
while (x % y == 0) {
x /= y;
}
return x % y == 1;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, y;
cin >> x >> y;
long long int ans = min(x % y, y - (x % y));
cout << ans;
}
| replace | 5 | 9 | 5 | 7 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll mini = n, tmp = 0;
if (n % k == 0) {
cout << 0 << endl;
return 0;
}
while (1) {
mini = min(abs(mini - k), mini);
if (mini == tmp) {
break;
}
tmp = mini;
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll tmp = n % k;
ll ans = min(abs(tmp - k), tmp);
cout << ans << endl;
} | replace | 8 | 21 | 8 | 11 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.