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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02791 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
int min;
int p[200010];
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
min = p[0];
for (int i = 0; i < n; i++) {
int flag = 1;
if (min > p[i]) {
min = p[i];
}
for (int j = 0; j <= i; j++) {... | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
int min;
int p[200010];
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
min = p[0];
for (int i = 0; i < n; i++) {
int flag = 1;
if (min > p[i]) {
min = p[i];
}
if (min < p[i]) {
flag =... | replace | 18 | 23 | 18 | 20 | TLE | |
p02791 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int P[100010];
int main() {
int N, i, cnt = 0, min;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> P[i];
if (min > P[i]) {
cnt++;
// } else {
min = P[i];
}
// cout << i << " " << min << " " << cnt << endl;
}
cout << c... | #include <iostream>
#include <string>
using namespace std;
int P[330010];
int main() {
int N, i, cnt = 0, min;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> P[i];
if (min > P[i]) {
cnt++;
// } else {
min = P[i];
}
// cout << i << " " << min << " " << cnt << endl;
}
cout << c... | replace | 4 | 5 | 4 | 5 | 0 | |
p02791 | C++ | Time Limit Exceeded | // 152
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
bool flg = true;
for (int j = 0; j < i; j++) {
if (p[i] <= p[j]) {
... | // 152
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 1;
int data = p[0];
for (int i = 1; i < n; i++) {
if (data > p[i]) {
data = p[i];
ans = ans + 1;
}
... | replace | 13 | 25 | 13 | 18 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int n, k, s, aa[110000], cnt = 0, cnta = INF;
signed main() {
cin >> n;
rep(i, n) {
cin >> aa[i];
if... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int n, k, s, aa[220000], cnt = 0, cnta = INF;
signed main() {
cin >> n;
rep(i, n) {
cin >> aa[i];
if... | replace | 7 | 8 | 7 | 8 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> lists(n);
for (int i = 0; i < n; i++) {
cin >> lists.at(i);
}
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (lists.at(i) >= lists.at(j)) {
ans -= 1;
break... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> lists(n);
for (int i = 0; i < n; i++) {
cin >> lists.at(i);
}
int ans = 1;
int std = lists.at(0);
for (int i = 1; i < n; i++) {
if (lists.at(i) < std) {
ans += 1;
std = lists.at(i);
}
}... | replace | 13 | 20 | 13 | 20 | TLE | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, p[100000], mini[100000], ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
mini[0] = p[0];
for (int ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, p[200000], mini[200000], ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
mini[0] = p[0];
for (int ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
int n, x, ans = 1, ma;
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d", a + i);
ma = a[0];
for (int i = 1; i < n; i++) {
ma = min(ma, a[i]);
if (a[i] <= ma)
ans++;
}
cout << ans << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
int main() {
int n, x, ans = 1, ma;
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d", a + i);
ma = a[0];
for (int i = 1; i < n; i++) {
ma = min(ma, a[i]);
if (a[i] <= ma)
ans++;
}
cout << ans << endl;
retur... | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, c) for (int i = 0; i < (int)c; ++i)
using llint = long long int;
using namespace std;
int main() {
int N;
int P[100005];
cin >> N;
rep(i, N) cin >> P[i];
int count = 0;
int m = P[0];
rep(i, N) {
if (m >= P[i])
count++;
m = min(m, P[i]);
}
cout <... | #include <bits/stdc++.h>
#define rep(i, c) for (int i = 0; i < (int)c; ++i)
using llint = long long int;
using namespace std;
int main() {
int N;
int P[200005];
cin >> N;
rep(i, N) cin >> P[i];
int count = 0;
int m = P[0];
rep(i, N) {
if (m >= P[i])
count++;
m = min(m, P[i]);
}
cout <... | replace | 8 | 9 | 8 | 9 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; ++i) {
cin >> P.at(N);
}
int ans = 0;
int currentMin = 1e9;
for (int i = 0; i < N; ++i) {
cur... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; ++i) {
cin >> P.at(i);
}
int ans = 0;
int currentMin = 1e9;
for (int i = 0; i < N; ++i) {
cur... | replace | 14 | 15 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02791 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j <= i; j++) {
if (p[i] > p[j])
break;
if (j == i)
count++;
}
cout << count;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 1;
int min = p[0];
for (int i = 1; i < n; i++)
if (p[i] < min) {
min = p[i];
count++;
}
cout << count;
}
| replace | 12 | 19 | 12 | 18 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
int P[120000];
int i;
int ans = 0;
int min = 0;
cin >> N;
for (i = 0; i < N; i++)
cin >> P[i];
min = P[0];
for (i = 0; i < N; i++) {
if (P[i] <= min) {
min = P[i];
ans++;
}
}
cout << an... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
int P[240000];
int i;
int ans = 0;
int min = 0;
cin >> N;
for (i = 0; i < N; i++)
cin >> P[i];
min = P[0];
for (i = 0; i < N; i++) {
if (P[i] <= min) {
min = P[i];
ans++;
}
}
cout << an... | replace | 6 | 7 | 6 | 7 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] ... | replace | 55 | 56 | 55 | 56 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n) {
int min = *min_element(p.begin(), p.begin() + i);
if (min >= p[i])
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 1;
int mini = p[0];
for (int i = 1; i < n; i++) {
mini = min(mini, p[i - 1]);
if (mini >= p[i])
cnt++;
}
cout << ... | replace | 8 | 12 | 8 | 13 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res, mn;
int a[100001];
cin >> n;
res = 0;
mn = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (mn >= a[i]) {
mn = a[i];
res++;
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res, mn;
int a[200001];
cin >> n;
res = 0;
mn = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (mn >= a[i]) {
mn = a[i];
res++;
}
}
cout << res << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, total = 0, minv = 1e5 + 5;
int a[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] <= minv) {
minv = a[i];
total++;
}
}
cout << total << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, total = 0, minv = 2138475648;
int a[200005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] <= minv) {
minv = a[i];
total++;
}
}
cout << total << endl;
return 0;
} | replace | 3 | 5 | 3 | 5 | 0 | |
p02791 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, p[20010], count, miiin;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
miiin = p[0];
for (int i = 0; i < n; i++) {
if (p[i] == 1) {
count += 1;
cout << count << endl;
return 0;
}
if (p[i] <= miiin) {
c... | #include <iostream>
using namespace std;
int n, p[200100], count, miiin;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
miiin = p[0];
for (int i = 0; i < n; i++) {
if (p[i] == 1) {
count += 1;
cout << count << endl;
return 0;
}
if (p[i] <= miiin) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int ans = 1;
for (int i = 1; i < N; i++) {
bool flag = true;
for (int j = i - 1; j >= 0; j--) {
if (P[j] < P[i]) {
flag = false;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int M[N], m = INT_MAX;
for (int i = 0; i < N; i++) {
m = min(P[i], m);
M[i] = m;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (M[i] == P[i]) // P[i]が最小 →... | replace | 10 | 20 | 10 | 19 | TLE | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mem(i, a) memset(i, a, sizeof(i))
#define PI acos(-1.0)
#define DMAX 100000 + 5
#define MOD 20190823
#define eps 1e-8
#define mp m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mem(i, a) memset(i, a, sizeof(i))
#define PI acos(-1.0)
#define DMAX 200000 + 5
#define MOD 20190823
#define eps 1e-8
#define mp m... | replace | 12 | 13 | 12 | 13 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[100000];
rep(i, n) scanf("%d", &p[i]);
int mn = n + 1;
int ans = 0;
rep(i, n) {
if (p[i] <= mn)
ans++;
mn = min(mn, p[i]);
}
printf("%d\n", ans);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[200000];
rep(i, n) scanf("%d", &p[i]);
int mn = n + 1;
int ans = 0;
rep(i, n) {
if (p[i] <= mn)
ans++;
mn = min(mn, p[i]);
}
printf("%d\n", ans);
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int j, k, count = 1;
for (j = 1; j < N; j++) {
for (k = j - 1; k > -1; k--) {
if (P[j] > P[k])
break;
if (k == 0)
count++;
}
}
cout << c... | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int j, min = 10000000, count = 0;
for (j = 0; j < N; j++) {
if (P[j] < min)
min = P[j];
if (min == P[j])
count++;
}
cout << count << endl;
return 0;
... | replace | 10 | 18 | 10 | 16 | TLE | |
p02791 | C++ | Runtime Error | /* -*- coding: utf-8 -*-
*
* c.cc: C - Low Elements
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#inclu... | /* -*- coding: utf-8 -*-
*
* c.cc: C - Low Elements
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#inclu... | replace | 28 | 29 | 28 | 29 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int S = 0;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(N);
}
M = vec.at(0);
for (int X = 1; X < N; X++) {
if (M >= vec.at(X)) {
M = vec.at(X);
S++;
}
}
cout << S + 1 << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int S = 0;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
}
M = vec.at(0);
for (int X = 1; X < N; X++) {
if (M >= vec.at(X)) {
M = vec.at(X);
S++;
}
}
cout << S + 1 << e... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
#define MAXSIZE 10000000;
const int MAX = 510000;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const ll MAXINDx = 3000;
const ll MAXINDy = 3000;
double dp[MAXINDx][MAXINDy] = {0};
struct UnionFind {
vector<... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
#define MAXSIZE 10000000;
const int MAX = 510000;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const ll MAXINDx = 3000;
const ll MAXINDy = 3000;
double dp[MAXINDx][MAXINDy] = {0};
struct UnionFind {
vector<... | replace | 162 | 163 | 162 | 163 | 0 | |
p02791 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/... | replace | 96 | 105 | 96 | 98 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int count = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (vec[j] <= vec[i])
break;
if (j == i - 1)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int count = 0;
int min_num = n + 1;
for (int i = 0; i < n; i++) {
if (vec[i] == 1) {
count++;
break;
}
if (vec[i] < min_num... | replace | 11 | 18 | 11 | 22 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define io_optimized \
ios::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
int main() {
io_optimized int n;
while (cin >> n) {
int a[n];
int sum = 0;
for (i... | #include <bits/stdc++.h>
#define io_optimized \
ios::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
int main() {
io_optimized int t, n, min;
while (cin >> t) {
t--;
int sum = 1;
cin... | replace | 7 | 21 | 7 | 16 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#defi... | replace | 35 | 36 | 35 | 36 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int arr[N], mark[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
mark[1] = arr[1];
for (int i = 2; i <= n; i++) {
mark[i] = min(mark[i - 1], arr[i]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int arr[N], mark[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
mark[1] = arr[1];
for (int i = 2; i <= n; i++) {
mark[i] = min(mark[i - 1], arr[i]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define reppe(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define repm(i, a, b) for ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define reppe(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define repm(i, a, b) for ... | replace | 28 | 34 | 28 | 34 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define debug(x) cerr << #x << ' ' << x << '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define debug(x) cerr << #x << ' ' << x << '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <=... | replace | 13 | 14 | 13 | 14 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10;
int a[M];
int main(int argc, char const *argv[]) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int mn = a[1];
int ans = 0;
for (int i = 2; i <= n; i++) {
if (mn < a[i])
ans++;
mn = min(mn, a[i]);
... | #include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 10;
int a[M];
int main(int argc, char const *argv[]) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int mn = a[1];
int ans = 0;
for (int i = 2; i <= n; i++) {
if (mn < a[i])
ans++;
mn = min(mn, a[i]);
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
using namespace std;
#define N 50000
#define nmax 50000
#define INFTY 100000
int n;
int num[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
num[i] = a;
}
int count = 1;
int memo = num[0... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
using namespace std;
#define N 500000
#define nmax 50000
#define INFTY 100000
int n;
int num[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
num[i] = a;
}
int count = 1;
int memo = num[... | replace | 5 | 6 | 5 | 6 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | replace | 32 | 33 | 32 | 33 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int a[maxn];
void fl() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
int main() {
// fl();
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int minn = INF, ans... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int a[2 * maxn];
void fl() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
int main() {
// fl();
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int minn = INF,... | replace | 4 | 5 | 4 | 5 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
const int maxn = 2e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#e... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
const int maxn = 2e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll int n, m, a[maxn], i;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
ll int mini ... | delete | 11 | 15 | 11 | 11 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i... | replace | 26 | 36 | 26 | 28 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repe(i, n) for (int i = 0; i <= n; ++i)
#define repr(i, n) for (int i = n - 1; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repe(i, n) for (int i = 0; i <= n; ++i)
#define repr(i, n) for (int i = n - 1; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | replace | 58 | 59 | 58 | 63 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
int main() {
int n;
cin >> n;
int p[n];
int ans = 1;
cin >> p[0];
rep1(i, n) {
cin ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
int main() {
int n;
cin >> n;
int ans = 0;
int m = 1e8;
rep(i, n) {
int p;
cin >>... | replace | 12 | 24 | 12 | 19 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { r... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { r... | replace | 22 | 33 | 22 | 29 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// 1番目の数を見て、それよりも小さい数はいくつあるかを判定する
vector<int> vec(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
int ans = 0;
int a = 0;
a = vec.at(1);
for (int i = 0; i < N; i++) {
if (a >= vec.at(i)) {
a = vec.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// 1番目の数を見て、それよりも小さい数はいくつあるかを判定する
vector<int> vec(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
int ans = 0;
int a = 0;
a = vec.at(0);
for (int i = 0; i < N; i++) {
if (a >= vec.at(i)) {
a = vec.at(i);
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | replace | 43 | 44 | 43 | 44 | 0 | |
p02791 | Python | Time Limit Exceeded | N = int(input())
P = list(map(int, input().split()))
print(1 + sum([int(P[i] <= min(P[:i])) for i in range(1, N)]))
| N = int(input())
P = list(map(int, input().split()))
Q = []
m = 10**17
for p in P:
m = min(m, p)
Q.append(m)
c = 0
for x, y in zip(P, Q):
if x <= y:
c += 1
print(c)
| replace | 2 | 3 | 2 | 12 | TLE | |
p02791 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n, k, x, y;
// Bitと転倒数
class Bit {
public:
ll size;
vector<ll> data;
Bi... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n, k, x, y;
// Bitと転倒数
class Bit {
public:
ll size;
vector<ll> data;
Bi... | replace | 44 | 45 | 44 | 45 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
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, i, j, k, x = 1e6, cnt = 0;
cin >> n;
int p[n];
for (i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
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, i, j, k, x = 1e6, cnt = 0;
cin >> n;
int p[n];
for (i = 0; i <... | replace | 6 | 10 | 6 | 10 | -11 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long dou... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long dou... | replace | 116 | 117 | 116 | 117 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define come return
constexpr auto AC = 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define come return
constexpr auto AC = 0... | replace | 26 | 27 | 26 | 27 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
int ans = 1;
for (in... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
int ans = 1;
int r =... | replace | 16 | 24 | 16 | 21 | TLE | |
p02791 | C++ | Runtime Error | #include <climits> /* LLONG_MAX */
#include <cmath>
#include <algorithm>
#include <iomanip> /* setprecision */
#include <iostream>
#include <numeric> /* gcd, lcm, partial_sum, reduce*/
#include <string>
#include <vector>
using ll = long long; // c++11
const std::string ans[2] = {"No\n", "Yes\n"};
int main() {
usi... | #include <climits> /* LLONG_MAX */
#include <cmath>
#include <algorithm>
#include <iomanip> /* setprecision */
#include <iostream>
#include <numeric> /* gcd, lcm, partial_sum, reduce*/
#include <string>
#include <vector>
using ll = long long; // c++11
const std::string ans[2] = {"No\n", "Yes\n"};
int main() {
usi... | replace | 19 | 21 | 19 | 24 | -11 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep_rev(n, i) for (ll i = n; i >= 0; --i)
using namespace std;
const long long INF = 1LL << 60;
ll N, m = INF, c = 0;
ll P[100100];
int main() {
cin >> N;
rep(i, N) cin >> P[i];
rep(i, N) {
if (m > P[i]) {
... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep_rev(n, i) for (ll i = n; i >= 0; --i)
using namespace std;
const long long INF = 1LL << 60;
ll N, m = INF, c = 0;
ll P[200010];
int main() {
cin >> N;
rep(i, N) cin >> P[i];
rep(i, N) {
if (m > P[i]) {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (p.a... | #include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int ans = n;
int mini = n;
for (int i = 0; i < p.size(); i++) {
mini = min(mini, p.at... | replace | 15 | 21 | 15 | 20 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int n;
int type;
vector<int> st;
int NEUTRO;
void init(int _, int __, int ___) {
n = _;
st.resize(2 * _);
NEUTRO = ___;
type = __;
}
SegmentTree() {}
int ope(int x, int y) {
if (type == 0)
return max(x, y);
... | #include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int n;
int type;
vector<int> st;
int NEUTRO;
void init(int _, int __, int ___) {
n = _;
st.resize(5 * _);
NEUTRO = ___;
type = __;
}
SegmentTree() {}
int ope(int x, int y) {
if (type == 0)
return max(x, y);
... | replace | 11 | 12 | 11 | 12 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long ll;
int main() {
int N;
cin >> N;
int p[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long ll;
int main() {
int N;
cin >> N;
int p[... | replace | 20 | 29 | 20 | 26 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int cnt = 1;
for (int i = 1; i < n; ++i) {
int res = 0;
for (int j = 0; j < i; ++j) {
if (a[i] <= a[j])
++res;
else
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int cnt = 0;
int res = 10000000;
for (int i = 0; i < n; ++i) {
res = min(res, a[i]);
if (a[i] <= res)
++cnt;
}
cout << cnt << endl;... | replace | 9 | 19 | 9 | 14 | TLE | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
long long gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
long long lcm(int x, int y) {
if (y == 0) {
return x;
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
long long gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
long long lcm(int x, int y) {
if (y == 0) {
return x;
}
... | replace | 42 | 43 | 42 | 43 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
cin >> P[i];
}
ll count = 0;
ll mini = P[0];
for (ll i = 0; i < N; i++) {
for (ll j = 0; j <= i; j++) {
mini = min(mini, P[j]);
}
if (P[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
cin >> P[i];
}
ll count = 0;
ll mini = P[0];
for (ll i = 0; i < N; i++) {
mini = min(mini, P[i]);
if (mini == P[i]) {
count++;
}
}
... | replace | 16 | 20 | 16 | 18 | TLE | |
p02791 | C++ | Runtime Error | #define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set2d(array, val, m, n) memset(array, val, sizeof(array[0][0]) * m * n);
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout... | #define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set2d(array, val, m, n) memset(array, val, sizeof(array[0][0]) * m * n);
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout... | replace | 13 | 17 | 13 | 17 | -11 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define inn(x, y) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define inn(x, y) ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> per(n);
for (int i = 0; i < n; i++) {
cin >> per.at(i);
}
int ans = 0;
set<int> num;
for (int i = 0; i < n; i++) {
for (int j = i; j > -1; j--) {
num.insert(per.at(i));
}
if (*begin(num) == per... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> per(n);
for (int i = 0; i < n; i++) {
cin >> per.at(i);
}
int ans = 0;
set<int> num;
for (int i = 0; i < n; i++) {
num.insert(per.at(i));
if (*begin(num) == per.at(i))
ans += 1;
}
cout << ans;
... | replace | 13 | 16 | 13 | 14 | TLE | |
p02791 | Python | Runtime Error | N = int(input())
P = map(int, input().split())
ret = 0
currmin = P[0]
for i in range(N):
if P[i] <= currmin:
currmin = P[i]
ret += 1
print(ret)
| N = int(input())
P = list(map(int, input().split()))
ret = 0
currmin = P[0]
for i in range(N):
if P[i] <= currmin:
currmin = P[i]
ret += 1
print(ret)
| replace | 1 | 2 | 1 | 2 | TypeError: 'map' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02791/Python/s629344950.py", line 5, in <module>
currmin = P[0]
TypeError: 'map' object is not subscriptable
|
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int mn = INT_MAX;
int i, j, n, m, cnt = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (mn > a[i]) {
mn = a[i];
cnt++;
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int a[200010];
int main() {
int mn = INT_MAX;
int i, j, n, m, cnt = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (mn > a[i]) {
mn = a[i];
cnt++;
}
}
cout << cnt << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#defin... | replace | 36 | 45 | 36 | 39 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p[100100], i, ruimin = 300000, ans = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] <= ruimin) {
ans++;
ruimin = p[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p[200100], i, ruimin = 300000, ans = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] <= ruimin) {
ans++;
ruimin = p[i];
}
}
cout << ans << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | replace | 234 | 235 | 234 | 235 | 0 | |
p02791 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int minn[100010];
int main(void) {
// freopen("aaa.in","r",stdin);
int n;
int ans = 0;
scanf("%d", &n);
minn[0] = n + 1;
for (int i = 1, a; i <= n; i++) {
scanf("%d", &a);
minn[i] = min(minn[i - 1], a);
if (a <= minn[i])
ans++;
... | #include <cstdio>
#include <iostream>
using namespace std;
int minn[300010];
int main(void) {
// freopen("aaa.in","r",stdin);
int n;
int ans = 0;
scanf("%d", &n);
minn[0] = n + 1;
for (int i = 1, a; i <= n; i++) {
scanf("%d", &a);
minn[i] = min(minn[i - 1], a);
if (a <= minn[i])
ans++;
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | replace | 595 | 596 | 595 | 596 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define dump(x) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define dump(x) ... | replace | 67 | 68 | 67 | 68 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long lint;
using namespace std;
int main() {
lint n, ans = 0;
cin >> n;
vector<lint> p(n), c(n);
rep(i, n) cin >> p.at(i);
c = p;
rep(i, n) {
sort(c.begin(), c.begin() + i);
if (p.at(i) <= c.at(0))
ans+... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long lint;
using namespace std;
int main() {
lint n, ans = 0;
cin >> n;
vector<lint> p(n), c(n);
rep(i, n) cin >> p.at(i);
c = p;
rep(i, n) {
if (c.at(i) < c.at(0))
c.at(0) = c.at(i);
if (p.at(i) <= c.a... | replace | 12 | 13 | 12 | 14 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#d... | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#d... | replace | 82 | 83 | 82 | 83 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main() {
Int N;
vector<Int> P(N);
rep(i, N) cin >> P[i];
Int m = P[0], ans = 1;
rep1(i, N - 1) {
if (m >= P[i])
ans++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main() {
Int N;
cin >> N;
vector<Int> P(N);
rep(i, N) cin >> P[i];
Int m = P[0], ans = 1;
rep1(i, N - 1) {
if (m >= P[i])... | insert | 8 | 8 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02791 | C++ | Runtime Error | #include <iostream>
#define N 100005
#define INF 0x3f3f3f3f
using namespace std;
int main() {
int min0 = INF;
int ans = 0;
int n;
cin >> n;
int a[N];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] < min0) {
ans++;
min0 = a[i];
}
}
cout << ans ... | #include <iostream>
#define N 1000005
#define INF 0x3f3f3f3f
using namespace std;
int main() {
int min0 = INF;
int ans = 0;
int n;
cin >> n;
int a[N];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] < min0) {
ans++;
min0 = a[i];
}
}
cout << ans... | replace | 1 | 2 | 1 | 2 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[40005];
int d[40005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
if (n == 0) // 0个元素特判一下
{
printf("0\n");
return 0;
}
d[1] = a[1]; // 初始化
int len = 1;
for (int i = 2; i <= n; i++) {
if (a[i... | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int d[200005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
if (n == 0) // 0个元素特判一下
{
printf("0\n");
return 0;
}
d[1] = a[1]; // 初始化
int len = 1;
for (int i = 2; i <= n; i++) {
if (a... | replace | 3 | 5 | 3 | 5 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI; // 例: VVI dp(10, vector<int>(10, INF);
typedef priority_queue<int, vector<int>, less<int>> QUE_int;
const int INF =
pow(10, 5)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI; // 例: VVI dp(10, vector<int>(10, INF);
typedef priority_queue<int, vector<int>, less<int>> QUE_int;
const int INF =
pow(10, 5)... | replace | 21 | 34 | 21 | 31 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define inf 1e9
int v[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int menor = v[0];
for (int i = 0; i < n; i++) {
if (v[i] <= menor) {... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define inf 1e9
int v[200005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int menor = v[0];
for (int i = 0; i < n; i++) {
if (v[i] <= menor) {... | replace | 9 | 10 | 9 | 10 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, a, b, arr[100009];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
m = arr[0];
a = 1;
for (i = 1; i < n; i++) {
if (arr[i] <= m) {
m = arr[i];
a++;
}
}
printf("%d\n", a);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, a, b, arr[200009];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
m = arr[0];
a = 1;
for (i = 1; i < n; i++) {
if (arr[i] <= m) {
m = arr[i];
a++;
}
}
printf("%d\n", a);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int min = 2000001, ans = 0;
int P[10000] = {0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i];
}
for (int i = 0; i < N; i++) {
if (min > P[i]) {
min = P[i];
ans++;
}
}
cout << ans;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int min = 200001, ans = 0;
int P[200000] = {0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i];
}
for (int i = 0; i < N; i++) {
if (min > P[i]) {
min = P[i];
ans++;
}
}
cout << ans;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#defi... | replace | 23 | 27 | 23 | 27 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) ... | replace | 51 | 57 | 51 | 57 | -11 | |
p02791 | C++ | Runtime Error | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) ... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) ... | replace | 21 | 22 | 21 | 22 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int p[20005], n, ans = 0, ma = 9999999;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
for (int i = 0; i < n; i++) {
if (p[i] <= ma)
ans++;
ma = min(p[i], ma);
}
printf("%d", ans);
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int p[200006], n, ans = 0, ma = 9999999;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
for (int i = 0; i < n; i++) {
if (p[i] <= ma)
ans++;
ma = min(p[i], ma);
}
printf("%d", ans);
return 0;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Runtime Error | /*
* Author: pawanmsr
*/
/*
* Run in Mac using the following command:
* g++ -std=c++14 <cpp_filename>
* A binary will be generated. Then run:
* ./a.out
*/
#include <algorithm>
#include <bitset>
#include <climits>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#i... | /*
* Author: pawanmsr
*/
/*
* Run in Mac using the following command:
* g++ -std=c++14 <cpp_filename>
* A binary will be generated. Then run:
* ./a.out
*/
#include <algorithm>
#include <bitset>
#include <climits>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#i... | replace | 44 | 45 | 44 | 45 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[10005];
int main() {
int n;
cin >> n;
int k = 0;
int mina = 0xfffff;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] <= mina) {
k++;
mina = a[i];
}
}
cout << k << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[2000005];
int main() {
int n;
cin >> n;
int k = 0;
int mina = 0xfffff;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] <= mina) {
k++;
mina = a[i];
}
}
cout << k << endl;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n... | replace | 81 | 82 | 81 | 82 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (size_t i = 1; i <= n; i++) {
int minidx = min_element(p.begin(), p.begin() + i) - p.begin();
if (p[minidx] == ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
int min = 3000000;
for (size_t i = 0; i < n; i++) {
if (p[i] < min)
min = p[i];
if (min == p[i])
++an... | replace | 11 | 14 | 11 | 16 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
const ll mod = 1e9 + 7;
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int ans = 0;
int mn = 0x3f3f3f3f;
for (int i = 0; i < n; i++) {
if (mn <... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
const ll mod = 1e9 + 7;
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int ans = 0;
int mn = 0x3f3f3f3f;
for (int i = 0; i < n; i++) {
if (mn <... | replace | 4 | 5 | 4 | 5 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) fo... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) fo... | replace | 49 | 50 | 49 | 50 | -11 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = n;
int low = p[0];
for (int i = 1; i < n; i++) {
if (p[i] > low) {
... | replace | 13 | 20 | 13 | 19 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { ... | replace | 59 | 60 | 59 | 60 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
// 組み合わせ配列初期化
int cmb[10][10]; // 先頭, 末尾
for (int head = 0; head < 11; head++) {
for (int tail = 0; tail < 11; tail++) {
cmb[head][tail] = 0;
}
}
// 組み合わせ配列を先に求める
for (int i = 1; i <= N; i++) {
std::string s = std::to_strin... | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
// 組み合わせ配列初期化
int cmb[10][10]; // 先頭, 末尾
for (int head = 0; head < 10; head++) {
for (int tail = 0; tail < 10; tail++) {
cmb[head][tail] = 0;
}
}
// 組み合わせ配列を先に求める
for (int i = 1; i <= N; i++) {
std::string s = std::to_strin... | replace | 8 | 10 | 8 | 10 | -6 | *** stack smashing detected ***: terminated
|
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<vector<int>> c(9, vector<int>(9));
for (int i = 1; i <= N; i++) {
int keta = to_string(i).length();
// cout << keta << endl;
int last_num = i % 10;
if (last_num == 0)
continue;
int first_num = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<vector<int>> c(9, vector<int>(9));
for (int i = 1; i <= N; i++) {
int keta = to_string(i).length();
// cout << keta << endl;
int last_num = i % 10;
if (last_num == 0)
continue;
int first_num = 0;
... | replace | 16 | 17 | 16 | 24 | 0 | |
p02792 | C++ | Time Limit Exceeded | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | replace | 87 | 88 | 87 | 94 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll ... | replace | 14 | 17 | 14 | 18 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pra... | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pra... | replace | 35 | 36 | 35 | 37 | -6 | munmap_chunk(): invalid pointer
|
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> p(10, vector<int>(10, 0));
for (int i = 1; i <= 9; i++) {
for (int j = i; j <= 9; j++) {
for (int k = 1; k <= n; k++) {
ostrin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> p(10, vector<int>(10, 0));
for (int k = 1; k <= n; k++) {
ostringstream oss2;
oss2 << k;
string num = oss2.str();
int begin = i... | replace | 10 | 26 | 10 | 18 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int mod = 1e9 + 7;
sig... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int mod = 1e9 + 7;
sig... | replace | 14 | 18 | 14 | 18 | 0 | Time: 0.000003
|
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("test.in","r",stdin);
// freopen("test.ok","w",stdout);
int64_t n, a = 0;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
int64_t x = i, y = j, z = i, t = j;
while (x >= 10)
x = x / 10;
w... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("test.in","r",stdin);
// freopen("test.ok","w",stdout);
int64_t n, a = 0;
cin >> n;
/*for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
int64_t x=i,y=j,
z=i,
t=j;
while (x>=10)
x=x/10... | replace | 8 | 18 | 8 | 31 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {... | replace | 33 | 34 | 33 | 34 | -11 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {... | replace | 31 | 32 | 31 | 37 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt",... | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
map<pii, int> mp;
int n;
cin >> n;
... | delete | 14 | 19 | 14 | 14 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
P f(int x) {
int fst;
string s = to_string(x);
fst = s[0] - '0';
int last = x % 10;
return P(fst, last);
}
int main() {
int n;
cin >> n;
int si = to_string(n).siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
P f(int x) {
int fst;
string s = to_string(x);
fst = s[0] - '0';
int last = x % 10;
return P(fst, last);
}
int main() {
int n;
cin >> n;
int si = to_string(n).siz... | replace | 22 | 23 | 22 | 23 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): map::at
|
p02792 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long n, fl[10][10], ans = 0;
cin >> n;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
fl[i][j] = 0;
for (int i = 1; i <= n; i++) {
int x = i;
while (x > 10)
x /= 10;
fl[x][i % 10]++;
}
for (int i = 0; i < 10; i... | #include <iostream>
using namespace std;
int main() {
long long n, fl[10][10], ans = 0;
cin >> n;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
fl[i][j] = 0;
for (int i = 1; i <= n; i++) {
int x = i;
while (x >= 10)
x /= 10;
fl[x][i % 10]++;
}
for (int i = 0; i < 10; ... | replace | 10 | 11 | 10 | 11 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.