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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >>... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >>... | replace | 21 | 22 | 21 | 22 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll cnt = 0;
for (int i = 0; i <= 1000; i++) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll cnt = 0;
for (int i = 1000; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
return 0;
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (int i = n; i < (i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (int i = n; i < (i... | replace | 36 | 37 | 36 | 37 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> n(100);
int C = min(A, B);
for (int i = 1; i <= C; i++) {
if (A % i == 0 && B % i == 0)
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> n(110);
int C = min(A, B);
for (int i = 1; i <= C; i++) {
if (A % i == 0 && B % i == 0)
... | replace | 15 | 16 | 15 | 16 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
int gcd(int A, int B) {
if (B % A == 0) {
return A;
} else {
return gcd(A % B, B);
}
}
std::vector<int> enum_div(int n) {
std::vector<int> ret;
for (int i = 1; i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
}
}
return ret;
}
int main(int a... | #include <iostream>
#include <vector>
int gcd(int A, int B) {
if (B % A == 0) {
return A;
} else {
return gcd(B % A, B);
}
}
std::vector<int> enum_div(int n) {
std::vector<int> ret;
for (int i = 1; i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
}
}
return ret;
}
int main(int a... | replace | 7 | 8 | 7 | 8 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | replace | 42 | 43 | 42 | 43 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <string>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> retu(100);
for (int i = 1; i < 101; i++) {
if (A % i == 0) {
if (B % i == 0) {
retu.at(i) = i;
}
}
}
sort(retu.begin(), retu.end());
rev... | #include <bits/stdc++.h>
#include <math.h>
#include <string>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> retu(101);
for (int i = 1; i < 101; i++) {
if (A % i == 0) {
if (B % i == 0) {
retu.at(i) = i;
}
}
}
sort(retu.begin(), retu.end());
rev... | replace | 8 | 9 | 8 | 9 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >>... | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >>... | replace | 24 | 25 | 24 | 25 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | replace | 33 | 34 | 33 | 34 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i < max(A, B); i++) {
if (0 == (A % i) && 0 == (B % i))
v.push_back(i);
}
// 順序反転
reverse(v.begin(), v.end());
// 出力
cout << v[K - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i <= max(A, B); i++) {
if (0 == (A % i) && 0 == (B % i))
v.push_back(i);
}
// 順序反転
reverse(v.begin(), v.end());
// 出力
cout << v[K - 1] << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int x = A;
while (A % x == 0 && B % x == 0)
x--;
int i = x, y = 1;
while (y < K) {
i--;
if (x % i == 0)
y++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int x = A;
while (A % x != 0 || B % x != 0)
x--;
int i = x, y = 1;
while (y < K) {
i--;
if (x % i == 0)
y++;
}
cout << i << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, L, ans;
cin >> A >> B >> K;
if (A > B)
L = A;
else
L = B;
vector<int> vec = {};
for (int i = 1; i <= L; i++) {
if (A % i == 0 && B % i == 0)
vec.push_back(i);
}
int size = vec.size();
ans = vec.at(size - K + 1);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, L, ans;
cin >> A >> B >> K;
if (A > B)
L = A;
else
L = B;
vector<int> vec = {};
for (int i = 1; i <= L; i++) {
if (A % i == 0 && B % i == 0)
vec.push_back(i);
}
int size = vec.size();
ans = vec.at(size - K);
c... | replace | 16 | 17 | 16 | 17 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> v;
for (int i = 0; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> v;
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
return ... | replace | 8 | 9 | 8 | 9 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> intersection;
int limit = max(a, b);
for (int i = 1; i < limit; i++) {
if (a % i == 0 && b % i == 0) {
intersection.push_back... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> intersection;
int limit = max(a, b);
for (int i = 1; i <= limit; i++) {
if (a % i == 0 && b % i == 0) {
intersection.push_bac... | replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; ++i) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k)
return cout << i << "\n", 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; --i) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k)
return cout << i << "\n", 0;
}
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
k--;
int n = max(a, b);
vector<int> arr;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
k--;
int n = max(a, b);
vector<int> arr;... | replace | 18 | 19 | 18 | 19 | 0 | |
p03106 | C++ | Time Limit Exceeded | // ABC120_B
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = min(A, B); i > 0; i++) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K)
cout << i << endl;
}
}
return 0;
}
| // ABC120_B
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = min(A, B); i > 0; i--) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K)
cout << i << endl;
}
}
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
ans.push_back(i);
}
}
cout << ans[ans.size() - k] << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
ans.push_back(i);
}
}
cout << ans[ans.size() - k] << endl;... | replace | 12 | 13 | 12 | 13 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
m = 0
ans = []
if a < b:
m = b
n = a
else:
m = a
n = b
for i in range(1, m):
if n % i == 0 and m % i == 0:
ans.append(i)
if ans:
print(ans[-k])
else:
print("1")
| a, b, k = map(int, input().split())
m = 0
ans = []
if a < b:
m = b
n = a
else:
m = a
n = b
for i in range(1, n + 1):
if m % i == 0 and n % i == 0:
ans.append(i)
if ans:
print(ans[-k])
else:
print("1")
| replace | 11 | 13 | 11 | 13 | 0 | |
p03106 | Python | Runtime Error | def main():
from math import gcd
A, B, K = map(int, input().split())
g = gcd(A, B)
rt = int(pow(g, 0.5))
divisors = set()
for d in range(1, rt + 1):
if g % d == 0:
divisors.add(d)
divisors.add(g // d)
ans = sorted(divisors, reverse=True)[K - 1]
print(a... | def main():
# from math import gcd
def gcd(a, b):
return a if b == 0 else gcd(b, a % b)
A, B, K = map(int, input().split())
g = gcd(A, B)
rt = int(pow(g, 0.5))
divisors = set()
for d in range(1, rt + 1):
if g % d == 0:
divisors.add(d)
divisors.add(... | replace | 1 | 2 | 1 | 5 | 0 | |
p03106 | Python | Runtime Error | A, B, K = map(int, input().split())
n = max(A, B)
k = 0
if n == 1:
print("1")
else:
while k < K:
n = n - 1
if A % n == 0 and B % n == 0:
k = k + 1
print(n)
| A, B, K = map(int, input().split())
n = max(A, B)
k = 0
while True:
if A % n == 0 and B % n == 0:
k = k + 1
if k >= K:
break
n = n - 1
print(n)
| replace | 3 | 11 | 3 | 10 | 0 | |
p03106 | Python | Runtime Error | # coding:utf-8
def main():
A, B, K = map(int, input().split())
ans = []
ans.append(1)
for i in range(2, max(A, B)):
if A % i == 0 and B % i == 0:
ans.append(i)
# if len(ans) >= K:
# break
# print(ans)
print(ans[-K])
if __name__ == "__main__":
main(... | # coding:utf-8
def main():
A, B, K = map(int, input().split())
ans = []
ans.append(1)
for i in range(2, max(A, B) + 1):
if A % i == 0 and B % i == 0:
ans.append(i)
# if len(ans) >= K:
# break
# print(ans)
print(ans[-K])
if __name__ == "__main__":
m... | replace | 7 | 8 | 7 | 8 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
if a == 1 or b == 1:
print(1)
exit(0)
div = []
ans = 0
for i in range(1, max(a, b)):
if a % i == 0 and b % i == 0:
div.append(i)
div.reverse()
print(div[k - 1])
| a, b, k = map(int, input().split())
if a == 1 or b == 1:
print(1)
exit(0)
div = []
ans = 0
for i in range(1, max(a, b) + 1):
if a % i == 0 and b % i == 0:
div.append(i)
div.reverse()
print(div[k - 1])
| replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
divisers = []
for i in range(1, max(a, b)):
if a % i == 0 and b % i == 0:
divisers.append(i)
print(divisers[-k])
| a, b, k = map(int, input().split())
divisers = []
for i in range(1, min(a, b) + 1):
if a % i == 0 and b % i == 0:
divisers.append(i)
print(divisers[-k])
| replace | 3 | 4 | 3 | 4 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
common_factors = []
for i in range(1, a):
if a % i == 0 and b % i == 0:
common_factors.append(i)
print(common_factors[-k])
| a, b, k = map(int, input().split())
common_factors = []
for i in range(1, a + 1):
if a % i == 0 and b % i == 0:
common_factors.append(i)
print(common_factors[-k])
| replace | 3 | 4 | 3 | 4 | 0 | |
p03106 | Python | Runtime Error | A, B, K = [int(i) for i in input().split()]
th = []
i = 1
while True:
i += 1
if (A % i, B % i) == (0, 0):
th.append(i)
if i > A or i > B:
break
print(th[len(th) - K])
| A, B, K = [int(i) for i in input().split()]
th = []
i = 0
while True:
i += 1
if (A % i, B % i) == (0, 0):
th.append(i)
if i > A or i > B:
break
print(th[len(th) - K])
| replace | 2 | 3 | 2 | 3 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i ... | replace | 22 | 35 | 22 | 33 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
int mai... | replace | 14 | 15 | 14 | 15 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 1; i < max(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a = {1};
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = a; i >= 1; i++) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i;
return 0;
}
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = a; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i;
return 0;
}
}
} | replace | 5 | 6 | 5 | 6 | TLE | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#... | replace | 23 | 25 | 23 | 25 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1e9 + 7
#define PI 3.141592653589793238
#define pb push_back
#define ALL(V) (V).begin(), (V).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long long int lint;
typedef vector<ll> VL;
typed... | #include <bits/stdc++.h>
#define MOD 1e9 + 7
#define PI 3.141592653589793238
#define pb push_back
#define ALL(V) (V).begin(), (V).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long long int lint;
typedef vector<ll> VL;
typed... | replace | 33 | 46 | 33 | 41 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
typedef long long ll;
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = gcd(A, B);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
typedef long long ll;
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = gcd(A, B);... | replace | 15 | 16 | 15 | 16 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i < b; i++) {
if (b % i == 0)
ans.push_back(i);
}
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i <= b; i++) {
if (b % i == 0)
ans.push_back(i);
}
... | replace | 14 | 15 | 14 | 15 | 0 | |
p03106 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int end = a > b ? b : a;
int count = 0;
for (int i = end; i > 0; i--) {
if (!(b % i) && !(a % i))
count++;
if (count == k)
return i;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int end = a > b ? b : a;
int count = 0;
for (int i = end; i > 0; i--) {
if (!(b % i) && !(a % i))
count++;
if (count == k) {
cout << i << endl;
return 0;
}
}
} | replace | 10 | 12 | 10 | 14 | 2 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> d;
for (int i = a; i >= 0; --i) {
if (a % i == 0 && b % i == 0) {
d.emplace_back(i);
}
}
cout << d[k - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> d;
for (int i = a; i > 0; --i) {
if (a % i == 0 && b % i == 0) {
d.emplace_back(i);
}
}
cout << d[k - 1] << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; i++)
#define rrange(i, n) for (i = n - 1; i >= 0; i--)
typedef long long int ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; i++)
#define rrange(i, n) for (i = n - 1; i >= 0; i--)
typedef long long int ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
... | replace | 37 | 38 | 37 | 38 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int p = 0;
vector<int> com(100, 0);
for (int i = 100; i >= 1; i++) {
if (a % i == 0 && b % i == 0) {
com[p] = i;
p++;
}
}
cout << com[c - 1] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int p = 0;
vector<int> com(100, 0);
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
com[p] = i;
p++;
}
}
cout << com[c - 1] << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 0; i < min(A, B); i++)
if (A % i == 0 && B % i == 0)
a.push_back(i);
cout << a.at(a.size() - K);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 1; i <= min(A, B); i++)
if (A % i == 0 && B % i == 0)
a.push_back(i);
cout << a.at(a.size() - K);
}
| replace | 6 | 7 | 6 | 7 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main(int argc, char const *argv[]) {
freopen("input.txt", "r", stdin);
int a, b, k;
cin >> a >> b >> k;
int g = gcd(a, b);
vector<int> V;
for (int i = g; i >= 1; i--) {
... | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main(int argc, char const *argv[]) {
// freopen("input.txt" , "r" , stdin) ;
int a, b, k;
cin >> a >> b >> k;
int g = gcd(a, b);
vector<int> V;
for (int i = g; i >= 1; i... | replace | 10 | 11 | 10 | 11 | -11 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = 0;
for (int i = 0; i < max(a, b); i--) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == c) {
cout << i << endl;
break;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = 0;
for (int i = max(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == c) {
cout << i << endl;
break;
}
}
}
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k;
cin >> k;
int m = min(a, b);
vector<int> c(m);
for (int i = 1; i <= m; i++) {
if (a % i == 0 && b % i == 0)
c.at(i) = i;
}
for (int i = 0; i < m; i++) {
cout << c.at(i) << endl;
}
int cnt = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k;
cin >> k;
int m = min(a, b);
vector<int> c(m);
for (int i = 1; i <= m; i++) {
if (a % i == 0 && b % i == 0)
c.at(i - 1) = i;
}
int cnt = 0;
for (int i = m - 1; i >= 0; i--) {
if (c.at(i) != 0)
... | replace | 12 | 16 | 12 | 13 | 0 | |
p03106 | 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()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
rep... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for... | replace | 13 | 14 | 13 | 14 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k ... | replace | 10 | 11 | 10 | 11 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
std::vector<int> va(101, 0);
std::vector<int> vb(101, 0);
void enum_divisors(long long N, int aorb) {
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
if (aorb) {
va[i]++;
if (N / i != i)
va[N / i]++;
} else {
... | #include <bits/stdc++.h>
using namespace std;
std::vector<int> va(101, 0);
std::vector<int> vb(101, 0);
void enum_divisors(long long N, int aorb) {
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
if (aorb) {
va[i]++;
if (N / i != i)
va[N / i]++;
} else {
... | replace | 32 | 33 | 32 | 33 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, k, v, c = 0;
cin >> a >> b >> k;
for (int i = a; i > 0; i++) {
if (a % i == 0 && b % i == 0)
c++;
if (c == k) {
v = i;
break;
}
}
cout << v << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, k, v, c = 0;
cin >> a >> b >> k;
for (int i = a; i > 0; i--) {
if (a % i == 0 && b % i == 0)
c++;
if (c == k) {
v = i;
break;
}
}
cout << v << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define SPACE " "
#def... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define SPACE " "
#def... | replace | 45 | 46 | 45 | 46 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = max(A, B); i > 0; i++) {
if (A % i == 0 && B % i == 0) {
K--;
if (K == 0)
cout << i << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = max(A, B); i > 0; i--) {
if (A % i == 0 && B % i == 0) {
K--;
if (K == 0)
cout << i << endl;
}
}
} | replace | 7 | 8 | 7 | 8 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int A, B, K;
vector<int> X;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
FOR(i, 1, max(A, B)) {
if (A % i == 0 && B % i == 0) {
X.push_back(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int A, B, K;
vector<int> X;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
FOR(i, 1, max(A, B) + 1) {
if (A % i == 0 && B % i == 0) {
X.push_b... | replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
cout << div.at(div.size() - 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
cout << div.at(div.size() - k) << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 100; i > 0; i++) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
vector<long long> v;
for (int i = 0; i <= 1000000; ++i) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
// if(v[0] == k) { cout<<k<... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
vector<long long> v;
for (int i = 1; i <= max(a, b); ++i) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
// if(v[0] == k) { cout<<... | replace | 6 | 7 | 6 | 7 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 2; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), c... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 1; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), c... | replace | 9 | 10 | 9 | 10 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int i = 0; i < min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
}
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(), greater<int>());
#define YES cout << "YES" << endl
#define NO co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(), greater<int>());
#define YES cout << "YES" << endl
#define NO co... | replace | 29 | 30 | 29 | 30 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> p;
int N = max(A, B);
for (int i = 1; i < N; i++) {
if ((A % i == 0) && (B % i == 0)) {
p.push_back(i);
}
}
cout << p[p.size() - K] << endl;
retur... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> p;
int N = max(A, B);
for (int i = 1; i <= N; i++) {
if ((A % i == 0) && (B % i == 0)) {
p.push_back(i);
}
}
cout << p[p.size() - K] << endl;
retu... | replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | replace | 239 | 240 | 239 | 240 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
queue<int> d;
for (int i = min(a, b); i <= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.push(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
queue<int> d;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.push(... | replace | 10 | 11 | 10 | 11 | 0 | |
p03106 | C++ | Runtime Error |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
double myabs(double a) { return sqrt(a * a); }
int main() {
int a, b, k;
std::cin >> a >> b >> k;
std::vector<int> t;
for (int i = 1; i < a; i++) {
if (0 == a % i) {
if (0 == b % i) {
t.push_back(i)... |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
double myabs(double a) { return sqrt(a * a); }
int main() {
int a, b, k;
std::cin >> a >> b >> k;
std::vector<int> t;
for (int i = 1; i <= a; i++) {
if (0 == a % i) {
if (0 == b % i) {
t.push_back(i... | replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int i = max(A, B);
while (K > 0) {
i--;
if (A % i == 0 && B % i == 0)
K--;
}
cout << i << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int i = max(A, B) + 1;
while (K > 0) {
i--;
if (A % i == 0 && B % i == 0)
K--;
}
cout << i << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03106 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
c = 0;
for (int i = 0; i < 100; i++) {
if (a % i == 0 && b % i == 0) {
c++;
if (c == k) {
cout << i << endl;
return 0;
}
}
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
c = 0;
for (int i = 100; i > -1; i--) {
if (a % i == 0 && b % i == 0) {
c++;
if (c == k) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | replace | 8 | 9 | 8 | 9 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 29 | 33 | 29 | 29 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | replace | 42 | 43 | 42 | 43 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | replace | 118 | 119 | 118 | 119 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int d = 0;
int ans = 0;
for (int i = 0; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == k) {
ans = i;
}
}
}
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int d = 0;
int ans = 0;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == k) {
ans = i;
}
}
}
... | replace | 10 | 11 | 10 | 11 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i < max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1]... | replace | 11 | 12 | 11 | 12 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
vector<int> vec(100);
for (i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
vec.at(i) = i;
}
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
cout << vec.at(k -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
vector<int> vec(1000);
for (i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
vec.at(i) = i;
}
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
cout << vec.at(k ... | replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | replace | 79 | 80 | 79 | 80 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
reverse(ans.begin(), ans.end());
cout << ans[k - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= min(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
reverse(ans.begin(), ans.end());
cout << ans[k - 1] << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, N;
cin >> A >> B >> K;
vector<int> Div(0);
for (int i = 1; i < max(A, B); i++) {
if (A % i == 0 && B % i == 0) {
Div.push_back(i);
N++;
}
}
cout << Div.at(N - K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, N;
cin >> A >> B >> K;
vector<int> Div(0);
for (int i = 1; i <= max(A, B); i++) {
if (A % i == 0 && B % i == 0) {
Div.push_back(i);
N++;
}
}
cout << Div.at(N - K) << endl;
} | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 32520) >= this->size() (which is 3)
|
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define vint vector<in... | #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define vint vector<in... | replace | 23 | 24 | 23 | 24 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int n1 = max(n, m), count = 0;
for (int i = 0; i < n1; i++) {
if (n % i == 0 && m % i == 0)
count++;
if (count == k) {
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int n1 = max(n, m), count = 0;
for (int i = n1; i >= 1; i--) {
if (n % i == 0 && m % i == 0)
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
| replace | 6 | 7 | 6 | 7 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int waru[100], kazu;
kazu = 0;
for (int i = min(a, b); i >= 0; i--) {
if (a % i == 0 && b % i == 0) {
kazu++;
waru[kazu] = i;
}
}
cout << waru[k] << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int waru[100], kazu;
kazu = 0;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
kazu++;
waru[kazu] = i;
}
}
cout << waru[k] << endl;
} | replace | 9 | 10 | 9 | 10 | -8 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...... | replace | 67 | 68 | 67 | 68 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
// 自然数nの約数列挙 O(root(N))
// 使い方
// 自然数nを渡すとvector<long long>を返す
// ソート含めると O(root(N) + N log N)
vl divisor(ll ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
// 自然数nの約数列挙 O(root(N))
// 使い方
// 自然数nを渡すとvector<long long>を返す
// ソート含めると O(root(N) + N log N)
vl divisor(ll ... | replace | 18 | 19 | 18 | 19 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
vector<int> num;
for (int i = 1; i <= max(a, b); i++) {
if (i % a == 0 && i % b == 0) {
num.push_back(i);
}
}
sort(num.begin(), num.end(), greater<int>());
cout << num[k - 1] << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
vector<int> num;
cin >> a >> b >> k;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
num.push_back(i);
}
}
sort(num.begin(), num.end(), greater<int>());
cout << num[k -... | replace | 8 | 10 | 8 | 11 | TLE | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, count = 0, i, j;
cin >> a >> b >> k;
for (i = 100; i > 0; i++) {
if (a % i == 0 && b % i == 0) {
count++;
}
if (count == k) {
break;
}
}
cout << i << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, count = 0, i, j;
cin >> a >> b >> k;
for (i = max({a, b}); i > 0; i -= 1) {
if (a % i == 0 && b % i == 0) {
count++;
}
if (count == k) {
break;
}
}
cout << i << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p03107 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define... | replace | 44 | 45 | 44 | 49 | 0 | |
p03107 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[10000];
long n = 0;
int i;
int j = 0;
int h = 0;
for (i = 0; i < 1; i++) {
scanf("%s", a);
}
// printf("%d\n", strlen(a));
for (i = 0; i < strlen(a); i++) {
// printf("%c", a[i]);
if (a[i] == ... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[100000];
long n = 0;
int i;
int j = 0;
int h = 0;
for (i = 0; i < 1; i++) {
scanf("%s", a);
}
// printf("%d\n", strlen(a));
for (i = 0; i < strlen(a); i++) {
// printf("%c", a[i]);
if (a[i] ==... | replace | 6 | 7 | 6 | 7 | 0 | |
p03107 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
#include <tgmath.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long... | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
#include <tgmath.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long... | insert | 27 | 27 | 27 | 32 | TLE | |
p03107 | C++ | Runtime Error | #include <stdio.h>
using namespace std;
#include <algorithm>
int main(void) {
char S[100000];
scanf("%s", S);
int count[2] = {0};
int i = 0;
while (S[i] != '\n') {
if (S[i] == '1')
count[0]++;
else
count[1]++;
i++;
}
if (count[0] > count[1]) {
printf("%d", count[1] * 2);
} e... | #include <stdio.h>
using namespace std;
#include <algorithm>
int main(void) {
char S[100000];
scanf("%s", S);
int count[2] = {0};
int i = 0;
while (S[i] != '\0') {
if (S[i] == '1')
count[0]++;
else
count[1]++;
i++;
}
if (count[0] > count[1]) {
printf("%d", count[1] * 2);
} e... | replace | 8 | 9 | 8 | 9 | 0 | |
p03107 | Python | Time Limit Exceeded | S = input()
cnt1 = 0
cnt2 = 0
while True:
before = S
S = before.replace("01", "", 1)
if before != S:
cnt1 += 1
else:
break
while True:
before = S
S = before.replace("10", "", 1)
if before != S:
cnt2 += 1
else:
break
print(2 * (cnt1 + cnt2))
| S = input()
print(2 * min(S.count("1"), S.count("0")))
| replace | 1 | 20 | 1 | 2 | TLE | |
p03107 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while ... | replace | 15 | 16 | 15 | 16 | 0 | |
p03107 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin... | replace | 28 | 29 | 28 | 29 | 0 | |
p03107 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int count = 0;
string s;
cin >> n >> s;
vector<char> c(n);
for (int i = 0; i < n; i++) {
c[i] = s.at(i);
if (c[i] == '0') {
count++;
}
}
cout << 2 * min(count, n - count);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int count = 0;
string s;
cin >> s;
n = s.length();
vector<char> c(n);
for (int i = 0; i < n; i++) {
c[i] = s.at(i);
if (c[i] == '0') {
count++;
}
}
cout << 2 * min(count, n - count);
}
| replace | 6 | 7 | 6 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03107 | C++ | Runtime Error | // https://atcoder.jp/contests/abc120/tasks/abc120_b
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0;... | // https://atcoder.jp/contests/abc120/tasks/abc120_b
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0;... | replace | 29 | 30 | 29 | 30 | -11 | |
p03107 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | insert | 35 | 35 | 35 | 37 | -6 | /usr/include/c++/12/bits/basic_string.h:1221: std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::reference std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator[](size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>; reference = char&; size_type = long unsigned int]:... |
p03107 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int k = 0;
int t = 0;
int l = 0;
while (k < N) {
if ((S[k] == '0' && S[k + 1] == '1') || (S[k] == '1' && S[k + 1] == '0')) {
for (int j = k; j < N; j++) {
S[j] = S[j + 2];
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int k = 0;
int t = 0;
int l = 0;
while (k < N) {
if ((S[k] == '0' && S[k + 1] == '1') || (S[k] == '1' && S[k + 1] == '0')) {
S.erase(k, 2);
l += 2;
k -= 1;
} else {... | replace | 16 | 19 | 16 | 17 | TLE | |
p03107 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char **argv) {
int count = 0;
string s;
cin >> s;
int i = 0;
while (true) {
if (i > s.size() - 1 || s.empty()) {
break;
}
if (s[i] == '0' && s[i + 1] == '1' || s[i] == '1' && s[i + 1] == '0') {
s.erase(s... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char **argv) {
int count = 0;
string s;
cin >> s;
int i = 0;
while (true) {
if (i > s.size() - 1 || s.empty()) {
break;
}
if (s[i] == '0' && s[i + 1] == '1' || s[i] == '1' && s[i + 1] == '0') {
s.erase(s... | replace | 21 | 22 | 21 | 24 | TLE | |
p03107 | C++ | Runtime Error | #include "iostream"
#include "set"
#include "vector"
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> pre(n), post(n), dond(n);
for (int i = 0; i < n; ++i)
pre[i] = i - 1, post[i] = i + 1;
int res = 0;
for (int i = 1; i < n; i++) {
if (pre[i] == -1) {
c... | #include "iostream"
#include "set"
#include "vector"
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> pre(n), post(n), dond(n);
for (int i = 0; i < n; ++i)
pre[i] = i - 1, post[i] = i + 1;
int res = 0;
for (int i = 1; i < n; i++) {
if (pre[i] == -1) {
c... | replace | 23 | 24 | 23 | 25 | 0 | |
p03107 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | replace | 26 | 44 | 26 | 31 | TLE | |
p03107 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int cnt = 0, len;
string s;
cin >> s;
len = s.size();
for (int i = 0; i < len - 1; i++) {
if (s.size() == 1)
break;
if ((s[i] == '0' && s[i + 1] == '1') || (s[i] == '1' && s[i + 1] == '0')) {
cnt += 2;
s.erase(i... | #include <iostream>
#include <string>
using namespace std;
int main() {
int cnt = 0, len;
string s;
cin >> s;
len = s.size();
for (int i = 0; i < len - 1; i++) {
if (s.size() == 1)
break;
if ((s[i] == '0' && s[i + 1] == '1') || (s[i] == '1' && s[i + 1] == '0')) {
cnt += 2;
s.erase(i... | replace | 16 | 17 | 16 | 17 | TLE | |
p03107 | C++ | Runtime Error | /*
Author: Mohammad faisal
Problem: unification
Date: 06/08/2019
*/
// #include<bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> con;
con.push(s[0]);
//... | /*
Author: Mohammad faisal
Problem: unification
Date: 06/08/2019
*/
// #include<bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
red = count(s.... | replace | 17 | 41 | 17 | 23 | 0 | |
p03107 | Python | Time Limit Exceeded | S = input()
num = 0
while True:
p = S.find("01")
if p > -1:
S = S[:p] + S[p + 2 :]
num += 2
else:
break
while True:
p = S.find("10")
if p > -1:
S = S[:p] + S[p + 2 :]
num += 2
else:
print(num)
break
| S = input()
print(min(S.count("0"), S.count("1")) * 2)
| replace | 1 | 18 | 1 | 2 | TLE | |
p03107 | Python | Runtime Error | S = input()
S = [Si for Si in S]
i = len(S) - 2
number_of_deleted_qube = 0
while i >= 0 and len(S) >= 2:
current = S[i]
right = S[i + 1]
if current != right:
del S[i + 1]
del S[i]
number_of_deleted_qube += 2
i -= 1
print(number_of_deleted_qube)
| S = input()
S = [Si for Si in S]
i = len(S) - 2
number_of_deleted_qube = 0
while i >= 0 and len(S) >= 2:
if i >= len(S) - 1:
i -= 1
continue
current = S[i]
right = S[i + 1]
if current != right:
del S[i + 1]
del S[i]
number_of_deleted_qube += 2
i -= 1
prin... | insert | 6 | 6 | 6 | 10 | 0 | |
p03107 | Python | Time Limit Exceeded | s = input()
count = 0
while s.find("01") != -1 or s.find("10") != -1:
count += 2 * s.count("01")
s = s.replace("01", "")
count += 2 * s.count("10")
s = s.replace("10", "")
print(count)
| s = input()
print(2 * min(s.count("0"), s.count("1")))
| replace | 1 | 9 | 1 | 2 | TLE | |
p03107 | Python | Runtime Error | S = list(int(input()))
a = S.count(0)
b = S.count(1)
ans = 2 * min(a, b)
print(ans)
| S = list(input())
a = S.count("0")
b = S.count("1")
ans = 2 * min(a, b)
print(ans)
| replace | 0 | 3 | 0 | 3 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03107/Python/s301284896.py", line 1, in <module>
S = list(int(input()))
TypeError: 'int' object is not iterable
|
p03107 | Python | Time Limit Exceeded | s = input()
n = len(s)
i = 0
while True:
before = len(s)
s = s.replace("01", "").replace("10", "")
after = len(s)
if before == after:
break
print(n - len(s))
| s = input()
n0 = s.count("0")
n1 = s.count("1")
print(2 * min(n0, n1))
| replace | 1 | 10 | 1 | 4 | TLE | |
p03107 | Python | Time Limit Exceeded | b = list(map(int, input()))
cnt = 0
while len(b) > 1:
if len(list(set(b))) == 1:
break
if b[0] != b[1]:
b = b[2:]
cnt += 1
continue
temp = b[:1]
b = b[1:]
b.append(*temp)
print(cnt * 2)
| s = input()
zom = min(s.count("1"), s.count("0"))
if len(set(list(s))) == 1:
zom = 0
print(zom * 2)
| replace | 0 | 13 | 0 | 5 | TLE | |
p03107 | Python | Time Limit Exceeded | def recursin_operation(S, len_init_s):
S = list(S)
N = len(S)
lst = [i for i in range(N - 1) if S[i] != S[i + 1]]
nums_of_deleted = []
if len(lst) != 0:
for i in lst:
S_next = [S[j] for j in range(len(S)) if j < i or j > i + 1]
nums_of_deleted.append(recursin_operatio... | S = input()
len_S = len(S)
zero_lst = [S[i] for i in range(len_S) if S[i] == "0"]
one_lst = [S[i] for i in range(len_S) if S[i] == "1"]
ans = min(len(zero_lst), len(one_lst)) * 2
print(ans)
| replace | 0 | 24 | 0 | 6 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.