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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, x, y, arr[100001];
int pre[100001], dp[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
n++;
}
cout << n;
} | #include <bits/stdc++.h>
using namespace std;
int n, x, y, arr[100001];
int pre[100001], dp[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> x;
string s;
cin >> s;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
n++;
}
cout << n;
} | insert | 7 | 7 | 7 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
ll N;
string S;
int main() {
cin >> N >> S;
ll ans = 0;
for (ll i = 0; i <= S.size() - 4; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
ll N;
string S;
int main() {
cin >> N >> S;
ll ans = 0;
for (ll i = 0; i <= S.size() - 3; i++) {
// cout << i << endl;
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans++;
}
}
cout << ans << endl;
} | replace | 13 | 14 | 13 | 15 | 0 | |
p02812 | 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;
string s;
cin >> n >> s;
int flag = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
flag++;
}
cout << flag;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
string s;
cin >> n >> s;
int flag = 0;
for (int i = 0; i <= n - 3; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
flag++;
}
cout << flag;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
string s;
cin >> s;
rep(i, n) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
string s;
cin >> s;
rep(i, n - 2) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
string S;
cin >> N >> S;
count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
string S;
cin >> N >> S;
count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
int i = 0;
int count = 0;
while (i < n) {
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C')) {
count++;
i++;
} else {
i++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
int i = 0;
int count = 0;
while (i + 2 < n) {
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C')) {
count++;
i++;
} else {
i++;
}
}
cout << count << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0, i = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0, i = 0;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
c++;
}
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0;
for (int i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
c++;
}
cout << c;
}
| insert | 3 | 3 | 3 | 5 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0, i = 0;
string S;
cin >> N >> S;
while (N > i - 1) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
}
}
i++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0, i = 0;
string S;
cin >> N >> S;
while (N - 2 > i) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
}
}
i++;
}
cout << cnt << endl;
} | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 10) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
num++;
}
cout << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
num++;
}
cout << num << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int A = 0;
for (int i = 0; i < N + 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C')
A++;
}
cout << A << endl;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int A = 0;
for (int i = 0; i + 2 < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C')
A++;
}
cout << A << endl;
}
| replace | 24 | 25 | 24 | 25 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 10) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int counter = 0;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
counter++;
}
cout << counter << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int counter = 0;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
counter++;
}
cout << counter << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
cnt++;
i += 2;
}
if (i == N - 3)
break;
}
cout << cnt << endl;
}
| insert | 14 | 14 | 14 | 16 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'B' and s.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.length() - 2; i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'B' and s.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int answer = 0;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
answer++;
}
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int answer = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
answer++;
}
}
cout << answer << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, cnt = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, cnt = 0;
string s;
cin >> n >> s;
for (int i = 0; i <= n - 3; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
cnt++;
}
cout << cnt << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N;
char *S;
int i, j, count = 0;
cin >> N;
cin >> S;
for (i = 0; i < N - 2; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C')
count++;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
char S[50];
int i, j, count = 0;
cin >> N;
cin >> S;
for (i = 0; i < N - 2; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C')
count++;
}
cout << count << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | -11 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> S(n);
for (int i = 0; i < n; i++) {
cin >> S.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> S(n);
for (int i = 0; i < n; i++) {
cin >> S.at(i);
}
int count = 0;
for (int i = 0; i < n - 2; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int sum, b;
sum = 0;
b = 0;
cin >> b >> a;
for (int i = 0; i < b - 1; i++) {
if (a.at(i) == 'A' && a.at(i + 1) == 'B' && a.at(i + 2) == 'C')
sum = sum + 1;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int sum, b;
sum = 0;
b = 0;
cin >> b >> a;
for (int i = 0; i < b - 2; i++) {
if (a.at(i) == 'A' && a.at(i + 1) == 'B' && a.at(i + 2) == 'C')
sum = sum + 1;
}
cout << sum << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string check = "ABC";
int count = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == check) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n;
cin >> s;
string check = "ABC";
int count = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.substr(i, 3) == check) {
count++;
}
}
cout << count << endl;
} | insert | 5 | 5 | 5 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
int counter = 0;
for (int i = 0; i < N - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
counter++;
}
}
cout << counter << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int counter = 0;
for (int i = 0; i < N - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
counter++;
}
}
cout << counter << endl;
}
| insert | 6 | 6 | 6 | 7 | -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)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
string S;
cin >> N >> S;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
string S;
cin >> N >> S;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int g;
g = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A') {
if (s[i + 1] == 'B' && s[i + 2] == 'C')
g++;
}
}
cout << g << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int g;
g = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A') {
if (s[i + 1] == 'B' && s[i + 2] == 'C')
g++;
}
}
cout << g << endl;
}
| replace | 5 | 6 | 5 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
rep(i, s.size()) {
if (i > (int)s.size() - 2)
break;
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
rep(i, n) {
if (i >= n - 2)
break;
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 12 | 14 | 12 | 14 | 0 | |
p02812 | Python | Runtime Error | N = int(input())
S = input()
count = 0
for i in range(N):
if S[i] == "A" and S[i + 1] == "B" and S[i + 2] == "C":
count += 1
print(count)
| N = int(input())
S = input()
count = 0
for i in range(N):
try:
if S[i] == "A" and S[i + 1] == "B" and S[i + 2] == "C":
count += 1
except IndexError:
break
print(count)
| replace | 4 | 6 | 4 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
int res = 0;
for (int i = 0; i < n - 2; i++) {
if (s.substr(i, 3) == "ABC")
res++;
}
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int res = 0;
for (int i = 0; i < n - 2; i++) {
if (s.substr(i, 3) == "ABC")
res++;
}
cout << res << "\n";
return 0;
} | insert | 12 | 12 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 1) > this->size() (which is 0)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define in(s) \
ll s; \
cin >> s
#define pr(r) cout << r << endl
#define prr(m, n) cout << m << " " << n << endl
#define prarr(a, i, n) fab(j, i, n) cout << a[j] << " "
#define wh(t) \
ll t; \
cin >> t; \
while (t--)
#define sz(u) u.size()
#define all(v) v.begin(), v.end()
#define arr(a, n) \
ll a[n]; \
fab(i, 0, n) cin >> a[i]
#define showdp(d, n, m) \
fab(i, 0, n) { \
fab(j, 0, m) if (d[i][j] == -1 || d[i][j] > 9) cout << d[i][j] << " "; \
else cout << " " << d[i][j] << " "; \
cout << endl; \
}
#define prs(u) cout << u << " "
#define fab(i, a, b) for (ll i = a; i < b; i++)
#define fba(i, b, a) for (ll i = b; i >= a; i--)
#define sup \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define MX 1000000007
#define MAX 10000007
#define endl "\n"
#define ll long long int
#define vl vector<ll>
#define vpl vector<pair<ll, ll>>
#define pl pair<ll, ll>
#define pll pair<ll, pl>
#define vvl vector<vl>
#define mxe(x, n) *max_element(x, x + n)
#define mne(x, n) *min_element(x, x + n)
#define mp make_pair
#define pb push_back
#define fs first
#define sd second
#define fr front()
#define bk back()
#define rr return
#define N 300005
#define inf 1e18 + 7
bool rsort1(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
bool rsort2(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.second > b.second);
}
bool sort2(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.second < b.second);
}
bool isPrime(ll p) {
for (ll i = 2; i * i <= p; i++)
if (p % i == 0)
rr false;
rr true;
}
void sieve(ll n, vl &v) {
v.pb(2);
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (ll i = 3; i * i <= n; i += 2)
if (prime[i])
for (ll j = i; j * i <= n; j += 2)
prime[j * i] = false;
for (ll i = 3; i <= n; i += 2)
if (prime[i])
v.pb(i);
}
ll phi(ll n) {
ll result = n;
for (ll p = 2; p * p <= n; p++) {
if (n % p == 0) {
while (n % p == 0)
n /= p;
result -= result / p;
}
}
if (n > 1)
result -= result / n;
return result;
}
int main() {
sup;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
ll n, cnt = 0;
string s;
map<string, ll> m;
m["ABC"] = 1;
cin >> n >> s;
fab(i, 0, n - 2) {
string k;
fab(j, 0, 3) k += s[i + j];
if (m[k] == 1)
cnt++;
}
pr(cnt);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define in(s) \
ll s; \
cin >> s
#define pr(r) cout << r << endl
#define prr(m, n) cout << m << " " << n << endl
#define prarr(a, i, n) fab(j, i, n) cout << a[j] << " "
#define wh(t) \
ll t; \
cin >> t; \
while (t--)
#define sz(u) u.size()
#define all(v) v.begin(), v.end()
#define arr(a, n) \
ll a[n]; \
fab(i, 0, n) cin >> a[i]
#define showdp(d, n, m) \
fab(i, 0, n) { \
fab(j, 0, m) if (d[i][j] == -1 || d[i][j] > 9) cout << d[i][j] << " "; \
else cout << " " << d[i][j] << " "; \
cout << endl; \
}
#define prs(u) cout << u << " "
#define fab(i, a, b) for (ll i = a; i < b; i++)
#define fba(i, b, a) for (ll i = b; i >= a; i--)
#define sup \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define MX 1000000007
#define MAX 10000007
#define endl "\n"
#define ll long long int
#define vl vector<ll>
#define vpl vector<pair<ll, ll>>
#define pl pair<ll, ll>
#define pll pair<ll, pl>
#define vvl vector<vl>
#define mxe(x, n) *max_element(x, x + n)
#define mne(x, n) *min_element(x, x + n)
#define mp make_pair
#define pb push_back
#define fs first
#define sd second
#define fr front()
#define bk back()
#define rr return
#define N 300005
#define inf 1e18 + 7
bool rsort1(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
bool rsort2(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.second > b.second);
}
bool sort2(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.second < b.second);
}
bool isPrime(ll p) {
for (ll i = 2; i * i <= p; i++)
if (p % i == 0)
rr false;
rr true;
}
void sieve(ll n, vl &v) {
v.pb(2);
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (ll i = 3; i * i <= n; i += 2)
if (prime[i])
for (ll j = i; j * i <= n; j += 2)
prime[j * i] = false;
for (ll i = 3; i <= n; i += 2)
if (prime[i])
v.pb(i);
}
ll phi(ll n) {
ll result = n;
for (ll p = 2; p * p <= n; p++) {
if (n % p == 0) {
while (n % p == 0)
n /= p;
result -= result / p;
}
}
if (n > 1)
result -= result / n;
return result;
}
int main() {
sup;
/* #ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
freopen("error.txt","w",stderr);
#endif */
ll n, cnt = 0;
string s;
map<string, ll> m;
m["ABC"] = 1;
cin >> n >> s;
fab(i, 0, n - 2) {
string k;
fab(j, 0, 3) k += s[i + j];
if (m[k] == 1)
cnt++;
}
pr(cnt);
return 0;
} | replace | 99 | 104 | 99 | 104 | 0 | |
p02812 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
// for (int i=0;i<n+3;i++){
// cin>>s.at(i);
// }
for (int i = 0; i < n + 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
// for (int i=0;i<n+3;i++){
// cin>>s.at(i);
// }
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 10) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
int main() {
int N, count = 0;
string S;
cin >> N >> S;
rep(i, N) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
int main() {
int N, count = 0;
string S;
cin >> N >> S;
rep(i, N - 2) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int retu[8][3] = {{0, 1, 2}, {3, 4, 5}, {6, 7, 8}, {0, 3, 6},
{1, 4, 7}, {2, 5, 8}, {0, 4, 8}, {2, 4, 6}};
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size() - 2; i++) {
ans += (S.substr(i, 3) == "ABC");
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int retu[8][3] = {{0, 1, 2}, {3, 4, 5}, {6, 7, 8}, {0, 3, 6},
{1, 4, 7}, {2, 5, 8}, {0, 4, 8}, {2, 4, 6}};
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size() - 2; i++) {
ans += (S.substr(i, 3) == "ABC");
}
cout << ans << endl;
}
| insert | 116 | 116 | 116 | 119 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
ans++;
}
cout << ans << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int solve(int n) {
int N = n;
int count = 0;
string S;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
count++;
}
}
cout << count << endl;
}
int main() {
int N;
cin >> N;
solve(N);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void solve(int n) {
int N = n;
int count = 0;
string S;
cin >> S;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
count++;
}
}
cout << count << endl;
}
int main() {
int N;
cin >> N;
solve(N);
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02812 | 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() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 1; N - 1; i++) {
if (s[i - 1] == 'A' && s[i] == 'B' && s[i + 1] == 'C')
count++;
}
cout << count << 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() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 1; i < N - 1; i++) {
if (s[i - 1] == 'A' && s[i] == 'B' && s[i + 1] == 'C')
count++;
}
cout << count << endl;
}
| replace | 13 | 14 | 13 | 14 | -11 | |
p02812 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
int main() {
string s;
int cnt = 0;
cin >> s;
for (int i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
cnt += 1;
}
}
cout << cnt << endl;
} | #include <iostream>
#include <queue>
using namespace std;
int main() {
string s;
int cnt = 0, n;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
cnt += 1;
}
}
cout << cnt << endl;
} | replace | 5 | 8 | 5 | 8 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string x;
cin >> n >> x;
vector<char> word(n);
for (int i; i < n; i++) {
word.at(i) = x[i];
}
int count = 0;
for (int i; i < n; i++) {
if (word.at(i) == 'A') {
if (word.at(i + 1) == 'B') {
if (word.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string x;
cin >> n >> x;
vector<char> word(n);
for (int i; i < n; i++) {
word.at(i) = x[i];
}
int count = 0;
for (int i; i < n - 2; i++) {
if (word.at(i) == 'A') {
if (word.at(i + 1) == 'B') {
if (word.at(i + 2) == 'C') {
count++;
}
}
}
}
cout << count << endl;
} | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744071626636196) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 0; i < N; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C')
count++;
}
cout << count << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
cin >> m;
string s;
cin >> s;
int n = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
n++;
}
}
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
cin >> m;
string s;
cin >> s;
int n = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
n++;
}
}
cout << n << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
string S;
cin >> N >> S;
ans = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) != 'A') {
continue;
} else if (S.at(i + 1) != 'B') {
continue;
} else if (S.at(i + 2) != 'C') {
continue;
}
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
string S;
cin >> N >> S;
ans = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) != 'A') {
continue;
} else if (S.at(i + 1) != 'B') {
continue;
} else if (S.at(i + 2) != 'C') {
continue;
}
ans++;
}
cout << ans << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | 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() {
int N;
string S;
cin >> N >> S;
int ans = 0;
rep(i, N) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
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() {
int N;
string S;
cin >> N >> S;
int ans = 0;
rep(i, N) {
if (S.at(i) == 'A' && i + 1 <= N - 1) {
if (S.at(i + 1) == 'B' && i + 2 <= N - 1) {
if (S.at(i + 2) == 'C') {
ans++;
}
}
}
}
cout << ans << endl;
} | replace | 13 | 15 | 13 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
int main() {
int n;
char s[N];
scanf("%d%s", n, s);
int sum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
sum++;
}
printf("%d\n", sum);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
int main() {
int n;
char s[N];
scanf("%d%s", &n, s);
int sum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
sum++;
}
printf("%d\n", sum);
return 0;
}
| replace | 6 | 7 | 6 | 7 | -11 | |
p02812 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long int c = 0, i, j, k, l, x, n;
string s;
cin >> s;
for (i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
c++;
}
}
cout << c;
}
| #include <iostream>
using namespace std;
int main() {
long long int c = 0, i, j, k, l, x, n;
string s;
cin >> n;
cin >> s;
for (i = 0; i < s.length() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
c++;
}
}
cout << c;
}
| insert | 5 | 5 | 5 | 6 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int j;
char A;
char B;
char C;
j = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
j++;
}
}
}
}
cout << j << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int j;
char A;
char B;
char C;
j = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A') {
if (S.at(i + 1) == 'B') {
if (S.at(i + 2) == 'C') {
j++;
}
}
}
}
cout << j << endl;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
} | replace | 8 | 13 | 8 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define N 200100
#define pii pair<int, int>
#define rep(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define inf 1e9
void solve() {
int n;
string s;
cin >> n;
cin >> s;
ll ans = 0;
int i = 0;
while (i < n) {
if (i + 2 < n && s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
i += 3;
continue;
}
i++;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w+", stdout);
#endif
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define N 200100
#define pii pair<int, int>
#define rep(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define inf 1e9
void solve() {
int n;
string s;
cin >> n;
cin >> s;
ll ans = 0;
int i = 0;
while (i < n) {
if (i + 2 < n && s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
i += 3;
continue;
}
i++;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
} | delete | 30 | 34 | 30 | 30 | 0 | |
p02812 | Python | Runtime Error | N = int(input())
S = input()
ans = 0
while "ABC" in S:
ans += 1
S.remove("ABC")
print(ans)
| N = int(input())
S = input()
ans = S.count("ABC")
print(ans)
| replace | 3 | 8 | 3 | 4 | AttributeError: 'str' object has no attribute 'remove' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s439519674.py", line 7, in <module>
S.remove('ABC')
AttributeError: 'str' object has no attribute 'remove'
|
p02812 | Python | Runtime Error | N = int(input())
S = input()
ans = 0
i = 0
while i < N:
if S[i] == "A":
i += 1
if S[i] == "B":
i += 1
if S[i] == "C":
ans += 1
else:
i += 1
else:
i += 1
else:
i += 1
print(ans)
| N = int(input())
S = input()
ans = 0
for i in range(N):
if S[i : i + 3] == "ABC":
ans += 1
print(ans)
| replace | 4 | 18 | 4 | 7 | 0 | |
p02812 | Python | Runtime Error | def main():
N, S = open(0).read().split("\n")
print(S.count("ABC"))
if __name__ == "__main__":
main()
| def main():
N = input()
S = input()
print(S.count("ABC"))
if __name__ == "__main__":
main()
| replace | 1 | 2 | 1 | 3 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s444212089.py", line 7, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s444212089.py", line 2, in main
N, S = open(0).read().split('\n')
ValueError: too many values to unpack (expected 2)
|
p02812 | Python | Runtime Error | a = int(input())
b = input()
print(a.count("ABC"))
| a = int(input())
b = input()
print(b.count("ABC"))
| replace | 2 | 3 | 2 | 3 | AttributeError: 'int' object has no attribute 'count' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02812/Python/s106628382.py", line 3, in <module>
print(a.count('ABC'))
AttributeError: 'int' object has no attribute 'count'
|
p02812 | Python | Runtime Error | n = int(input())
s = input()
ans = 0
for i in range(n):
if s[i] == "A" and s[i + 1] == "B" and s[i + 2] == "C":
ans += 1
print(ans)
| n = int(input())
s = input()
ans = 0
for i in range(n):
if s[i : i + 3] == "ABC":
ans += 1
print(ans)
| replace | 4 | 5 | 4 | 5 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t = 0;
for (int i = 0; i < s.size() - 2; i++)
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
t++;
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int t = 0;
for (int i = 0; i < s.size() - 2; i++)
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C')
t++;
cout << t << endl;
return 0;
} | insert | 4 | 4 | 4 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N, i = 0, count = 0;
cin >> N;
cin >> S;
for (i + 2; i < N; i++) {
if (S.at(i - 2) == 'A' && S.at(i - 1) == 'B' && S.at(i) == 'C') {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int N, i = 0, count = 0;
cin >> N;
cin >> S;
for (i; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count << endl;
}
| replace | 10 | 12 | 10 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 18446744073709551614) >= this->size() (which is 10)
|
p02812 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string A;
cin >> N >> A;
int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) == 'A') {
if (A.at(i + 1) == 'B') {
if (A.at(i + 2) == 'C') {
count++;
} else
continue;
} else
continue;
} else
continue;
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string A;
cin >> N >> A;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (A.at(i) == 'A') {
if (A.at(i + 1) == 'B') {
if (A.at(i + 2) == 'C') {
count++;
} else
continue;
} else
continue;
} else
continue;
}
cout << count << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
char n;
string s;
cin >> n >> s;
for (int i = 0; i <= n - 3; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
ans++;
}
}
cout << ans << endl;
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
int n;
string s;
cin >> n >> s;
for (int i = 0; i <= n - 3; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
ans++;
}
}
cout << ans << endl;
cout << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 1) >= this->size() (which is 1)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
string str = S;
int count = 0;
for (int i = 0; i < N; i++) {
int j = i + 1;
int k = j + 1;
if (str.at(i) == 'A' && str.at(j) == 'B' && str.at(k) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
string str = S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
int j = i + 1;
int k = j + 1;
if (str.at(i) == 'A' && str.at(j) == 'B' && str.at(k) == 'C') {
count++;
}
}
cout << count << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B') {
if (s.at(i + 2) == 'C') {
ans++;
}
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n - 2) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B') {
if (s.at(i + 2) == 'C') {
ans++;
}
}
}
}
cout << ans << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int sum = 0;
string str;
cin >> N >> str;
for (int i = 0; i < N; i++) {
if (i == N - 1) {
break;
} else if (str.at(i) == 'A' && str.at(i + 1) == 'B' &&
str.at(i + 2) == 'C') {
sum++;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int sum = 0;
string str;
cin >> N >> str;
for (int i = 0; i < N; i++) {
if (i == N - 2) {
break;
} else if (str.at(i) == 'A' && str.at(i + 1) == 'B' &&
str.at(i + 2) == 'C') {
sum++;
}
}
cout << sum << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02812 | 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++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
int ans = 0;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
}
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 7 | 0 | |
p02812 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
string s;
int res = 0;
for (int i = 0; i + 3 <= n; i++) {
if (s.substr(i, 3) == "ABC")
res++;
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int res = 0;
for (int i = 0; i + 3 <= n; i++) {
if (s.substr(i, 3) == "ABC")
res++;
}
cout << res << endl;
return 0;
}
| insert | 31 | 31 | 31 | 32 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 1) > this->size() (which is 0)
|
p02812 | 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() {
int n;
string s;
cin >> n;
cin >> s;
int ans = 0;
for (int i = 0; i < n; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #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() {
int n;
string s;
cin >> n;
cin >> s;
int ans = 0;
for (int i = 0; i < n - 2; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 1; i++) {
// cout << s.at(i);
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C'))
ans++;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n - 2; i++) {
if ((s.at(i) == 'A') && (s.at(i + 1) == 'B') && (s.at(i + 2) == 'C'))
ans++;
}
cout << ans;
}
| replace | 8 | 10 | 8 | 9 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i <= s.size() - 3; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
for (int i = 0; i <= s.size() - 3; i++) {
if (s.at(i) == 'A') {
if (s.at(i + 1) == 'B' && s.at(i + 2) == 'C') {
count++;
}
}
}
cout << count << endl;
}
| insert | 4 | 4 | 4 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 2)
|
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int cow = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
cow++;
}
}
cout << cow << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int cow = 0;
/*
N -
3�ɂ��闝�R�Ƃ��āAString��i����i+2�܂ł����āA���O����n�܂�̂ŁA
�Ō�͓A�ꌅ�ɂȂ�̂Œ��ׂ�K�v���Ȃ��̂� i <= N-3
�ɂ��Ă���B i <= N-3�ɂ��Ȃ������ꍇ�ARunTime
Error(���s���G���[)�ɂȂ�\��������B
�܂��AN < N-3 �ɂ����ꍇ�A�Ⴆ�� N
���P�O���Ƃ��āA�ɂȂ�����O�̂V�ׂ����̂ɁA
i < N-3 �Ƃ����ꍇ�Ai < 7
�܂�A(i��7����(7���܂܂Ȃ�)�̊�)�ƂȂ�̂�7��ڂ����s����Ȃ��Ȃ�A
Wrong answer�ƂȂ�ꍇ������B
*/
for (int i = 0; i <= N - 3; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
cow++;
}
}
cout << cow << endl;
return 0;
} | replace | 14 | 15 | 14 | 27 | 0 | |
p02812 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < N - 2; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'B' && S.at(i + 2) == 'C') {
count++;
}
}
cout << count;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02813 | Python | Runtime Error | # ABC150C - Count Order
from itertools import permutations
def main():
N, *PQ = map(int, open(0).read().split())
P, Q = PQ[:N], PQ[N:]
perms = list(permutations(range(1, N + 1), N))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
main()
| # ABC150C - Count Order
from itertools import permutations
def main():
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
perms = list(permutations(range(1, N + 1)))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
main()
| replace | 5 | 8 | 5 | 9 | ValueError: [1, 3, 2] is not in list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s593478625.py", line 14, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s593478625.py", line 9, in main
ans = abs(perms.index(P) - perms.index(Q))
ValueError: [1, 3, 2] is not in list
|
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
int a[100], b[100], n, f[100], c[100];
int lowbit(int x) { return x & (-x); }
int add(int x) {
while (x <= n) {
c[x] += 1;
x += lowbit(x);
}
}
int pre(int x) {
int sum = 0;
while (x) {
sum += c[x];
x -= lowbit(x);
}
return sum;
}
void init() {
f[0] = 1;
for (int i = 1; i <= 8; ++i) {
f[i] = f[i - 1] * i;
}
}
int cantor_exp(int p[], int len) {
int sum = 0;
for (int i = n; i >= 1; --i) {
int a = pre(p[i]);
sum += a * f[n - i];
add(p[i]);
}
return sum;
}
int main() {
ios;
cin >> n;
init();
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
cin >> b[i];
}
int s1, s2;
s1 = cantor_exp(a, n);
memset(c, 0, sizeof c);
s2 = cantor_exp(b, n);
cout << abs(s1 - s2) << '\n';
} | #include <bits/stdc++.h>
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
int a[100], b[100], n, f[100], c[100];
int lowbit(int x) { return x & (-x); }
void add(int x) {
while (x <= n) {
c[x] += 1;
x += lowbit(x);
}
}
int pre(int x) {
int sum = 0;
while (x) {
sum += c[x];
x -= lowbit(x);
}
return sum;
}
void init() {
f[0] = 1;
for (int i = 1; i <= 8; ++i) {
f[i] = f[i - 1] * i;
}
}
int cantor_exp(int p[], int len) {
int sum = 0;
for (int i = n; i >= 1; --i) {
int a = pre(p[i]);
sum += a * f[n - i];
add(p[i]);
}
return sum;
}
int main() {
ios;
cin >> n;
init();
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
cin >> b[i];
}
int s1, s2;
s1 = cantor_exp(a, n);
memset(c, 0, sizeof c);
s2 = cantor_exp(b, n);
cout << abs(s1 - s2) << '\n';
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02813 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int rui(int a, int b) {
if (b == 0)
return 1;
return a * rui(a, b - 1);
}
int main() {
int N, P = 0, Q = 0, pre, num = 0, re, a = 0, b = 0;
bool te[10], flag;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> re;
P += re;
P *= 10;
}
P /= 10;
for (int i = 0; i < N; i++) {
cin >> re;
Q += re;
Q *= 10;
}
Q /= 10;
for (int i = 0; i < rui(10, N); i++) {
pre = i;
flag = false;
for (int j = 0; j < 10; j++)
te[j] = false;
for (int j = 0; j < N; j++) {
if (te[pre % 10] || pre % 10 > N || pre % 10 == 0) {
flag = true;
break;
}
te[pre % 10] = true;
pre /= 10;
}
if (!flag)
num++;
if (i == P)
a = num;
if (i == Q)
b = num;
if (a != 0 && b != 0)
break;
}
cout << max(a - b, b - a);
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int rui(int a, int b) {
if (b == 0)
return 1;
return a * rui(a, b - 1);
}
int main() {
int N, P = 0, Q = 0, pre, num = 0, re, a = 0, b = 0;
bool te[10], flag;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> re;
P += re;
P *= 10;
}
P /= 10;
for (int i = 0; i < N; i++) {
cin >> re;
Q += re;
Q *= 10;
}
Q /= 10;
for (int i = rui(10, N - 1); i < rui(10, N); i++) {
pre = i;
flag = false;
for (int j = 0; j < 10; j++)
te[j] = false;
for (int j = 0; j < N; j++) {
if (te[pre % 10] || pre % 10 > N || pre % 10 == 0) {
flag = true;
break;
}
te[pre % 10] = true;
pre /= 10;
}
if (!flag)
num++;
if (i == P)
a = num;
if (i == Q)
b = num;
if (a != 0 && b != 0)
break;
}
cout << max(a - b, b - a);
return 0;
}
| replace | 24 | 25 | 24 | 25 | TLE | |
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, c = 0;
char ch;
string s = "", t = "", u = "";
cin >> n;
for (i = 0; i < n; i++) {
cin >> ch;
s += ch;
u += (char)('1' + i);
}
for (i = 0; i < n; i++) {
cin >> ch;
t += ch;
}
int a = 0, b = 0;
while (u != s) {
next_permutation(u.begin(), u.end());
a++;
}
sort(u.begin(), u.end());
while (u != t) {
next_permutation(u.begin(), u.end());
b++;
}
cout << abs(a - b);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, c = 0;
char ch;
string s = "", t = "", u = "";
cin >> n;
for (i = 0; i < n; i++) {
cin >> ch;
s += ch;
u += (char)('1' + i);
}
for (i = 0; i < n; i++) {
cin >> ch;
t += ch;
}
int a = 0, b = 0;
while (u != s) {
next_permutation(u.begin(), u.end());
a++;
}
sort(u.begin(), u.end());
while (u != t) {
next_permutation(u.begin(), u.end());
b++;
}
cout << abs(a - b);
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02813 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define PI 3.14159265359
#define ll long long int
int main(void) {
ll N;
cin >> N;
vector<ll> P(N), Q(N), R(N);
for (ll i = 1; i <= N; i++) {
ll p;
cin >> p;
P.push_back(p);
R.push_back(i);
}
for (ll i = 0; i < N; i++) {
ll q;
cin >> q;
Q.push_back(q);
}
ll a, b;
ll i = 0;
do {
if (P == R)
a = i;
if (Q == R)
b = i;
i++;
} while (next_permutation(R.begin(), R.end()));
cout << abs(a - b) << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define PI 3.14159265359
#define ll long long int
int main(void) {
ll N;
cin >> N;
vector<ll> P(N), Q(N), R(N);
for (ll i = 1; i <= N; i++) {
ll p;
cin >> p;
P.push_back(p);
R.push_back(i);
}
for (ll i = 0; i < N; i++) {
ll q;
cin >> q;
Q.push_back(q);
}
ll a, b;
ll i = 0;
do {
if (P == R)
a = i;
if (Q == R)
b = i;
if (R > max(P, Q))
break;
i++;
} while (next_permutation(R.begin(), R.end()));
cout << abs(a - b) << endl;
} | insert | 45 | 45 | 45 | 47 | TLE | |
p02813 | 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 ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
bool compare(vi a, vi b) {
for (int i = 0; i < a.size(); i++) {
if (a[i] != b[i])
return false;
}
return true;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, n1, n2;
vector<int> aux;
cin >> n;
for (int i = 0; i < n; i++)
aux.push_back(i + 1);
vector<vector<int>> v;
vi b(n);
vi a(n);
do {
v.push_back(aux);
} while (next_permutation(all(aux)));
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(all(v));
for (int i = 0; i < v.size(); i++) {
if (compare(v[i], a))
n1 = i;
if (compare(v[i], b))
n2 = i;
}
cout << abs(n1 - n2) << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
bool compare(vi a, vi b) {
for (int i = 0; i < a.size(); i++) {
if (a[i] != b[i])
return false;
}
return true;
}
int32_t main() {
int n, n1, n2;
vector<int> aux;
cin >> n;
for (int i = 0; i < n; i++)
aux.push_back(i + 1);
vector<vector<int>> v;
vi b(n);
vi a(n);
do {
v.push_back(aux);
} while (next_permutation(all(aux)));
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(all(v));
for (int i = 0; i < v.size(); i++) {
if (compare(v[i], a))
n1 = i;
if (compare(v[i], b))
n2 = i;
}
cout << abs(n1 - n2) << endl;
return 0;
} | delete | 25 | 32 | 25 | 25 | 0 | |
p02813 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 0; i < n; ++i) {
cin >> q[i];
}
vector<int> x(n);
for (int i = 0; i < n; ++i) {
x[i] = i + 1;
}
int a = 0, b = 0;
int cnt = 0;
do {
if (p == x)
a = cnt;
if (q == x)
b = cnt;
cnt++;
} while (next_permutation(p.begin(), q.end()));
cout << abs(a - b) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
for (int i = 0; i < n; ++i) {
cin >> q[i];
}
vector<int> x(n);
for (int i = 0; i < n; ++i) {
x[i] = i + 1;
}
int a = 0, b = 0;
int cnt = 0;
do {
if (p == x)
a = cnt;
if (q == x)
b = cnt;
cnt++;
} while (next_permutation(x.begin(), x.end()));
cout << abs(a - b) << endl;
return 0;
}
| replace | 46 | 47 | 46 | 47 | -6 | munmap_chunk(): invalid pointer
|
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
#define show(x) cerr << #x << " : " << x << '\n';
#define yogeshk972() \
cerr << "\nTime Taken : " << (float)(clock() - time_p) / CLOCKS_PER_SEC \
<< "\n";
clock_t time_p = clock();
using namespace std;
const int N = 1e3 + 10, mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int n;
cin >> n;
vector<int> v1(n), v2(n);
for (auto &x : v1)
cin >> x;
for (auto &x : v2)
cin >> x;
int a, b, ct = 0;
vector<int> v;
for (int i = 1; i <= n; i++)
v.pb(i);
do {
if (v == v1)
a = ct;
if (v == v2)
b = ct;
ct++;
} while (next_permutation(v.begin(), v.end()));
cout << abs(a - b);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define INF 0x3f3f3f3f
#define show(x) cerr << #x << " : " << x << '\n';
#define yogeshk972() \
cerr << "\nTime Taken : " << (float)(clock() - time_p) / CLOCKS_PER_SEC \
<< "\n";
clock_t time_p = clock();
using namespace std;
const int N = 1e3 + 10, mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/*
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
*/
int n;
cin >> n;
vector<int> v1(n), v2(n);
for (auto &x : v1)
cin >> x;
for (auto &x : v2)
cin >> x;
int a, b, ct = 0;
vector<int> v;
for (int i = 1; i <= n; i++)
v.pb(i);
do {
if (v == v1)
a = ct;
if (v == v2)
b = ct;
ct++;
} while (next_permutation(v.begin(), v.end()));
cout << abs(a - b);
return 0;
}
| replace | 21 | 27 | 21 | 27 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
// using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define plii pair<pair<ll, int>, int>
#define piii pair<pii, int>
#define viii vector<pair<pii, int>>
#define vl vector<ll>
#define vll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define mp make_pair
#define ms(x, v) memset(x, v, sizeof x)
#define pr_vec(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " ";
#define f_in(st) freopen(st, "r", stdin)
#define f_out(st) freopen(st, "w", stdout)
#define INF (ll)1e17
#define matrix vector<vector<ll>>
#define fr(i, a, b) for (i = a; i <= b; i++)
#define fb(i, a, b) for (i = a; i >= b; i--)
#define ASST(x, l, r) assert(x <= r && x >= l)
#define maxbits 9
#define maxmask (1ll << maxbits)
// typedef tree<pll, null_type, less<pll>, rb_tree_tag,
// tree_order_statistics_node_update>
// new_data_set;
const int N = 1e5 + 10, M = (ll)1e9 + 1;
const int mod = (ll)998244353, sz = 5, MAX = (ll)1e6 + 10;
string fir = "Monocarp", sec = "Bicarp";
void work() {
ll n;
cin >> n;
vl p(n), q(n), a(n);
for (ll i = 0; i < n; i++) {
cin >> p[i];
a[i] = i + 1;
}
for (ll i = 0; i < n; i++)
cin >> q[i];
ll x, y, cnt = 0;
do {
bool same = true;
for (ll i = 0; i < n; i++) {
if (a[i] != p[i])
same = false;
}
if (same)
x = cnt;
same = true;
for (ll i = 0; i < n; i++) {
if (a[i] != q[i])
same = false;
}
if (same)
y = cnt;
cnt++;
} while (next_permutation(a.begin(), a.end()));
cout << abs(x - y);
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// precomp();
ll t;
// cin >> t;
t = 1;
while (t--) {
work();
}
return 0;
}
| #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
// using namespace __gnu_pbds;
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define plii pair<pair<ll, int>, int>
#define piii pair<pii, int>
#define viii vector<pair<pii, int>>
#define vl vector<ll>
#define vll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define mp make_pair
#define ms(x, v) memset(x, v, sizeof x)
#define pr_vec(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " ";
#define f_in(st) freopen(st, "r", stdin)
#define f_out(st) freopen(st, "w", stdout)
#define INF (ll)1e17
#define matrix vector<vector<ll>>
#define fr(i, a, b) for (i = a; i <= b; i++)
#define fb(i, a, b) for (i = a; i >= b; i--)
#define ASST(x, l, r) assert(x <= r && x >= l)
#define maxbits 9
#define maxmask (1ll << maxbits)
// typedef tree<pll, null_type, less<pll>, rb_tree_tag,
// tree_order_statistics_node_update>
// new_data_set;
const int N = 1e5 + 10, M = (ll)1e9 + 1;
const int mod = (ll)998244353, sz = 5, MAX = (ll)1e6 + 10;
string fir = "Monocarp", sec = "Bicarp";
void work() {
ll n;
cin >> n;
vl p(n), q(n), a(n);
for (ll i = 0; i < n; i++) {
cin >> p[i];
a[i] = i + 1;
}
for (ll i = 0; i < n; i++)
cin >> q[i];
ll x, y, cnt = 0;
do {
bool same = true;
for (ll i = 0; i < n; i++) {
if (a[i] != p[i])
same = false;
}
if (same)
x = cnt;
same = true;
for (ll i = 0; i < n; i++) {
if (a[i] != q[i])
same = false;
}
if (same)
y = cnt;
cnt++;
} while (next_permutation(a.begin(), a.end()));
cout << abs(x - y);
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t;
// cin >> t;
t = 1;
while (t--) {
work();
}
return 0;
}
| delete | 91 | 96 | 91 | 91 | TLE | |
p02813 | Python | Runtime Error | # ABC150C - Count Order
from itertools import permutations
def main():
N, *PQ = map(int, open(0).read().split())
P, Q = PQ[:N], PQ[N:]
perms = list(permutations(range(1, N + 1)))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
main()
| # ABC150C - Count Order
from itertools import permutations
def main():
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
perms = tuple(permutations(range(1, N + 1)))
ans = abs(perms.index(P) - perms.index(Q))
print(ans)
if __name__ == "__main__":
main()
| replace | 5 | 8 | 5 | 9 | ValueError: [1, 3, 2] is not in list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s713702771.py", line 14, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02813/Python/s713702771.py", line 9, in main
ans = abs(perms.index(P) - perms.index(Q))
ValueError: [1, 3, 2] is not in list
|
p02813 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a, b, c, d;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
c.push_back(x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
d.push_back(y);
}
for (int i = 0; i < n; i++) {
a.push_back(i + 1);
b.push_back(i + 1);
}
if (c == d) {
cout << 0 << endl;
} else {
int cnt1 = 0, cnt2 = 0;
while (a != c) {
cnt1++;
next_permutation(a.begin(), a.end());
}
while (b != d) {
cnt2++;
next_permutation(b.begin(), b.end());
}
cout << abs(cnt1 - cnt2) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a, b, c, d;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
c.push_back(x);
}
for (int i = 0; i < n; i++) {
int y;
cin >> y;
d.push_back(y);
}
for (int i = 0; i < n; i++) {
a.push_back(i + 1);
b.push_back(i + 1);
}
if (c == d) {
cout << 0 << endl;
} else {
int cnt1 = 0, cnt2 = 0;
while (a != c) {
cnt1++;
next_permutation(a.begin(), a.end());
}
while (b != d) {
cnt2++;
next_permutation(b.begin(), b.end());
}
cout << abs(cnt1 - cnt2) << endl;
}
}
| replace | 3 | 7 | 3 | 7 | 0 | |
p02813 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
vector<int> v1, v2;
set<vector<int>> vs;
vector<int> tmp;
int n;
void brute(int idx) {
if (idx == n) {
if (tmp.size() == n) {
// for(auto x : tmp)
// cout<<x<<" ";
// puts("");
vs.insert(tmp);
}
return;
}
for (int i = 1; i <= n; i++) {
if (find(tmp.begin(), tmp.end(), i) == tmp.end()) {
tmp.push_back(i);
brute(idx + 1);
tmp.pop_back();
brute(idx + 1);
}
}
}
int main() {
// freopen("a.out", "wt", stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v1.push_back(x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v2.push_back(x);
}
brute(0);
// for (auto v : vs)
// {
// for(auto x : v)
// cout<<x<<" ";
// puts("");
// }
int idx1 = -1, idx2 = -2;
int num = 0;
for (auto v : vs) {
if (v1 == v)
idx1 = num;
if (v2 == v)
idx2 = num;
num++;
}
cout << abs(idx1 - idx2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
vector<int> v1, v2;
set<vector<int>> vs;
vector<int> tmp;
int n;
void brute(int idx) {
if (idx == n) {
if (tmp.size() == n) {
// for(auto x : tmp)
// cout<<x<<" ";
// puts("");
vs.insert(tmp);
}
return;
}
for (int i = 1; i <= n; i++) {
if (find(tmp.begin(), tmp.end(), i) == tmp.end()) {
tmp.push_back(i);
brute(idx + 1);
tmp.pop_back();
// brute(idx+1);
}
}
}
int main() {
// freopen("a.out", "wt", stdout);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v1.push_back(x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v2.push_back(x);
}
brute(0);
// for (auto v : vs)
// {
// for(auto x : v)
// cout<<x<<" ";
// puts("");
// }
int idx1 = -1, idx2 = -2;
int num = 0;
for (auto v : vs) {
if (v1 == v)
idx1 = num;
if (v2 == v)
idx2 = num;
num++;
}
cout << abs(idx1 - idx2) << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
#define rp(i, f, t) for (int i = f; i < t; i++)
#define pr(i, f, t) for (int i = t - 1; i >= f; i--)
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
map<long long, long long> prime_factor(long long n) {
map<long long, long long> res;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rp(i, 0, n) cin >> a[i];
ll g = a[0] / 2;
rp(i, 1, n) g = gcd(g, a[i] / 2);
ll l = g;
map<ll, ll> mp;
rp(i, 0, n) {
map<ll, ll> mp2 = prime_factor((a[i] / 2) / g);
for (auto i = mp2.begin(); i != mp2.end(); ++i) {
mp[i->first] = max(mp[i->first], i->second);
}
}
for (auto i = mp.begin(); i != mp.end(); ++i) {
l *= pow(i->first, i->second);
}
// cout << l << endl;
ll e = 0, o = 0;
rp(i, 0, n) {
if ((l / (a[i] / 2)) % 2 == 0)
e++;
else
o++;
}
ll ans = 0;
if (o == n && m >= l) {
ans = (m - l) / (l * 2) + 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
#define rp(i, f, t) for (int i = f; i < t; i++)
#define pr(i, f, t) for (int i = t - 1; i >= f; i--)
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
map<long long, long long> prime_factor(long long n) {
map<long long, long long> res;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rp(i, 0, n) cin >> a[i];
ll g = a[0] / 2;
rp(i, 1, n) g = gcd(g, a[i] / 2);
ll l;
if (n >= 2)
l = (a[0] / 2) * (a[1] / 2) / gcd(a[0] / 2, a[1] / 2);
else
l = a[0] / 2;
rp(i, 2, n) { l = l * (a[i] / 2) / gcd(l, a[i] / 2); }
// cout << l << endl;
ll e = 0, o = 0;
rp(i, 0, n) {
if ((l / (a[i] / 2)) % 2 == 0)
e++;
else
o++;
}
ll ans = 0;
if (o == n && m >= l) {
ans = (m - l) / (l * 2) + 1;
}
cout << ans << endl;
} | replace | 26 | 39 | 26 | 33 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long a[100000];
long long gcd(long long m, long long n) {
if (n == 0) {
return m;
}
if (n > m) {
return gcd(n, m);
}
return gcd(n, m % n);
}
int main() {
int N;
long long M;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int two_power_num = 0;
while (a[0] % 2 == 0) {
a[0] /= 2;
two_power_num++;
}
for (int i = 1; i < N; i++) {
int cur_two_power_num = 0;
while (a[i] % 2 == 0) {
a[i] /= 2;
cur_two_power_num++;
}
if (two_power_num != cur_two_power_num) {
cout << 0 << endl;
return 0;
}
}
long long base = 1;
for (int i = 0; i < two_power_num - 1; i++) {
base *= 2;
}
long long lcm = a[0];
for (int i = 1; i < N; i++) {
lcm = lcm * a[i] / gcd(lcm, a[i]);
}
long long candidates = M / (base * lcm);
if (candidates % 2 == 0) {
cout << candidates / 2 << endl;
} else {
cout << candidates / 2 + 1 << endl;
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long a[100000];
long long gcd(long long m, long long n) {
if (n == 0) {
return m;
}
if (n > m) {
return gcd(n, m);
}
return gcd(n, m % n);
}
int main() {
int N;
long long M;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int two_power_num = 0;
while (a[0] % 2 == 0) {
a[0] /= 2;
two_power_num++;
}
for (int i = 1; i < N; i++) {
int cur_two_power_num = 0;
while (a[i] % 2 == 0) {
a[i] /= 2;
cur_two_power_num++;
}
if (two_power_num != cur_two_power_num) {
cout << 0 << endl;
return 0;
}
}
long long base = 1;
for (int i = 0; i < two_power_num - 1; i++) {
base *= 2;
}
long long lcm = a[0];
for (int i = 1; i < N; i++) {
lcm = lcm * a[i] / gcd(lcm, a[i]);
if (lcm > M) {
cout << 0 << endl;
return 0;
}
}
long long candidates = M / (base * lcm);
if (candidates % 2 == 0) {
cout << candidates / 2 << endl;
} else {
cout << candidates / 2 + 1 << endl;
}
return 0;
}
| insert | 60 | 60 | 60 | 64 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
return gcd(y, x);
else if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(N), b(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b[i] = a[i] / 2;
}
long long hoge = 0;
while (a[0] % 2 == 0) {
hoge++;
a[0] /= 2;
}
for (int i = 1; i < N; i++) {
long long fuga = 0;
while (a[i] % 2 == 0) {
fuga++;
a[i] /= 2;
}
if (hoge != fuga) {
cout << 0 << endl;
return 0;
}
}
long long LCM = 1;
for (int i = 0; i < N; i++) {
LCM = (LCM * b[i]) / gcd(LCM, b[i]);
}
cout << M / LCM - M / (LCM * 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
return gcd(y, x);
else if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(N), b(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
b[i] = a[i] / 2;
}
long long hoge = 0;
while (a[0] % 2 == 0) {
hoge++;
a[0] /= 2;
}
for (int i = 1; i < N; i++) {
long long fuga = 0;
while (a[i] % 2 == 0) {
fuga++;
a[i] /= 2;
}
if (hoge != fuga) {
cout << 0 << endl;
return 0;
}
}
long long LCM = 1;
for (int i = 0; i < N; i++) {
LCM = LCM / gcd(LCM, b[i]) * b[i];
if (LCM > M) {
cout << 0 << endl;
return 0;
}
}
cout << M / LCM - M / (LCM * 2) << endl;
} | replace | 38 | 39 | 38 | 43 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a) {
ll x = a;
a = b;
b = x;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
int main() {
ll n, m;
cin >> n >> m;
vector<ll> lis(n);
cin >> lis[0];
ll a = lis[0] / 2, b;
for (int i = 1; i < n; i++) {
cin >> lis[i];
a = lcm(a, lis[i] / 2);
}
for (int i = 0; i < n; i++) {
if (a % lis[i] == 0) {
cout << 0 << endl;
return 0;
}
}
cout << (m / a + 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
int main() {
ll n, m;
cin >> n >> m;
vector<ll> lis(n);
cin >> lis[0];
ll a = lis[0] / 2, b;
for (int i = 1; i < n; i++) {
cin >> lis[i];
a = lcm(a, lis[i] / 2);
}
for (int i = 0; i < n; i++) {
if (a % lis[i] == 0) {
cout << 0 << endl;
return 0;
}
}
cout << (m / a + 1) / 2 << endl;
return 0;
} | delete | 5 | 10 | 5 | 5 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define MOD 1000000007
// #define MOD 998244353
// #define MOD LLONG_MAX
const double PI = 3.14159265358979323846;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
if (a == 1)
return a;
// if(a==0)re
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 1000000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { // 最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
// ll arr[1000500];
// vint primes;
// //エラトステネスの篩
// void Eratosthenes(){
// ll N = 1000500;
// for(ll i = 0; i < N; i++){
// arr[i] = 1;
// }
// for(ll i = 2; i < sqrt(N); i++){
// if(arr[i]){
// for(ll j = 0; i * (j + 2) < N; j++){
// arr[i *(j + 2)] = 0;
// }
// }
// }
// for(ll i = 2; i < N; i++){
// if(arr[i]){
// primes.pb(i);
// //cout << i << endl;
// }
// }
// }
void printv(vint &V) {
for (auto e : V)
cout << e << " ";
cout << endl;
}
int main() {
cout << fixed << setprecision(10);
ll N, M;
cin >> N >> M;
vint a(N);
rep(i, N) cin >> a[i];
ll num = 1;
rep(i, N) {
num = lcm(num, a[i]);
if (num >= 3 * M) {
cout << 0 << endl;
return 0;
}
}
bool f = true;
rep(i, N) {
if ((num / a[i]) % 2 == 0) {
f = false;
break;
}
}
if (!f) {
cout << 0 << endl;
return 0;
}
// cout<<num<<endl;
ll ok = -1;
ll ng = M;
auto isOK = [&](ll p) { return num * (2 * p + 1) <= 2 * M; };
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
// cout<<mid<<endl;
if (isOK(mid))
ok = mid;
else
ng = mid;
}
cout << ok + 1 << endl;
}
//
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define MOD 1000000007
// #define MOD 998244353
// #define MOD LLONG_MAX
const double PI = 3.14159265358979323846;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
if (a == 1)
return a;
// if(a==0)re
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 1000000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { // 最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
// ll arr[1000500];
// vint primes;
// //エラトステネスの篩
// void Eratosthenes(){
// ll N = 1000500;
// for(ll i = 0; i < N; i++){
// arr[i] = 1;
// }
// for(ll i = 2; i < sqrt(N); i++){
// if(arr[i]){
// for(ll j = 0; i * (j + 2) < N; j++){
// arr[i *(j + 2)] = 0;
// }
// }
// }
// for(ll i = 2; i < N; i++){
// if(arr[i]){
// primes.pb(i);
// //cout << i << endl;
// }
// }
// }
void printv(vint &V) {
for (auto e : V)
cout << e << " ";
cout << endl;
}
int main() {
cout << fixed << setprecision(10);
ll N, M;
cin >> N >> M;
vint a(N);
rep(i, N) cin >> a[i];
ll num = 1;
rep(i, N) {
num = lcm(num, a[i]);
if (num > 2 * M) {
cout << 0 << endl;
return 0;
}
}
bool f = true;
rep(i, N) {
if ((num / a[i]) % 2 == 0) {
f = false;
break;
}
}
if (!f) {
cout << 0 << endl;
return 0;
}
// cout<<num<<endl;
ll ok = -1;
ll ng = M;
auto isOK = [&](ll p) { return num * (2 * p + 1) <= 2 * M; };
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
// cout<<mid<<endl;
if (isOK(mid))
ok = mid;
else
ng = mid;
}
cout << ok + 1 << endl;
}
//
| replace | 295 | 296 | 295 | 296 | TLE | |
p02814 | C++ | Time Limit Exceeded | // template version 1.15
using namespace std;
#include <bits/stdc++.h>
// varibable settings
#define int long long
const int INF = 1e18;
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
if ((a) < (b))
(a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
if ((a) > (b))
(a) = (b);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#define cerrendl 42
#endif
//}}}
int gcd(int a, int b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return (a / gcd(a, b)) * b; // overflowしにくいように最初に割り算をする。
}
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
map<int, int> d;
rep(i, n) {
cin >> a[i];
int v = a[i];
int c = 0;
while (v % 2 == 0) {
v /= 2;
c++;
}
d[c]++;
}
if (sz(d) == 1) {
int L = 1;
rep(i, n) { L = lcm(L, a[i] / 2); }
dump(L);
if (m < L) {
cout << 0 << endl;
return 0;
}
cout << (m - L) / (2 * L) + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| // template version 1.15
using namespace std;
#include <bits/stdc++.h>
// varibable settings
#define int long long
const int INF = 1e18;
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x) - A.begin())
#define posu(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
if ((a) < (b))
(a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
if ((a) > (b))
(a) = (b);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#define cerrendl 42
#endif
//}}}
int gcd(int a, int b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return (a / gcd(a, b)) * b; // overflowしにくいように最初に割り算をする。
}
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
map<int, int> d;
rep(i, n) {
cin >> a[i];
int v = a[i];
int c = 0;
while (v % 2 == 0) {
v /= 2;
c++;
}
d[c]++;
}
if (sz(d) == 1) {
int L = 1;
rep(i, n) {
L = lcm(L, a[i] / 2);
if (L > m)
break;
}
dump(L);
if (m < L) {
cout << 0 << endl;
return 0;
}
cout << (m - L) / (2 * L) + 1 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| replace | 94 | 95 | 94 | 99 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool mjjj(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>,
rb_tree_tag, tree_order_statistics_node_update>; template<typename TK, typename
TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag,
tree_order_statistics_node_update>;
*/
template <typename T> struct edge {
int src, to;
T cost;
// edge(int to) : src(-1),to(to),cost(-1){}
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<lint>>;
template <typename T> using Matrix = vector<vector<T>>;
#define INF 1e+9
#define MAX_V 100000
struct prb {
lint init;
lint ex;
prb(lint init, lint ex) : init(init), ex(ex) {}
prb(lint init) : init(init), ex(0) {}
lint scr() { return init + ex; }
prb() : init(0), ex(0) {}
};
// <最短距離, 頂点の番号>
using P = pair<lint, lint>;
lint V;
vector<edge<lint>> G[MAX_V];
lint d[MAX_V];
lint lcm(lint a, lint b);
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
lint v = p.second;
if (d[v] < p.first)
continue;
for (lint i = 0; i < G[v].size(); ++i) {
edge<lint> e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
lint n, m;
cin >> n >> m;
vector<lint> a(n);
cin >> a;
// sort(a.begin(),a.end());
lint temp = a[0];
lint q = 0;
lint qq = 0;
REP(i, n) {
if (a[i] % 2 == 1) {
cout << 0;
return 0;
}
}
while (!(temp & 1)) {
temp >>= 1;
q++;
}
FOR(i, 1, n) {
temp = a[i];
qq = 0;
while (!(temp & 1)) {
temp >>= 1;
qq++;
}
if (qq != q) {
cout << 0;
return 0;
}
}
lint hlcm = a[0] / 2;
REP(i, n - 1) { hlcm = lcm(hlcm, a[i + 1] / 2); }
lint qqq = (lint)(m / hlcm) + 1;
cout << (lint)(qqq / 2);
}
lint gcd(lint a, lint b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
lint lcm(lint a, lint b) { return a * b / gcd(a, b); } | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool mjjj(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>,
rb_tree_tag, tree_order_statistics_node_update>; template<typename TK, typename
TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag,
tree_order_statistics_node_update>;
*/
template <typename T> struct edge {
int src, to;
T cost;
// edge(int to) : src(-1),to(to),cost(-1){}
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<lint>>;
template <typename T> using Matrix = vector<vector<T>>;
#define INF 1e+9
#define MAX_V 100000
struct prb {
lint init;
lint ex;
prb(lint init, lint ex) : init(init), ex(ex) {}
prb(lint init) : init(init), ex(0) {}
lint scr() { return init + ex; }
prb() : init(0), ex(0) {}
};
// <最短距離, 頂点の番号>
using P = pair<lint, lint>;
lint V;
vector<edge<lint>> G[MAX_V];
lint d[MAX_V];
lint lcm(lint a, lint b);
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
lint v = p.second;
if (d[v] < p.first)
continue;
for (lint i = 0; i < G[v].size(); ++i) {
edge<lint> e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
lint n, m;
cin >> n >> m;
vector<lint> a(n);
cin >> a;
// sort(a.begin(),a.end());
lint temp = a[0];
lint q = 0;
lint qq = 0;
REP(i, n) {
if (a[i] % 2 == 1) {
cout << 0;
return 0;
}
}
while (!(temp & 1)) {
temp >>= 1;
q++;
}
FOR(i, 1, n) {
temp = a[i];
qq = 0;
while (!(temp & 1)) {
temp >>= 1;
qq++;
}
if (qq != q) {
cout << 0;
return 0;
}
}
lint hlcm = a[0] / 2;
REP(i, n - 1) {
hlcm = lcm(hlcm, a[i + 1] / 2);
if (m < hlcm) {
cout << 0;
return 0;
}
}
lint qqq = (lint)(m / hlcm) + 1;
cout << (lint)(qqq / 2);
}
lint gcd(lint a, lint b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
lint lcm(lint a, lint b) { return a * b / gcd(a, b); } | replace | 228 | 229 | 228 | 235 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
long long gcd(long long N, long long M) {
while (true) {
if (min(N, M) == 0) {
return max(N, M);
} else if (N > M) {
N %= M;
} else {
M %= N;
}
}
}
long long lcm(long long N, long long M) { return N * M / gcd(N, M); }
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N, 0);
cin >> A[0];
long long tmp = A[0];
long long fact = 1;
while (tmp % 2 == 0 && tmp > 0) {
tmp /= 2;
fact *= 2;
}
if (fact == 1) {
cout << 0 << endl;
return 0;
}
long long lcm_ = A[0];
for (int i = 1; i < N; i++) {
cin >> A[i];
if (A[i] % fact != 0 || (A[i] / fact) % 2 == 0) {
cout << 0 << endl;
return 0;
}
lcm_ = lcm(lcm_, A[i]);
}
cout << 2 * M / lcm_ - M / lcm_ << endl;
} | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
long long gcd(long long N, long long M) {
while (true) {
if (min(N, M) == 0) {
return max(N, M);
} else if (N > M) {
N %= M;
} else {
M %= N;
}
}
}
long long lcm(long long N, long long M) { return N * M / gcd(N, M); }
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N, 0);
cin >> A[0];
long long tmp = A[0];
long long fact = 1;
while (tmp % 2 == 0 && tmp > 0) {
tmp /= 2;
fact *= 2;
}
if (fact == 1) {
cout << 0 << endl;
return 0;
}
long long lcm_ = A[0];
for (int i = 1; i < N; i++) {
cin >> A[i];
if (A[i] % fact != 0 || (A[i] / fact) % 2 == 0) {
cout << 0 << endl;
return 0;
}
lcm_ = lcm(lcm_, A[i]);
if (lcm_ > MOD) {
cout << 0 << endl;
return 0;
}
}
cout << 2 * M / lcm_ - M / lcm_ << endl;
} | insert | 54 | 54 | 54 | 58 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define sp(x) setprecision(x)
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m;
cin >> n >> m;
ll arr[n], ans = 1;
bool flag = 1;
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i] /= 2;
ans = (ans * arr[i]) / __gcd(ans, arr[i]);
if (ans > m) {
flag = 0;
break;
}
}
for (int i = 0; i < n; i++) {
if ((ans / arr[i]) % 2 == 0)
flag = 0;
}
if (flag == 0) {
cout << 0 << endl;
return 0;
}
ans = m / ans;
if (ans % 2 == 0)
ans = ans / 2;
else
ans = (ans / 2) + 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define sp(x) setprecision(x)
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m;
cin >> n >> m;
ll arr[n], ans = 1;
bool flag = 1;
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr[i] /= 2;
ans = (ans * arr[i]) / __gcd(ans, arr[i]);
if (ans > m) {
flag = 0;
break;
}
}
if (flag == 0) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < n; i++) {
if ((ans / arr[i]) % 2 == 0)
flag = 0;
}
if (flag == 0) {
cout << 0 << endl;
return 0;
}
ans = m / ans;
if (ans % 2 == 0)
ans = ans / 2;
else
ans = (ans / 2) + 1;
cout << ans << endl;
} | insert | 36 | 36 | 36 | 41 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
else {
if (b == 1)
return 1;
else if (b == 0)
return a;
else
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int main() {
ll n, m;
cin >> n >> m;
ll a[n];
rep(i, n) cin >> a[i];
ll p[n];
rep(i, n) p[i] = a[i] / 2;
ll P = p[0];
bool OK = true;
for (ll i = 1; i < n; i++) {
P = lcm(P, p[i]);
}
rep(i, n) {
if ((P / p[i]) % 2 == 0)
OK = false;
}
if (OK) {
if ((m / P) % 2 == 1)
cout << ((m / P) + 1) / 2 << endl;
else
cout << (m / P) / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
ll n, m;
cin >> n >> m;
ll a[n];
rep(i, n) cin >> a[i];
ll p[n];
rep(i, n) p[i] = a[i] / 2;
ll P = p[0];
bool OK = true;
for (ll i = 1; i < n; i++) {
P = lcm(P, p[i]);
}
rep(i, n) {
if ((P / p[i]) % 2 == 0)
OK = false;
}
if (OK) {
if ((m / P) % 2 == 1)
cout << ((m / P) + 1) / 2 << endl;
else
cout << (m / P) / 2 << endl;
} else {
cout << 0 << endl;
}
}
| replace | 21 | 35 | 21 | 23 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
const ll mod = 1000000007;
ll gcd(ll x, ll y) {
ll a, b;
if (y >= x) {
a = y;
b = x;
} else {
a = x;
b = y;
}
if (b == 0)
return a;
return gcd(a % b, b);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
int main() {
ll n, m;
cin >> n >> m;
vll lst(n);
rep(i, n) {
cin >> lst[i];
lst[i] /= 2;
}
ll lcmv = 1;
rep(i, n) { lcmv = lcm(lcmv, lst[i]); };
ll ok = true;
rep(i, n) {
ll t = lcmv / lst[i];
if (t % 2 == 0) {
ok = false;
break;
}
}
ll ans = ok ? (m / lcmv + 1) / 2 : 0;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
const ll mod = 1000000007;
ll gcd(ll x, ll y) {
ll a, b;
if (y >= x) {
a = y;
b = x;
} else {
a = x;
b = y;
}
if (b == 0)
return a;
return gcd(a % b, b);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
int main() {
ll n, m;
cin >> n >> m;
vll lst(n);
rep(i, n) {
cin >> lst[i];
lst[i] /= 2;
}
ll lcmv = 1;
rep(i, n) {
lcmv = lcm(lcmv, lst[i]);
if (lcmv > m) {
puts("0");
return 0;
}
};
ll ok = true;
rep(i, n) {
ll t = lcmv / lst[i];
if (t % 2 == 0) {
ok = false;
break;
}
}
ll ans = ok ? (m / lcmv + 1) / 2 : 0;
cout << ans << endl;
return 0;
}
| replace | 75 | 76 | 75 | 82 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(n);
long long memo = 0;
for (int i = 0; i < n; i++) {
long long x, cnt = 0;
cin >> x;
a[i] = x / 2;
while (x % 2 == 0) {
x /= 2;
cnt++;
}
if (i == 0)
memo = cnt;
if (i != 0 && cnt != memo) {
cout << 0 << endl;
return 0;
}
}
sort(a.begin(), a.end());
long long mem = a[0] / __gcd(a[0], a[1]) * a[1];
for (int i = 2; i < n; i++) {
if (mem > m) {
cout << 0 << endl;
return 0;
}
if (mem % a[i] != 0)
mem = mem / __gcd(mem, a[i]) * a[i];
}
long long ans = 0, me = mem;
while (me <= m) {
ans++;
me += 2 * mem;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(n);
long long memo = 0;
for (int i = 0; i < n; i++) {
long long x, cnt = 0;
cin >> x;
a[i] = x / 2;
while (x % 2 == 0) {
x /= 2;
cnt++;
}
if (i == 0)
memo = cnt;
if (i != 0 && cnt != memo) {
cout << 0 << endl;
return 0;
}
}
sort(a.begin(), a.end());
long long mem;
if (n == 1)
mem = a[0];
else
mem = a[0] / __gcd(a[0], a[1]) * a[1];
for (int i = 2; i < n; i++) {
if (mem > m) {
cout << 0 << endl;
return 0;
}
if (mem % a[i] != 0)
mem = mem / __gcd(mem, a[i]) * a[i];
}
long long ans = 0, me = mem;
while (me <= m) {
ans++;
me += 2 * mem;
}
cout << ans << endl;
}
| replace | 24 | 25 | 24 | 29 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
// m > n >= 0
template <class T> T gcd(T m, T n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
int halfNtimes(int n, int count) {
if (n % 2 == 0) {
n /= 2;
return halfNtimes(n, count + 1);
} else
return count;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
cin >> a[0];
int memo = halfNtimes(a[0], 0);
int ans;
bool exsist = true;
for (int i = 1; i < n; i++) {
int b;
cin >> b;
if (halfNtimes(b, 0) != memo) {
exsist = false;
break;
}
a[i] = b;
}
if (exsist) {
long long t =
accumulate(a.begin(), a.end(), 2, [m](long long acc, long long i) {
long long g;
if (acc > i)
g = gcd(acc, i);
else
g = gcd(i, acc);
long long lcm = acc * i / (2 * g);
if (lcm > m)
return (long long)0;
return lcm;
});
int count = 0;
int unit = t;
while (t <= m) {
count++;
t += unit * 2;
}
ans = count;
} else
ans = 0;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
// m > n >= 0
template <class T> T gcd(T m, T n) {
if (n == 0)
return m;
return gcd(n, m % n);
}
int halfNtimes(int n, int count) {
if (n % 2 == 0) {
n /= 2;
return halfNtimes(n, count + 1);
} else
return count;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
cin >> a[0];
int memo = halfNtimes(a[0], 0);
int ans;
bool exsist = true;
for (int i = 1; i < n; i++) {
int b;
cin >> b;
if (halfNtimes(b, 0) != memo) {
exsist = false;
break;
}
a[i] = b;
}
if (exsist) {
long long t =
accumulate(a.begin(), a.end(), 2, [m](long long acc, long long i) {
long long g;
if (acc > i)
g = gcd(acc, i);
else
g = gcd(i, acc);
long long lcm = acc * i / (2 * g);
if (lcm > m)
return (long long)0;
return lcm;
});
if (t != 0) {
int count = 0;
int unit = t;
while (t <= m) {
count++;
t += unit * 2;
}
ans = count;
} else
ans = 0;
} else
ans = 0;
cout << ans << endl;
return 0;
} | replace | 55 | 62 | 55 | 65 | TLE | |
p02814 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
template <typename T>
using posteriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[] = {0, -1, -1, -1, 0, 1, 1,
// 1};
template <typename T, typename U> inline bool chmax(T &a, U b) {
return a < b ? (a = b, true) : false;
}
template <typename T, typename U> inline bool chmin(T &a, U b) {
return a > b ? (a = b, true) : false;
}
template <typename T> void unique(vector<T> &a) {
a.erase(unique(ALL(a)), a.end());
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
ll __lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(ALL(a));
unique(a);
n = a.size();
vector<int> cnt(n);
REP(i, n) {
a[i] >>= 1;
int tmp = a[i];
while (a[i] % 2 == 0) {
++cnt[i];
tmp >>= 1;
}
}
sort(ALL(cnt));
if (cnt.front() < cnt.back()) {
cout << "0\n";
return 0;
}
ll l = a[0];
FOR(i, 1, n) {
l = __lcm(l, a[i]);
if (l > m) {
cout << "0\n";
return 0;
}
}
m -= l;
cout << m / (l * 2) + 1 << '\n';
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
template <typename T>
using posteriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[] = {0, -1, -1, -1, 0, 1, 1,
// 1};
template <typename T, typename U> inline bool chmax(T &a, U b) {
return a < b ? (a = b, true) : false;
}
template <typename T, typename U> inline bool chmin(T &a, U b) {
return a > b ? (a = b, true) : false;
}
template <typename T> void unique(vector<T> &a) {
a.erase(unique(ALL(a)), a.end());
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
ll __lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(ALL(a));
unique(a);
n = a.size();
vector<int> cnt(n);
REP(i, n) {
a[i] >>= 1;
int tmp = a[i];
while (tmp % 2 == 0) {
++cnt[i];
tmp >>= 1;
}
}
sort(ALL(cnt));
if (cnt.front() < cnt.back()) {
cout << "0\n";
return 0;
}
ll l = a[0];
FOR(i, 1, n) {
l = __lcm(l, a[i]);
if (l > m) {
cout << "0\n";
return 0;
}
}
m -= l;
cout << m / (l * 2) + 1 << '\n';
return 0;
}
| replace | 48 | 49 | 48 | 49 | TLE | |
p02814 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef double ld;
const long long INF = (1LL << 62);
const double inf = pow(10, 10);
double pi = 3.141592653589793;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
const ll MOD = 4000007;
void init() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
init();
ll N, M;
cin >> N >> M;
vector<ll> A(N);
ll num = 1;
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] /= 2;
num = lcm(num, A[i]);
if (num > M) {
cout << 0 << endl;
return 0;
}
}
if (num % 4 == 0)
return 1;
else
cout << (M / num + 1) / 2 << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef double ld;
const long long INF = (1LL << 62);
const double inf = pow(10, 10);
double pi = 3.141592653589793;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
const ll MOD = 4000007;
void init() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
init();
ll N, M;
cin >> N >> M;
vector<ll> A(N);
ll num = 1;
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] /= 2;
num = lcm(num, A[i]);
if (num > M) {
cout << 0 << endl;
return 0;
}
}
bool isOK = true;
for (int i = 0; i < N; i++) {
ll x = num / A[i];
if (x % 2 == 0)
isOK = false;
}
if (!isOK)
cout << 0 << endl;
else
cout << (M / num + 1) / 2 << endl;
}
| replace | 52 | 54 | 52 | 60 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a) ? "Yes" : "No")
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 62;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n;
ll m;
int ans = 0;
cin >> n >> m;
ll radio = 1LL;
vector<ll> a(n);
set<ll> base; // n= [f]+t[s]
rep(i, n) {
cin >> a[i];
base.insert(a[i] / 2);
}
int t = 0;
int bef = *base.begin();
while (bef % 2 == 0) {
t++;
bef /= 2;
}
for (auto itr = base.begin(); itr != base.end(); itr++) {
if (!(*itr % t == 0 and *itr / t % 2 == 1)) {
cout << 0 << endl;
clog << "!" << endl;
return 0;
}
radio *= (*itr) / __gcd(radio, *itr);
if (radio > m) {
cout << 0 << endl;
// goto fin;
return 0;
}
}
// fin:
ll fa = radio, fb = radio * 3;
ans = 1 + (m - fa) / (fb - fa);
cout << ans << endl;
return 0;
}
/*
3+6n =3(1+2n) n=2,7,12 ...1+5b (9)
5+10m=5(1+2m) m=1,4,7,....1+3a (12)
50 10 1,4(9) ...2
7(1+2a)
11(1+2b)
20(1+2c)
100 5
(1+2a)
3(1+2b) 1,2...n
1000000000 33333333
*/
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a) ? "Yes" : "No")
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INFLL = 1LL << 62;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n;
ll m;
int ans = 0;
cin >> n >> m;
ll radio = 1LL;
vector<ll> a(n);
set<ll> base; // n= [f]+t[s]
rep(i, n) {
cin >> a[i];
base.insert(a[i] / 2);
}
int t = 0;
int bef = *base.begin();
while (bef % 2 == 0) {
t++;
bef /= 2;
}
for (auto itr = base.begin(); itr != base.end(); itr++) {
if (!(*itr % (1 << t) == 0 and *itr / (1 << t) % 2 == 1)) {
cout << 0 << endl;
clog << "!" << endl;
return 0;
}
radio *= (*itr) / __gcd(radio, *itr);
if (radio > m) {
cout << 0 << endl;
// goto fin;
return 0;
}
}
// fin:
ll fa = radio, fb = radio * 3;
ans = 1 + (m - fa) / (fb - fa);
cout << ans << endl;
return 0;
}
/*
3+6n =3(1+2n) n=2,7,12 ...1+5b (9)
5+10m=5(1+2m) m=1,4,7,....1+3a (12)
50 10 1,4(9) ...2
7(1+2a)
11(1+2b)
20(1+2c)
100 5
(1+2a)
3(1+2b) 1,2...n
1000000000 33333333
*/
| replace | 53 | 54 | 53 | 54 | -8 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
ll two(ll n) {
ll c = 0;
while (n % (0x01 << (c + 1)) == 0) {
c++;
}
return c;
}
ll solve() {
int N;
ll M;
cin >> N >> M;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = a[i] / 2;
}
ll lc = a[0];
ll nt = two(a[0]);
for (int i = 1; i < N; i++) {
if (two(a[i]) != nt) {
return 0;
}
lc = lcm(lc, a[i]);
}
ll d = M / lc;
return (d / 2) + (d % 2);
}
int main() {
cout << solve() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
// return a * (b / gcd(a, b));
return a * (b / __gcd(a, b));
}
ll two(ll n) {
ll c = 0;
while (n % (0x01 << (c + 1)) == 0) {
c++;
}
return c;
}
ll solve() {
int N;
ll M;
cin >> N >> M;
vector<ll> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = a[i] / 2;
}
ll lc = a[0];
ll nt = two(a[0]);
for (int i = 1; i < N; i++) {
if (two(a[i]) != nt) {
return 0;
}
lc = lcm(lc, a[i]);
}
ll d = M / lc;
return (d / 2) + (d % 2);
}
int main() {
cout << solve() << endl;
return 0;
}
| replace | 14 | 15 | 14 | 18 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD_1_000_000_007 (1000000007LL)
#define LINF (1LL << 60)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i < (long long)(n); i++)
#define rep2(i, n) for (long long i = 2; i < (long long)(n); i++)
#define rep0c(i, n) for (long long i = 0; i <= (long long)(n); i++)
#define rep1c(i, n) for (long long i = 1; i <= (long long)(n); i++)
#define rep2c(i, n) for (long long i = 2; i <= (long long)(n); i++)
#define repc0(n, i) for (long long i = (long long)(n); i >= 0; i--)
#define repc1(n, i) for (long long i = (long long)(n); i >= 1; i--)
#define repc2(n, i) for (long long i = (long long)(n); i >= 2; i--)
namespace solver {
using namespace std;
typedef long long ll;
ll N, M, A[100010];
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll c = gcd(a, b);
return a / c * b;
}
void init() {
scanf("%lld %lld", &N, &M);
rep(i, N) {
scanf("%lld", A + i);
A[i] /= 2;
}
}
void solve() {
while (A[0] % 2 == 0) {
rep(i, N) if (A[i] % 2 == 0) { A[i] /= 2; }
else {
printf("0\n");
return;
}
M /= 2;
}
rep(i, N) if (A[i] % 2 == 0) {
printf("0\n");
return;
}
ll acc = A[0];
rep1(i, N) acc = lcm(A[i], acc);
ll ans = 0;
ll a = M / acc;
if (a % 2)
ans = (a + 1) / 2;
else
ans = a / 2;
printf("%lld\n", ans);
}
} // namespace solver
int main() {
solver::init();
solver::solve();
return 0;
} | #include <bits/stdc++.h>
#define MOD_1_000_000_007 (1000000007LL)
#define LINF (1LL << 60)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i < (long long)(n); i++)
#define rep2(i, n) for (long long i = 2; i < (long long)(n); i++)
#define rep0c(i, n) for (long long i = 0; i <= (long long)(n); i++)
#define rep1c(i, n) for (long long i = 1; i <= (long long)(n); i++)
#define rep2c(i, n) for (long long i = 2; i <= (long long)(n); i++)
#define repc0(n, i) for (long long i = (long long)(n); i >= 0; i--)
#define repc1(n, i) for (long long i = (long long)(n); i >= 1; i--)
#define repc2(n, i) for (long long i = (long long)(n); i >= 2; i--)
namespace solver {
using namespace std;
typedef long long ll;
ll N, M, A[100010];
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll c = gcd(a, b);
return a / c * b;
}
void init() {
scanf("%lld %lld", &N, &M);
rep(i, N) {
scanf("%lld", A + i);
A[i] /= 2;
}
}
void solve() {
while (A[0] % 2 == 0) {
rep(i, N) if (A[i] % 2 == 0) { A[i] /= 2; }
else {
printf("0\n");
return;
}
M /= 2;
}
rep(i, N) if (A[i] % 2 == 0) {
printf("0\n");
return;
}
ll acc = A[0];
rep1(i, N) {
acc = lcm(A[i], acc);
if (acc > M) {
printf("0\n");
return;
}
}
ll ans = 0;
ll a = M / acc;
if (a % 2)
ans = (a + 1) / 2;
else
ans = a / 2;
printf("%lld\n", ans);
}
} // namespace solver
int main() {
solver::init();
solver::solve();
return 0;
} | replace | 55 | 56 | 55 | 62 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout << " ";
for (int i = 0; i < v[0].size(); i++)
cout << i << " ";
cout << endl;
for (int i = 0; i < v.size(); i++) {
cout << "i=" << i << ": ";
for (int j = 0; j < v[i].size(); j++) {
if (v[i][j] == 0)
cout << "\x1B[0m" << v[i][j] << " ";
else
cout << "\x1B[31m" << v[i][j]
<< " "; // https://stackoverrun.com/ja/q/12618775
}
cout << "\x1B[0m" << endl;
}
}
ll GCD(ll a, ll b) {
if (a < b)
std::swap(a, b);
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
// return a * b/GCD(a, b);;
return a / GCD(a, b) * b; // オーバーフローしないように先にgcd(a, b)で割る
}
int num_2(ll x) {
int res = 0;
while (x % 2 == 0) {
res++;
x /= 2;
}
return res;
}
int main() {
int N;
ll M;
cin >> N >> M;
vector<ll> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
a[i] = a[i] >> 1;
for (int i = 0; i < N - 1; i++) {
if (num_2(a[i]) != num_2(a[i + 1])) {
cout << 0 << endl;
return 0;
}
}
// cout << " a: "; print_vec(a);
// cout << " num2: " << num_2(a[0]) << endl;
if (N == 1)
a.push_back(1);
ll lcm = LCM(a[0], a[1]);
for (int i = 0; i < N; i++) {
lcm = LCM(lcm, a[i]);
}
// cout << " gcd: " << GCD(a[0], a[1]) << " lcm: " << lcm << endl;
if (lcm > M) {
cout << 0 << endl;
return 0;
}
ll ans = (M / lcm + 2 - 1) / 2; // (M/lcm) / 2の切り上げ;
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
cout << " ";
for (int i = 0; i < v[0].size(); i++)
cout << i << " ";
cout << endl;
for (int i = 0; i < v.size(); i++) {
cout << "i=" << i << ": ";
for (int j = 0; j < v[i].size(); j++) {
if (v[i][j] == 0)
cout << "\x1B[0m" << v[i][j] << " ";
else
cout << "\x1B[31m" << v[i][j]
<< " "; // https://stackoverrun.com/ja/q/12618775
}
cout << "\x1B[0m" << endl;
}
}
ll GCD(ll a, ll b) {
// if(a < b) std::swap(a, b);//これ入れたらTLEになった
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
// return a * b/GCD(a, b);;
return a / GCD(a, b) * b; // オーバーフローしないように先にgcd(a, b)で割る
}
int num_2(ll x) {
int res = 0;
while (x % 2 == 0) {
res++;
x /= 2;
}
return res;
}
int main() {
int N;
ll M;
cin >> N >> M;
vector<ll> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
a[i] = a[i] >> 1;
for (int i = 0; i < N - 1; i++) {
if (num_2(a[i]) != num_2(a[i + 1])) {
cout << 0 << endl;
return 0;
}
}
// cout << " a: "; print_vec(a);
// cout << " num2: " << num_2(a[0]) << endl;
if (N == 1)
a.push_back(1);
ll lcm = LCM(a[0], a[1]);
for (int i = 0; i < N; i++) {
lcm = LCM(lcm, a[i]);
}
// cout << " gcd: " << GCD(a[0], a[1]) << " lcm: " << lcm << endl;
if (lcm > M) {
cout << 0 << endl;
return 0;
}
ll ans = (M / lcm + 2 - 1) / 2; // (M/lcm) / 2の切り上げ;
cout << ans << endl;
}
| replace | 31 | 33 | 31 | 32 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long gcd(int a, int b) {
int x = max(a, b);
int y = min(a, b);
if (y == 0) {
return x;
} else {
return gcd(x % y, y);
}
}
long long gmv(long long a, long long b) {
long long g = gcd(a, b);
return a * b / g;
}
long long gcdv(vector<long long> v) {
long long res = 1;
for (int i = 0; i < n; i++) {
res = gmv(v[i], res);
if ((res / v[i]) % 2 == 0) {
return 0;
}
}
return res;
}
int main() {
cin >> n >> m;
vector<long long> a(n + 1);
int tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
a[i] = tmp / 2;
}
long long res = gcdv(a);
if (res == 0) {
cout << 0 << endl;
return 0;
} else {
cout << (m / res + 1) / 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long gcd(int a, int b) {
int x = max(a, b);
int y = min(a, b);
if (y == 0) {
return x;
} else {
return gcd(x % y, y);
}
}
long long gmv(long long a, long long b) {
long long g = gcd(a, b);
return a * b / g;
}
long long gcdv(vector<long long> v) {
long long res = 1;
for (int i = 0; i < n; i++) {
res = gmv(v[i], res);
if ((res / v[i]) % 2 == 0 || res > m) {
return 0;
}
}
return res;
}
int main() {
cin >> n >> m;
vector<long long> a(n + 1);
int tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
a[i] = tmp / 2;
}
long long res = gcdv(a);
if (res == 0) {
cout << 0 << endl;
return 0;
} else {
cout << (m / res + 1) / 2 << endl;
}
return 0;
}
| replace | 23 | 24 | 23 | 24 | TLE | |
p02814 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll MOD = 1e9 + 7;
const int INF = 1 << 30;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cout << fixed << setprecision(15);
ll N;
cin >> N;
ll M;
cin >> M;
vector<ll> v(N);
ll x;
cin >> x;
ll sum = 1;
while (x % 2 == 0) {
x /= 2;
sum = sum * 2;
}
v[0] = x;
for (int i = 1; i < N; i++) {
double y;
cin >> y;
if ((int)(y / sum) != (y / sum) || (int)(y / sum) % 2 == 0) {
cout << 0 << endl;
return 0;
} else {
v[i] = (y / sum);
}
}
ll LCM = 1;
rep(i, N) { LCM = lcm(LCM, v[i]); }
ll LCM0 = LCM * (sum / 2);
if (LCM0 <= M) {
ll ans = (M - LCM0) / (LCM0 * 2) + 1;
cout << ans << endl;
} else {
cout << 0 << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
const ll MOD = 1e9 + 7;
const int INF = 1 << 30;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cout << fixed << setprecision(15);
ll N;
cin >> N;
ll M;
cin >> M;
vector<ll> v(N);
ll x;
cin >> x;
ll sum = 1;
while (x % 2 == 0) {
x /= 2;
sum = sum * 2;
}
v[0] = x;
for (int i = 1; i < N; i++) {
double y;
cin >> y;
if ((int)(y / sum) != (y / sum) || (int)(y / sum) % 2 == 0) {
cout << 0 << endl;
return 0;
} else {
v[i] = (y / sum);
}
}
ll LCM = 1;
rep(i, N) {
LCM = lcm(LCM, v[i]);
if (LCM > M) {
cout << 0 << endl;
return 0;
}
}
ll LCM0 = LCM * (sum / 2);
if (LCM0 <= M) {
ll ans = (M - LCM0) / (LCM0 * 2) + 1;
cout << ans << endl;
} else {
cout << 0 << endl;
}
} | replace | 59 | 60 | 59 | 66 | 0 | |
p02814 | C++ | Runtime Error | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define PI acos(-1LL)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a * b) / gcd(a, b))
void solve();
int32_t main() {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
void solve() {
int i, j;
int n, m;
cin >> n >> m;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
a[i] /= 2;
}
int lc = 1;
for (i = 0; i < n; i++) {
lc = lcm(lc, a[i]);
}
int flag = 0;
for (int i = 1; i <= n; i++) {
int temp = lc * 2 / a[i];
if (temp % 2 == 0) {
flag = 1;
break;
}
}
d(lc);
if (flag) {
cout << 0 << endl;
return;
}
int multi = m / lc;
d(multi);
multi = ceil(multi / (long double)2);
cout << multi << endl;
} | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define PI acos(-1LL)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a * b) / gcd(a, b))
void solve();
int32_t main() {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
void solve() {
int i, j;
int n, m;
cin >> n >> m;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
a[i] /= 2;
}
int lc = 1;
for (i = 0; i < n; i++) {
lc = lcm(lc, a[i]);
}
int flag = 0;
for (int i = 0; i < n; i++) {
int temp = (lc) / a[i];
if (temp % 2 == 0) {
flag = 1;
break;
}
}
d(lc);
if (flag) {
cout << 0 << endl;
return;
}
int multi = m / lc;
d(multi);
multi = ceil(multi / (long double)2);
cout << multi << endl;
} | replace | 64 | 66 | 64 | 66 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ok(ll n) {
ll k = n;
ll cu = 0;
while (k % 2 == 0) {
k /= 2;
cu++;
}
return cu;
}
int main() {
ll n, m;
vll a(n);
rep(i, n) { cin >> a[i]; }
rep(i, n) { a[i] /= 2; }
ll k = ok(a[0]);
rep(i, n) {
if (ok(a[i]) != k) {
COUT(0);
return 0;
}
a[i] >>= k;
}
m >>= k;
ll j = 1;
rep(i, n) {
j = lcm(j, a[i]);
if (j > m) {
cout << 0 << endl;
return 0;
}
}
m /= j;
COUT((m + 1) / 2);
return 0;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ok(ll n) {
ll k = n;
ll cu = 0;
while (k % 2 == 0) {
k /= 2;
cu++;
}
return cu;
}
int main() {
ll n, m;
cin >> n >> m;
vll a(n);
rep(i, n) { cin >> a[i]; }
rep(i, n) { a[i] /= 2; }
ll k = ok(a[0]);
rep(i, n) {
if (ok(a[i]) != k) {
COUT(0);
return 0;
}
a[i] >>= k;
}
m >>= k;
ll j = 1;
rep(i, n) {
j = lcm(j, a[i]);
if (j > m) {
cout << 0 << endl;
return 0;
}
}
m /= j;
COUT((m + 1) / 2);
return 0;
}
| insert | 50 | 50 | 50 | 51 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.