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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03143 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#define ll long long
using namespace std;
const int N = 2e5;
struct edge {
int fr, to, w;
} a[N], sta[N];
int n, m, val[N], fa[N];
int siz[N], cnt, top, ans;
ll sum[N];
int cmp(const edge &A, const edge &B) { return A.w < B.w; }
int find(in... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#define ll long long
using namespace std;
const int N = 2e5;
struct edge {
int fr, to, w;
} a[N], sta[N];
int n, m, val[N], fa[N];
int siz[N], cnt, top, ans;
ll sum[N];
int cmp(const edge &A, const edge &B) { return A.w < B.w; }
int find(in... | replace | 33 | 34 | 33 | 34 | TLE | |
p03143 | C++ | Time Limit Exceeded | /*input
6 10
4 4 1 1 1 7
3 5 19
2 5 20
4 5 8
1 6 16
2 3 9
3 6 16
3 4 1
2 6 20
2 4 19
1 2 9
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i, j, k) for (int i = j; i < k; ++i)
#define RREP(i, j, k) for (int i = j; i >= k; --i)
#define F f... | /*input
6 10
4 4 1 1 1 7
3 5 19
2 5 20
4 5 8
1 6 16
2 3 9
3 6 16
3 4 1
2 6 20
2 4 19
1 2 9
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i, j, k) for (int i = j; i < k; ++i)
#define RREP(i, j, k) for (int i = j; i >= k; --i)
#define F f... | replace | 40 | 41 | 40 | 41 | TLE | |
p03143 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <ext/algorithm>
#include <ext/numeric>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ffor(_a, _f, _t... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <ext/algorithm>
#include <ext/numeric>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ffor(_a, _f, _t... | insert | 113 | 113 | 113 | 118 | 0 | |
p03143 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct GroupState {
int maxei;
long long vwsum;
};
struct UnionFind {
vector<int> par;
vector<long long> sum;
vector<int> last_e;
UnionFind(int n, vector<int> &vw) {
par.resize(n);
sum.resize(n);
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct GroupState {
int maxei;
long long vwsum;
};
struct UnionFind {
vector<int> par;
vector<long long> sum;
vector<int> last_e;
UnionFind(int n, vector<int> &vw) {
par.resize(n);
sum.resize(n);
... | replace | 102 | 103 | 102 | 104 | 0 | 3
rest edge
|
p03143 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct edge {
int a, b, y;
bool operator<(const struct edge &rhs) const { return y < rhs.y; }
};
struct union_find {
vector<long long> data;
union_find(vector<int> &X) : data(X.size()) {
for (int i = 0; i < X.size(); i++)
data[i] = -X[i];
}
void unite(... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int a, b, y;
bool operator<(const struct edge &rhs) const { return y < rhs.y; }
};
struct union_find {
vector<long long> data;
union_find(vector<int> &X) : data(X.size()) {
for (int i = 0; i < X.size(); i++)
data[i] = -X[i];
}
void unite(... | replace | 18 | 19 | 18 | 19 | 0 | |
p03143 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
/*
計算量気にしなければ貪欲に消せばいい
はみ出しているのがあったら消去
非連結になったらはみ出し確認
明らかに計算量が死ぬ
*/
// BEGIN CUT HERE
struct UnionFind {
int num; // 連結成分の数
vector<int> r, p, w; // そのグループのサイズ,自分の親っぽいやつ
UnionFind() {}
UnionFind(int n) : num(n), r(n, 1), w(n), p(n, 0)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
/*
計算量気にしなければ貪欲に消せばいい
はみ出しているのがあったら消去
非連結になったらはみ出し確認
明らかに計算量が死ぬ
*/
// BEGIN CUT HERE
struct UnionFind {
int num; // 連結成分の数
vector<int> r, p, w; // そのグループのサイズ,自分の親っぽいやつ
UnionFind() {}
UnionFind(int n) : num(n), r(n, 1), w(n), p(n, 0)... | replace | 78 | 79 | 78 | 79 | 0 | |
p03143 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
ll gcd(ll a, ll b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
ll gcd(ll a, ll b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c ... | replace | 423 | 424 | 423 | 425 | 0 | |
p03144 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define poly vector<ll>
#define sqr(x) ((x) * (x))
#define mp make_pair
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define poly vector<ll>
#define sqr(x) ((x) * (x))
#define mp make_pair
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
... | replace | 101 | 102 | 101 | 102 | 0 | |
p03144 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <map>
#include <set>
#include <string>
#include <vector>
using int64 = long long;
const int64 inf = 1000000000000ll;
struct Color {
std::vector<int> costs;
size_t pos{0};
int id;
int64 cost_n(int n) {
if (n == 0) {
if (pos < 3) {
return -inf;
... | #include <algorithm>
#include <cstdio>
#include <map>
#include <set>
#include <string>
#include <vector>
using int64 = long long;
const int64 inf = 1000000000000ll;
struct Color {
std::vector<int> costs;
size_t pos{0};
int id;
int64 cost_n(int n) {
if (n == 0) {
if (pos < 3) {
return -inf;
... | replace | 179 | 183 | 179 | 183 | TLE | |
p03145 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const long lon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const long lon... | replace | 36 | 37 | 36 | 37 | 0 | |
p03145 | Python | Runtime Error | LL = list(map(int, input().split())).sort()
R = LL[0] * LL[1] // 2
print(R)
| LL = list(map(int, input().split()))
LL.sort()
R = LL[0] * LL[1] // 2
print(R)
| replace | 0 | 1 | 0 | 2 | TypeError: 'NoneType' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s826877996.py", line 2, in <module>
R = LL[0] * LL[1] // 2
TypeError: 'NoneType' object is not subscriptable
|
p03145 | Python | Runtime Error | h, w, _ = [int(i) for i in input()]
ans = h * w // 2
print(ans)
| h, w, _ = [int(i) for i in input().split()]
ans = h * w // 2
print(ans)
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: ' ' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s129162499.py", line 1, in <module>
h, w, _ = [int(i) for i in input()]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s129162499.py", line 1, in <listcomp>
... |
p03145 | Python | Runtime Error | def main() -> None:
ab, bc, ca = map(int, input())
print(ab * bc // 2)
if __name__ == "__main__":
main()
| def main() -> None:
ab, bc, ca = map(int, input().split())
print(ab * bc // 2)
if __name__ == "__main__":
main()
| replace | 1 | 2 | 1 | 2 | ValueError: invalid literal for int() with base 10: ' ' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s388138041.py", line 7, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s388138041.py", line 2, in main
ab, bc, ca = map(int, input())
Val... |
p03145 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | replace | 76 | 77 | 76 | 77 | -11 | |
p03145 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a, b, Area;
printf("Enter the values of a and b : \n");
scanf("%d %d %d", &a, &b);
Area = (a + b) / 2;
printf("Area of a triangle = %d \n", Area);
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
int answer;
scanf("%d %d %d", &a, &b, &c);
answer = a * b / 2;
printf("%d", answer);
return 0;
} | replace | 4 | 10 | 4 | 9 | -11 | |
p03145 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
printf("%d", a * b * c / 2 / max({a, b, c}));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%d", a * b * c / 2 / max({a, b, c}));
} | insert | 6 | 6 | 6 | 7 | 0 | |
p03145 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int a, b;
scanf("%d%d%d", &a, &b);
int ans = a * b / 2;
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int a, b;
scanf("%d%d", &a, &b);
int ans = a * b / 2;
printf("%d\n", ans);
return 0;
} | replace | 10 | 11 | 10 | 11 | -11 | |
p03145 | Python | Runtime Error | def run(a):
return a[0] * a[1] // 2
def main():
a = map(int, input().split())
print(run(a))
if __name__ == "__main__":
main()
| def run(a):
return a[0] * a[1] // 2
def main():
a = list(map(int, input().split()))
print(run(a))
if __name__ == "__main__":
main()
| replace | 5 | 6 | 5 | 6 | TypeError: 'map' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s623921707.py", line 11, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s623921707.py", line 7, in main
print(run(a))
File "/home/alex/... |
p03145 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
return (a * b) / 2;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
return 0;
} | replace | 9 | 10 | 9 | 11 | 6 | |
p03145 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
return a * b * c / max(a, max(b, c)) / 2;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b * c / 2 / max(a, max(b, c))) << endl;
return 0;
} | replace | 6 | 7 | 6 | 8 | 6 | |
p03145 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265
#define MOD 100... | #include <bits/stdc++.h>
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265
#define MOD 100... | replace | 21 | 25 | 21 | 25 | 0 | |
p03145 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return (a * b / 2);
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a * b / 2);
return 0;
}
| replace | 9 | 10 | 9 | 11 | 6 | |
p03145 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
const int maxa = 3;
int a[maxa];
int main() {
int mini1 = 0, mini2 = 0, num1, num2, area;
for (int i = 0; i < 3; i++) {
cin >> a[i];
if (mini1 <= a[i]) {
mini1 = a[i];
num1 = i;
}
}
a[num1] = 0;
for (int j = 0; j < 3; j--) {
if (mini1 >= ... | #include <iostream>
using namespace std;
const int maxa = 3;
int a[maxa];
int main() {
int a, b, c, area;
cin >> a >> b >> c;
area = (a * b) / 2;
cout << area;
return 0;
}
| replace | 8 | 35 | 8 | 11 | TLE | |
p03145 | Python | Runtime Error | s = int(input())
an = []
an.append(s)
n = s
while an.count(4) != 2:
if n % 2 == 0:
n /= 2
an.append(int(n))
else:
n = 3 * n + 1
an.append(int(n))
if an.index(1 or 2) == 0:
print(4)
else:
print(an.index(4) + 4)
| x, y, z = map(int, input().split())
print(int(x * y / 2))
| replace | 0 | 15 | 0 | 2 | ValueError: invalid literal for int() with base 10: '3 4 5' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s174683495.py", line 1, in <module>
s = int(input())
ValueError: invalid literal for int() with base 10: '3 4 5'
|
p03145 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
vector<int> x;
cin >> x.at(0);
cin >> x.at(1);
cin >> x.at(2);
sort(all(x));
cout << x.at(0) * x.at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
vector<int> x(3);
cin >> x.at(0);
cin >> x.at(1);
cin >> x.at(2);
sort(all(x));
cout << x.at(0) * x... | replace | 11 | 12 | 11 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03145 | Python | Runtime Error | AB, BC, CA = int(input())
print((AB * BC) // 2)
| AB, BC, CA = map(int, input().split())
print((AB * BC) // 2)
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: '3 4 5' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03145/Python/s114139853.py", line 1, in <module>
AB, BC, CA = int(input())
ValueError: invalid literal for int() with base 10: '3 4 5'
|
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
vector<int> f(1000000);
f.at(0) = s;
rep(i, 1000000) {
if (f.at(i) % 2 == 0)
f.at(i + 1) = f.at(i) / 2;
else
f.at(i + 1) = 3 * f.at(i) + 1;
}
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
vector<int> f(1000000);
f.at(0) = s;
rep(i, 1000000 - 1) {
if (f.at(i) % 2 == 0)
f.at(i + 1) = f.at(i) / 2;
else
f.at(i + 1) = 3 * f.at(i) + 1;
}
for (int i = 0; ... | 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 1000000) >= this->size() (which is 1000000)
|
p03146 | C++ | Runtime Error | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int a[100010];
int main(int argc, char const *argv[]) {
int s;
cin >> s;
a[0] = s;
for (int i = 0; i < 100009; i++) {
if (a[i] % 2 == 0) {
a[i + 1] = a[i] / 2;
} else {
a[i + 1] = a[i] * 3 + 1;
... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int a[100010];
int main(int argc, char const *argv[]) {
int s;
cin >> s;
a[0] = s;
for (int i = 0; i < 100009; i++) {
if (a[i] % 2 == 0) {
a[i + 1] = a[i] / 2;
} else {
a[i + 1] = a[i] * 3 + 1;
... | replace | 21 | 23 | 21 | 23 | 0 | |
p03146 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | replace | 28 | 29 | 28 | 29 | 0 | |
p03146 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
set<int> st;
int x = s;
while (st.count(x) == 0) {
st.insert(x);
if (x % 2 == 0) {
x /= 2;
} else {
x *= 3;
x + 1;
}
}
cout << st.size() + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
set<int> st;
int x = s;
while (st.count(x) == 0) {
st.insert(x);
if (x % 2 == 0) {
x /= 2;
} else {
x = x * 3 + 1;
}
}
cout << st.size() + 1 << endl;
}
| replace | 13 | 15 | 13 | 14 | TLE | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
vector<ll> vec(100, -1);
vec.at(a) = 1;
for (ll i = 0;; i++) {
if (a % 2 == 0) {
a = a / 2;
} else {
a = 3 * a + 1;
}
if (a <= 100) {
if (vec.at(a) == -1) {
vec.at(a) = 1;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
vector<ll> vec(101, -1);
vec.at(a) = 1;
for (ll i = 0;; i++) {
if (a % 2 == 0) {
a = a / 2;
} else {
a = 3 * a + 1;
}
if (a <= 100) {
if (vec.at(a) == -1) {
vec.at(a) = 1;... | replace | 6 | 7 | 6 | 7 | 0 | |
p03146 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int s;
cin >> s;
ll ans = 1;
while (s != 4 || s != 2 || s != 1) {
ans += 1;
if (s % 2 == 0) {
s = s / 2;
} else {
s ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF (1 << 29)
#define MAX_N 1000010
/* ACはうれCすぎてうれD */
int main(void) {
int s;
cin >> s;
ll ans = 1;
while (s != 4 && s != 2 &&
s != 1) { // 2 1 4 2 なら、4 より先に 2が重複するじゃん
// ずっと 4 しか考えてな... | replace | 12 | 13 | 12 | 15 | TLE | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ans(1000000000, 0);
for (int i = 0; i < 1000000; i++) {
if (s % 2 == 0) {
s /= 2;
ans[s]++;
} else {
s = 3 * s + 1;
ans[s]++;
}
if (ans[s] == 2) {
cout << i + 2 << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ans(100000000, 0);
ans[s]++;
for (int i = 0; i < 1000000; i++) {
if (s % 2 == 0) {
s /= 2;
ans[s]++;
} else {
s = 3 * s + 1;
ans[s]++;
}
if (ans[s] == 2) {
cout << i + 2 << end... | replace | 5 | 6 | 5 | 7 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03146 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | replace | 187 | 188 | 187 | 191 | TLE | |
p03146 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int n[1000000], i = 0;
while (true) {
n[i] = s;
i++;
if (s % 2 == 0)
s = s / 2;
else
s = 3 * s + 1;
for (int j = 0; j < i; j++) {
if (n[j] == s) {
cout << i + 1 << endl;
return 1;
... | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int n[1000000], i = 0;
while (true) {
n[i] = s;
i++;
if (s % 2 == 0)
s = s / 2;
else
s = 3 * s + 1;
for (int j = 0; j < i; j++) {
if (n[j] == s) {
cout << i + 1 << endl;
return 0;
... | replace | 17 | 18 | 17 | 18 | 1 | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 9 | 10 | 9 | 10 | 0 | |
p03146 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 4;
while (n != 4 || n != 2 || n != 1) {
if (n % 2 == 1)
n = 3 * n + 1;
else
n /= 2;
cnt++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 4;
while (1) {
if (n == 4 || n == 2 || n == 1)
break;
if (n % 2 == 1)
n = 3 * n + 1;
else
n /= 2;
cnt++;
}
cout << cn... | replace | 10 | 11 | 10 | 13 | TLE | |
p03146 | Python | Runtime Error | s = int(input())
a = [s]
z = set(s)
idx = 1
for i in range(10**8):
idx += 1
if a[i] % 2 == 0:
ai = a[i] // 2
else:
ai = 3 * a[i] + 1
if ai in z:
print(idx)
exit()
a.append(ai)
z.add(ai)
| s = int(input())
a = [s]
z = set([s])
idx = 1
for i in range(10**8):
idx += 1
if a[i] % 2 == 0:
ai = a[i] // 2
else:
ai = 3 * a[i] + 1
if ai in z:
print(idx)
exit()
a.append(ai)
z.add(ai)
| replace | 2 | 3 | 2 | 3 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03146/Python/s047431119.py", line 3, in <module>
z = set(s)
TypeError: 'int' object is not iterable
|
p03146 | C++ | Runtime Error | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numer... | replace | 27 | 28 | 27 | 28 | 0 | |
p03146 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
bool in_judge(std::vector<int> &a) {
int n = a.size();
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[n - 1]) {
return true;
}
}
return false;
}
int main() {
int s;
std::cin >> s;
std::vector<int> a(1, s);
for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
bool in_judge(std::vector<int> &a) {
int n = a.size();
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[n - 1]) {
return true;
}
}
return false;
}
int main() {
int s;
std::cin >> s;
std::vector<int> a(1, s);
for ... | replace | 27 | 28 | 27 | 28 | 9 | |
p03146 | C++ | Runtime Error | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[1000005], n;
for (int i = 0; i < 10000005; i++) {
a[i] = 0;
}
scanf("%d", &n);
for (int i = 1; i < 1000005; i++) {
a[n]++;
if (a[n] == 2) {
printf("%d\n", i);
break;
}
if (n % 2 ==... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int a[1000005], n;
for (int i = 0; i < 1000005; i++) {
a[i] = 0;
}
scanf("%d", &n);
for (int i = 1; i < 1000005; i++) {
a[n]++;
if (a[n] == 2) {
printf("%d\n", i);
break;
}
if (n % 2 == ... | replace | 6 | 7 | 6 | 7 | -11 | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | replace | 15 | 16 | 15 | 16 | 0 | |
p03146 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a[100000], i, j;
cin >> a[0];
for (i = 0;; i++) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
for (j = 0; j < i + 1; j++) {
if (a[i + 1] == a[j]) {
cout << i + 1;
break;
}
}
... | #include <iostream>
using namespace std;
int main() {
int a[100000], i, j;
cin >> a[0];
for (i = 0;; i++) {
if (a[i] % 2 == 0)
a[i + 1] = a[i] / 2;
else
a[i + 1] = 3 * a[i] + 1;
for (j = 0; j < i + 1; j++) {
if (a[i + 1] == a[j]) {
cout << i + 2;
return 0;
}
... | replace | 12 | 14 | 12 | 14 | -11 | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int memo[350];
int collaz(int x) {
if (x % 2 == 0) {
return x / 2;
}
return (x * 3) + 1;
}
int main() {
int n, i = 1;
cin >> n;
while (memo[n] == 0) {
memo[n] = i++;
n = collaz(n);
}
cout << i;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
map<int, int> memo;
int collaz(int x) {
if (x % 2 == 0) {
return x / 2;
}
return (x * 3) + 1;
}
int main() {
int n, i = 1;
cin >> n;
while (memo[n] == 0) {
memo[n] = i++;
n = collaz(n);
}
cout << i;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03146 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
// #include "bits/stdc++.h"
using namespace std;
// using namespace std::... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
// #include "bits/stdc++.h"
using namespace std;
// using namespace std::... | replace | 69 | 70 | 69 | 70 | 0 | |
p03146 | C++ | Runtime Error | #include <iostream>
#include <set>
using namespace std;
int main() {
int s;
cin >> s;
int a;
int i = 1;
set<int> ss;
while (a <= 1000000) {
if (i == 1) {
a = s;
} else if (a % 2 == 0) {
a = a / 2;
} else {
a = 3 * a + 1;
}
if (ss.find(a) == ss.end()) {
ss.inser... | #include <iostream>
#include <set>
using namespace std;
int main() {
int s;
cin >> s;
int a;
int i = 1;
set<int> ss;
while (a <= 1000000) {
if (i == 1) {
a = s;
} else if (a % 2 == 0) {
a = a / 2;
} else {
a = 3 * a + 1;
}
if (ss.find(a) == ss.end()) {
ss.inser... | replace | 24 | 25 | 24 | 25 | 0 | |
p03146 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<bool> done(10000000, false);
int cnt = 0;
while (true) {
cnt++;
if (done.at(s)) {
cout << cnt << endl;
break;
} else {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<bool> done(10000000, false);
int cnt = 0;
while (true) {
cnt++;
if (done.at(s)) {
cout << cnt << endl;
break;
} else {
done.at(s) = true;
if (s % 2 == 0) {
s /= 2;
} else {
... | insert | 14 | 14 | 14 | 15 | TLE | |
p03146 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int i = 1;
do {
if (s == 4 || s == 2 || s == 1) {
cout << i + 3 << endl;
break;
}
i++;
} while (1);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int s;
cin >> s;
int i = 1;
do {
if (s == 4 || s == 2 || s == 1) {
cout << i + 3 << endl;
break;
}
i++;
if (s % 2 == 0) {
s = s / 2;
} else {
s = 3 * s + 1;
}
} while (1);
return 0;
} | insert | 14 | 14 | 14 | 19 | TLE | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int s;
cin >> s;
const int p = 2147483647;
vector<int> num(p, 0);
int ans;
int a_prev;
int a_now = s;
int i = 1;
while (true) {
if (i == 1) {
a_now = s;
} else {
a_prev = a_now;
if (a_prev %... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int s;
cin >> s;
const int p = 147483647;
vector<int> num(p, 0);
int ans;
int a_prev;
int a_now = s;
int i = 1;
while (true) {
if (i == 1) {
a_now = s;
} else {
a_prev = a_now;
if (a_prev % ... | replace | 9 | 10 | 9 | 10 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03146 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
int main() {
int s;
scanf("%d", &s);
std::vector<int> vec;
vec.push_back(s);
int i;
for (i = 1; i < 1000000; i++) {
int tmp = vec.at(i - 1);
int push;
if (tmp % 2 == 0) {
push = tmp / 2;
} else {
push = tmp * 3 + 1;
... | #include <algorithm>
#include <cstdio>
#include <vector>
int main() {
int s;
scanf("%d", &s);
std::vector<int> vec;
vec.push_back(s);
int i;
for (i = 1; i < 1000000; i++) {
int tmp = vec.at(i - 1);
int push;
if (tmp % 2 == 0) {
push = tmp / 2;
} else {
push = tmp * 3 + 1;
... | replace | 30 | 31 | 30 | 31 | 5 | |
p03146 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int s;
cin >> s;
int ans = 1;
int a = (s <= 4 ? 1 : 0);
int b = (s >= 4 ? 4 : s);
while (a < 2) {
if (s... | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int s;
cin >> s;
int ans = 1;
int a = 0;
if (s == 4 || s == 2 || s == 1)
a += 1;
int b = (s == 4 || s =... | replace | 15 | 17 | 15 | 19 | TLE | |
p03146 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
... |
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
... | replace | 96 | 97 | 96 | 97 | TLE | |
p03146 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int c[10 * a];
c[a] = 1;
int t;
for (int i = 0;; i++) {
t = i;
if (a % 2 == 1)
a = 3 * a + 1;
else
a = a / 2;
if (c[a] == 1)
goto end;
else
c[a] = 1;
}
end:
cout << t + 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int c[1000000];
c[a] = 1;
int t;
for (int i = 0;; i++) {
t = i;
if (a % 2 == 1)
a = 3 * a + 1;
else
a = a / 2;
if (c[a] == 1)
goto end;
else
c[a] = 1;
}
end:
cout << t + 2;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03146 | C++ | Time Limit Exceeded | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | replace | 50 | 51 | 50 | 59 | TLE | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long fn(long n);
#define N 1000000
int main() {
long str[N] = {};
long s, tmp;
cin >> s;
str[s] = 1;
for (int i = 2; i < N + 1; i++) {
tmp = fn(s);
// cout << tmp << endl;
if (str[tmp] != 0) {
return i;
} else {
str[tmp] = 1;
}... | #include <bits/stdc++.h>
using namespace std;
long fn(long n);
#define N 1000000
int main() {
long str[N] = {};
long s, tmp;
cin >> s;
str[s] = 1;
for (int i = 2; i < N + 1; i++) {
tmp = fn(s);
// cout << tmp << endl;
if (str[tmp] != 0) {
cout << i << endl;
return 0;
} else {
... | replace | 18 | 19 | 18 | 20 | 5 | |
p03146 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
int s;
std::cin >> s;
int list[1000000];
int index = 0;
int a_i;
int a_pre = s;
list[0] = s;
index = index + 1;
bool search_flag = false;
while (true) {
if (a_pre % 2 == 0) {
a_i = a_pre / 2;
} else {
a_i = 3 * a_pre + 1;
}
list[index] = ... | #include <iostream>
int main() {
int s;
std::cin >> s;
int list[1000000];
int index = 0;
int a_i;
int a_pre = s;
list[0] = s;
index = index + 1;
bool search_flag = false;
while (true) {
if (a_pre % 2 == 0) {
a_i = a_pre / 2;
} else {
a_i = 3 * a_pre + 1;
}
list[index] = ... | replace | 22 | 23 | 22 | 23 | TLE | |
p03146 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, i = 0, j;
vector<int> a;
cin >> s;
a.push_back(s);
i++;
while (true) {
if (a[i - 1] % 2) {
a.push_back(a[i - 1] * 3 + 1);
} else {
a.push_back(a[i - 1] / 2);
}
for (j = 0; j < i; j++) {
if (a[i]... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int s, i = 0, j;
vector<int> a;
cin >> s;
a.push_back(s);
i++;
while (true) {
if (a[i - 1] % 2) {
a.push_back(a[i - 1] * 3 + 1);
} else {
a.push_back(a[i - 1] / 2);
}
for (j = 0; j < i; j++) {
if (a[i]... | replace | 19 | 20 | 19 | 20 | 1 | |
p03146 | C++ | Runtime Error | // in progress
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fr(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define rfr(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define PI 3.14159265
int rec(int ind, int n) {
if ... | // in progress
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fr(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define rfr(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define PI 3.14159265
int rec(int ind, int n) {
if ... | replace | 20 | 22 | 20 | 22 | 0 | |
p03146 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(1);
cin >> a.at(0);
int i;
int ans = 0;
while (true) {
for (int j = 0; j < i; j++) {
if (a.at(i) == a.at(j)) {
ans = i + 1;
}
}
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else {
a... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(1);
cin >> a.at(0);
int i = 0;
int ans = 0;
while (true) {
for (int j = 0; j < i; j++) {
if (a.at(i) == a.at(j)) {
ans = i + 1;
}
}
if (a.at(i) % 2 == 0) {
a.push_back(a.at(i) / 2);
} else {
... | replace | 6 | 7 | 6 | 7 | TLE | |
p03146 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int S, ans = 2;
vector<bool> num(300, 1);
cin >> S;
num.at(S - 1) = 0;
while (true) {
if (S % 2 == 0) {
S /= 2;
} else {
S = 3 * S + 1;
}
if (num.at(S - 1)) {
num.a... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int S, ans = 2;
vector<bool> num(10000, 1);
cin >> S;
num.at(S - 1) = 0;
while (true) {
if (S % 2 == 0) {
S /= 2;
} else {
S = 3 * S + 1;
}
if (num.at(S - 1)) {
num... | replace | 8 | 9 | 8 | 9 | 0 | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | replace | 130 | 131 | 130 | 131 | -11 | |
p03146 | 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() {
int n;
cin >> n;
vector<int> k(1000001, 0);
k[n] = 1;
int cnt = 2;
while (1) {
if (n % 2 == 0) {
n /= 2;
} else {
n = n * 3 + 1;
}
if (k[n] == 1) {
cout << cnt <<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> k(1000001, 0);
k[n] = 1;
int cnt = 2;
while (1) {
if (n % 2 == 0) {
n /= 2;
} else {
n = n * 3 + 1;
}
if (k[n] == 1) {
cout << cnt <<... | replace | 19 | 20 | 19 | 20 | TLE | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
int ans;
int v[100] = {0};
v[s]++;
for (int i = 1;; i++) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (v[s] == 0)
v[s]++;
else {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int s;
cin >> s;
int ans;
int v[1000000] = {0};
v[s]++;
for (int i = 1;; i++) {
if (s % 2 == 0) {
s /= 2;
} else {
s = 3 * s + 1;
}
if (v[s] == 0)
v[s]++;
else {... | replace | 8 | 9 | 8 | 9 | 0 | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a;
a[1] = s;
int an;
bool loop = true;
for (int i = 2; loop; i++) {
if (a[i - 1] % 2 == 0)
a.push_back(a[i - 1] / 2);
else
a.push_back(3 * a[i - 1] + 1);
for (int j = 1; j < i; j++) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> a(2);
a[0] = -1;
a[1] = s;
int an;
bool loop = true;
for (int i = 2; loop; i++) {
if (a[i - 1] % 2 == 0)
a.push_back(a[i - 1] / 2);
else
a.push_back(3 * a[i - 1] + 1);
for (int j = 1; j < i; ... | replace | 6 | 7 | 6 | 8 | -11 | |
p03146 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, i = 1, m;
cin >> s;
m = s;
while (s != 4 || m != 2 || m != 1) {
if (s % 2 == 0) {
s /= 2;
} else
s = 3 * s + 1;
i++;
}
cout << i + 3 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, i = 1, m;
cin >> s;
m = s;
while (s != 4) {
if (m == 2 || m == 1)
break;
if (s % 2 == 0) {
s /= 2;
} else
s = 3 * s + 1;
i++;
}
cout << i + 3 << endl;
return 0;
} | replace | 7 | 8 | 7 | 10 | TLE | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, num;
cin >> s;
vector<int> a(101);
int tmp = s;
a[tmp]++;
for (int i = 1;; i++) {
if (tmp % 2 == 0)
tmp /= 2;
else
tmp = 3 * tmp + 1;
a[tmp]++;
if (a[tmp] == 2) {
cout << i + 1;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, num;
cin >> s;
vector<int> a(1000001);
int tmp = s;
a[tmp]++;
for (int i = 1;; i++) {
if (tmp % 2 == 0)
tmp /= 2;
else
tmp = 3 * tmp + 1;
a[tmp]++;
if (a[tmp] == 2) {
cout << i + 1;
return 0;
}
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03146 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | replace | 19 | 20 | 19 | 20 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> data(n);
data[0] = 0;
rep(i, 0, n) { cin >... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> data(n + 1);
data[0] = 0;
rep(i, 0, n) { c... | replace | 12 | 13 | 12 | 13 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
REP(i, N) cin >> h[i];
int ans = 0;
for (int l = 0; l < N; ++l) {
while (h[l] > 0) {
int r = l;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
REP(i, N) cin >> h[i];
int ans = 0;
for (int l = 0; l < N; ++l) {
while (h[l] > 0) {
int r;
... | replace | 16 | 19 | 16 | 21 | 0 | |
p03147 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int res = 0;
while (true) {
if (*max_element(h.begin(), h.end()) == 0)
break;
int it = 0;
while (it... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int res = 0;
while (true) {
if (*max_element(h.begin(), h.end()) == 0)
break;
int it = 0;
while (it... | replace | 22 | 23 | 22 | 23 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = int; _Allocator =
std::allocator<int>; reference = int&; size_type = long unsigned int]
Error: attempt to subscript container with out-o... |
p03147 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[101] = {0};
int Min = 100;
for (int i = 0; i < n; ++i) {
cin >> h[i];
if (Min > h[i]) {
Min = h[i];
}
}
for (int i = 0; i < n; ++i) {
h[i] -= Min;
}
int Sum = Min;
int st, end;
int flg = 0;
while (... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[101] = {0};
int Min = 100;
for (int i = 0; i < n; ++i) {
cin >> h[i];
if (Min > h[i]) {
Min = h[i];
}
}
for (int i = 0; i < n; ++i) {
h[i] -= Min;
}
int Sum = Min;
int st, end;
int flg = 0;
while (... | delete | 34 | 36 | 34 | 34 | TLE | |
p03147 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
const vector<vector<int>> DivideGroup(const vector<int> origGroup) {
vector<vector<int>> divideds;
vector<int> divided;
for (const int member : origGroup) {
if (member == 0) {
if (!divided.empty()) {
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
const vector<vector<int>> DivideGroup(const vector<int> origGroup) {
vector<vector<int>> divideds;
vector<int> divided;
for (const int member : origGroup) {
if (member == 0) {
if (!divided.empty()) {
... | insert | 32 | 32 | 32 | 36 | TLE | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> buf;
int main() {
int N, h[100], c = 0;
vector<vector<int>> T(100, vector<int>(N + 1, 0));
int ans = 0;
cin >> N;
for (int i = 0; i < 100; i++) {
h[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> buf;
int main() {
int N, h[100], c = 0;
vector<vector<int>> T(100, vector<int>(100, 0));
int ans = 0;
cin >> N;
for (int i = 0; i < 100; i++) {
h[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i =... | replace | 8 | 9 | 8 | 9 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> buf;
int main() {
int N, h[100], c = 0;
vector<vector<int>> T(100, vector<int>(N, 0));
int ans = 0;
cin >> N;
for (int i = 0; i < 100; i++) {
h[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> buf;
int main() {
int N, h[100], c = 0;
vector<vector<int>> T(1000, vector<int>(100, 0));
int ans = 0;
cin >> N;
for (int i = 0; i < 100; i++) {
h[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i ... | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
int j = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
while (h[i] > 0) {
int j = i;
while (h[j] > 0) {
++j;
}
int k = i;
while (k ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
int j = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
while (h[i] > 0) {
for (int j = i; j < N && h[j] > 0; ++j) {
--h[j];
}
++cnt;
}
}
... | replace | 12 | 20 | 12 | 14 | 0 | |
p03147 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ct(string) cout << string << endl
int main() {
int n, minn, ans = 0, check, startt;
cin >> n;
vector<int> data(n);
rep(i, n) cin >> data.... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ct(string) cout << string << endl
int main() {
int n, minn, ans = 0, check, startt;
cin >> n;
vector<int> data(n);
rep(i, n) cin >> data.... | replace | 20 | 21 | 20 | 21 | TLE | |
p03147 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <vector>
int main() {
using namespace std;
int n;
scanf("%d", &n);
vector<int> h(n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
int watering_times = 0;
for (int i = 0; i < n; i++) {
while (h[i]) {
watering_times++;
h[i]--;
... | #include <cstdio>
#include <iostream>
#include <vector>
int main() {
using namespace std;
int n;
scanf("%d", &n);
vector<int> h(n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
int watering_times = 0;
for (int i = 0; i < n; i++) {
while (h[i]) {
watering_times++;
h[i]--;
... | replace | 24 | 25 | 24 | 28 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
int cnt;
while (true) {
bool allzero = true;
for (int i = 0; i < N; i++) {
if (h.at(i) != 0) {
allzero = false;
}
}
if (a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
int cnt;
while (true) {
bool allzero = true;
for (int i = 0; i < N; i++) {
if (h.at(i) != 0) {
allzero = false;
}
}
if (a... | replace | 30 | 31 | 30 | 31 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 32559) >= this->size() (which is 4)
|
p03147 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, ans, r, j, i, l;
cin >> N;
int h[1100] = {0};
for (int i = 0; i < N; ++i)
cin >> h[i];
ans = 0;
for (int l = 0; l < N; l++) {
while (h[l] > 0) {
for (int r = l + 1; r < N; r++) {
if (h[r] == 0)
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, ans, r, j, i, l;
cin >> N;
int h[1100] = {0};
for (int i = 0; i < N; ++i)
cin >> h[i];
ans = 0;
for (int l = 0; l < N; l++) {
while (h[l] > 0) {
int r;
for (r = l + 1; r < N; r++) {
if (h[r] == 0)
... | replace | 13 | 14 | 13 | 15 | TLE | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | replace | 46 | 47 | 46 | 47 | -11 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
#define SORT(x, n) sort(x, x)
#define P pair<int... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
#define SORT(x, n) sort(x, x)
#define P pair<int... | replace | 37 | 40 | 37 | 44 | 0 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | replace | 52 | 53 | 52 | 53 | 0 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
int tmp = *std::max_element(h.begin(), h.end());
std::vector<int> flag(0);
for (int i = 0; i < tmp; i++) {
for (int j = 0; j < ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
int tmp = *std::max_element(h.begin(), h.end());
std::vector<int> flag(0);
for (int i = 0; i < tmp; i++) {
for (int j = 0; j < ... | replace | 27 | 28 | 27 | 28 | 0 | |
p03147 | C++ | Runtime Error | #include <iostream>
#include <utility>
using namespace std;
unsigned int *h;
unsigned int N;
unsigned int findMax() {
unsigned max = 0;
unsigned int found = N;
for (unsigned int i = 0; i < N; i++) {
if (max < h[i]) {
max = h[i];
found = i;
}
}
return found;
}
std::pair<unsigned int, unsi... | #include <iostream>
#include <utility>
using namespace std;
unsigned int *h;
unsigned int N;
unsigned int findMax() {
unsigned max = 0;
unsigned int found = N;
for (unsigned int i = 0; i < N; i++) {
if (max < h[i]) {
max = h[i];
found = i;
}
}
return found;
}
std::pair<unsigned int, unsi... | replace | 77 | 78 | 77 | 78 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
// #define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::syn... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
// #define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::syn... | insert | 23 | 23 | 23 | 27 | 0 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> u(n);
for (int i = 0; i < n; i++) {
ci... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> u(n + 1);
for (int i = 0; i < n; i++) {
... | replace | 14 | 15 | 14 | 15 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define N 100009
int main() {
int n;
cin >> n;
int data[n];
for (int i = 0; i < n; i++)
cin >> data[i];
bool color[n + 1];
for (int i = 0; i < n; i++)
color[i] = false;
color[... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
#define N 100009
int main() {
int n;
cin >> n;
int data[n];
for (int i = 0; i < n; i++)
cin >> data[i];
bool color[n + 1];
for (int i = 0; i < n; i++)
color[i] = false;
color[... | replace | 28 | 29 | 28 | 35 | 0 | |
p03147 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int i = 0, n, m = 0, j = 0, a[114];
for (cin >> n; i < n; cin >> a[i++])
;
for (a[i] = 0; j++ < 114;)
for (i = 0; i<n; m += a[i]--> 0 && a[++i] <= 0)
;
cout << m << endl;
} | #include <iostream>
using namespace std;
int main() {
int i = 0, n, m = 0, j = 0, a[114];
for (cin >> n; i < n; cin >> a[i++])
;
for (a[i] = 0; j++ < 114;)
for (i = 0; i<n; m += a[i++]--> 0 && a[i] <= 0)
;
cout << m << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p03147 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int n, h[111], flag1 = 1, flag2, ans = 0, i, j, k, min;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
if (h[i] != 0)
flag1 = 0;
}
while (flag1 == 0) {
k = 0;
flag2 = 1;
min = 111;
for (i = 0; i < n; i++) {
if (h[i] == 0) {
... | #include <stdio.h>
int main() {
int n, h[111], flag1 = 1, flag2, ans = 0, i, j, k, min;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &h[i]);
if (h[i] != 0)
flag1 = 0;
}
while (flag1 == 0) {
k = -1;
flag2 = 1;
min = 111;
for (i = 0; i < n; i++) {
if (h[i] == 0) {
... | replace | 10 | 11 | 10 | 11 | TLE | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0;
bool st = true;
while (st) {
int i = 0;
if (h[i] == 0) {
while (h[i] == 0 && i < n) {
... | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0;
bool st = true;
while (st) {
int i = 0;
if (h[i] == 0) {
while (h[i] == 0 && i < n) {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
vector<vector<int>> table(1);
int index = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] == 0) {
index++;
table.p... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
vector<vector<int>> table(1);
int index = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
if (H[i] == 0) {
index++;
table.p... | insert | 29 | 29 | 29 | 33 | 0 | |
p03147 | C++ | Time Limit Exceeded | #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++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
// using Graph = vector<vector<int>>;
const int dx[4] = {... | #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++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// const int N = 1000000;
const ll mod = 1000000007;
// using Graph = vector<vector<int>>;
const int dx[4] = {... | replace | 43 | 44 | 43 | 44 | TLE | |
p03147 | Python | Runtime Error | N = int(input())
H = list(map(int, input().split()))
ans = 0
while max(H) > 0:
grp = [[]]
for i, h in enumerate(H):
if h == 0:
if len(grp[-1]) > 0:
grp.append([])
else:
grp[-1].append((i, h))
for g in grp:
mi = min([h for _, h in g])
a... | N = int(input())
H = list(map(int, input().split()))
ans = 0
while max(H) > 0:
grp = [[]]
for i, h in enumerate(H):
if h == 0:
if len(grp[-1]) > 0:
grp.append([])
else:
grp[-1].append((i, h))
for g in grp:
if len(g) == 0:
continue
... | insert | 13 | 13 | 13 | 15 | ValueError: min() arg is an empty sequence | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03147/Python/s431171639.py", line 14, in <module>
mi = min([h for _, h in g])
ValueError: min() arg is an empty sequence
|
p03147 | Python | Runtime Error | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(input())
h = list(map(int, input().split()))
dflag = 0
cmin = 0
cmax = h[0]
count = 0
for i in range(1, N):
if h[i - 1] < h[i] and dflag == 1:
count += cmax - cmin
cmax =... | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(input())
if N == 1:
print(input())
exit()
h = list(map(int, input().split()))
dflag = 0
cmin = 0
cmax = h[0]
count = 0
for i in range(1, N):
if h[i - 1] < h[i] and dflag == 1... | insert | 9 | 9 | 9 | 12 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
// Begin {{{
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (i64 i = 0; i < (n); ++i)
#define reps(i, s, n) for (i64 i = (s); i <= (n); ++i)
#define VAR(Type, ...) \
Type __VA_ARGS__; ... | #include <bits/stdc++.h>
// Begin {{{
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (i64 i = 0; i < (n); ++i)
#define reps(i, s, n) for (i64 i = (s); i <= (n); ++i)
#define VAR(Type, ...) \
Type __VA_ARGS__; ... | replace | 78 | 79 | 78 | 79 | 0 | |
p03147 | C++ | Runtime Error | #include <stdio.h>
int nibun(int *, int, int, int);
int main(void) {
int n, h[200];
int ans;
ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
ans = nibun(h, 0, n, ans);
printf("%d\n", ans);
return 0;
}
int nibun(int *h, int start, int end, int ans) {
int i, j, k... | #include <stdio.h>
int nibun(int *, int, int, int);
int main(void) {
int n, h[200];
int ans;
ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
ans = nibun(h, 0, n, ans);
printf("%d\n", ans);
return 0;
}
int nibun(int *h, int start, int end, int ans) {
int i, j, k... | replace | 39 | 40 | 39 | 40 | -11 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
// 高さが全部 0 になるまでやる
int res = 0;
while (true) {
// 最高高さが 0 だったらおしまい
if (*max_element(h.begin(), h.end()) == 0)
break;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
// 高さが全部 0 になるまでやる
int res = 0;
while (true) {
// 最高高さが 0 だったらおしまい
if (*max_element(h.begin(), h.end()) == 0)
break;
... | replace | 26 | 27 | 26 | 27 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int left, right;
int water = 0;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
left = 0;
while (1) {
while (h[left] == 0) {
left++;
if (left == N)
break;
}
right = lef... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int left, right;
int water = 0;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
left = 0;
while (1) {
while (h[left] == 0) {
left++;
if (left == N)
break;
}
if (left ==... | replace | 21 | 24 | 21 | 30 | 0 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 1; i <= N; i++)
cin >> h[i];
long long int ans = 0, active = 0;
for (in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(1000);
for (int i = 1; i <= N; i++)
cin >> h[i];
long long int ans = 0, active = 0;
for ... | replace | 13 | 14 | 13 | 14 | 0 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> h(N);
for (int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> h(N);
for (int... | replace | 34 | 35 | 34 | 35 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.