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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03102 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, m, c, ans = 0, z;
cin >> n >> m >> c;
vector<long long int> b(100000000);
vector<long long int> a(100000000);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, m, c, ans = 0, z;
cin >> n >> m >> c;
vector<long long int> b(1000000);
vector<long long int> a(1000000);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n;... | replace | 9 | 11 | 9 | 11 | MLE | |
p03102 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = 0; i < (f); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100;
const int INF = (1 << 12);
int main() {
int n, m, c;
cin >> ... | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = 0; i < (f); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100;
const int INF = (1 << 12);
int main() {
int n, m, c;
cin >> ... | replace | 17 | 18 | 17 | 18 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int ans = 0;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
int ans = 0;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | replace | 28 | 29 | 28 | 29 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> bm(m);
for (int i = 0; i < m; i++)
cin >> bm[i];
vector<vector<int>> am(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> am[i][j];
}
}
int a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> bm(m);
for (int i = 0; i < m; i++)
cin >> bm[i];
vector<vector<int>> am(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> am[i][j];
}
}
int a... | replace | 11 | 12 | 11 | 12 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using ... | replace | 25 | 26 | 25 | 27 | 0 | |
p03102 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
vector<int> b(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i <... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
int n, m, c;
int count = 0;
cin >> n >> m >> c;
int b[30];
int a[30][30];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | replace | 11 | 13 | 11 | 13 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int count = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int B[M];
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
int count = 0;
for... | replace | 10 | 12 | 10 | 12 | -11 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
using vi = vector<int>;
int main() {
int N, M, C;
cin >> N >> M >> C;
vi B = vi(10);
FOR(i, 0, M) cin >> B[i];
int ans = 0;
FOR(k, 0, N) {
int sum = C;
FOR(i, 0, M) {
int A_i;
cin >> A_i;
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
using vi = vector<int>;
int main() {
int N, M, C;
cin >> N >> M >> C;
vi B = vi(M);
FOR(i, 0, M) cin >> B[i];
int ans = 0;
FOR(k, 0, N) {
int sum = C;
FOR(i, 0, M) {
int A_i;
cin >> A_i;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A;
vector<int> B(M);
// vector<vector<int>> A = vector<vector<int>>(N, vector<int>(M));
int cnt = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
int sum = C;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
int A;
vector<int> B(M);
// vector<vector<int>> A = vector<vector<int>>(N, vector<int>(M));
int cnt = 0;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
int sum = C;
fo... | replace | 16 | 17 | 16 | 17 | 0 | |
p03102 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | replace | 35 | 36 | 35 | 36 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
int B[M];
int A[N][M];
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j <... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
int B[110];
int A[110][110];
cin >> N >> M >> C;
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
for (int j = ... | replace | 11 | 13 | 11 | 13 | -11 | |
p03102 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, c, num[21][21], nn, sum;
while (scanf("%d%d%d", &n, &m, &c)) {
nn = 0;
for (int j = 0; j < m; j++)
scanf("%d", &num[0][j]);
for (int i = 1; i <= n; i++) {
sum = c;
for (int j = 0; j < m; j++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, c, num[21][21], nn, sum;
while (cin >> n >> m >> c) {
nn = 0;
for (int j = 0; j < m; j++)
scanf("%d", &num[0][j]);
for (int i = 1; i <= n; i++) {
sum = c;
for (int j = 0; j < m; j++) {
scanf("... | replace | 6 | 7 | 6 | 7 | TLE | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef pair<LL, LL> PII;
typedef vector<string> VS;
inline LL toInt(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream s... | replace | 45 | 46 | 45 | 46 | -6 | free(): invalid size
|
p03102 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<long long> b(n, 0);
int a = 0;
for (int mm = 0; mm < m; mm++) {
std::cin >> b[mm];
}
for (int nn = 0; nn < n; nn++) {
long long s = 0;
for (int mm = 0; mm < m; mm++) {
int a;
std:... | #include <iostream>
#include <vector>
int main() {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<long long> b(m, 0);
int a = 0;
for (int mm = 0; mm < m; mm++) {
std::cin >> b[mm];
}
for (int nn = 0; nn < n; nn++) {
long long s = 0;
for (int mm = 0; mm < m; mm++) {
int a;
std:... | replace | 6 | 7 | 6 | 7 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
//... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
using Pll = pair<ll, ll>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
//... | replace | 24 | 25 | 24 | 25 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | replace | 15 | 16 | 15 | 16 | 0 | |
p03102 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(M, vector<int>(N));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < M; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j... | replace | 10 | 11 | 10 | 11 | 0 | |
p03102 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
/*https://github.com/kurokoji/.cpp-Template/wiki#struct-fast*/
// 理解できていないものはコメントアウト
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* debug */
#define debug(x) \
c... | #include "bits/stdc++.h"
using namespace std;
/*https://github.com/kurokoji/.cpp-Template/wiki#struct-fast*/
// 理解できていないものはコメントアウト
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* debug */
#define debug(x) \
c... | insert | 88 | 88 | 88 | 91 | -11 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
int a[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++)
cin >> b[i];
int a[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (... | replace | 11 | 12 | 11 | 12 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define repp(i, n) for (int(i) = 1; (i) <= (n); ++(i))
#define popcnt __builtin_popcount
#define all(v) v.begin(), v.end()
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
using ll = long lon... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define repp(i, n) for (int(i) = 1; (i) <= (n); ++(i))
#define popcnt __builtin_popcount
#define all(v) v.begin(), v.end()
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
using ll = long lon... | replace | 35 | 36 | 35 | 36 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push... | replace | 45 | 46 | 45 | 46 | 0 | |
p03102 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C, sum, res;
cin >> N >> M >> C;
vector<int> A, B;
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
res = 0;
for (int j = 0; j < N; j++) {
sum = C;
for (int i = 0; i < M; i++) {
cin >> A.at(i);
sum +=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, C, sum, res;
cin >> N >> M >> C;
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
res = 0;
for (int j = 0; j < N; j++) {
sum = C;
for (int i = 0; i < M; i++) {
cin >> A.at(i);
... | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
vector<int> A(N);
long long sum = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
vector<int> A(M);
long long sum = 0;
for (int j = 0; j < M; j++) {
cin >> A[j];... | replace | 15 | 16 | 15 | 16 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}... | replace | 6 | 8 | 6 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// B - Can you solve this?
int main(void) {
int n, m, c;
std::cin >> n >> m >> c;
std::vector<int> b(n);
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int ans = 0;
int a, sum;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++)... | #include <bits/stdc++.h>
using namespace std;
// B - Can you solve this?
int main(void) {
int n, m, c;
std::cin >> n >> m >> c;
int b[m];
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
int ans = 0;
int a, sum;
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
std:... | replace | 6 | 7 | 6 | 7 | 0 | |
p03102 | Python | Runtime Error | import numpy as np
if __name__ == "__main__":
N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))
A = np.array(list(map(lambda _: list(map(int, input().split())), range(N))))
scores = np.matmul(A, B)
print(np.sum(scores > -C))
| import numpy as np
if __name__ == "__main__":
N, M, C = map(int, input().split())
B = np.array(list(map(int, input().split())))
A = np.array(list(map(lambda _: list(map(int, input().split())), range(N))))
scores = A.dot(B)
print(np.sum(scores > -C))
| replace | 7 | 8 | 7 | 8 | TLE | |
p03102 | Python | Runtime Error | import numpy as np
n, m, c = [int(x) for x in input().split(" ")]
b = np.asarray([int(x) for x in input().split(" ")])
a = np.ndarray((n, 3), dtype=np.int32)
for i in range(n):
a[i] = [int(x) for x in input().split(" ")]
s = np.sum(a * b, axis=1)
print(np.sum(s + c > 0))
| import numpy as np
n, m, c = [int(x) for x in input().split(" ")]
b = np.asarray([int(x) for x in input().split(" ")])
a = np.ndarray((n, m), dtype=np.int32)
for i in range(n):
a[i] = [int(x) for x in input().split(" ")]
s = np.sum(a * b, axis=1)
print(np.sum(s + c > 0))
| replace | 5 | 6 | 5 | 6 | TLE | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#if LOCAL
freopen("b.in", "r", stdin);
#endif
int N, M, C;
cin >> N >> M >> C;
int res = 0;
vector<int> B(N);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int a, sum = C;
for (int j = 0; j < M; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
#if LOCAL
freopen("b.in", "r", stdin);
#endif
int N, M, C;
cin >> N >> M >> C;
int res = 0;
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
int a, sum = C;
for (int j = 0; j < M; j++) {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | replace | 105 | 106 | 105 | 106 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const int X = 10000;
int N, M, C, ans = 0;
int B[X];
int A[X][X];
cin >> N >> M >> C;
for (int i = 1; i <= M; i++)
cin >> B[i];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
cin >> A[i][j];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
const int X = 10000;
int N, M, C, ans = 0;
int B[X];
int A[100][100];
cin >> N >> M >> C;
for (int i = 1; i <= M; i++)
cin >> B[i];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++)
cin >> A[i][j]... | replace | 8 | 9 | 8 | 9 | -11 | |
p03102 | C++ | Runtime Error |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
... | replace | 16 | 17 | 16 | 17 | -11 | |
p03102 | Python | Runtime Error | # -*- coding: utf-8 -*-
import numpy as np
N, M, C = map(int, input().split())
B = np.ndarray([M, 1])
B = list(map(int, input().split()))
A = np.ndarray([N, M])
for i in range(N):
A[i, :] = list(map(int, input().split()))
ans = sum((A @ B + C) > 0)
print(ans)
| # -*- coding: utf-8 -*-
import numpy as np
N, M, C = map(int, input().split())
B = np.ndarray([M, 1])
B = list(map(int, input().split()))
A = np.ndarray([N, M])
for i in range(N):
A[i, :] = list(map(int, input().split()))
ans = sum((np.dot(A, B) + C) > 0)
print(ans)
| replace | 11 | 12 | 11 | 12 | TLE | |
p03102 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | #include <iostream>
using namespace std;
int main() {
/*input*/
int n, m, c;
cin >> n >> m >> c;
int *b = new int[m];
int **a = new int *[n];
for (int i = 0; i < n; i++) {
a[i] = new int[m];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <... | replace | 34 | 39 | 34 | 35 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(n);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[j];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int ans = 0;
int a;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
cin >> a;
sum += a * b[j];
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03102 | C++ | Runtime Error | // main.cpp
// CppTest
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
// input from txt （提出時にこの箇所は削除すること）
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
/////////////////////
// Write code below /
... | // main.cpp
// CppTest
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
// cinを高速にするためのおまじない
cin.tie(0);
ios::sync_with_stdio(false);
/////////////////////
// Write code below /
/////////////////////
int N, M,... | replace | 11 | 14 | 11 | 14 | 0 | |
p03102 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(N);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, C;
cin >> N >> M >> C;
vector<vector<int>> A(N, vector<int>(M));
vector<int> B(M);
for (int i = 0; i < M; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A.at(i).at(j);
}
}... | replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03102 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m, c, num = 0;
cin >> n >> m >> c;
int array[20][20];
for (int i = 0; i <= n; i++) {
for (int j = 0; j < m; j++) {
cin >> array[i][j];
}
}
for (int i = 1; i <= n; i++) {
int sum = c;
for (int j = 0; j < m; j++) {
sum +... | #include <iostream>
using namespace std;
int main() {
int n, m, c, num = 0;
cin >> n >> m >> c;
int array[21][21];
for (int i = 0; i <= n; i++) {
for (int j = 0; j < m; j++) {
cin >> array[i][j];
}
}
for (int i = 1; i <= n; i++) {
int sum = c;
for (int j = 0; j < m; j++) {
sum +... | replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e3 + 17;
ll cnt, lnt, mn = N, mx, a[N], n, m, k, x, y, ans, sum;
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
cin >> n >> m;
for (ll i = 0... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const long long N = 1e5 + 17;
ll cnt, lnt, mn = N, mx, a[N], n, m, k, x, y, ans, sum;
pair<ll, ll> pr[N];
vector<ll> v, v2, v3;
map<ll, ll> mp;
bool used[N], t1, t2;
vector<string> sv;
int main() {
cin >> n >> m;
for (ll i = 0... | replace | 5 | 6 | 5 | 6 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 28;
vector<pair<int, int>> p;
long long ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p.push_back({a, b});
}
sort(p.begin(), p.end());
int c = 0;
int i = 0;
while (c + p[i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 28;
vector<pair<int, int>> p;
long long ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p.push_back({a, b});
}
sort(p.begin(), p.end());
int c = 0;
int i = 0;
while (c + p[i... | replace | 16 | 17 | 16 | 17 | 0 | |
p03103 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, a, b;
vector<pair<int, int>> vec;
long long ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, a, b;
vector<pair<int, int>> vec;
long long ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m... | replace | 21 | 22 | 21 | 22 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ep emplace_back
#define st first
#define sc second
using namespace std;
const ll mod = 998244353;
const int e = 300;
const int base = 311;
// dung igt thay cho gt luc tinh giai thua
// 3
// cach tao hoan vi tu n so : n*(n+1)/2;
struct kien {... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ep emplace_back
#define st first
#define sc second
using namespace std;
const ll mod = 998244353;
const int e = 1e6 + 69;
const int base = 311;
// dung igt thay cho gt luc tinh giai thua
// 3
// cach tao hoan vi tu n so : n*(n+1)/2;
struct k... | replace | 10 | 11 | 10 | 11 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
long long n, m, ans = 0;
struct Node {
int p, d;
bool operator<(Node b) { return p < b.p; }
} a[3000];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i].p >> a[i].d;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i) {
... | #include <algorithm>
#include <iostream>
using namespace std;
long long n, m, ans = 0;
struct Node {
int p, d;
bool operator<(Node b) { return p < b.p; }
} a[300000];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i].p >> a[i].d;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i) {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
rep(i, n) cin >> a[i] >> b[i];
vector<pa... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
vector<pa... | replace | 12 | 13 | 12 | 13 | 0 | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | replace | 55 | 61 | 55 | 58 | TLE | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
struct AB {
long long a;
long long b;
};
bool asc(const AB &left, const AB &right) {
if (left.a != right.a)
return left.a < right.a;
}
int main() {
int N, M, tmp1, tmp2, get;
long long cost;
AB tmp_AB;
vector<AB> v;
cin >> N >> M... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
struct AB {
long long a;
long long b;
};
bool asc(const AB &left, const AB &right) { return left.a < right.a; }
int main() {
int N, M, tmp1, tmp2, get;
long long cost;
AB tmp_AB;
vector<AB> v;
cin >> N >> M;
for (int i = 0; i < N; i+... | replace | 9 | 13 | 9 | 10 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | replace | 42 | 43 | 42 | 43 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;... | replace | 24 | 25 | 24 | 25 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i... | replace | 11 | 12 | 11 | 12 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m;
struct drink {
int cou;
long long mon;
} a[10001];
bool cmp(struct drink a, struct drink b) { return a.mon < b.mon; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%lld%d", &a[i].mon, &a[i].cou);
sort(a + 1, a + n + 1, ... | #include <bits/stdc++.h>
using namespace std;
int n, m;
struct drink {
int cou;
long long mon;
} a[100001];
bool cmp(struct drink a, struct drink b) { return a.mon < b.mon; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%lld%d", &a[i].mon, &a[i].cou);
sort(a + 1, a + n + 1,... | replace | 9 | 10 | 9 | 10 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie(... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie(... | replace | 22 | 23 | 22 | 23 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int N = 20;
pii a[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d%d", &a[i].first, &a[i].second);
sort(a, a + n);
ll ans = 0... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int N = 1e5;
pii a[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d%d", &a[i].first, &a[i].second);
sort(a, a + n);
ll ans = ... | replace | 7 | 8 | 7 | 8 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, m;
pair<int, int> super[10000];
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%d %d", &super[i].first, &super[i].second);
sort(super, super + n);
long long sum = 0;
for (int i = 0; i < n; ... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, m;
pair<int, int> super[100000];
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++)
scanf("%d %d", &super[i].first, &super[i].second);
sort(super, super + n);
long long sum = 0;
for (int i = 0; i < n;... | replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
bool comparator(P &A, P &B) { return A.first <= B.first; }
int main() {
int n, m;
cin >> n >> m;
vector<P> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i].first >> arr[i].second;
}
sort(arr.begin(), arr.end(), ... | #include <bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
bool comparator(P &A, P &B) { return A.first < B.first; }
int main() {
int n, m;
cin >> n >> m;
vector<P> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i].first >> arr[i].second;
}
sort(arr.begin(), arr.end(), c... | replace | 4 | 5 | 4 | 5 | 0 | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
map<ll, ll> C;
for (ll i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
C[A.at(i)] += B.at(i);
}
sort(A.begin(), A.end());
ll ans = 0;
ll cnt = 0;
for (ll i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
map<ll, ll> C;
for (ll i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
C[A.at(i)] += B.at(i);
}
sort(A.begin(), A.end());
ll ans = 0;
ll cnt = 0;
ll judge;
for (l... | replace | 15 | 18 | 15 | 22 | TLE | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, d = 0;
cin >> a >> b;
vector<pair<int, int>> c(a);
for (int i = 0; i < a; i++)
cin >> c.at(i).first >> c.at(i).second;
sor... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, d = 0;
cin >> a >> b;
vector<pair<int, int>> c(a);
for (int i = 0; i < a; i++)
cin >> c.at(i).first >> c.at(i).second;
sor... | insert | 23 | 23 | 23 | 24 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0... | replace | 99 | 100 | 99 | 100 | -11 | |
p03103 | Python | Time Limit Exceeded | n, m = map(int, input().split())
money = 0
li = []
for i in range(n):
li.append(list(map(int, input().split())))
li.sort()
while 0 < m:
shop = li.pop(0)
if m < shop[1]:
money += m * shop[0]
break
money += shop[0] * shop[1]
m -= shop[1]
print(money)
| n, m = map(int, input().split())
money = 0
li = []
for i in range(n):
li.append(list(map(int, input().split())))
li.sort()
for j in range(n):
shop = li.pop(0)
if m < shop[1]:
money += m * shop[0]
break
money += shop[0] * shop[1]
m -= shop[1]
print(money)
| replace | 8 | 9 | 8 | 9 | TLE | |
p03103 | Python | Runtime Error | n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)].sort()
pm = s = 0
m_minus_1 = m - 1
for item in a:
pm += item[1]
if pm > m_minus_1:
print(s + item[0] * (m - pm + item[1]))
break
else:
s += item[0] * item[1]
| n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
a.sort()
pm = s = 0
m_minus_1 = m - 1
for item in a:
pm += item[1]
if pm > m_minus_1:
print(s + item[0] * (m - pm + item[1]))
break
else:
s += item[0] * item[1]
| replace | 1 | 2 | 1 | 3 | TypeError: 'NoneType' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03103/Python/s281800849.py", line 5, in <module>
for item in a:
TypeError: 'NoneType' object is not iterable
|
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e4 + 10;
typedef struct Node {
ll a, b;
bool operator<(const Node &t) const { return a < t.a; }
} Node;
Node p[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &p[i].a, &p[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
typedef struct Node {
ll a, b;
bool operator<(const Node &t) const { return a < t.a; }
} Node;
Node p[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &p[i].a, &p[... | replace | 3 | 4 | 3 | 4 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DIM 107
#define DIMM 2007
#define INF 10000000000007.0
#define X 2000000007
#define epc 0.0000001
#define PI 3.14159265358979323846
#define MAX 25
#define MODULO 10009
const long double gr = (1 + sqrt(5)) / 2;
typedef int I;
typedef long long ll;
typedef long dou... | #include <bits/stdc++.h>
using namespace std;
#define DIM 100007
#define DIMM 2007
#define INF 10000000000007.0
#define X 2000000007
#define epc 0.0000001
#define PI 3.14159265358979323846
#define MAX 25
#define MODULO 10009
const long double gr = (1 + sqrt(5)) / 2;
typedef int I;
typedef long long ll;
typedef long ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
A[i].first = tmp1;
A[i].second = tmp2;
}
// for (int i = 0; i < N; i++)
//{
// cout << i << "th" << A[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
A[i].first = tmp1;
A[i].second = tmp2;
}
// for (int i = 0; i < N; i++)
//{
// cout << i << "th" << A[i]... | replace | 28 | 29 | 28 | 29 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef unsigned long long int ll;
typedef std::pair<ll, ll> pii;
using namespace std;
bool s(pii a, pii b) { return a.first <= b.first; }
int main() {
int N, M;
vector<pii> v;
cin >> N >> M;
ll ans = 0;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
v.push_back(... | #include <bits/stdc++.h>
typedef unsigned long long int ll;
typedef std::pair<ll, ll> pii;
using namespace std;
bool s(pii a, pii b) { return a.first <= b.first; }
int main() {
int N, M;
vector<pii> v;
cin >> N >> M;
ll ans = 0;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
v.push_back(... | replace | 18 | 19 | 18 | 19 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> vec;
rep(i, n) {
ll a, b;
cin >> a >> b;
vec[i].first = a;
vec[i].second = b;
}
... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> vec;
rep(i, n) {
ll a, b;
cin >> a >> b;
vec.push_back(make_pair(a, b));
}
sort(A... | replace | 13 | 15 | 13 | 14 | -11 | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> b... | insert | 50 | 50 | 50 | 51 | TLE | |
p03103 | C++ | Runtime Error | /*ASHWINI SHARMA*/
#include <bits/stdc++.h>
using namespace std;
#define fr(i, a, b) for (long long int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i-... | /*ASHWINI SHARMA*/
#include <bits/stdc++.h>
using namespace std;
#define fr(i, a, b) for (long long int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i-... | replace | 48 | 52 | 48 | 49 | -11 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (n); ++i)
#define ll long long
template <class T, class U> struct P {
T a;
U b;
};
bool Comp(P<ll, ll> &a, P<ll, ll> &b) { return a.a <= b.a; }
int main() {
ll n, m;
cin >> n >> m;
ve... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (n); ++i)
#define ll long long
template <class T, class U> struct P {
T a;
U b;
};
bool Comp(P<ll, ll> &a, P<ll, ll> &b) { return a.a < b.a; }
int main() {
ll n, m;
cin >> n >> m;
vec... | replace | 14 | 15 | 14 | 15 | 0 | |
p03103 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for ... | replace | 42 | 43 | 42 | 43 | -11 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>> E(N);
for (int i = 0; i < N; i++) {
cin >> E.at(i).first >> E.at(i).second... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>> E(N);
for (int i = 0; i < N; i++) {
cin >> E.at(i).first >> E.at(i).... | replace | 7 | 9 | 7 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 0)
|
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> X(N);
for (long long int i = 0; i < N; i++) {
long long int A, B;
cin >> A >> B;
X.at(i) = make_pair(A, B);
}
sort(X.begin(), X.end());
long long int ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> X(N);
for (long long int i = 0; i < N; i++) {
long long int A, B;
cin >> A >> B;
X.at(i) = make_pair(A, B);
}
sort(X.begin(), X.end());
long long int ans ... | replace | 17 | 18 | 17 | 18 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
const int maxN = 10010;
const int MAXM = 310;
const int MAXK = 17;
const int MOD = 1000000007;
const ll INF = 100... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
const int maxN = 100010;
const int MAXM = 310;
const int MAXK = 17;
const int MOD = 1000000007;
const ll INF = 10... | replace | 11 | 12 | 11 | 12 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { c... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { c... | replace | 62 | 63 | 62 | 63 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long sum;
int n, m, cnt;
pair<int, int> p[10005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p + 1, p + n + 1);
for (int i = 1; i <= n; i++) {
int cnti = 0;
while (cnt != m) {
if (cn... | #include <bits/stdc++.h>
using namespace std;
long long sum;
int n, m, cnt;
pair<int, int> p[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p + 1, p + n + 1);
for (int i = 1; i <= n; i++) {
int cnti = 0;
while (cnt != m) {
if (c... | replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < n; i++) {
int amount = min(q, v[i].second);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < n; i++) {
int amount = min(q, v[i].secon... | replace | 9 | 10 | 9 | 10 | -11 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, a, b;
cin >> N >> M;
vector<pair<int, int>> pairs(N);
for (int i = 0; i < N; ++i) {
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
int honsuu = 0;
int index = ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M, a, b;
cin >> N >> M;
vector<pair<int, int>> pairs(N);
for (int i = 0; i < N; ++i) {
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
int honsuu = 0;
int index = ... | insert | 20 | 20 | 20 | 24 | 0 | |
p03103 | C++ | Time Limit Exceeded | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#defin... | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#defin... | replace | 43 | 44 | 43 | 44 | TLE | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<pair<long long, long long>> p(N);
for (long long i = 0; i < N; i++) {
p.at(i) = make... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<pair<long long, long long>> p(N);
for (long long i = 0; i < N; i++) {
p.at(i) = make... | replace | 21 | 28 | 21 | 27 | TLE | |
p03103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, B;
cin >> N >> M;
vector<pair<int, int>> list(N);
for (int i = 0; i < N; i++) {
cin >> A >> B;
list[i] = make_pair(A, B);
}
sort(list.begin(), list.end());
long cost = 0;
int drink = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, A, B;
cin >> N >> M;
vector<pair<int, int>> list(N);
for (int i = 0; i < N; i++) {
cin >> A >> B;
list[i] = make_pair(A, B);
}
sort(list.begin(), list.end());
long cost = 0;
int drink = 0;
for (int i = 0; i < N; i++) {
... | insert | 23 | 23 | 23 | 29 | TLE | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX 10005
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
pair<ll, int> T[N_MAX];
for (int i = 0; i < N; i++) {
ll A;
int B;
cin >> A >> B;
T[i].first = A;... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX 100005
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
pair<ll, int> T[N_MAX];
for (int i = 0; i < N; i++) {
ll A;
int B;
cin >> A >> B;
T[i].first = A... | replace | 7 | 8 | 7 | 8 | 0 | |
p03103 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int main() {
int n, m, x;
cin >> n >> m;
vector<ii> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
int i = 0;
long long y = 0;
while (x < m) {
if (a[i].second > 0)
y +=... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int main() {
int n, m, x = 0;
cin >> n >> m;
vector<ii> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
int i = 0;
long long y = 0;
while (x < m) {
if (a[i].second > 0)
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03103 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define poi 1000
using namespace std;
struct girl {
int x, y;
bool operator<(girl b) const { return x < b.x; }
} a[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9') {
if (c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define poi 1000000
#define int long long
using namespace std;
struct girl {
int x, y;
bool operator<(girl b) const { return x < b.x; }
} a[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0... | replace | 5 | 6 | 5 | 7 | 0 | |
p03103 | 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, m;
cin >> n >> m;
vector<int> a(n), b(n);
vector<pair<int, int>> ab;
rep(i, n) {
cin >> a.at(i) >> b.at(i);
ab.at(i) = make_pair(a.at(i), b.at(i));
}
sort(ab.begin(), ab.end());
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int64_t> a(n), b(n);
vector<pair<int64_t, int>> ab(n);
rep(i, n) {
cin >> a.at(i) >> b.at(i);
ab.at(i) = make_pair(a.at(i), b.at(i));
}
sort(ab.begin(), ab.en... | replace | 7 | 9 | 7 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03103 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | replace | 54 | 62 | 54 | 64 | 0 | |
p03105 | C++ | Time Limit Exceeded | /**************************
* Writer : Leo101
* Problem :
* Tags :
**************************/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define File(s) \
freopen(#s ".in", "r", stdin); ... | /**************************
* Writer : Leo101
* Problem :
* Tags :
**************************/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define File(s) \
freopen(#s ".in", "r", stdin); ... | delete | 28 | 30 | 28 | 28 | TLE | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int a, b, k;
... | #include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long tint;
const int INF = 1e6;
const long double PI = acos(-1);
int main() {
int a, b, c;
... | replace | 15 | 29 | 15 | 18 | 0 | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = A * C;
if (A > B) {
cout << "0" << endl;
exit(1);
}
for (int i = 3; i <= 100; i++) {
if (ans < B) {
ans = ans + A * C;
} else {
cout << i << endl;
exit(1);
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C < B) {
cout << C << endl;
} else {
cout << int(B / A) << endl;
}
}
| replace | 6 | 18 | 6 | 10 | 1 | |
p03105 | C++ | Runtime Error | // https://cs.stackexchange.com/questions/84426/find-a-node-with-maximum-distance-from-given-node-in-a-tree
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including
// tree_order_statistics_node_update using namespace __gnu_pbds; #include
/... | // https://cs.stackexchange.com/questions/84426/find-a-node-with-maximum-distance-from-given-node-in-a-tree
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including
// tree_order_statistics_node_update using namespace __gnu_pbds; #include
/... | replace | 53 | 58 | 53 | 55 | 0 | |
p03105 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**5)
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
ans = n * (n - 1) // 2
result = [ans]
leader = [-1] * n
size = [1] * n
def leader_check(i):
if leader[i] == -1:
return i
ln = leader_check(leader[i])
leader[i] ... | a, b, c = list(map(int, input().split()))
if b > a * c:
print(c)
else:
print(int(b / a))
| replace | 0 | 32 | 0 | 5 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03105/Python/s049058276.py", line 3, in <module>
n, m = list(map(int, input().split()))
ValueError: too many values to unpack (expected 2)
|
p03105 | C++ | Runtime Error | #include <iostream>
int main() {
long A;
long B;
long C;
std::cin >> A >> B >> C;
if (A * C < B) {
std::cout << C;
} else {
std::cout << B / A;
}
main();
return 0;
} | #include <iostream>
int main() {
long A;
long B;
long C;
std::cin >> A >> B >> C;
if (A * C < B) {
std::cout << C;
} else {
std::cout << B / A;
}
return 0;
} | delete | 12 | 13 | 12 | 12 | -11 | |
p03105 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
if (a / b >= c) {
cout << c << endl;
} else if (a / b < c) {
cout << a / b << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> b >> a >> c;
if (a / b >= c) {
cout << c << endl;
} else if (a / b < c) {
cout << a / b << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n, m) for (int i = (n); i < (m); i++)
#define REP_EQ(i, n, m) for (int i = (n); i <= (m); i++)
#define CNT(i, n) for (int i = (n); i > 0; i--)
#define REP_two(i, n, m) for (int i = (n); i < (m); i += 2)
#define ll long long
int dx[4] = {1, 0, -1, 0};
int dy[4... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n, m) for (int i = (n); i < (m); i++)
#define REP_EQ(i, n, m) for (int i = (n); i <= (m); i++)
#define CNT(i, n) for (int i = (n); i > 0; i--)
#define REP_two(i, n, m) for (int i = (n); i < (m); i += 2)
#define ll long long
int dx[4] = {1, 0, -1, 0};
int dy[4... | replace | 15 | 18 | 15 | 21 | 0 | |
p03105 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define For(i, n) for (int i = 0; i < n; i++)
#define Fre(i, a, b) for (int i = a; i < b; i++)
#define sf(n) scanf("%d", &n)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a,... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define For(i, n) for (int i = 0; i < n; i++)
#define Fre(i, a, b) for (int i = a; i < b; i++)
#define sf(n) scanf("%d", &n)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a,... | replace | 62 | 66 | 62 | 63 | 0 | |
p03105 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | delete | 70 | 75 | 70 | 70 | 0 | |
p03105 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int a, b, c, co = 0;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
while (a > b || c != 0) {
b = b - a;
co++;
c--;
}
printf("%d\n", co);
return 0;
} | #include <stdio.h>
int main(void) {
int a, b, c, co = 0;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
while (a <= b && c > 0) {
b = b - a;
co++;
c--;
}
printf("%d\n", co);
return 0;
} | replace | 6 | 7 | 6 | 7 | TLE | |
p03105 | C++ | Runtime Error | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
auto ans = b / a;
return ans < c ? ans : c;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
auto ans = b / a;
std::cout << (ans < c ? ans : c) << std::endl;
;
return 0;
}
| replace | 6 | 7 | 6 | 9 | 4 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
if (A > B)
swap(A, B);
int cnt = 0;
for (int i = 0; i < A; i++) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K) {
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
if (A > B)
swap(A, B);
int cnt = 0;
for (int i = A; i > 0; i--) {
if (A % i == 0 && B % i == 0)
cnt++;
if (cnt == K) {
cout << i << endl;
break;
}
}
} | replace | 9 | 10 | 9 | 10 | -8 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
for (int i = 100; 0 < i; i++) {
if ((a / i) * i == a && (b / i) * i == b) {
k--;
if (k == 0) {
c... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
for (int i = 100; 0 < i; i--) {
if ((a / i) * i == a && (b / i) * i == b) {
k--;
if (k == 0) {
c... | replace | 15 | 16 | 15 | 16 | TLE | |
p03106 | C++ | Runtime Error | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | insert | 110 | 110 | 110 | 111 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
int cnt = 1;
cin >> A >> B >> K;
int comdiv[K];
for (int i = 1; i < 100; i++) {
if ((A % i == 0) || (B % i == 0)) {
comdiv[cnt] = i;
cnt++;
}
}
cout << comdiv[K];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
int cnt = 1;
cin >> A >> B >> K;
int comdiv[100];
for (int i = 100; 0 < i; i--) {
if ((A % i == 0) && (B % i == 0)) {
comdiv[cnt] = i;
cnt++;
}
}
cout << comdiv[K];
} | replace | 6 | 9 | 6 | 9 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | replace | 25 | 26 | 25 | 26 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.