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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02835 | Python | Runtime Error | A1 = input()
A2 = input()
A3 = input()
if A1 + A2 + A3 < 22:
print("win")
else:
print("bust")
| A1, A2, A3 = (int(x) for x in input().split())
if A1 + A2 + A3 < 22:
print("win")
else:
print("bust")
| replace | 0 | 4 | 0 | 1 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02835/Python/s934239505.py", line 2, in <module>
A2 = input()
EOFError: EOF when reading a line
|
p02835 | Python | Runtime Error | a, b, c = map(int, input().split())
print("win" if sum((a, b, c)) < 21 else "bust")
a, b, c = map(int, input().split())
print("win" if sum((a, b, c)) < 22 else "bust")
| a, b, c = map(int, input().split())
print("win" if sum((a, b, c)) < 22 else "bust")
| delete | 0 | 3 | 0 | 0 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02835/Python/s003175429.py", line 4, in <module>
a, b, c = map(int, input().split())
EOFError: EOF when reading a line
|
p02835 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb p... | replace | 25 | 29 | 25 | 29 | -6 | terminate called after throwing an instance of 'std::__ios_failure'
what(): basic_ios::clear: iostream error
|
p02835 | Python | Runtime Error | array = map(int, input().split())
print(f'{ "bust" if sum(array) >= 22 else "win"}')
| array = map(int, input().split())
if sum(array) >= 22:
print("bust")
else:
print("win")
| replace | 1 | 2 | 1 | 5 | 0 | |
p02835 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", a, b, c);
if (a + b + c < 22)
printf("win\n");
else
printf("bust\n");
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a + b + c < 22)
printf("win\n");
else
printf("bust\n");
} | replace | 3 | 4 | 3 | 4 | -11 | |
p02835 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define sz(a) int((a).size())
#define endl '\n'
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
int32_t main() {
ios_base::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define sz(a) int((a).size())
#define endl '\n'
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
int32_t main() {
ios_base::sync_with_stdio(false);
... | replace | 19 | 23 | 19 | 23 | 0 | |
p02835 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d");
if (a + b + c <= 21) {
printf("win");
} else {
printf("bust");
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a + b + c <= 21) {
printf("win");
} else {
printf("bust");
}
return 0;
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02835 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
#define ld long double
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE... | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
#define ld long double
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin... | delete | 16 | 21 | 16 | 16 | 0 | |
p02835 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a;
cin >> a[0] >> a[1] >> a[2];
if (a[0] + a[1] + a[2] < 22)
cout << "win" << endl;
else
cout << "bust" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s = a + b + c;
if (s <= 21)
cout << "win" << endl;
else
cout << "bust" << endl;
}
| replace | 4 | 7 | 4 | 8 | -11 | |
p02835 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", a, b, c);
if (a + b + c <= 21) {
printf("win");
} else {
printf("bust");
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a + b + c <= 21) {
printf("win");
} else {
printf("bust");
}
return 0;
} | replace | 3 | 4 | 3 | 4 | -11 | |
p02836 | C++ | Time Limit Exceeded | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define ff first
#define ss second
... | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define ff first
#define ss second
... | insert | 66 | 66 | 66 | 67 | TLE | |
p02836 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
string S;
int ans = 0;
cin >> S;
for (int i = 0; i <= S.length() / 2 - 1; i++) {
if (S[i] != S[S.length() - 1 - i]) {
// cout << S[i] << " " << S[S.length() - 1 - i] << endl;
ans++;
}
}
printf("%d", ans);
ret... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
string S;
int ans = 0;
cin >> S;
int l = S.length();
for (int i = 0; i <= l / 2 - 1; i++) {
if (S[i] != S[l - 1 - i]) {
ans++;
}
}
printf("%d", ans);
return 0;
}
| replace | 8 | 11 | 8 | 11 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF LLONG_MAX - 100
#define inf 1012345678
#define MOD 1000000007
#define fcout cout << fix... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF LLONG_MAX - 100
#define inf 1012345678
#define MOD 1000000007
#define fcout cout << fix... | replace | 66 | 67 | 66 | 67 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
string str;
cin >> str;
int begin = 0;
int end = str.length() - 1;
int answer = 0;
while ... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
string str;
cin >> str;
int begin = 0;
int end = str.length() - 1;
int answer = 0;
while ... | replace | 21 | 22 | 21 | 22 | -11 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define bet(min, max, n) if (!(min < n && n < max))
#define bet_omin(min, max, n) if (!(min <= n && n < max))
#define bet_omax(min, max, n) if (!(min < n && n <= max))
#define rep(i, n) for (int i =... | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define bet(min, max, n) if (!(min < n && n < max))
#define bet_omin(min, max, n) if (!(min <= n && n < max))
#define bet_omax(min, max, n) if (!(min < n && n <= max))
#define rep(i, n) for (int i =... | replace | 20 | 21 | 20 | 21 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
if (S.size() % 2 == 0) {
for (int i = 0; i < S.size() / 2; i++) {
if (S.at(i) != S.at(S.size() - 1 - i)) {
ans++;
}
}
}
if (S.size() % 2 == 1) {
for (int i = 0; i < S.size() / 2 - 1; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size() / 2; i++) {
if (S.at(i) != S.at(S.size() - 1 - i)) {
ans++;
}
}
cout << ans << endl;
}
| replace | 6 | 18 | 6 | 9 | 0 | |
p02836 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string moji;
cin >> moji;
int kotae = 0;
for (int i = 0; i <= moji.size() / 2 - 1; i++) {
if (moji[i] != moji[moji.size() - i - 1]) {
kotae++;
}
}
cout << kotae << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string moji;
cin >> moji;
int kotae = 0;
if (moji.size() != 1) {
for (int i = 0; i <= moji.size() / 2 - 1; i++) {
if (moji[i] != moji[moji.size() - i - 1]) {
kotae++;
}
}
}
cout << kotae << ... | replace | 8 | 11 | 8 | 13 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
ll ans = 0;
for (int i = 0; i <= S.size() / 2 - 1; i++) {
if (S[i] != S[S.size() - i - 1])
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
ll ans = 0;
for (int i = 0; i <= ll(S.size()) / 2 - 1; i++) {
if (S[i] != S[S.size() - i - 1])
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#incl... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#incl... | replace | 41 | 42 | 41 | 43 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s = "";
cin >> s;
int ans = 0;
for (int i = 0, j = s.size() - 1; i != j; i++, j--)
if (s[i] != s[j])
ans++;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s = "";
cin >> s;
int ans = 0;
for (int i = 0, j = (int)s.size() - 1; i < (int)s.size() / 2; i++, j--)
if (s[i] != s[j])
ans++;
cout << ans << '\n';
return 0;
}
| replace | 7 | 8 | 7 | 8 | -11 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include<tr1/unordered_map>
#pragma GCC optimize("Ofast")
#define ll long long
#define pll pair<long long, long long>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define Forn(i, n) f... | #include <bits/stdc++.h>
// #include<tr1/unordered_map>
#pragma GCC optimize("Ofast")
#define ll long long
#define pll pair<long long, long long>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define Forn(i, n) f... | replace | 27 | 28 | 27 | 28 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ans, i, j;
string s;
int main() {
cin >> s;
i = 0;
j = s.size() - 1;
while (i != j) {
if (s[i] != s[j])
ans++;
i++;
j--;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int ans, i, j;
string s;
int main() {
cin >> s;
i = 0;
j = s.size() - 1;
while (i <= j) {
if (s[i] != s[j])
ans++;
i++;
j--;
}
cout << ans;
return 0;
} | replace | 8 | 9 | 8 | 9 | -11 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i <= S.size() / 2 - 1; i++) {
if (S[i] != S[S.size() - i - 1]) {
cnt++;
}
}
cout << cnt << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string S;
cin >> S;
int cnt = 0;
for (int i = 0; i < S.size() / 2; i++) {
if (S[i] != S[S.size() - i - 1]) {
cnt++;
}
}
cout << cnt << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02836 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.length() / 2 - 1; i++) {
if (s[i] != s[s.length() - i]) {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.length() / 2; i++) {
if (s[i] != s[s.length() - 1 - i]) {
count++;
}
}
cout << count << endl;
return 0;
}
| replace | 8 | 10 | 8 | 10 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
string S;
cin >> S;
int len = S.length();
int res = 0;
string sub1 = S.substr(0, len / 2);
string sub2 = S.substr(len / 2 + len % 2);
reverse(sub2.begin(), sub2.end());
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
string S;
cin >> S;
int len = S.length();
int res = 0;
string sub1 = S.substr(0, len / 2);
string sub2 = S.substr(len / 2 + len % 2);
reverse(sub2.begin(), sub2.end());
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<int> st;
int prime[1100001];
void seive() {
for (int i = 2; i * i <= 1100000; i++) {
if (!prime[i]) {
// cout << i << endl;
for (int j = i * i; j <= 1100000; j += i) {
prime[j] = 1;
}
}
}
for (int i = 2; i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<int> st;
int prime[1100001];
void seive() {
for (int i = 2; i * i <= 1100000; i++) {
if (!prime[i]) {
// cout << i << endl;
for (int j = i * i; j <= 1100000; j += i) {
prime[j] = 1;
}
}
}
for (int i = 2; i... | delete | 22 | 26 | 22 | 22 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans = 0;
int i = 0;
while (i <= (s.size() - 1 - i)) {
if (s.at(i) != s.at(s.size() - 1 - i)) {
ans++;
}
i++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int ans = 0;
int i = 0;
while (i < (s.size() - 1 - i)) {
if (s.at(i) != s.at(s.size() - 1 - i)) {
ans++;
}
i++;
}
cout << ans << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
using namespace std::chrono;
// VARS
#define int long long
#define ld long double
#define mod1 1000000007
#define mod2 998244353
#define pi 3.141592653589793... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
using namespace std::chrono;
// VARS
#define int long long
#define ld long double
#define mod1 1000000007
#define mod2 998244353
#define pi 3.141592653589793... | replace | 89 | 95 | 89 | 90 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s, t;
int a, ans;
ans = 0;
cin >> s;
a = s.size();
s = t;
reverse(t.begin(), t.end());
rep(i, a / 2) {
if (s.at(i) != t.at(i))
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s, t;
int a, ans;
ans = 0;
cin >> s;
a = s.size();
t = s;
reverse(t.begin(), t.end());
rep(i, a / 2) {
if (s.at(i) != t.at(i))
ans++;
}
cout << ans << endl;
}
| replace | 9 | 10 | 9 | 10 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define WHITE 0
#define BLACK 1
typedef long long ll;
t... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, x, n) for (int i = x; i < n; i++)
#define WHITE 0
#define BLACK 1
typedef long long ll;
t... | replace | 27 | 28 | 27 | 28 | 0 | |
p02836 | Python | Runtime Error | S = list(input())
firstS = S[: len(S) // 2]
secondS = list(reversed(S[len(S) // 2 + 1 :]))
count = 0
for x in range(len(firstS)):
if firstS[x] != secondS[x]:
count += 1
print(count)
| S = list(input())
firstS = S[: len(S) // 2]
if len(S) % 2 == 0:
secondS = list(reversed(S[len(S) // 2 :]))
else:
secondS = list(reversed(S[len(S) // 2 + 1 :]))
count = 0
for x in range(len(firstS)):
if firstS[x] != secondS[x]:
count += 1
print(count)
| replace | 3 | 4 | 3 | 7 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02836/Python/s200391316.py", line 9, in <module>
if firstS[x] != secondS[x]:
IndexError: list index out of range
|
p02836 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
string S;
cin >> S;
int ans = 0;
int a = S.size();
for (int i = 0; i < a / 2;) {
if (S.at(i) != S.at(a - 1 - i)) {
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
string S;
cin >> S;
int ans = 0;
int a = S.size();
for (int i = 0; i < a / 2; i++) {
if (S.at(i) != S.at(a - 1 - i)) {
ans++;
}
}
cout << ans << endl;
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02836 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
string s;
int main() {
cin >> s;
int ans = 0;
for (int i = 0; i <= s.length() / 2 - 1; i++) {
if (s[i] != s[s.length() - ... | #include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
string s;
int main() {
cin >> s;
int ans = 0;
if (s.length() == 1) {
cout << 0 << endl;
return 0;
}
for (int i = ... | insert | 16 | 16 | 16 | 20 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pai 3.1415926535897932384
using namespace std;
using ll = long long;
using P = pair<int, int>;
in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pai 3.1415926535897932384
using namespace std;
using ll = long long;
using P = pair<int, int>;
in... | replace | 26 | 27 | 26 | 27 | 0 | |
p02836 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int count = 0;
int i = 0;
int j = str.size() - 1;
while (i < j) {
if (str[i] == str[j])
continue;
else
count++;
i++;
j--;
}
printf("%d\n", count);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int count = 0;
int i = 0;
int j = str.size() - 1;
while (i < j) {
if (str[i] == str[j])
;
else
count++;
i++;
j--;
}
printf("%d\n", count);
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define roop(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long int;
using ull = unsigned long long;
constexpr ull mod = 1e9 + 7;
constexp... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define roop(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long int;
using ull = unsigned long long;
constexpr ull mod = 1e9 + 7;
constexp... | insert | 35 | 35 | 35 | 39 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
std::string s;
std::cin >> s;
int end = s.length() - 1;
int ans = 0;
for (size_t i = 0;... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
std::string s;
std::cin >> s;
int end = s.length() - 1;
int ans = 0;
for (int i = 0; i ... | replace | 20 | 21 | 20 | 21 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
string S;
cin >> S;
int ans = 0;
rep(i, S.length() / 2 - 1) if (S[i] != S[S.length() - i - 1]) ans++;
cout << ans;... | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
string S;
cin >> S;
int ans = 0;
rep(i, S.length() / 2) if (S[i] != S[S.length() - i - 1]) ans++;
cout << ans;
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int A = S.size() - 1;
int count = 0;
if (S.size() == 1) {
cout << 0 << endl;
}
for (int i = 0; A >= S.size() / 2; i++) {
if (S.at(i) != S.at(A)) {
count++;
}
A--;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int A = S.size() - 1;
int count = 0;
if (S.size() == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 0; A >= S.size() / 2; i++) {
if (S.at(i) != S.at(A)) {
count++;
}
A--;
}
cout << count << en... | insert | 11 | 11 | 11 | 12 | 0 | |
p02836 | C++ | Runtime Error | #include <stdio.h>
int main() {
char s[150];
int sleng = 0, dif = 0;
scanf("%s", s);
for (size_t i = 0; s[i] != '\0'; i++) {
sleng++;
}
for (size_t i = 0; sleng - i - 1 >= i; i++) {
if (s[i] != s[sleng - i - 1])
dif++;
}
printf("%d", dif);
return 0;
} | #include <stdio.h>
int main() {
char s[150];
int sleng = 0, dif = 0;
scanf("%s", s);
for (size_t i = 0; s[i] != '\0'; i++) {
sleng++;
}
for (size_t i = 0; sleng - i - 1 >= i; i++) {
if (sleng - i - 1 <= 0)
break;
if (s[i] != s[sleng - i - 1])
dif++;
}
printf("%d", dif);
retur... | insert | 10 | 10 | 10 | 12 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define FORall(it, a) \
for (__typeof((a).begin()) it = (a).begi... | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define FORall(it, a) \
for (__typeof((a).begin()) it = (a).begi... | insert | 49 | 49 | 49 | 53 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define rgi register int
#define pii pair<int, int>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
#define filein(x) freopen(x, "r", stdin)
#define fileout(x) freopen(x, "w", stdout)
using namespace std;
int n, ans;
string s;
signed main() {
... | #include <bits/stdc++.h>
#define ll long long
#define rgi register int
#define pii pair<int, int>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
#define filein(x) freopen(x, "r", stdin)
#define fileout(x) freopen(x, "w", stdout)
using namespace std;
int n, ans;
string s;
signed main() {
... | replace | 19 | 20 | 19 | 20 | -11 | |
p02836 | C++ | Runtime Error | /*
author: Salam_35
problem name:
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define sc(n) scanf("%d", &n)
#define Max 100005
#define scan(n) scanf("%lld", &n)
#define pi acos(-1.0)
#define _fastio ... | /*
author: Salam_35
problem name:
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define sc(n) scanf("%d", &n)
#define Max 100005
#define scan(n) scanf("%lld", &n)
#define pi acos(-1.0)
#define _fastio ... | insert | 44 | 44 | 44 | 48 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int cnt = 0;
for (int i = 0; i < s.length() - 1 - i; i++)
if (s[i] != s[s.length() - 1 - i])
cnt++;
cout << cnt << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int cnt = 0;
getline(cin, s);
for (int i = 0; i < s.length() - 1 - i; i++)
if (s[i] != s[s.length() - 1 - i])
cnt++;
cout << cnt << "\n";
return 0;
}
| insert | 5 | 5 | 5 | 6 | -11 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | replace | 57 | 58 | 57 | 58 | 0 | |
p02836 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
int k = s.size();
int ans = 0;
for (int i = 0; i < k / 2; k++) {
if (s[i] != s[k - i - 1]) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
int k = s.size();
int ans = 0;
for (int i = 0; i < k / 2; i++) {
if (s[i] != s[k - i - 1]) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { ce... | replace | 100 | 104 | 100 | 103 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string S = 0;
cin >> S;
for (int i = 0, j = S.length() - 1; i < j; i++, j--) {
if (S[i] != S[j]) {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string S;
cin >> S;
for (int i = 0, j = S.length() - 1; i < j; i++, j--) {
if (S[i] != S[j]) {
ans++;
}
}
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::logic_error'
what(): basic_string: construction from null is not valid
|
p02836 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
string a;
getline(cin, a);
int l = 0;
for (int i = 0; i < a.length(); i++) {
for (int j = a.length() - 1; j >= 0; j++) {
if (a[i] != a[j]) {
l++;
}
}
}
cout << l;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string a;
getline(cin, a);
int l = 0, k = a.length();
for (int i = 0; i < k / 2; i++) {
if (a[i] != a[k - i - 1]) {
l++;
}
}
cout << l;
}
| replace | 6 | 12 | 6 | 10 | TLE | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
for (int i = 0; i < S.size() / 2 - 1; i++) {
if (S.at(i) != S.at(S.size() - i - 1))
a++;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a = 0;
for (int i = 0; i < S.size() / 2; i++) {
if (S.at(i) != S.at(S.size() - i - 1))
a++;
}
cout << a << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02836 | C++ | Runtime Error | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(x, y) for (int x = 0; x < y; x++)
#define MOD 1000000007
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a,... | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(x, y) for (int x = 0; x < y; x++)
#define MOD 1000000007
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a,... | insert | 35 | 35 | 35 | 40 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i <= s.size() - 1 - i; i++) {
if (s[i] != s[s.size() - 1 - i])
ans++;
}
cout << ans << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
int j = s.size() - 1 - i;
if (s[i] != s[j] && i < j)
ans++;
}
cout <... | replace | 10 | 12 | 10 | 13 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
rep(i, s.size() / 2) {
if (s.at(i) != s.at(s.size() - i)) {
count++;
}
}
cout << count;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
rep(i, s.size() / 2) {
if (s.at(i) != s.at(s.size() - 1 - i)) {
count++;
}
}
cout << count;
} | replace | 9 | 10 | 9 | 10 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 8) >= this->size() (which is 8)
|
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a;
cin >> s;
a = s.size();
int count = 0;
for (int i = 0; i < a; i++) {
if (s.at(i) != s.at(a - i)) {
count++;
}
}
cout << count / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a;
cin >> s;
a = s.size();
int count = 0;
for (int i = 0; i < a; i++) {
if (s.at(i) != s.at(a - i - 1)) {
count++;
}
}
cout << count / 2 << endl;
}
| replace | 11 | 12 | 11 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 8) >= this->size() (which is 8)
|
p02836 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int i = 0;
int j = s.size() - 1;
while (i <= j) {
if (s[i] != s[j]) {
cnt++;
}
}
cout << cnt;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
int i = 0;
int j = s.size() - 1;
while (i <= j) {
if (s[i] != s[j]) {
cnt++;
}
i++;
j--;
}
cout << cnt;
} | insert | 14 | 14 | 14 | 16 | TLE | |
p02836 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int lenght(char *str) {
int a = strlen(str);
return a;
}
int main() {
char str[10];
cin >> str;
int l = lenght(str);
int m = (l + 1) / 2;
int counter = 0;
for (int i = 0; i < m; ++i) {
if (str[i] == str[l - i - 1])
++counter;
}
... | #include <cstring>
#include <iostream>
using namespace std;
int lenght(char *str) {
int a = strlen(str);
return a;
}
int main() {
char str[100];
cin >> str;
int l = lenght(str);
int m = (l + 1) / 2;
int counter = 0;
for (int i = 0; i < m; ++i) {
if (str[i] == str[l - i - 1])
++counter;
}
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | insert | 32 | 32 | 32 | 34 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0;; i++) {
if (S.size() - 1 - i < i)
break;
if (S[i] != S[S.size() - 1 - i])
ans++;
}
cout << ans << endl;
return... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
if (S.size() == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 0;; i++) {
if (S.size() - 1 - i < i)
break;
if (S[i] != S[S.s... | insert | 10 | 10 | 10 | 14 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | replace | 36 | 42 | 36 | 42 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long ll;
constexpr long long INFLL = 1e18;
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long ll;
constexpr long long INFLL = 1e18;
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0... | replace | 21 | 22 | 21 | 22 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 8) >= this->size() (which is 8)
|
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAXN 1000100
#define pii pair<int, int>
#define pb push_back
#define inf 1e18
#define fi first
#define se second
#define mt make_tuple
typedef long long ll;
using namespace std;
string s;
int ans;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base... | #include <bits/stdc++.h>
#define MAXN 1000100
#define pii pair<int, int>
#define pb push_back
#define inf 1e18
#define fi first
#define se second
#define mt make_tuple
typedef long long ll;
using namespace std;
string s;
int ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
int n =... | delete | 16 | 19 | 16 | 16 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; 2 * i < S.length(); i++) {
if (S.at(i) != S.at(S.length() - i)) {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.length() / 2; i++) {
if (S.at(i) != S.at(S.length() - 1 - i)) {
count++;
}
}
cout << count << endl;
}
| replace | 8 | 10 | 8 | 10 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 8) >= this->size() (which is 8)
|
p02836 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = 0, r = s.size() - 1;
int ans = 0;
while (l < r) {
ans += s[l] != s[r];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int l = 0, r = s.size() - 1;
int ans = 0;
while (l < r) {
ans += s[l] != s[r];
l++;
r--;
}
cout << ans << endl;
} | insert | 10 | 10 | 10 | 12 | TLE | |
p02836 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0;
string s;
cin >> s;
int i = 0, j = s.length() - 1;
while (i <= j) {
if (s[i] != s[j])
c++;
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0;
string s;
cin >> s;
int i = 0, j = s.length() - 1;
while (i <= j) {
if (s[i] != s[j])
c++;
i++;
j--;
}
cout << c << endl;
return 0;
}
| insert | 10 | 10 | 10 | 12 | TLE | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i <= s.size() / 2 - 1; i++) {
if (s.at(i) != s.at(s.size() - 1 - i))
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt = 0;
if (s.size() == 1) {
} else {
for (int i = 0; i <= s.size() / 2 - 1; i++) {
if (s.at(i) != s.at(s.size() - 1 - i))
cnt++;
}
}
cout << cnt << endl;
return 0;
} | replace | 8 | 11 | 8 | 14 | 0 | |
p02836 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size() / 2; i++) {
for (int j = S.size() - 1; j > S.size() / 2; j++) {
if (S[i] != S[j]) {
ans++;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size() / 2; i++) {
if (S[i] != S[S.size() - i - 1]) {
ans++;
}
}
cout << ans << endl;
} | replace | 8 | 12 | 8 | 10 | -11 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using names... | replace | 326 | 328 | 326 | 330 | 0 | |
p02836 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using names... | replace | 327 | 328 | 327 | 328 | 0 | |
p02836 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
string s;
int ans;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++)
if (s[i] >= 'A' && s[i] <= 'Z')
s[i] = 'a' + s[i] - 'A';
for (int i = 0; i <= s.size() / 2 - 1; i++)
ans += (s[i] != s[s.size(... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
string s;
int ans;
int main() {
cin >> s;
if (s.size() == 1) {
cout << "0";
return 0;
}
for (int i = 0; i < s.size(); i++)
if (s[i] >= 'A' && s[i] <= 'Z')
s[i] = 'a' + s[i] - 'A';
for (int i = 0;... | insert | 9 | 9 | 9 | 13 | 0 | |
p02837 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define dump(x) cout << #x << " = " ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define dump(x) cout << #x << " = " ... | replace | 52 | 53 | 52 | 53 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fastio \
cin.tie(NULL); \
cout.tie(NULL); \
ios_base::sync_with_stdio(0... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
cin.tie(NULL); \
cout.tie(NULL); \
ios_base::sync_with_stdio(0... | replace | 65 | 67 | 65 | 67 | -11 | |
p02837 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= (ll)(n); i++)
#define rep0(i, n) for (int i = 0; i <= (ll)(n); i++)
int main() {
int n;
cin >> n;
int x[n][n];
int y[n][n];
int a[n + 1];
bool all_not_told = true;
rep1(i, n) {
cin >> a[i];
if ... | #include <iostream>
using namespace std;
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= (ll)(n); i++)
#define rep0(i, n) for (int i = 0; i <= (ll)(n); i++)
int main() {
int n;
cin >> n;
int x[20][20];
int y[20][20];
int a[20];
bool all_not_told = true;
rep1(i, n) {
cin >> a[i];
if... | replace | 10 | 13 | 10 | 13 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N;
int A[20];
int x[20][20];
int y[20][20];
int counter(int x) {
if (x == 0)
return 0;
return counter(1 << x) + (x & 1);
}
void solve() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
for (int j = 1; j <= A[i]; j++) {
cin >> x[i][j] ... | #include <bits/stdc++.h>
using namespace std;
int N;
int A[20];
int x[20][20];
int y[20][20];
int counter(int x) {
if (x == 0)
return 0;
return counter(x >> 1) + (x & 1);
}
void solve() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
for (int j = 1; j <= A[i]; j++) {
cin >> x[i][j] ... | replace | 11 | 12 | 11 | 12 | -11 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 22;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); i >= (b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
template <typename T> inline void read(T &x) {
x = 0;
char ch = getchar();
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 22;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); i >= (b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
template <typename T> inline void read(T &x) {
x = 0;
char ch = getchar();
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02837 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <vector>
#define ll long long int
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define co(x) cout << x << endl
#d... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <vector>
#define ll long long int
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define co(x) cout << x << endl
#d... | replace | 44 | 45 | 44 | 45 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
scanf("%d", &n);
vector<vector<P>> xy(n, vector<P>(0));
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
for (int j = 0; j < a; j++) {
int x, y;
scanf("%d %d", &x, &y);
xy[i].push_bac... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
scanf("%d", &n);
vector<vector<P>> xy(n, vector<P>(0));
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
for (int j = 0; j < a; j++) {
int x, y;
scanf("%d %d", &x, &y);
xy[i].push_bac... | replace | 23 | 24 | 23 | 24 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// const long long int MOD = 1000000007;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<vector<int>> x(N, vector<int>(0)), y(N, vector<int>(0));
for (int i = 0; i < N; i++) {
cin >> A[i];
vector<int> empty(A[i]);
x... | #include <bits/stdc++.h>
using namespace std;
// const long long int MOD = 1000000007;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<vector<int>> x(N, vector<int>(0)), y(N, vector<int>(0));
for (int i = 0; i < N; i++) {
cin >> A[i];
vector<int> empty(A[i]);
x... | replace | 28 | 29 | 28 | 29 | 0 | |
p02837 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
// 2^N < 3*10^4なので、すべての状態をチェックしてもいけそう？
int main() {
size_t N = 0;
std::cin >> N;
std::vector<uint16_t> one_graph(N); // 1で接続
std::vector<uint16_t> zero_graph(N); // 0でつながる
for (size_t i = 0; i < N; ++i) {
size_t A;
std::cin >> A;
for (s... | #include <algorithm>
#include <iostream>
#include <vector>
// 2^N < 3*10^4なので、すべての状態をチェックしてもいけそう？
int main() {
size_t N = 0;
std::cin >> N;
std::vector<uint16_t> one_graph(N); // 1で接続
std::vector<uint16_t> zero_graph(N); // 0でつながる
for (size_t i = 0; i < N; ++i) {
size_t A;
std::cin >> A;
for (s... | replace | 26 | 27 | 26 | 27 | TLE | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<vector<int>> x(N), y(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
for (int j = 0; j < A.at(j); j++) {
int a, b;
cin >> a >> b;
x.at(i).push_back(a - 1);
y.at(i).push_back(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<vector<int>> x(N), y(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
for (int j = 0; j < A.at(i); j++) {
int a, b;
cin >> a >> b;
x.at(i).push_back(a - 1);
y.at(i).push_back(... | replace | 10 | 11 | 10 | 11 | 0 | |
p02837 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
scanf("%d", &n);
vector<vector<P>> xy;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
vector<P> tmp;
for (int j = ... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
scanf("%d", &n);
vector<vector<P>> xy;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
vector<P> tmp;
for (int j = ... | replace | 33 | 40 | 33 | 36 | 0 | |
p02837 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define debug(s) cout << s << endl
#define debug1(s, t) cout << s << " " << t << endl
#define printvec(vec) \
for... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define debug(s) cout << s << endl
#define debug1(s, t) cout << s << " " << t << endl
#define printvec(vec) \
for... | replace | 37 | 38 | 37 | 38 | TLE | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int countOnbit(int x) {
if (x == 0)
return 0;
return countOnbit(x >> 1) + (x & 1);
}
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<vector<int>> x(N + 1); // 指定した番号
vector<vector<int>> y(N + 1); // 正直者であるか否か
for (int i = 1; i <= N; i++) ... | #include <bits/stdc++.h>
using namespace std;
int countOnbit(int x) {
if (x == 0)
return 0;
return countOnbit(x >> 1) + (x & 1);
}
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<vector<int>> x(N + 1); // 指定した番号
vector<vector<int>> y(N + 1); // 正直者であるか否か
for (int i = 1; i <= N; i++) ... | replace | 37 | 40 | 37 | 40 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 1) >= this->size() (which is 1)
|
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, X, Ans = 0;
cin >> N;
vector<vector<int>> V(N, vector<int>(N, -1));
rep(i, N) {
cin >> A;
rep(j, A) {
cin >> X;
cin >> V.at(i).at(X - 1);
}
}
rep(i, (1 << N)) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, A, X, Ans = 0;
cin >> N;
vector<vector<int>> V(N, vector<int>(N, -1));
rep(i, N) {
cin >> A;
rep(j, A) {
cin >> X;
cin >> V.at(i).at(X - 1);
}
}
rep(i, (1 << N)) {
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | insert | 59 | 59 | 59 | 60 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl
#define prints(x) cout << f... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl
#define prints(x) cout << f... | replace | 136 | 139 | 136 | 139 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define int int64_t
#define double long double
#define rep(i, N) for (int i = 0; i < N; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; --i)
#define all(v) v.begin(), v.end()
using namespace std;
// using pr = pair<int, int>;
using tup = tuple<int, int, int>;
using ve... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define int int64_t
#define double long double
#define rep(i, N) for (int i = 0; i < N; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; --i)
#define all(v) v.begin(), v.end()
using namespace std;
// using pr = pair<int, int>;
using tup = tuple<int, int, int>;
using ve... | replace | 17 | 18 | 17 | 18 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using pp = pair<int, int>;
int main() {
int N, doubt = 0, M = 0;
cin >> N;
vector<vector<pp>> V(N, vector<pp>(0));
int A, p, q;
for (int i = 0; i < N; i++) {
cin >> A;
for (int j = 0; j < A; j++) {
cin >> p >> q;
V[i].push_back(pp(p, q));
... | #include <bits/stdc++.h>
using namespace std;
using pp = pair<int, int>;
int main() {
int N, doubt = 0, M = 0;
cin >> N;
vector<vector<pp>> V(N, vector<pp>(0));
int A, p, q;
for (int i = 0; i < N; i++) {
cin >> A;
for (int j = 0; j < A; j++) {
cin >> p >> q;
V[i].push_back(pp(p, q));
... | replace | 20 | 21 | 20 | 21 | 0 | |
p02837 | Python | Runtime Error | n = int(input())
testimony_dict = {}
for i in range(n):
a = int(input())
testimony_dict[i + 1] = []
for j in range(a):
xy = input().split(" ")
testimony_dict[i + 1].append(xy)
max_valid_bin = ""
for i in range(2**n - 1, 0, -1):
is_valid = True
bin_i = format(i, f"0{n}b")
for j ... | n = int(input())
testimony_dict = {}
for i in range(n):
a = int(input())
testimony_dict[i + 1] = []
for j in range(a):
xy = input().split(" ")
testimony_dict[i + 1].append(xy)
max_valid_bin = ""
for i in range(2**n - 1, 0, -1):
is_valid = True
bin_i = format(i, "0{}b".format(n))
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<vector<int>>> ta(n, vector<vector<int>>(n, vector<int>(1, 66)));
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j < a; j++) {
int x, y;
cin >> x >> y;
x--;
ta[i][x][0] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<vector<int>>> ta(n, vector<vector<int>>(n, vector<int>(1, 66)));
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j < a; j++) {
int x, y;
cin >> x >> y;
x--;
ta[i][x][0] =... | replace | 21 | 22 | 21 | 22 | 0 | |
p02837 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> x(n + 1);
vector<vector<int>> y(n + 1);
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
x[i].resize(a[i]);
y[i].resize(a[i]);
for (int j = 1; j <= a[i]; j++) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> x(n + 1);
vector<vector<int>> y(n + 1);
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
x[i].resize(a[i] + 1);
y[i].resize(a[i] + 1);
for (int j = 1; j <= a[i];... | replace | 16 | 18 | 16 | 18 | 0 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<pair<int, int>>> a(n);
for (int i = 0; i < n; ++i) {
int k;
scanf("%d", &k);
a[i].resize(k);
for (int j = 0; j < k; ++j) {
scanf("%d %d", &a[i][j].first, &a[i][j].second);
--a[i][j].firs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<pair<int, int>>> a(n);
for (int i = 0; i < n; ++i) {
int k;
scanf("%d", &k);
a[i].resize(k);
for (int j = 0; j < k; ++j) {
scanf("%d %d", &a[i][j].first, &a[i][j].second);
--a[i][j].firs... | replace | 21 | 22 | 21 | 22 | -11 | |
p02837 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | replace | 25 | 26 | 25 | 26 | 0 | ok8
*0
*1
*2
*3
*4
*5
*6
*7
|
p02838 | C++ | Time Limit Exceeded | #include <cstdio>
long a[300010], s[64][300010][2];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%ld", a + i);
for (int j = 0; j < 61; ++j) {
int k = (a[i] >> j) & 1;
if (k == 0) {
s[j][i + 1][0] = s[j][i][0] + 1;
s[j][i + 1][1] = s[j][i][1];
... | #include <cstdio>
long a[300010], s[64][300010][2];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%ld", a + i);
for (int j = 0; j < 61; ++j) {
int k = (a[i] >> j) & 1;
if (k == 0) {
s[j][i + 1][0] = s[j][i][0] + 1;
s[j][i + 1][1] = s[j][i][1];
... | replace | 26 | 29 | 26 | 27 | TLE | |
p02838 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
using namespace std;
uint64_t A[100001];
ll modexp(int i, ll p) {
if (p == 0)
return 1;
ll ans = modexp(i, p / 2);
ans = (ans * ans) % MOD;
if (p % 2)
... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
using namespace std;
uint64_t A[300001];
ll modexp(int i, ll p) {
if (p == 0)
return 1;
ll ans = modexp(i, p / 2);
ans = (ans * ans) % MOD;
if (p % 2)
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02838 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
typedef pair<int, int> P;
int main() {
const int INF = pow(10, 9)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
typedef long long ll;
typedef pair<int, int> P;
int main() {
const int INF = pow(10, 9)... | replace | 16 | 21 | 16 | 23 | TLE | |
p02838 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s... | replace | 19 | 20 | 19 | 20 | 0 | |
p02838 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll N, cnt[100000][63], A[100000], sum[63];
int main(void) {
cin >> N;
rep(i, N) {
cin >> A[i];
ll x = A[i];
ll m = 0;
while (x > 0) {
if (x & 1 == 1)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll N, cnt[300000][63], A[300000], sum[63];
int main(void) {
cin >> N;
rep(i, N) {
cin >> A[i];
ll x = A[i];
ll m = 0;
while (x > 0) {
if (x & 1 == 1)... | replace | 6 | 7 | 6 | 7 | 0 | |
p02838 | C++ | Time Limit Exceeded | #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
ll p = 1e9 + 7;
cin >> n;
vector<ll> cnt(61, 0);
rep(i, n) {
ll a;
cin >> a;
ll j = 0;
while (a >= 1) {
if (a % 2 == 1)
c... | #define rep(i, n) for (ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
ll p = 1e9 + 7;
cin >> n;
vector<ll> cnt(61, 0);
rep(i, n) {
ll a;
cin >> a;
ll j = 0;
while (a >= 1) {
if (a % 2 == 1)
c... | replace | 26 | 30 | 26 | 29 | TLE | |
p02838 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const int mod = 1... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const int mod = 1... | replace | 72 | 73 | 72 | 80 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.