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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define SZ(a) (int)(a).size()
using ll = long long;
int main() {
cin.sync_with_stdio(false);
ll n, m;
cin >> n >> m;
if (n == 1) {
printf("%lld\n", m);
return 0;
}
int ans = 1;
for (int i = 2; i * i... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define SZ(a) (int)(a).size()
using ll = long long;
int main() {
cin.sync_with_stdio(false);
ll n, m;
cin >> n >> m;
if (n == 1) {
printf("%lld\n", m);
return 0;
}
int ans = 1;
for (ll i = 2; i * i ... | replace | 18 | 19 | 18 | 19 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
constexpr int INF = (1 << 30) - 1;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template <typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
constexpr int INF = (1 << 30) - 1;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
template <typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template <typ... | replace | 18 | 19 | 18 | 19 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K, ans = 1;
cin >> N >> K;
if (N == 1) {
cout << K << endl;
return 0;
}
for (int i = 2; i * i <= K; i++) {
int cnt = 0;
ll tmp = i;
while (K % tmp == 0) {
cnt++;
K /= tmp;
}
cnt /=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K, ans = 1;
cin >> N >> K;
if (N == 1) {
cout << K << endl;
return 0;
}
for (int i = 2; i <= sqrt(K); i++) {
int cnt = 0;
ll tmp = i;
while (K % tmp == 0) {
cnt++;
K /= tmp;
}
cnt ... | replace | 13 | 14 | 13 | 14 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
int main() {
long long n, p, ans{1};
scanf("%lld%lld", &n, &p);
for (int i = 2; i * i <= p; i++) {
if (p % i)
continue;
int tmp{};
while (!(p % i)) {
p /= i;
tmp++;
}
tmp /= n;
for (int j = 0; j < tmp; j++)
ans *= i;
}
if (n == 1)
a... | #include <bits/stdc++.h>
int main() {
long long n, p, ans{1};
scanf("%lld%lld", &n, &p);
for (long long i = 2; i * i <= p; i++) {
if (p % i)
continue;
int tmp{};
while (!(p % i)) {
p /= i;
tmp++;
}
tmp /= n;
for (int j = 0; j < tmp; j++)
ans *= i;
}
if (n == 1)... | replace | 5 | 6 | 5 | 6 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | replace | 39 | 40 | 39 | 40 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << p;
return 0;
}
ll ans = 1;
for (int i = 2; i * i <= p; i += 2) {
ll cnt = 0;
while (p % i == 0) {
cnt++;
p ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << p;
return 0;
}
ll ans = 1;
for (ll i = 2; i * i <= p; i += 2) {
ll cnt = 0;
while (p % i == 0) {
cnt++;
p /... | replace | 14 | 15 | 14 | 15 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define int long long
signed main() {
int n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
int ans = 1;
for (int i = 2;; i++) {
int w = 1;
for (int j = 0; j < n; j++)
w *= i;
if (p < w)... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define int long long
signed main() {
int n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
if (n > 50) {
cout << 1 << endl;
return 0;
}
int ans = 1;
for (int i = 2;; i++) {
int w = 1;
... | insert | 10 | 10 | 10 | 14 | TLE | |
p03196 | C++ | Time Limit Exceeded | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, p;
std::cin >> n >> p;
unordered_map<ll, ll> in;
ll rem = p;
for (int i = 2; i <= sqrt(p); i++) {
while (rem % i == 0) {
rem /= i;
in[i]++;
}
}
for (int i = 2; i <= rem; i++) {
while (rem % i =... | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, p;
std::cin >> n >> p;
unordered_map<ll, ll> in;
ll rem = p;
for (int i = 2; i <= sqrt(p); i++) {
while (rem % i == 0) {
rem /= i;
in[i]++;
}
}
in[rem]++;
ll result = 1;
for (auto i : in) {
... | replace | 16 | 22 | 16 | 18 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | replace | 65 | 66 | 65 | 66 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
lint n, p;
lint rez;
int main() {
rez = 1;
cin >> n >> p;
if (n == 1) {
cout << p << "\n";
return 0;
}
for (int i = 2; i * i <= p; i++) {
int x = 0;
while (p % i == 0)
x++, p /= i;
rez = rez * pow(i, x / n... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
lint n, p;
lint rez;
int main() {
rez = 1;
cin >> n >> p;
if (n == 1) {
cout << p << "\n";
return 0;
}
for (int i = 2; 1LL * i * i <= p; i++) {
int x = 0;
while (p % i == 0)
x++, p /= i;
rez = rez * pow(i,... | replace | 20 | 21 | 20 | 21 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(ll N, ll P) {
if (N == 1)
return P;
double x = powl(P, 1.0 / N);
if (x < 2.0)
return 1;
// x >= 2
int d = (int)ceil(x);
for (ll n = d; n >= 1; --n) {
int cnt = 0;
ll y = P;
while (y % n == 0) {
++cnt;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(ll N, ll P) {
if (N == 1)
return P;
double x = powl(P, 1.0 / N);
if (x < 2.0)
return 1;
// x >= 2
int d = (int)ceil(x);
for (ll n = d; n >= 2; --n) {
int cnt = 0;
ll y = P;
while (y % n == 0) {
++cnt;
... | replace | 15 | 16 | 15 | 16 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
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); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
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); ... | replace | 45 | 46 | 45 | 46 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, k;
cin >> n >> k;
ll ans = 1;
if (n == 1) {
cout << k;
return 0;
}
for (int i = 2; i * i <= k; i += 2) {
ll cnt = 0;
while (k % i == 0) {
cnt++;
k ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n, k;
cin >> n >> k;
ll ans = 1;
if (n == 1) {
cout << k;
return 0;
}
for (ll i = 2; i * i <= k; i += 2) {
ll cnt = 0;
while (k % i == 0) {
cnt++;
k /... | replace | 14 | 15 | 14 | 15 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define PI acos(-1)
#define fast_io \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define PI acos(-1)
#define fast_io \
ios_base::sync_with_stdio(false); ... | replace | 20 | 21 | 20 | 21 | TLE | |
p03196 | 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 <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <u... | replace | 30 | 31 | 30 | 31 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
map<ll, int> ma;
ll N, P;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen("A.INP", ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
map<ll, int> ma;
ll N, P;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen("A.INP", ... | replace | 29 | 30 | 29 | 30 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(c) (c).begin(), (c).end()
const int MOD = 1000000007;
int main() {
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
map<ll, ll> m;
ll d = 2;
ll l = p / 2;
while (p > 1 && l >= d) {
if (p %... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(c) (c).begin(), (c).end()
const int MOD = 1000000007;
int main() {
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
}
map<ll, ll> m;
ll d = 2;
ll l = p;
while (p > 1 && l >= d * d) {
if (p %... | replace | 18 | 20 | 18 | 20 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
#define ll long long
ll N, P;
int solve() {
ll ans = 1;
ll store;
for (int i = 1; pow(i, N) <= P; i++) {
store = static_cast<ll>(pow(i, N));
if (P % store == 0) {
ans = i;
}
}
cout << ans << endl;
return 0;
}
int main() {
cin ... | #include <iostream>
#include <math.h>
using namespace std;
#define ll long long
ll N, P;
int solve() {
ll ans = 1;
ll store;
for (int i = 1; pow(i, N) <= P; i++) {
store = static_cast<ll>(pow(i, N));
if (P % store == 0) {
ans = i;
}
}
cout << ans << endl;
return 0;
}
int main() {
cin ... | insert | 22 | 22 | 22 | 26 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
ll n, p;
cin >> n >> p;
vector<ll> D;
for (ll d = 1; d * d <= p; ++d) {
if (p % d == 0) {
D.push_back(d);
D.push_back(p / d);
}
}
ll odp = 1;
for (int i = 0;... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
ll n, p;
cin >> n >> p;
vector<ll> D;
for (ll d = 1; d * d <= p; ++d) {
if (p % d == 0) {
D.push_back(d);
D.push_back(p / d);
}
}
ll odp = 1;
for (int i = 0;... | insert | 20 | 20 | 20 | 22 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
typedef long long ll;
ll N, P;
ll pw(ll n, int m) {
ll ret = 1;
while (m) {
if (m & 1) {
ret *= n;
}
n *= n;
m >>= 1;
}
return ret;
}
int main() {
cin >> N >... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
typedef long long ll;
ll N, P;
ll pw(ll n, int m) {
ll ret = 1;
while (m) {
if (m & 1) {
ret *= n;
}
n *= n;
m >>= 1;
}
return ret;
}
int main() {
cin >> N >... | replace | 21 | 22 | 21 | 22 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n, p;
cin >> n >> p;
int c = 2;
long t = static_cast<long>(pow(c, n));
long r = 1;
if (n == 1) {
cout << p << endl;
return 0;
}
while (t <= p) {
if (p % t == 0) {
r = c;
}
++c;
t = static_cast<lon... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long n, p;
cin >> n >> p;
int c = 2;
long t = static_cast<long>(pow(c, n));
long r = 1;
if (n == 1) {
cout << p << endl;
return 0;
} else if (n >= 40) {
cout << 1 << endl;
return 0;
}
while (t <= p) {
if (p % ... | insert | 14 | 14 | 14 | 17 | TLE | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int64 N, P;
cin >> N >> P;
vector<int64> divisor;
for (int64 i = 1; i * i <= P; i++) {
if (P % i == 0) {
divisor.emplace_back(i);
if (i * i != P)
divisor.emplace_back(P / i);
}
}
int64 ret = 1;... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int64 N, P;
cin >> N >> P;
vector<int64> divisor;
for (int64 i = 1; i * i <= P; i++) {
if (P % i == 0) {
divisor.emplace_back(i);
if (i * i != P)
divisor.emplace_back(P / i);
}
}
int64 ret = 1;... | replace | 21 | 22 | 21 | 22 | 0 | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, p;
vector<int> prime;
cin >> n >> p;
if (n == 1)
cout << p << endl;
else if (n == 2) {
int ans = 1;
for (int i = 2; i <= sqrt(p); i++) {
if (p % (i * i) == 0)
ans = i;
}
cout << ans << endl;
} else {
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, p;
vector<int> prime;
cin >> n >> p;
if (n == 1)
cout << p << endl;
else if (n == 2) {
int ans = 1;
for (long i = 2; i <= sqrt(p); i++) {
if (p % (i * i) == 0)
ans = i;
}
cout << ans << endl;
} else {
in... | replace | 10 | 11 | 10 | 11 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
int A = P;
int ans = 1;
int cnt = 2;
int waru = 0;
while (P > 1 || cnt <= sqrt(A)) {
if (P % cnt == 0 && P / cnt > 0) {
waru++;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, P;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
int A = P;
int ans = 1;
int cnt = 2;
int waru = 0;
while (P > 1 && cnt <= sqrt(A)) {
if (P % cnt == 0 && P / cnt > 0) {
waru++;... | replace | 17 | 18 | 17 | 18 | TLE | |
p03196 | C++ | Time Limit Exceeded | #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 vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(),... | #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 vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
using vs = vector<string>;
#define all(a) a.begin(),... | insert | 63 | 63 | 63 | 67 | TLE | |
p03196 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int lli;
lli modpow(lli a, lli p, lli mod) {
lli ret = 1;
for (int i = 63; i >= 0; i--) {
ret *= ret;
if (ret > mod)
return -1;
if ((1LL << i & p) != 0) {
ret *= a;
if (ret > mod)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int lli;
lli modpow(lli a, lli p, lli mod) {
lli ret = 1;
for (int i = 63; i >= 0; i--) {
if (ret > (lli)1e7)
return -1;
ret *= ret;
if (ret > mod)
return -1;
if ((1LL << i & p) != 0) {
... | insert | 9 | 9 | 9 | 11 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream> /... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream> /... | replace | 43 | 44 | 43 | 44 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N, P, tmp, ans;
cin >> N >> P;
ans = 1;
if ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N, P, tmp, ans;
cin >> N >> P;
ans = 1;
if ... | replace | 25 | 26 | 25 | 26 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxN = 100 * 1000 + 9;
const int INF = 1e9;
const double EPS = 1e-9;
map<long long, long long> mp;
long long n, p;
long long quickPow(long long a, long long b) {
if (b == 0)
return 1;
long long tmp = quickPow(a, b / 2);
if (b & 1)
return tmp * tmp... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 100 * 1000 + 9;
const int INF = 1e9;
const double EPS = 1e-9;
map<long long, long long> mp;
long long n, p;
long long quickPow(long long a, long long b) {
if (b == 0)
return 1;
long long tmp = quickPow(a, b / 2);
if (b & 1)
return tmp * tmp... | replace | 22 | 23 | 22 | 23 | TLE | |
p03196 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
ll n, p, ans;
ll pow(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
return x * pow(x, y - 1);
} else {
ll yy = pow(x, y / 2);
return yy * yy;
}
}
int main() {
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
... | #include <iostream>
using namespace std;
typedef long long ll;
ll n, p, ans;
ll pow(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
return x * pow(x, y - 1);
} else {
ll yy = pow(x, y / 2);
return yy * yy;
}
}
int main() {
cin >> n >> p;
if (n == 1) {
cout << p << endl;
return 0;
... | insert | 24 | 24 | 24 | 25 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI = acos(-1);
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
int main() {
ll n, p;
cin >> n >> p;
ll m = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI = acos(-1);
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
int main() {
ll n, p;
cin >> n >> p;
ll m = 0;
... | replace | 16 | 19 | 16 | 23 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A;
cin >> A;
long long N;
cin >> N;
if (A == 1) {
cout << N << endl;
return 0;
}
long long temp = N;
map<long long, long long> mp;
int i = 2;
while (temp > 1) {
if (temp % i == 0) {
mp[i]++;
temp = temp / i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A;
cin >> A;
long long N;
cin >> N;
if (A == 1) {
cout << N << endl;
return 0;
}
long long temp = N;
map<long long, long long> mp;
int i = 2;
while (temp > 1) {
if (temp % i == 0) {
mp[i]++;
temp = temp / i... | replace | 22 | 23 | 22 | 23 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
typedef long long int LL;
int main() {
LL n, m, a, b;
int i, j;
int s = 1;
cin >> n >> m;
if (n == 1) {
cout << m << endl;
return 0;
}
for (a = 1;; a++) {
for (b = 1, i = 0; i < n; i++) {
b *= a;
if (b > m) {
cout << s << endl;
... | #include <iostream>
using namespace std;
typedef long long int LL;
int main() {
LL n, m, a, b;
int i, j;
int s = 1;
cin >> n >> m;
if (n == 1) {
cout << m << endl;
return 0;
}
if (n > 100) {
cout << 1 << endl;
return 0;
}
for (a = 1;; a++) {
for (b = 1, i = 0; i < n; i++) {
b... | insert | 10 | 10 | 10 | 14 | TLE | |
p03196 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long pw(long long e, long long x) {
if (x == 0)
return 1;
if (x == 1)
return e;... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long pw(long long e, long long x) {
if (x == 0)
return 1;
if (x == 1)
return e;... | insert | 32 | 32 | 32 | 36 | 0 | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B, C = 1;
cin >> A >> B;
if (A == 1) {
cout << B << endl;
return 0;
}
for (int i = 2; i * i <= B; i++)
if (B % i == 0) {
int cnt = 0;
while (B % i == 0)
B /= i, cnt++;
cnt = (int)(cnt / A);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B, C = 1;
cin >> A >> B;
if (A == 1) {
cout << B << endl;
return 0;
}
for (long long int i = 2; i * i <= B; i++)
if (B % i == 0) {
int cnt = 0;
while (B % i == 0)
B /= i, cnt++;
cnt = (int)(cnt / ... | replace | 9 | 10 | 9 | 10 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main() {
ll n, P;
cin >> n >> P;
ll p = P;
// map<ll,ll> mp;
ll ans = 1;
vector<ll> last;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main() {
ll n, P;
cin >> n >> P;
ll p = P;
// map<ll,ll> mp;
ll ans = 1;
vector<ll> last;
... | insert | 20 | 20 | 20 | 24 | TLE | |
p03196 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | insert | 67 | 67 | 67 | 71 | 0 | |
p03196 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
// #include<boost/multiprecision/cpp_dec_float.hpp>
// namespace mp=boost::multiprecision;
// #define mulint mp::cpp_int
// #define mulfloat mp::cpp_dec_float_100
using namespace std;
struct __INIT {
__INIT() {
ci... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
// #include<boost/multiprecision/cpp_dec_float.hpp>
// namespace mp=boost::multiprecision;
// #define mulint mp::cpp_int
// #define mulfloat mp::cpp_dec_float_100
using namespace std;
struct __INIT {
__INIT() {
ci... | replace | 40 | 41 | 40 | 41 | TLE | |
p03196 | C++ | Time Limit Exceeded | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | insert | 114 | 114 | 114 | 118 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
ll n, p;
cin >> ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
ll n, p;
cin >> ... | replace | 25 | 26 | 25 | 26 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll power(ll x, ll y) {
if (x == 1)
return 1;
if (y == 1)
return x;
if (x > 1000000)
return 1000000000001;
if (y > 40)
return 1000000000001;
ll res = 1;
for (ll i = 0; i < y; i++) {
if (res > 1000000000000) {
res =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll power(ll x, ll y) {
if (x == 1)
return 1;
if (y == 1)
return x;
if (x > 1000000)
return 1000000000001;
if (y > 40)
return 1000000000001;
ll res = 1;
for (ll i = 0; i < y; i++) {
if (res > 1000000000000) {
res =... | replace | 28 | 32 | 28 | 36 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | #include <bits/stdc++.h>
#include <unistd.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | replace | 217 | 230 | 217 | 223 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
long long sqr(long long n) { return static_cast... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
long long sqr(long long n) { return static_cast... | insert | 35 | 35 | 35 | 39 | TLE | |
p03196 | C++ | Time Limit Exceeded | /*input
1 8
*/
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define pp pop_back
#define pf pop_front
... | /*input
1 8
*/
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define pb push_back
#define pp pop_back
#define pf pop_front
... | replace | 130 | 131 | 130 | 131 | TLE | |
p03196 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, p, g = 1;
int main() {
cin >> n >> p;
if (n == 1)
return cout << p, 0;
for (int i = 2; i * i <= p; i++)
if (p % i == 0) {
int c = 0;
while (p % i == 0)
p /= i, c++;
for (int j = 0; j < (c / n); j++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, p, g = 1;
int main() {
cin >> n >> p;
if (n == 1)
return cout << p, 0;
for (ll i = 2; i * i <= p; i++)
if (p % i == 0) {
int c = 0;
while (p % i == 0)
p /= i, c++;
for (int j = 0; j < (c / n); j++)
... | replace | 12 | 13 | 12 | 13 | TLE | |
p03196 | C++ | Runtime Error | // submitted by Himj
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i, s, e) for (i = s; i < e; i++)
#define ms(arr, val) memset(arr, val, sizeof(arr))
using namespace std;
const int mxn = 2e5 + 1;
int main() {
ios_base::sync_w... | // submitted by Himj
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i, s, e) for (i = s; i < e; i++)
#define ms(arr, val) memset(arr, val, sizeof(arr))
using namespace std;
const int mxn = 2e5 + 1;
int main() {
ios_base::sync_w... | replace | 17 | 21 | 17 | 18 | 0 | |
p03197 | C++ | Runtime Error | // 各ターンで、各色のリンゴは高々1個までしか減らせない
// リンゴの数が偶数なら、ルンルンは"あなた"が直前に食べた場合に食べるようにすることで、
// かならず最後にその種類のリンゴを食べることができる。
// リンゴの数が1より大きい奇数なら、ルンルンは"あなた"が最初に食べたあと、そのリンゴを食べないようにして、
// あなたのターンが回ってきた時にそのリンゴの数が偶数個になるようにして、あとは偶数個の場合の戦略で、
// 最後にそのリンゴを食べることができる。
// →だれが先にそのリンゴを食べるかによって戦略が変わるのか？
#include <bits/stdc++.h>
using namespace std;
... | // 各ターンで、各色のリンゴは高々1個までしか減らせない
// リンゴの数が偶数なら、ルンルンは"あなた"が直前に食べた場合に食べるようにすることで、
// かならず最後にその種類のリンゴを食べることができる。
// リンゴの数が1より大きい奇数なら、ルンルンは"あなた"が最初に食べたあと、そのリンゴを食べないようにして、
// あなたのターンが回ってきた時にそのリンゴの数が偶数個になるようにして、あとは偶数個の場合の戦略で、
// 最後にそのリンゴを食べることができる。
// →だれが先にそのリンゴを食べるかによって戦略が変わるのか？
#include <bits/stdc++.h>
using namespace std;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03197 | Python | Runtime Error | print("second" if all([int(input()) % 2 == 0 for i in range(input())]) else "first")
| print(
"second" if all([int(input()) % 2 == 0 for i in range(int(input()))]) else "first"
)
| replace | 0 | 1 | 0 | 3 | TypeError: 'str' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03197/Python/s329085131.py", line 1, in <module>
print("second" if all([int(input()) % 2 == 0 for i in range(input())]) else "first")
TypeError: 'str' object cannot be interpreted as an integer
|
p03197 | Python | Runtime Error | n = int(input())
A = list(map(int, input().split()))
print("second" if all(A[i] % 2 == 0 for i in range(n)) else "first")
| n = int(input())
A = [int(input()) for i in range(n)]
print("second" if all(A[i] % 2 == 0 for i in range(n)) else "first")
| replace | 1 | 2 | 1 | 2 | 0 | |
p03197 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
if (a[i] % 2)
return puts("first");
}
puts("second");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
if (a[i] % 2) {
puts("first");
return 0;
}
}
puts("second");
return 0;
}
| replace | 9 | 11 | 9 | 13 | 6 | |
p03198 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sqr(x) ((x) * (x))
#define mp make_pair
#define ld long double
#define PI pair<int, int>
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sqr(x) ((x) * (x))
#define mp make_pair
#define ld long double
#define PI pair<int, int>
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
... | replace | 42 | 43 | 42 | 43 | 0 | |
p03198 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
vector<long long> solve(vector<int> A) {
int N = A.size();
vector<long long> dp(N);
vector<double> diff(N - 1);
set<int> four;
for (int i = N - 2; i >= 0; --i) {
dp[i] = dp[i + 1];
diff[i] = double(A[i + 1])... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
vector<long long> solve(vector<int> A) {
int N = A.size();
vector<long long> dp(N);
vector<double> diff(N - 1);
set<int> four;
for (int i = N - 2; i >= 0; --i) {
dp[i] = dp[i + 1];
diff[i] = double(A[i + 1])... | replace | 13 | 24 | 13 | 22 | TLE | |
p03198 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define rg register
#define ll long long
#define LDB long double
#define ull unsigned long long
#define view(i, x) for (rg int i = hd[x]; i != -1; i = e[i].nt)
#define go(i, x, a) for (rg int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define rg register
#define ll long long
#define LDB long double
#define ull unsigned long long
#define view(i, x) for (rg int i = hd[x]; i != -1; i = e[i].nt)
#define go(i, x, a) for (rg int... | delete | 62 | 64 | 62 | 62 | TLE | |
p03198 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
clock_t t = clock();
namespace my_std {
using namespace std;
#define pii pair<int, int>
#define fir first
#define sec second
#define MP make_pair
#define rep(i, x, y) for (int i = (x); i <= (y); i++)
#define drep(i, x, y) for (int i = (x); i >= (y); i--)
#define go(x) for (int i = head[x]; i; i... | #include <bits/stdc++.h>
clock_t t = clock();
namespace my_std {
using namespace std;
#define pii pair<int, int>
#define fir first
#define sec second
#define MP make_pair
#define rep(i, x, y) for (int i = (x); i <= (y); i++)
#define drep(i, x, y) for (int i = (x); i >= (y); i--)
#define go(x) for (int i = head[x]; i; i... | replace | 12 | 13 | 12 | 13 | TLE | |
p03198 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | replace | 254 | 255 | 254 | 255 | 0 | |
p03198 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int read() {
char ch = getchar();
int f = 0, x = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
x = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int read() {
char ch = getchar();
int f = 0, x = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
x = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
... | replace | 26 | 27 | 26 | 27 | TLE | |
p03198 | C++ | Runtime Error | #include <bits/stdc++.h>
#define inf (long long)(1e18)
using namespace std;
long long n;
vector<long long> a, pre, suf;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (auto &p : a)
cin >> p;
cout << solve() << endl;
return 0;
}
long long solve() {
auto calc = [](vector<long long> &v) {
... | #include <bits/stdc++.h>
#define inf (long long)(1e18)
using namespace std;
long long n;
vector<long long> a, pre, suf;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (auto &p : a)
cin >> p;
cout << solve() << endl;
return 0;
}
long long solve() {
auto calc = [](vector<long long> &v) {
... | replace | 20 | 21 | 20 | 21 | 0 | |
p03198 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | replace | 701 | 725 | 701 | 750 | TLE | |
p03198 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | replace | 40 | 41 | 40 | 41 | 0 | |
p03198 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | replace | 24 | 25 | 24 | 25 | 0 | |
p03199 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <clocale>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <math.h>
#in... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <clocale>
#include <cmath>
#include <complex>
#include <ctype.h>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <math.h>
#in... | replace | 178 | 181 | 178 | 181 | TLE | |
p03199 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#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... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#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... | delete | 105 | 124 | 105 | 105 | TLE | |
p03200 | C++ | Time Limit Exceeded | //
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int main() {
string s;
cin >> s;
ll ans = 0;
for (int ... | //
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int main() {
string s;
cin >> s;
ll ans = 0;
/* for... | replace | 15 | 20 | 15 | 28 | TLE | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for... | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for... | replace | 54 | 55 | 54 | 55 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
// string S = "BWBWBW";
int ret = 0;
bool isMoreFound = true;
while (isMoreFound) {
string newS = S;
bool isAtLeastFound = false;
for (int idx = 0; idx < S.size() - 1; idx++) {
if (S[idx] == 'B' && S[idx + 1] == ... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
// string S = "BWBWBW";
long long ret = 0;
long long leftB = 0;
for (int idx = 0; idx < S.size(); idx++) {
if (S[idx] == 'B')
leftB++;
else if (S[idx] == 'W')
ret += leftB;
}
cout << ret;
return 0;
}
| replace | 7 | 23 | 7 | 14 | TLE | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
#define inc(l, i, r) for (int i = l; i <= r; i++)
#define dec(r, i, l) for (int i = r; i >= l; i--)
#define mid ((l + r) >> 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define ___ putchar(10);
#define N 100100
using namespace std;
t... | #include <bits/stdc++.h>
#define inc(l, i, r) for (int i = l; i <= r; i++)
#define dec(r, i, l) for (int i = r; i >= l; i--)
#define mid ((l + r) >> 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define ___ putchar(10);
#define N 200200
using namespace std;
t... | replace | 10 | 11 | 10 | 11 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
bool flag = true;
while (flag) {
flag = false;
for (int i = 0; i < S.length() - 1; i++) {
if (S[i] == 'B' && S[i + 1] == 'W') {
S[i] = 'W';
S[i + 1] = 'B';
flag = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long long count = 0;
int left = 0;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'W') {
count += i - left;
left++;
}
}
cout << count << endl;
return 0;
}
| replace | 8 | 20 | 8 | 14 | TLE | |
p03200 | C++ | Runtime Error | #include <cstdio>
// #include <cstdlib>
#include <cstring>
// #include <map>
// #include <set>
// #include <queue>
// #include <string>
// #include <vector>
// #include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int MAXN = 100005;
const int P = 1... | #include <cstdio>
// #include <cstdlib>
#include <cstring>
// #include <map>
// #include <set>
// #include <queue>
// #include <string>
// #include <vector>
// #include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int MAXN = 200005;
const int P = 1... | replace | 17 | 18 | 17 | 18 | 0 | |
p03200 | C++ | Time Limit Exceeded | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | replace | 42 | 51 | 42 | 49 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric> // accumulate(v.begin(), v.end(), 0)
#include <vector>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int N = (int)S.size();
int ans = 0;
for (int i = 0; i < N - 1; i++) {
if (S[i]... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric> // accumulate(v.begin(), v.end(), 0)
#include <vector>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int N = (int)S.size();
ll ans = 0;
int end = N - 1;
for (int i = N - 1; i >= 0; ... | replace | 14 | 21 | 14 | 20 | TLE | |
p03200 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
ll c = 0, ans = 0;
char *str = new char[20005];
scanf("%s... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int main() {
ll c = 0, ans = 0;
char *str = new char[200005];
scanf("%... | replace | 12 | 13 | 12 | 13 | 0 | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 100010
char s[N];
int main() {
scanf("%s", s);
int n = strlen(s);
long long ans = 0, c = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == 'B')
++c;
else
ans += c;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N 200010
char s[N];
int main() {
scanf("%s", s);
int n = strlen(s);
long long ans = 0, c = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == 'B')
++c;
else
ans += c;
}
cout << ans << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
long long wn = 0;
long long ans = 0;
cin >> str;
for (int i = st... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
long long wn = 0;
long long ans = 0;
cin >> str;
for (int i = st... | replace | 20 | 21 | 20 | 21 | -11 | |
p03200 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int r = 0;
for (int i = s.size() - 1; i >= 0; i++) {
if (s[i] == 'W') {
r = i;
break;
}
}
int ans = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == 'B') {
ans += r - i;
r--;
}
}
... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
long long cnt = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'B')
cnt++;
else
ans += cnt;
}
cout << ans << endl;
} | replace | 6 | 19 | 6 | 12 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44
using namespace std;
string str;
int main() {
// ifstream cin("A.in");
// ofstream cout("A.out");
// int ;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >... | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44
using namespace std;
string str;
int main() {
// ifstream cin("A.in");
// ofstream cout("A.out");
// int ;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >... | replace | 19 | 32 | 19 | 23 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#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() {
char s[200005] = {};
long int ans = 0;... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#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() {
char s[200005] = {};
long int ans = 0;... | replace | 18 | 25 | 18 | 23 | TLE | |
p03200 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | replace | 25 | 26 | 25 | 26 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
#define mod 1000000007
#define PI 3.14159265
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
#define mod 1000000007
#define PI 3.14159265
#d... | replace | 24 | 34 | 24 | 30 | TLE | |
p03200 | C++ | Time Limit Exceeded | #ifndef LOCAL
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <qu... | #ifndef LOCAL
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <qu... | replace | 87 | 91 | 87 | 94 | TLE | |
p03200 | C++ | Runtime Error | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define int ll
int ans;
string S;
int a[30000];
int len;
int Count;
signed main() {
cin >> S;
len = S.size();
for (int i = 0; i < len; i++) {
if (S[i] == 'B') {
a[i + 1] = 1;
}
... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define int ll
int ans;
string S;
int a[300000];
int len;
int Count;
signed main() {
cin >> S;
len = S.size();
for (int i = 0; i < len; i++) {
if (S[i] == 'B') {
a[i + 1] = 1;
}
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
long long f = 0;
int d = 0;
long long sum = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'B' && s[i + 1] == 'W') {
sum++;
s[i] = 'W';
s[i + 1] = '... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
long long f = 0;
int d = 0;
long long sum = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'W') {
sum += f;
} else {
f++;
}
}
cout << sum << e... | replace | 12 | 18 | 12 | 16 | TLE | |
p03200 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
vector<int> cum_cnt(s.size(), 0);
rep(i, 0, s.size() + 1) cum_cnt[i + 1] = cum_cnt[i] + int(s[i] ==... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int cnt = 0;
ll ans = 0;
for (auto c : s)
if (c == 'B')
++cnt;
else
ans += cn... | replace | 10 | 16 | 10 | 17 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
#define len(x) ((int)(x).size())
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
#define len(x) ((int)(x).size())
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i =... | replace | 31 | 39 | 31 | 37 | TLE | |
p03200 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
char s[100010];
int n, num = 0;
LL ans = 0;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = n; i >= 1; i--) {
if (s[i] == 'B') {
ans += (n - i - num);
num++;
}... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
char s[200010];
int n, num = 0;
LL ans = 0;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = n; i >= 1; i--) {
if (s[i] == 'B') {
ans += (n - i - num);
num++;
}... | replace | 6 | 7 | 6 | 7 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
string s;
cin >> s;
int ans = 0;
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REP(i, x, n) for (int i = x; i < n; i++)
int main() {
string s;
cin >> s;
ll ans = 0;
int ... | replace | 13 | 25 | 13 | 21 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
#define debug(x) cerr << #x << " : " << x << endl
namespace atcoder {
void judge_outer(bool judge_exp, string ok = "Yes", string ng = "No") {
if (judge_exp) {
cout << ok << endl;
} else {
cout << n... | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
#define debug(x) cerr << #x << " : " << x << endl
namespace atcoder {
void judge_outer(bool judge_exp, string ok = "Yes", string ng = "No") {
if (judge_exp) {
cout << ok << endl;
} else {
cout << n... | replace | 35 | 43 | 35 | 41 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
#define put(n) cout << (n) << endl
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
#define put(n) cout << (n) << endl
#define rep(i, N) for (int(i) = 0; (i) < (N); ++(i))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(... | replace | 17 | 32 | 17 | 24 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int64_t ans = 0;
while (true) {
bool flag = false;
for (int i = 0; i < S.size() - 1; i++) {
if (S.substr(i, 2) == "BW") {
ans++;
flag = true;
S.at(i) = 'W';
S.at(i + 1) = 'B';
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int64_t ans = 0;
int count = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'B') {
count++;
} else {
ans += count;
}
}
cout << ans << endl;
return 0;
}
| replace | 7 | 19 | 7 | 13 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
// bool flag = 0;
int ans = 0;
int k = 0;
for (int i = 0; i < S.size() - 1; i++) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
ll n = 0;
ll ans = 0;
for (ll i = 0; i < S.size(); i++) {
if (S.at(i) == 'W') {
... | replace | 17 | 42 | 17 | 23 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.s... | replace | 19 | 34 | 19 | 25 | TLE | |
p03200 | C++ | Time Limit Exceeded |
// A - Irreversible operation
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
if (S.size() == 1) {
cout << 0 << endl;
return 0;
}
int ans = 0;
i... |
// A - Irreversible operation
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
if (S.size() == 1) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
ll ... | replace | 19 | 40 | 19 | 26 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int res = 0, d = 1;
while (d > 0) {
d = 0;
for (int i = s.size() - 1; i > 0; i--) {
if (s[i] == 'W' && s[i - 1] == 'B') {
d++, swap(s[i], s[i - 1]);
}
}
res += d;
}
cout << res << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long res = 0;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'B')
cnt++;
else
res += cnt;
}
cout << res << endl;
return 0;
}
| replace | 7 | 16 | 7 | 14 | TLE | |
p03200 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long long n, a[100001], b[100001], ans = 0;
string s;
void gb(int l, int r) {
if (l == r)
return;
int mid = (l + r) >> 1;
gb(l, mid);
gb(mid + 1, r);
int i = l, j = mid + 1, top = l - 1, k;
while (i <= mid && j <= r) {
i... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long long n, a[250001], b[250001], ans = 0;
string s;
void gb(int l, int r) {
if (l == r)
return;
int mid = (l + r) >> 1;
gb(l, mid);
gb(mid + 1, r);
int i = l, j = mid + 1, top = l - 1, k;
while (i <= mid && j <= r) {
i... | replace | 4 | 5 | 4 | 5 | 0 | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
string S;
cin >> S;
uint64_t ans = 0;
while (1) {
int idx = S.find("BW");
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ini, n) for (int i = ini; i < n; i++)
#define _rep(i, ini, n) for (int i = ini; i >= n; i--)
#define ToEnd(a) a.begin(), a.end()
uint64_t MOD = 1000000007;
int main() {
string S;
cin >> S;
uint64_t ans = 0, wCnt = 0;
;
for (auto s : S) {
if (s... | replace | 11 | 18 | 11 | 18 | TLE | |
p03200 | C++ | Time Limit Exceeded | #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 INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }... | #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 INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }... | replace | 18 | 30 | 18 | 30 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
uint64_t count = 0;
rep(i, s.size() - 1) {
if (s[i] == 'B' && s[i + 1] == 'W') {
s[i] = 'W';
s[i + 1] = 'B';
count++;
while (s[i - 1] == 'B') {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
uint64_t count = 0;
uint64_t black = 0;
rep(i, s.size()) {
if (s[i] == 'W') {
count += black;
} else {
black++;
}
}
std::cout << count << st... | replace | 11 | 22 | 11 | 17 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
std::string s;
std::cin >> s;
int cnt = 0;
size_t p = 0;
while ((p = s.find("BW")) != std::string::npos) {
s.replace(p, 2, "WB", 2);
cnt++;
}
std::cout << cnt << std::endl;
return 0;
} | #include <iostream>
int main() {
std::string s;
std::cin >> s;
unsigned long long cnt = 0;
int b = 0;
for (auto &c : s) {
if (c == 'W') {
cnt += b;
} else { // 'B'
b++;
}
}
std::cout << cnt << std::endl;
return 0;
} | replace | 5 | 10 | 5 | 14 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int cnt = 0;
for (int j = 0;; j++) {
bool bw = true;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'W') {
cnt++;
s[i] = 'W';
s[i + 1] = 'B';
bw = f... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
long long int cnt = 0, w[n] = {};
if (s[0] == 'W')
w[0]++;
for (int i = 1; i < n; i++) {
if (s[i] == 'W')
w[i] = w[i - 1] + 1;
else
w[i] = w[i - 1];
}
for (int i = 0; i < n; i++) {
... | replace | 7 | 20 | 7 | 20 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
typedef vector<ll> vll;
typedef vector<int> vi;
const int maxn = 100 + 10;
int main() {
string s;
cin >> s;
int ans = 0;
int left = 0;
int right = 0;
while (left < s.length() && right < s.length()) {
while (le... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
typedef vector<ll> vll;
typedef vector<int> vi;
const int maxn = 100 + 10;
int main() {
string s;
cin >> s;
ll ans = 0;
ll cnt = 0;
for (auto c : s) {
if (c == 'B')
++cnt;
else
ans += cnt;
}
... | replace | 12 | 29 | 12 | 19 | TLE | |
p03200 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define SUM(n) ((n) + 1) * (n) / 2 // 1〜nまでの総和を求める式
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed << setprecision(x + 1) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define SUM(n) ((n) + 1) * (n) / 2 // 1〜nまでの総和を求める式
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed << setprecision(x + 1) ... | replace | 46 | 59 | 46 | 52 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.