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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02844 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, check;
string S;
int ans = 0;
vector<int> p(100);
cin >> N >> S;
for (int i = 0; i < 1000; i++) {
check = 0;
p.at(2) =... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, check;
string S;
int ans = 0;
vector<int> p(100, 10);
cin >> N >> S;
for (int i = 0; i < 1000; i++) {
check = 0;
p.at(... | replace | 13 | 14 | 13 | 14 | 0 | |
p02844 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define eb emplace_back
#define mp make_pair
using namespace std;
string s, t;
int n, ans;
bool check() {
for (int i = 0; i < s.length(); i++) {
if (s[i] == t[0]) {
for (int j = i + 1; j < s.le... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define eb emplace_back
#define mp make_pair
using namespace std;
string s, t;
int n, ans;
bool check() {
for (int i = 0; i < s.length(); i++) {
if (s[i] == t[0]) {
for (int j = i + 1; j < s.le... | insert | 19 | 19 | 19 | 20 | TLE | |
p02844 | C++ | Runtime Error | #include <bits/stdc++.h>
int n, m;
std::map<std::string, int> cnt;
std::string s;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n;
std::cin >> s;
std::vector<int> max_pos(n, -1);
std::vector<int> min_pos(n, n + 1);
for (int i = 0; i <= 9; ++i)
min_pos[i] = n + 1, ma... | #include <bits/stdc++.h>
int n, m;
std::map<std::string, int> cnt;
std::string s;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n;
std::cin >> s;
std::vector<int> max_pos(10, -1);
std::vector<int> min_pos(10, n + 1);
for (int i = 0; i <= 9; ++i)
min_pos[i] = n + 1, ... | replace | 9 | 11 | 9 | 11 | -6 | malloc(): corrupted top size
|
p02844 | C++ | Time Limit Exceeded | // INCLUDE
//------------------------------------------
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
// DEFINE
//------------------------------------------
#define ll long long
#define ALLv(a) (a).begin(), (a).... | // INCLUDE
//------------------------------------------
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
// DEFINE
//------------------------------------------
#define ll long long
#define ALLv(a) (a).begin(), (a).... | replace | 43 | 46 | 43 | 67 | TLE | |
p02844 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N;
string S;
int dp[30000][11][11][11];
bool used[10][10][10];
int ans;
void dfs(int n, int a, int b, int c) {
if (dp[n][a][b][c])
return;
dp[n][a][b][c] = 1;
if (n == N || c < 10) {
if (a < 10 && b < 10 && c < 10) {
if (!used[a][b][c])
an... | #include <bits/stdc++.h>
using namespace std;
int N;
string S;
int dp[30010][11][11][11];
bool used[10][10][10];
int ans;
void dfs(int n, int a, int b, int c) {
if (dp[n][a][b][c])
return;
dp[n][a][b][c] = 1;
if (n == N || c < 10) {
if (a < 10 && b < 10 && c < 10) {
if (!used[a][b][c])
an... | replace | 6 | 7 | 6 | 7 | -11 | |
p02844 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define ll long long
#define mp make_pair
#define pb push_back
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
template <typename T> void ckmax(T &a, T b) {
if (b >... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define ll long long
#define mp make_pair
#define pb push_back
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
template <typename T> void ckmax(T &a, T b) {
if (b >... | replace | 17 | 18 | 17 | 18 | 0 | |
p02844 | C++ | Runtime Error | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<int>> s;
void find(vector<int> a, int k) {
for (int i = 0; i < 10; i++) {
vector... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<int>> s;
void find(vector<int> a, int k) {
for (int i = 0; i < 10; i++) {
vector... | replace | 22 | 26 | 22 | 26 | 0 | Time: 0.000003
|
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | replace | 35 | 37 | 35 | 42 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vec... | replace | 81 | 82 | 81 | 82 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#incl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#incl... | replace | 113 | 117 | 113 | 117 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vp vector<P>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vp vector<P>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int... | replace | 75 | 76 | 75 | 79 | 0 | |
p02845 | Python | Runtime Error | MOD = 1000000007
n = int(input())
A = list(map(int, input().split()))
vec = [0, 0, 0]
num = 1
for a in A:
idx = [i for i, x in enumerate(vec) if x == a]
num = (num * len(idx)) % MOD
vec[idx[0]] += 1
print(num)
| MOD = 1000000007
n = int(input())
A = list(map(int, input().split()))
vec = [0, 0, 0]
num = 1
for a in A:
idx = [i for i, x in enumerate(vec) if x == a]
if len(idx) == 0:
print(0)
exit()
num = (num * len(idx)) % MOD
vec[idx[0]] += 1
print(num)
| insert | 10 | 10 | 10 | 13 | 0 | |
p02845 | Python | Runtime Error | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def main():
MOD = 1000000007
N, *A = map(int, read().split())
C = [0] * N
C[0] = 3
ans = 1
for a in A:
ans = ans * C[a] % MOD
if ans == 0:
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def main():
MOD = 1000000007
N, *A = map(int, read().split())
C = [0] * (N + 1)
C[0] = 3
ans = 1
for a in A:
ans = ans * C[a] % MOD
if ans ... | replace | 12 | 13 | 12 | 13 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02845/Python/s718829903.py", line 30, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02845/Python/s718829903.py", line 22, in main
C[a + 1] += 1
IndexError: list i... |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<string> vst;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll mod = (1e+9) + 7;
const ll inf = 1e+16;
#define rep(i, m, n) for (ll i = m; i < n; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<string> vst;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
const ll mod = (1e+9) + 7;
const ll inf = 1e+16;
#define rep(i, m, n) for (ll i = m; i < n; i... | replace | 27 | 28 | 27 | 28 | 0 | |
p02845 | Python | Runtime Error | #!/usr/bin/python3
import os
import sys
def main():
N = read_int()
A = read_ints()
print(solve(N, A))
MOD = 1000000007
def solve(N, A):
c = 1
nums = [0, 0, 0]
for a in A:
z = nums.count(a)
c *= z
c %= MOD
nums[nums.index(a)] = a + 1
return c
#######... | #!/usr/bin/python3
import os
import sys
def main():
N = read_int()
A = read_ints()
print(solve(N, A))
MOD = 1000000007
def solve(N, A):
c = 1
nums = [0, 0, 0]
for a in A:
z = nums.count(a)
if z == 0:
return 0
c *= z
c %= MOD
nums[nums.i... | insert | 21 | 21 | 21 | 23 | 0 | |
p02845 | Python | Runtime Error | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n, *a = map(int, read().split())
ans = 1
mod = 10**9 + 7
memo = [0, 0, 0]
for check in a:
ans *= memo.count(check)
ans %= mod
memo[memo.index(check)] += 1
print(... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n, *a = map(int, read().split())
ans = 1
mod = 10**9 + 7
memo = [0, 0, 0]
for check in a:
if check in memo:
ans *= memo.count(check)
ans %= mod
m... | replace | 12 | 15 | 12 | 19 | 0 | |
p02845 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <st... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <st... | insert | 139 | 139 | 139 | 143 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define RE... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define RE... | insert | 69 | 69 | 69 | 73 | 0 | |
p02845 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
long long res = 1;
vector<int> C(3);
for (int i = 0; i < N; i++) {
long long cnt = 0, id = -1;
if (A[i] == C[... | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
long long res = 1;
vector<int> C(3);
for (int i = 0; i < N; i++) {
long long cnt = 0, id = -1;
if (A[i] == C[... | insert | 30 | 30 | 30 | 35 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | insert | 66 | 66 | 66 | 70 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.... | insert | 80 | 80 | 80 | 84 | 0 | |
p02845 | C++ | Runtime Error | // https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_e
// E - Colorful Hats 2
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> bo... | // https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_e
// E - Colorful Hats 2
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> bo... | replace | 59 | 60 | 59 | 61 | 0 | |
p02845 | C++ | Runtime Error | // smtb2019_e.cpp
// Sun Dec 1 20:57:22 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typ... | // smtb2019_e.cpp
// Sun Dec 1 20:57:22 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typ... | insert | 39 | 39 | 39 | 43 | 0 | |
p02845 | C++ | Runtime Error | #define MOD 1000000007
#if 1
//------------------------------------------------------------
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <class T> struct Entry {
static void Run() { T().Run(); }
};
struct MyMain;
#if defined(TEST)
#include "test.hpp"
#else
signed main() {
cin.... | #define MOD 1000000007
#if 1
//------------------------------------------------------------
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
template <class T> struct Entry {
static void Run() { T().Run(); }
};
struct MyMain;
#if defined(TEST)
#include "test.hpp"
#else
signed main() {
cin.... | insert | 1,159 | 1,159 | 1,159 | 1,164 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
//=====================================================
// マクロ定義部
//=====================================================
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (ll i = (a); i <= (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rep_... | #include <bits/stdc++.h>
using namespace std;
//=====================================================
// マクロ定義部
//=====================================================
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (ll i = (a); i <= (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rep_... | replace | 89 | 90 | 89 | 90 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "... | #include <bits/stdc++.h>
using namespace std;
// #define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "... | replace | 40 | 41 | 40 | 44 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) { return a + b - mod * (a + b >= mod); }
int mul(int a, int b) { return int(1ll * a * b % mod); }
int power(int a, int x) {
if (x == 0) {
return 1;
}
return mul(power(mul(a, a), x >> 1), (x & 1 ? a : 1));
}
int ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) { return a + b - mod * (a + b >= mod); }
int mul(int a, int b) { return int(1ll * a * b % mod); }
int power(int a, int x) {
if (x == 0) {
return 1;
}
return mul(power(mul(a, a), x >> 1), (x & 1 ? a : 1));
}
int ... | replace | 44 | 45 | 44 | 48 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
int n;
int a[maxn];
int main() {
ios_base::sync_with_stdio(false);
... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
int n;
int a[maxn];
int main() {
ios_base::sync_with_stdio(false);
... | insert | 36 | 36 | 36 | 38 | 0 | |
p02845 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n;
long long a[100002];
long long md = 1000000007ll;
map<pair<pair<int, int>, pair<int, int>>, long long> mp;
long long slv(int id, int rd, int bl, int gr) {
// cout<<id<<" "<<rd<<" "<<bl<<" "<<gr<<endl;
if (id == -1) {
if (rd <= 0 && bl <= 0 && gr <= ... | #include <bits/stdc++.h>
using namespace std;
long long n;
long long a[100002];
long long md = 1000000007ll;
map<pair<pair<int, int>, pair<int, int>>, long long> mp;
long long slv(int id, int rd, int bl, int gr) {
// cout<<id<<" "<<rd<<" "<<bl<<" "<<gr<<endl;
if (id == -1) {
if (rd <= 0 && bl <= 0 && gr <= ... | insert | 19 | 19 | 19 | 28 | TLE | |
p02845 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 1000000007;
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
ll gcd(ll a, ll b) { re... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 1000000007;
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
ll gcd(ll a, ll b) { re... | insert | 48 | 48 | 48 | 52 | 0 | |
p02845 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
co... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
co... | insert | 126 | 126 | 126 | 130 | 0 | |
p02845 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
// vector string deque break continue
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define fs first
#define sc second
#define... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
// vector string deque break continue
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define fs first
#define sc second
#define... | insert | 51 | 51 | 51 | 54 | 0 | |
p02845 | C++ | Runtime Error | #include <iostream>
#include <set>
using namespace std;
long long int MOD = 1000000007;
int N;
int A[100005];
multiset<int> S;
long long int dp[100005];
int main(void) {
cin >> N;
dp[0] = 1;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 2; i++) {
S.insert(0);
}
for (... | #include <iostream>
#include <set>
using namespace std;
long long int MOD = 1000000007;
int N;
int A[100005];
multiset<int> S;
long long int dp[100005];
int main(void) {
cin >> N;
dp[0] = 1;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i <= 2; i++) {
S.insert(0);
}
for (... | insert | 29 | 29 | 29 | 33 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
vect... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
vect... | insert | 28 | 28 | 28 | 31 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | replace | 185 | 186 | 185 | 192 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | replace | 57 | 58 | 57 | 61 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#inc... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#inc... | replace | 80 | 81 | 80 | 81 | 0 | |
p02845 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define d_5 100000
#define d9_7 1000000007
#define vll vector<vector<long long>>
#define vl vector<long long>
#define ... | #include "bits/stdc++.h"
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define d_5 100000
#define d9_7 1000000007
#define vll vector<vector<long long>>
#define vl vector<long long>
#define ... | replace | 26 | 28 | 26 | 42 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll MOD = 1000000007;
// const ll MOD=998244353;
template <typename T, typename U>
istream &operator>>... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll MOD = 1000000007;
// const ll MOD=998244353;
template <typename T, typename U>
istream &operator>>... | insert | 53 | 53 | 53 | 57 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N);
int maxA = 0;
rep(i, N) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N);
int maxA = 0;
rep(i, N) {
cin >> ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 10000... | #include <bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll, ll>>
#define pii pair<int, int>
#define REP(i, a) for (int(i) = 0; (i) < (a); (i)++)
#define RREP(i, a) for (int(i) = a - 1; (i) >= (0); (i)--)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define MOD 10000... | insert | 47 | 47 | 47 | 51 | 0 | |
p02845 | Python | Runtime Error | import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
rbg = [-1, -1, -1]
ans = 1
mod = 10**9 + 7
for A in a:
ans *= rbg.count(A - 1)
ans %= mod
rbg[rbg.index(A - 1)] = A
print(ans)
| import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
rbg = [-1, -1, -1]
ans = 1
mod = 10**9 + 7
for A in a:
ans *= rbg.count(A - 1)
ans %= mod
for i in range(3):
if rbg[i] == A - 1:
rbg[i] = A
break
print(ans)
| replace | 13 | 14 | 13 | 17 | 0 | |
p02845 | Python | Runtime Error | import sys
readline = sys.stdin.buffer.readline
n = int(readline())
A = map(int, readline().split())
mod = 1000000007
caps = [0] * 3
ans = 1
for a in A:
ans *= caps.count(a)
caps[caps.index(a)] += 1
ans %= mod
print(ans)
| import sys
readline = sys.stdin.buffer.readline
n = int(readline())
A = map(int, readline().split())
mod = 1000000007
caps = [0] * 3
ans = 1
for a in A:
ans *= caps.count(a)
# caps[caps.index(a)] += 1
for i in range(3):
if caps[i] == a:
caps[i] += 1
break
ans %= mod
pri... | replace | 11 | 12 | 11 | 16 | 0 | |
p02845 | Python | Runtime Error | n = int(input())
a = list(map(int, input().split()))
mod = 10**9 + 7
ans = 1
cnt = [0, 0, 0]
for i in a:
ans *= cnt.count(i)
cnt[cnt.index(i)] += 1
ans %= mod
print(ans)
| n = int(input())
a = list(map(int, input().split()))
mod = 10**9 + 7
ans = 1
cnt = [0, 0, 0]
for i in a:
ans *= cnt.count(i)
for j in range(3):
if cnt[j] == i:
cnt[j] += 1
break
ans %= mod
print(ans)
| replace | 8 | 9 | 8 | 12 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll ans = 1;
multiset<int> se{0, 0, 0};
for (int i = 0; i < N; ++i) {
ans *= se.count(A[i]);
ans %= mod;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define mod 1000000007
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll ans = 1;
multiset<int> se{0, 0, 0};
for (int i = 0; i < N; ++i) {
ans *= se.count(A[i]);
if (se.count(... | insert | 18 | 18 | 18 | 22 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// ----------------------------------------------------------------------
ll MOD = 1e9 + 7;
// ll MOD = 998244353;
// g = eGCD(a, b, s, t) ---> sa + tb = g
constexpr ll eGCD(ll a, ll b, ll &s, ll &t) {
if (a == 0) {
s ... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// ----------------------------------------------------------------------
ll MOD = 1e9 + 7;
// ll MOD = 998244353;
// g = eGCD(a, b, s, t) ---> sa + tb = g
constexpr ll eGCD(ll a, ll b, ll &s, ll &t) {
if (a == 0) {
s ... | replace | 144 | 145 | 144 | 148 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long mod = 1000000007;
const int INF = 1001001001;
int main() {
ll n;
cin >> n;
ll ans = 1;
vector<ll> count(40000, 0);
for (ll i = 0; i < n; i++) {
ll scope;
cin >> scope;
if (scope == 0) {
ans = ans * (3 - (count.at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long mod = 1000000007;
const int INF = 1001001001;
int main() {
ll n;
cin >> n;
ll ans = 1;
vector<ll> count(100001, 0);
for (ll i = 0; i < n; i++) {
ll scope;
cin >> scope;
if (scope == 0) {
ans = ans * (3 - (count.at... | replace | 10 | 11 | 10 | 11 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1000000007;
// const int mod = 998244353;
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1000000007;
// const int mod = 998244353;
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++... | insert | 29 | 29 | 29 | 34 | 0 | 0 1 2 3 4 5
0 0 0 0 0 0
0 0 0 0 0 0
3 1 1 1 1 1 |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vecto... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vecto... | insert | 101 | 101 | 101 | 105 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | #include <bits/stdc++.h>
#ifdef _DEBUG
#define debug(x) \
cerr << "line: " << __LINE__ << ", func: " << __func__ << " -> " << #x \
<< " = " << x << endl
#else
#define debug(x)
#endif
#define all(s) begin(s), end(s)
#define rall(s) rbegin(s),... | replace | 64 | 65 | 64 | 65 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> T pow(T a, long long n, T e = 1) {
T ret = e;
while (n) {
if (n & 1)
ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod ... | #include <bits/stdc++.h>
using namespace std;
template <typename T> T pow(T a, long long n, T e = 1) {
T ret = e;
while (n) {
if (n & 1)
ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod ... | replace | 91 | 92 | 91 | 93 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// int/long: -2,147,483,648 - 2,147,483,648 (-2^31 <= int < 2^31)
// long/long long: -9,223,372,036,854,775,808 - 9,223,372,036,854,775,807
// (-2^63 <= long < 2^63)
#define INF (1 << 29)
// 536,870,912
// lower_bound(A.begin(), A.end(), N)
// upper_bound(...
// A.eras... | #include <bits/stdc++.h>
using namespace std;
// int/long: -2,147,483,648 - 2,147,483,648 (-2^31 <= int < 2^31)
// long/long long: -9,223,372,036,854,775,808 - 9,223,372,036,854,775,807
// (-2^63 <= long < 2^63)
#define INF (1 << 29)
// 536,870,912
// lower_bound(A.begin(), A.end(), N)
// upper_bound(...
// A.eras... | insert | 54 | 54 | 54 | 58 | 0 | |
p02845 | C++ | Runtime Error | #include <stdio.h>
constexpr int kMod = int(1E9 + 7);
constexpr int kN = int(1E5 + 10);
int a[kN];
int main() {
int n, cnt, x = 0, y = 0, z = 0;
long long int ans = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
cnt = 0;
if (x == a[i])
cnt... | #include <stdio.h>
constexpr int kMod = int(1E9 + 7);
constexpr int kN = int(1E5 + 10);
int a[kN];
int main() {
int n, cnt, x = 0, y = 0, z = 0;
long long int ans = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
cnt = 0;
if (x == a[i])
cnt... | replace | 25 | 27 | 25 | 26 | 0 | |
p02845 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using namespace literals;
constexpr int Mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> table(N / 3 + 2, 0);
table[0] = 3;
int64_t ans = 1;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
... | #include "bits/stdc++.h"
using namespace std;
using namespace literals;
constexpr int Mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> table(N + 2, 0);
table[0] = 3;
int64_t ans = 1;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
ans ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02845 | C++ | Runtime Error | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#incl... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#incl... | insert | 143 | 143 | 143 | 147 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i-- > 0;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define ... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i-- > 0;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define ... | replace | 701 | 702 | 701 | 702 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define eb emplace_back
#define mp make_pair
using namespace std;
multiset<int> s;
int n, x;
ll ans = 1;
const int mod = 1e9 + 7;
int main() {
cin >> n;
s.insert(0), s.insert(0), s.insert(0);
for (in... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define eb emplace_back
#define mp make_pair
using namespace std;
multiset<int> s;
int n, x;
ll ans = 1;
const int mod = 1e9 + 7;
int main() {
cin >> n;
s.insert(0), s.insert(0), s.insert(0);
for (in... | replace | 17 | 19 | 17 | 21 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#de... | insert | 36 | 36 | 36 | 40 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
/* #include <atcoder/all> */
#include <iostream>
using namespace std;
/* using namespace atcoder; */
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) ... | #include <bits/stdc++.h>
/* #include <atcoder/all> */
#include <iostream>
using namespace std;
/* using namespace atcoder; */
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) ... | replace | 52 | 53 | 52 | 53 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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 (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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 (a > b) {
a = b;
return 1;
}... | replace | 113 | 114 | 113 | 114 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define MOD (int)(1e9 + 7)
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> B(3);
long long ans = 1;
for (in... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define MOD (int)(1e9 + 7)
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> B(3);
long long ans = 1;
for (in... | insert | 33 | 33 | 33 | 36 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i... | replace | 30 | 32 | 30 | 37 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define LL long long
#define LD long double
multiset<int> s;
const int mod = 1e9 + 7;
int n, a[100005];
LL ans = 1;
int main() {
scanf("%d", &n);
for (int i = 1; i <= 3; ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define LL long long
#define LD long double
multiset<int> s;
const int mod = 1e9 + 7;
int n, a[100005];
LL ans = 1;
int main() {
scanf("%d", &n);
for (int i = 1; i <= 3; ... | replace | 21 | 23 | 21 | 25 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
cout << "{";
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
cout << "{";
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
cou... | delete | 20 | 22 | 20 | 20 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0,... | replace | 50 | 51 | 50 | 51 | 0 | |
p02845 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
long long ans = 1;
vector<long long> v(3, 0);
for (int i = 0; i < N; i++) {
long long cnt = 0;
int flag = -1;... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
long long ans = 1;
vector<long long> v(3, 0);
for (int i = 0; i < N; i++) {
long long cnt = 0;
int flag = 0;
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(... | replace | 51 | 52 | 51 | 52 | 0 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
int l;
cin >> l;
a[i] = l + 1;
}
long long m = 1000000007;
int b[n];
for (int i = 0; i < n + 1; i++)
b[i] = 0;
long long dp[100010];
dp[0] = 1;
b[0] = 3;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
int l;
cin >> l;
a[i] = l + 1;
}
long long m = 1000000007;
int b[n];
for (int i = 0; i < n + 1; i++)
b[i] = 0;
long long dp[100010];
dp[0] = 1;
b[0] = 3;
for (int ... | replace | 20 | 23 | 20 | 23 | -11 | |
p02845 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1e9
#define MOD 1000000007
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool ... | #include <bits/stdc++.h>
#define INF 1e9
#define MOD 1000000007
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool ... | insert | 39 | 39 | 39 | 43 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inc... | insert | 93 | 93 | 93 | 98 | 0 | |
p02845 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
ll ret = 1;
vector<int> v(3, -1);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int idx = -1;
int count = 0;
for (int j = 0; j < 3; j++) {
i... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
ll ret = 1;
vector<int> v(3, -1);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int idx = -1;
int count = 0;
for (int j = 0; j < 3; j++) {
i... | insert | 26 | 26 | 26 | 30 | 0 | |
p02845 | C++ | Runtime Error |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#i... |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#i... | insert | 87 | 87 | 87 | 90 | 0 | |
p02845 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | insert | 146 | 146 | 146 | 151 | 0 | |
p02846 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x;... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x;... | replace | 44 | 45 | 44 | 45 | TLE | |
p02846 | C++ | Runtime Error | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include ... | replace | 104 | 105 | 104 | 109 | -6 | 4a75dce1-7224-4568-8687-29e9d1b0858e.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02846/C++/s473071620.cpp:106: int main(): Assertion `false' failed.
|
p02846 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02846 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
LL T1, T2, A1, A2, B1, B2;
cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;
LL D1 = A1 - B1, D2 = A2 - B2;
if (D1 > 0) {
D1 = -D1;
D2 = -D2;... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
LL T1, T2, A1, A2, B1, B2;
cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;
LL D1 = A1 - B1, D2 = A2 - B2;
if (D1 > 0) {
D1 = -D1;
D2 = -D2;... | replace | 22 | 23 | 22 | 23 | 0 | |
p02846 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
int main() {
ll t1, t2, a1, a2, b1, b2;
cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;
if (a1 < b1) {
swap(a1, b1);
swap(a2, b2);
}
// かならず a1 > b1
ll d = (t1 * ... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
int main() {
ll t1, t2, a1, a2, b1, b2;
cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;
if (a1 < b1) {
swap(a1, b1);
swap(a2, b2);
}
// かならず a1 > b1
ll d = (t1 * ... | replace | 28 | 34 | 28 | 30 | TLE | |
p02846 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint t1, t2;
cin >> t1 >> t2;
lint a1, a2, b1, b2;
cin >> a1 >> a2 >> b1 >> b2;
lint P = (a1 - b1) * t1;
lint Q = (a2 - b2) * t2;
if (P > 0)
P *= -1, Q *= -1;
if (P == Q) {
cout << "infinity" << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint t1, t2;
cin >> t1 >> t2;
lint a1, a2, b1, b2;
cin >> a1 >> a2 >> b1 >> b2;
lint P = (a1 - b1) * t1;
lint Q = (a2 - b2) * t2;
if (P > 0)
P *= -1, Q *= -1;
if (P == -Q) {
cout << "infinity" << endl;
ret... | replace | 13 | 14 | 13 | 14 | 0 | |
p02846 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll t1, t2, a1, a2, b1, b2;
cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;
if (t1 * a1 + t2 * a2 == t1 * b1 + t1 * b2) {
cout << "infinity" << endl;
return 0;
}
ll c1 = a1 - b1;
ll c2 = a2 - b2;
if (c1 < 0) {
c1 *= -1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll t1, t2, a1, a2, b1, b2;
cin >> t1 >> t2 >> a1 >> a2 >> b1 >> b2;
if (t1 * a1 + t2 * a2 == t1 * b1 + t2 * b2) {
cout << "infinity" << endl;
return 0;
}
ll c1 = a1 - b1;
ll c2 = a2 - b2;
if (c1 < 0) {
c1 *= -1;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02846 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll t1, t2, a1, a2, b1, b2;
int main() {
cin >> t1 >> t2;
cin >> a1 >> a2;
cin >> b1 >> b2;
if (a1 * t1 + a2 * t2 > b1 * t1 + b2 * t2)
swap(a1, b1), swap(a2, b2);
a1 *= t1;
a2 *= t2;
b1 *= t1;
b2 *= t2;
ll tota = a1 + a2, totb = b1 ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll t1, t2, a1, a2, b1, b2;
int main() {
cin >> t1 >> t2;
cin >> a1 >> a2;
cin >> b1 >> b2;
if (a1 * t1 + a2 * t2 > b1 * t1 + b2 * t2)
swap(a1, b1), swap(a2, b2);
a1 *= t1;
a2 *= t2;
b1 *= t1;
b2 *= t2;
ll tota = a1 + a2, totb = b1 ... | replace | 18 | 24 | 18 | 24 | 0 | |
p02846 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll ... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll ... | replace | 72 | 73 | 72 | 76 | 0 | 10 12 2
20 8 12
30 20
10 2
|
p02847 | Python | Runtime Error | arr = ["NONE", "SAT", " FRI", "THU", "WED", "TUE", "MON", "SUN"]
s = input()
print(arr.index(s))
| arr = ["NONE", "SAT", "FRI", "THU", "WED", "TUE", "MON", "SUN"]
s = input()
print(arr.index(s))
| replace | 0 | 1 | 0 | 1 | 0 | |
p02847 | Python | Runtime Error | s = input()
dic = {"SUN": 6, "MON": 5, "WED": 4, "THU": 3, "FRI": 2, "SAT": 1}
print(dic[s])
| s = input()
dic = {"SUN": 7, "MON": 6, "TUE": 5, "WED": 4, "THU": 3, "FRI": 2, "SAT": 1}
print(dic[s])
| replace | 2 | 3 | 2 | 3 | 0 | |
p02847 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define ll long long
const int MOD = 1e9 + 7;
using namespace std;
int main() {
map<string, int> mp;
mp.insert(make_pair("SUN", 7));
mp.insert(make_pair("MON", 6));
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define ll long long
const int MOD = 1e9 + 7;
using namespace std;
int main() {
map<string, int> mp;
mp.insert(make_pair("SUN", 7));
mp.insert(make_pair("MON", 6));
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02847 | Python | Runtime Error | s = input()
week = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
for i in len(s):
if s == week[i]:
print(7 - i)
break
| s = input()
week = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
for i in range(7):
if s == week[i]:
print(7 - i)
break
| replace | 2 | 3 | 2 | 3 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02847/Python/s523840245.py", line 3, in <module>
for i in len(s):
TypeError: 'int' object is not iterable
|
p02847 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int main() {
string day;
string s[7] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int daycounter;
cin >> day;
for (int i = 0; i < sizeof(s); i++) {
if (day == s[i]) {
daycounter = 7 - i;
}
}
cout << daycounter;
return 0;
} | #include <cstring>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
if (S == "SUN")
cout << "7";
else if (S == "MON")
cout << "6";
else if (S == "TUE")
cout << "5";
else if (S == "WED")
cout << "4";
else if (S == "THU")
cout << "3";
else if (S == "FRI")
c... | replace | 4 | 14 | 4 | 21 | -11 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
map<string, int> week; // 名前→成績
week["SUN"] = 0;
week["MON"] = 1;
week["TUE"] = 2;
week["WEN"] = 3;
week["THU"] = 4;
week["FRI"] = 5;
week["SAT"] = 6;
cout << 7 - week.at(S) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
map<string, int> week; // 名前→成績
week["SUN"] = 0;
week["MON"] = 1;
week["TUE"] = 2;
week["WED"] = 3;
week["THU"] = 4;
week["FRI"] = 5;
week["SAT"] = 6;
cout << 7 - week.at(S) << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | replace | 42 | 43 | 42 | 43 | 1 | |
p02847 | C++ | Runtime Error | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (int i = a; i < b; i++)
#define f2(i, a, b) for (int i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const i... | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (int i = a; i < b; i++)
#define f2(i, a, b) for (int i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const i... | replace | 22 | 27 | 22 | 26 | 0 | |
p02847 | C++ | Runtime Error | /*
@author: sharrad99
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all... | /*
@author: sharrad99
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all... | delete | 19 | 23 | 19 | 19 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fill(a, c) memset(&a, c, sizeof(a))
#define fore(i, x, y) for (ll i = x; i < y; i++)
#define FIN \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fill(a, c) memset(&a, c, sizeof(a))
#define fore(i, x, y) for (ll i = x; i < y; i++)
#define FIN \
ios_base::sync_with_stdio(0); ... | delete | 19 | 22 | 19 | 19 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string s;
cin >> s;
string d[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
for (int i = 0; i < sizeof(d); i++) {
if (s == d[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
string s;
cin >> s;
string d[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
for (int i = 0; i < 7; i++) {
if (s == d[i]) {
... | replace | 10 | 11 | 10 | 11 | -11 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
vector<string> days = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
unordered_map<string, int> days_map;
for (int i = 0; i <= 7; i++) {
days_map[days[i]] = i;
}
string day;
cin >> day;
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
vector<string> days = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
unordered_map<string, int> days_map;
for (int i = 0; i < 7; i++) {
days_map[days[i]] = i;
}
string day;
cin >> day;
cout... | replace | 7 | 8 | 7 | 8 | -11 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
#define fl(i, a, n) for (int i = a; i <= n; i++)
#define pb push_back
#define pob pop_back
#define int long long int
#define ff first
#define ss second
#define pi 3.1415926535898
#define vi vector<int>
#define mi map<int, int>
#define umi unordered_... | #include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
#define fl(i, a, n) for (int i = a; i <= n; i++)
#define pb push_back
#define pob pop_back
#define int long long int
#define ff first
#define ss second
#define pi 3.1415926535898
#define vi vector<int>
#define mi map<int, int>
#define umi unordered_... | replace | 38 | 39 | 38 | 40 | -11 | |
p02847 | 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() {
ios::sync_with_stdio(false);
cin.tie(0);
string s[] = {"MON", "TUE", "WED", "THU", "FRI", "SAT"};
string t;
cin >> t;
rep(i, 7) {
if (t == s[i])... | #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() {
ios::sync_with_stdio(false);
cin.tie(0);
string s[] = {"MON", "TUE", "WED", "THU", "FRI", "SAT"};
string t;
cin >> t;
rep(i, 6) {
if (t == s[i])... | replace | 16 | 17 | 16 | 17 | 0 | |
p02847 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
char s[3];
cin >> s;
if (s[0] == 'S') {
if (s[1] == 'U')
cout << "7";
else
cout << "1";
} else if (s[0] == 'M')
cout << "6";
else if (s[0] == 'T') {
if (s[1] == 'U')
cout << "5";
else
cout << "3";
} else if (s[... | #include <iostream>
using namespace std;
int main() {
char s[10];
cin >> s;
if (s[0] == 'S') {
if (s[1] == 'U')
cout << "7";
else
cout << "1";
} else if (s[0] == 'M')
cout << "6";
else if (s[0] == 'T') {
if (s[1] == 'U')
cout << "5";
else
cout << "3";
} else if (s... | replace | 3 | 4 | 3 | 4 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pair<ll, ll>> vpl;
typedef vector<vl> vvl;
typedef vector<vs> vvs;
#define f(i, start, end) for (i = start; i < end; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pair<ll, ll>> vpl;
typedef vector<vl> vvl;
typedef vector<vs> vvs;
#define f(i, start, end) for (i = start; i < end; i++)... | replace | 19 | 23 | 19 | 20 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> week(7);
week = {"SAT"
"FRI"
"THU"
"WHD"
"TUE"
"MON"
"SUN"};
for (int i = 0; i < 7; i++) {
if (s == week.at(i)) {
cout << i + 1 << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> week(7);
week = {"SAT", "FRI", "THU", "WED", "TUE", "MON", "SUN"};
for (int i = 0; i < 7; i++) {
if (s == week.at(i)) {
cout << i + 1 << endl;
}
}
}
| replace | 7 | 14 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 1) >= this->size() (which is 1)
|
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define ppb pop_back
#define mp make_pair
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define ppb pop_back
#define mp make_pair
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen(... | replace | 11 | 15 | 11 | 15 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.