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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02989 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
int m;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
v.push_back(m);
}
int up = 0;
int down = 0;
int c = 0;
for (int i = 1; i < v[distance(v.begin(), max_element(v.begin()... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
int m;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
v.push_back(m);
}
sort(v.begin(), v.end());
int s = n / 2;
cout << v[s] - v[s - 1] << endl;
return 0;
}
| replace | 15 | 34 | 15 | 21 | TLE | |
p02989 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace ... | replace | 96 | 108 | 96 | 98 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n / 2) - a.at(n / 2 - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n / 2) - a.at(n / 2 - 1) << endl;
} | 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 0) >= this->size() (which is 0)
|
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, p[25], ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
ans = p[n / 2] - p[(n / 2) - 1];
if (ans <= 0) {
ans = 0;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n, p[500000], ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
ans = p[n / 2] - p[(n / 2) - 1];
if (ans <= 0) {
ans = 0;
}
cout << ans << endl;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using ll = long long;
int main() {
int N;
cin >> N;
int a = N / 2;
vector<int> d(N);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < n; i++) \
;
using ll = long long;
int main() {
int N;
cin >> N;
int a = N / 2;
vector<int> d(N);
for (int i ... | replace | 18 | 19 | 18 | 19 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 6) >= this->size() (which is 6)
|
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
cout << d.at(n / 2 + 1) - d.at(n / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
cout << d.at(n / 2) - d.at((n / 2) - 1) << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02989 | C++ | Runtime Error | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define null nullptr
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define precise(x) cou... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define null nullptr
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define precise(x) cou... | delete | 34 | 39 | 34 | 34 | -11 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define TEST_CASES
using ll = long long;
#define ff first
#define ss second
const int N = 1e5 + 10;
int n;
int a[N];
void solve() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int p = 0;
int ans = 0;
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
// #define TEST_CASES
using ll = long long;
#define ff first
#define ss second
const int N = 1e5 + 10;
int n;
int a[N];
void solve() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int p = 0;
int ans = 0;
for (int i = 0; p < n and i <... | replace | 19 | 21 | 19 | 21 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, a[50000] = {};
cin >> n;
rep(i, n) { cin >> a[i]; }
sort(a, a + n);
n /= 2;
cout << (a[n] - a[n - 1]) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, a[100000] = {};
cin >> n;
rep(i, n) { cin >> a[i]; }
sort(a, a + n);
n /= 2;
cout << (a[n] - a[n - 1]) << "\n";
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#include <algorithm>
int main() {
int N;
cin >> N;
int d[N];
for (int i = 0; i < N; ++i) {
cin >> d[i];
}
sort(d, d + N);
int res = 0;
int num_ARC = 0;
int num_ABC = 0;
int K_max = d[N - 1];
for (int i = 0; i < K_max; ++i) {
for (int j = 0; j < N;... | #include <iostream>
using namespace std;
#include <algorithm>
int main() {
int N;
cin >> N;
int d[N];
for (int i = 0; i < N; ++i) {
cin >> d[i];
}
sort(d, d + N);
int res = 0;
int num_ABC = d[N / 2 - 1];
int num_ARC = d[N / 2];
res = num_ARC - num_ABC;
cout << res;
} | replace | 14 | 38 | 14 | 17 | TLE | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> d(N);
int D = 0;
for (int i = 0; i < N; i++)
cin >> d[i];
sort(d.begin(), d.end());
int ans;
int diff = d[N / 2] - d[N ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
int D = 0;
for (int i = 0; i < N; i++)
cin >> d[i];
sort(d.begin(), d.end());
int ans;
int diff = d[N... | insert | 12 | 12 | 12 | 13 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, i, ans = 0;
cin >> N;
bool a = true;
vector<int> d(N);
for (i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end())... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, i, ans = 0;
cin >> N;
bool a = true;
vector<int> d(N);
for (i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end())... | replace | 18 | 32 | 18 | 20 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
int k = 0;
for (int i = d.at(n / 2); i <= d.at(i + 1); i++)
k++;
cout << k << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
cout << d.at(n / 2) - d.at(n / 2 - 1) << endl;
} | replace | 12 | 18 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 7) >= this->size() (which is 6)
|
p02989 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
long long int n, i, j;
scanf("%lld", &n);
long long int d[n];
for (i = 0; i < n; i++) {
scanf("%lld", &d[i]);
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (d[i] > d[j]) {
long long int tmp = d[i];
d[i] = d[j];
d[j] = t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
cout << a[n / 2] - a[n / 2 - 1];
} | replace | 0 | 18 | 0 | 10 | TLE | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, d[10001], ans;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d, d + N);
ans = d[N / 2] - d[N / 2 - 1];
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, d[100000], ans;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d, d + N);
ans = d[N / 2] - d[N / 2 - 1];
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
int mid_1st = d.at(0.5 * N - 1);
int mid_2nd = d.at(0.5 * N);
int res = 0;
if (mid_1st != mid_2nd) {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
int mid_1st = d.at(0.5 * N - 1);
int mid_2nd = d.at(0.5 * N);
int res = 0;
if (mid_1st != mid_2nd) {
... | delete | 22 | 25 | 22 | 22 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
int ans = 0;
for (int i = 0; i < d.size(); i++) {
cin >> d.at(i);
}
for (int K = 0; K <= 100000; K++) {
int sumR = 0;
int sumB = 0;
for (int i = 0; i < d.size(); i++) {
if... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
int ans = 0;
for (int i = 0; i < d.size(); i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(N / 2) - d.at(N / 2 - 1) << endl;
} | replace | 11 | 27 | 11 | 13 | TLE | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, d[20];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> d[i];
sort(d, d + N);
cout << d[N / 2] - d[N / 2 - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, d[100000], count = 0;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> d[i];
sort(d, d + N);
cout << d[N / 2] - d[N / 2 - 1] << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
for (int i = d[N / 2] - 1; i <= d[i]; i++) {
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> d[i];
}
sort(d.begin(), d.end());
for (int i = d[(N / 2) - 1] + 1; i <= d[N / 2]; i++) {
ans++;
}
cout << ans << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, ans = 0;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());
rep(i, 100000) {
int cnt = 0;
rep(j, n) {
if (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, ans = 0;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());
cout << d[n / 2] - d[n / 2 - 1] << endl;
return 0;
}
| replace | 12 | 24 | 12 | 13 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int med = n / 2;
int ans = a.at(med + 1) - a.at(med);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int med = n / 2;
int ans = a.at(med) - a.at(med - 1);
cout << ans << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long n;
int d[100000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (d[i] > d[j]) {
int tmp = d[i];
d[i] =... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long n;
int d[100000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n);
if (d[n / 2] == d[n / 2 - 1]) {
cout << 0 << endl;
} else {
cout << d[n / 2] - d[n / 2 - 1] << endl;
... | replace | 13 | 22 | 13 | 14 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int cnt = 0, a[10001] = {0}, n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
cout << a[n / 2 + 1] - a[n / 2];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int cnt = 0, a[100001] = {0}, n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
cout << a[n / 2 + 1] - a[n / 2];
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02989 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void swp(int &a, int &b) {
int tmp = a;
a = b;
b = tmp;
}
void quicksort(int a[], int lower, int upper) {
int bound = a[lower], l = lower, u = upper;
do {
while (a[l] < bound)
l++;
... | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void swp(int &a, int &b) {
int tmp = a;
a = b;
b = tmp;
}
void quicksort(int a[], int lower, int upper) {
int bound = a[lower], l = lower, u = upper;
do {
while (a[l] < bound)
l++;
... | replace | 33 | 34 | 33 | 34 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
int counter = 0;
for (int K = d.at(0); K <= d.at(N - 1); K++) {
int ARC = 0;
for (int i = 0; i < N; i++) ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
cout << d.at(N / 2) - d.at((N / 2) - 1) << endl;
} | replace | 14 | 27 | 14 | 15 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int d[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
cout << d[n / 2] - d[n / 2 - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int d[100000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n);
cout << d[n / 2] - d[n / 2 - 1] << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, d[10100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n);
cout << d[n / 2] - d[n / 2 - 1] << endl;
r... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, d[101000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n);
cout << d[n / 2] - d[n / 2 - 1] << endl;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(10001);
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d.begin(), d.begin() + n);
cout << d[n / 2] - d[n / 2 - 1] << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(100001);
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d.begin(), d.begin() + n);
cout << d[n / 2] - d[n / 2 - 1] << "\n";
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
l.at(i) = d.at(i);
}
sort(l.begin(), l.end());
int cnt = 0;
for (int k = l.at(0); k <= l.at(n - 1); k++) {
int ARC = 0;
int ABC... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d.begin(), d.end());
int ans = d[n / 2] - d[n / 2 - 1];
cout << ans << endl;
return 0;
} | replace | 7 | 29 | 7 | 13 | TLE | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
int MIN = 1000040, MAX = -1;
rep(i, n) {
cin >> d[i];
MIN = min(MIN,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) { cin >> d[i]; }
sort(d.begin(), d.end());
ll right = d[n / 2];
... | replace | 10 | 29 | 10 | 15 | TLE | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, mass, count;
cin >> N;
mass = 0;
count = 0;
vector<int> diff(N);
for (int i = 0; i < N; i++) {
cin >> diff.at(i);
}
for (int K = 1; K < 100001; K++) {
for (int i = 0; i < N; i++) {
if (K >= diff.at(i)) {
mass++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, mass, count;
cin >> N;
mass = 0;
count = 0;
vector<int> diff(N);
for (int i = 0; i < N; i++) {
cin >> diff.at(i);
}
sort(diff.begin(), diff.end());
count = diff.at(N / 2) - diff.at(N / 2 - 1);
cout << count << endl;
}
| replace | 13 | 28 | 13 | 17 | TLE | |
p02989 | C++ | Time Limit Exceeded | #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);
sort(p.begin(), p.end());
int abc = 0;
int pat = 0;
for (int i = p.at(0); i <= p.at(n - 1); i++) {
for (int j = 0; j < n; j++) {
if (i > p.at(j))
... | #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);
sort(p.begin(), p.end());
int ans = 0;
ans = p.at(n / 2) - p.at(n / 2 - 1);
cout << ans << endl;
} | replace | 10 | 24 | 10 | 14 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
int d1 = d.at(n / 2), d2 = d.at((n / 2) + 1), k = d2 - d1;
cout << k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
int d1 = d.at((n / 2) - 1), d2 = d.at(n / 2), k = d2 - d1;
cout << k << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 1
#define fi first
#define se second
#define pb push_back
#define fore(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define DEBUG 1
#define fi first
#define se second
#define pb push_back
#define fore(... | replace | 36 | 37 | 36 | 37 | 0 | |
p02989 | C++ | Time Limit Exceeded | // Divide the Problems
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int o = 0;
bool isMin(int d) { return d >... | // Divide the Problems
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int o = 0;
bool isMin(int d) { return d >... | replace | 21 | 26 | 21 | 22 | TLE | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int a = vec.at(n / 2 - 1);
int b = vec.at(n / 2);
cout << b - a << endl;
} | #include <algorithm>
#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.at(i);
}
sort(vec.begin(), vec.end());
int a = vec.at(n / 2 - 1);
int b = vec.at(n / 2);
cout << b - a << endl;
} | insert | 7 | 7 | 7 | 8 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
int a[25];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
sort(a, a + n);
cout << a[n / 2] - a[n / 2 - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
int a[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
sort(a, a + n);
cout << a[n / 2] - a[n / 2 - 1] << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> D(N);
for (int i = 0; i < N; i++)
cin >> D.at(i);
sort(D.begin(), D.end());
int ans = D.at(N / 2) - D.at(N / 2 - 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> D(N);
for (int i = 0; i < N; i++)
cin >> D.at(i);
sort(D.begin(), D.end());
int ans = D.at(N / 2) - D.at(N / 2 - 1);
cout << ans << endl;
} | insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> d(N);
for (int i = 0; i < N; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
int ans = d.at(N / 2) - d.at(N / 2 - 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
int ans = d.at(N / 2) - d.at(N / 2 - 1);
cout << ans << endl;
} | insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int b[10000];
int a;
cin >> a;
int x = a / 2;
int y = x - 1;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
sort(b, b + a);
cout << (b[x] - b[y]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int b[100000];
int a;
cin >> a;
int x = a / 2;
int y = x - 1;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
sort(b, b + a);
cout << (b[x] - b[y]);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02989 | C++ | Runtime Error | /*#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
char a=0,b=0;
int aa=0,bb=0;
cin>>s;
for(int i=0;i<4;i++)
if(a==0) a=s[i];
else if(s[i]==a) aa++;
else if(b==0) b=s[i];
else if(s[i]==b) bb++;
else
{
... | /*#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
char a=0,b=0;
int aa=0,bb=0;
cin>>s;
for(int i=0;i<4;i++)
if(a==0) a=s[i];
else if(s[i]==a) aa++;
else if(b==0) b=s[i];
else if(s[i]==b) bb++;
else
{
... | replace | 43 | 44 | 43 | 44 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(N / 2 + 1) - d.at(N / 2) + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(N / 2) - d.at(N / 2 - 1) << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = m... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = m... | replace | 37 | 38 | 37 | 38 | 0 | |
p02989 | C++ | Runtime Error | /* ****GT_18**** */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll ... | /* ****GT_18**** */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll ... | replace | 29 | 30 | 29 | 30 | 0 | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin... | replace | 20 | 21 | 20 | 21 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int check(int a[], int n, int num) {
int c1 = 0, c2 = 0;
for (int i = 0; i < n; i++) {
if (a[i] < num)
c1++;
else
c2++;
}
return (c1 == c2);
}
void solve() {
int n;
cin >> n;
int a[n];
int max = 0;
for (int i =... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int check(int a[], int n, int num) {
int c1 = 0, c2 = 0;
for (int i = 0; i < n; i++) {
if (a[i] < num)
c1++;
else
c2++;
}
return (c1 == c2);
}
void solve() {
int n;
cin >> n;
int a[n];
int max = 0;
for (int i =... | replace | 25 | 31 | 25 | 26 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(n / 2 + 1) - d.at(n / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
cout << d.at(n / 2) - d.at(n / 2 - 1) << endl;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < vec.at(N - 1); i++) {
if (vec.at(... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < vec.at(N - 1) + 1; i++) {
if (vec... | replace | 16 | 18 | 16 | 18 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | replace | 76 | 77 | 76 | 77 | 0 | |
p02989 | C++ | Runtime Error | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | replace | 53 | 70 | 53 | 54 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());
int cnt = 0;
for (int i = 1; i <= d[n - 1]; i++) {
int l = 0, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> b(n);
rep(i, n) cin >> b[i];
sort(b.begin(), b.end());
int ans = b[b.size() / 2] - b[b.size() / 2 - 1];
cout << ans << en... | replace | 9 | 25 | 9 | 14 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n / 2 + 1) - a.at(n / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n / 2) - a.at(n / 2 - 1) << endl;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02989 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int mid(int a, int b, int c) {
return a + b + c - max(max(a, b), c) - min(min(a, b), c);
}
int main() {
int N;
cin >> N;
vector<int> D(N);
for (int i = 0; i < N; i++) {
cin >> D.at(i);
}
int count = 0;
for (int k = 0; k < 100000; k++) {
int R = 0, C... | #include <bits/stdc++.h>
using namespace std;
int mid(int a, int b, int c) {
return a + b + c - max(max(a, b), c) - min(min(a, b), c);
}
int main() {
int N;
cin >> N;
vector<int> D(N);
for (int i = 0; i < N; i++) {
cin >> D.at(i);
}
sort(D.begin(), D.end());
cout << D.at(N / 2) - D.at(N / 2 - 1) <<... | replace | 13 | 30 | 13 | 15 | TLE | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// C
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
ll i;
ll a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// C
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
ll i;
ll a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
cout << a[n / 2] - a[(n / 2) - 1];
} | delete | 6 | 9 | 6 | 6 | -11 | |
p02989 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> ppi;
const int MAX_N = 5e4 + 20, MAX_M = 2e5 + 10, SQRT = 230, inf = 1000000000;
int n, Arr[MAX_N];
int cnt;
int main() {
ios::sync_with_stdio(false),... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> ppi;
const int MAX_N = 2e5 + 10, MAX_M = 2e5 + 10, SQRT = 230, inf = 1000000000;
int n, Arr[MAX_N];
int cnt;
int main() {
ios::sync_with_stdio(false),... | replace | 10 | 11 | 10 | 11 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[21];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
if (a[n / 2] == a[n / 2 - 1])
cout << 0 << endl;
else
cout << (a[n / 2] - a[n / 2 - 1]) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200001];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
if (a[n / 2] == a[n / 2 - 1])
cout << 0 << endl;
else
cout << (a[n / 2] - a[n / 2 - 1]) << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mp(n, 0);
for (int i = 0; i < n; i++) {
int d;
cin >> d;
mp[d - 1]++;
}
int ans = 0;
long long sum = 0;
for (int i = 0; i < 100000; i++) {
sum += mp[i];
if (n - sum == sum) {
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mp(100000, 0);
for (int i = 0; i < n; i++) {
int d;
cin >> d;
mp[d - 1]++;
}
int ans = 0;
long long sum = 0;
for (int i = 0; i < 100000; i++) {
sum += mp[i];
if (n - sum == sum) {
ans++;
... | replace | 5 | 6 | 5 | 6 | -11 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ma... | #include <bits/stdc++.h>
#define all(A) begin(A), end(A)
#define rall(A) rbegin(A), rend(A)
#define sz(A) int(A.size())
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ma... | replace | 29 | 30 | 29 | 30 | 0 | |
p02989 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n);
int mx = 0;
for (int &i : v) {
cin >> i;
mx = max(i, mx);
}
... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v(n);
int mx = 0;
for (int &i : v) {
cin >> i;
mx = max(i, mx);
}
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02989 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | replace | 62 | 63 | 62 | 63 | 0 | |
p02990 | Python | Runtime Error | import math
n, k = map(int, input().split())
mod = 10**9 + 7
def cmb_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(1, k + 1):
# print("{0}C{1} * {2}C{3}".format(n - k + 1, i, k-1,i-1))
print(((cmb_count((n - k + 1), i) % mod) * (cmb_count(k - 1, i -... | import math
n, k = map(int, input().split())
mod = 10**9 + 7
def cmb_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(1, k + 1):
# print("{0}C{1} * {2}C{3}".format(n - k + 1, i, k-1,i-1))
if n - k + 1 >= i:
print(((cmb_count((n - k + 1), i) % m... | replace | 12 | 13 | 12 | 16 | 0 | |
p02990 | Python | Runtime Error | from scipy.special import comb
def solve(string):
n, k = map(int, string.split())
ans = []
for i in range(1, k + 1):
base = comb(n - k + 1, i, exact=True)
var = comb(k - 1, i - 1, exact=True)
ans.append(str(base * var % (10**9 + 7)))
return "\n".join(ans)
if __name__ == "__ma... | from scipy.misc import comb
def solve(string):
n, k = map(int, string.split())
ans = []
for i in range(1, k + 1):
base = comb(n - k + 1, i, exact=True)
var = comb(k - 1, i - 1, exact=True)
ans.append(str(base * var % (10**9 + 7)))
return "\n".join(ans)
if __name__ == "__main_... | replace | 0 | 1 | 0 | 1 | ModuleNotFoundError: No module named 'scipy' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02990/Python/s841009615.py", line 1, in <module>
from scipy.special import comb
ModuleNotFoundError: No module named 'scipy'
|
p02990 | C++ | Runtime Error | #include <iostream>
// #include <iomanip>
// #include <string>
#include <vector>
// #include <algorithm>
// #include <utility>
// #include <set>
// #include <map>
// #include <queue>
// #include <deque>
// #include <bitset>
// #include <math.h>
using namespace std;
using ll = long long;
// using ld = long double ;
usin... | #include <iostream>
// #include <iomanip>
// #include <string>
#include <vector>
// #include <algorithm>
// #include <utility>
// #include <set>
// #include <map>
// #include <queue>
// #include <deque>
// #include <bitset>
// #include <math.h>
using namespace std;
using ll = long long;
// using ld = long double ;
usin... | insert | 55 | 55 | 55 | 59 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Hello \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n... | #include <bits/stdc++.h>
using namespace std;
#define Hello \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n... | replace | 26 | 27 | 26 | 31 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define reg register
#define int long long
using namespace std;
const int MAXN = 5010;
const int mod = 1e9 + 7;
int n, k, fac[MAXN], inv[MAXN];
int getc(int n, int m) {
return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
void work() {
fac[0] = inv[0] = fac[1] = inv[1] = 1;
for (reg i... | #include <bits/stdc++.h>
#define reg register
#define int long long
using namespace std;
const int MAXN = 5010;
const int mod = 1e9 + 7;
int n, k, fac[MAXN], inv[MAXN];
int getc(int n, int m) {
if (m > n)
return 0;
return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
void work() {
fac[0] = inv[0] = fac[1]... | insert | 8 | 8 | 8 | 10 | 0 | |
p02990 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
const LL MOD = 1000000007;
LL fac[2020];
LL power(LL a, LL b) {
LL x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % MOD;
y = (y * y) % MOD;
b /= 2;
}
return x % MOD;
}
LL mod_inv(LL n) { return power(n, MOD - 2); }
... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
const LL MOD = 1000000007;
LL fac[2020];
LL power(LL a, LL b) {
LL x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % MOD;
y = (y * y) % MOD;
b /= 2;
}
return x % MOD;
}
LL mod_inv(LL n) { return power(n, MOD - 2); }
... | replace | 38 | 40 | 38 | 46 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
#define ff(i, n) for (int i = 1; i <= n; i++)
ll C[4005][4005], n, k;
ll solve(int i, int total) {
if (total < i)
return 0;
if (i == 0 && total > 0)
return 0;
if (i < 0)
return 0;
total -= i;
return C[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
#define ff(i, n) for (int i = 1; i <= n; i++)
ll C[4005][4005], n, k;
ll solve(int i, int total) {
if (total < i)
return 0;
if (i == 0 && total > 0)
return 0;
if (i == 0 && total == 0)
return 1;
if (i < ... | insert | 16 | 16 | 16 | 18 | -11 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 関数
const long INF = 1000000000000000;
const long MOD = 1000000007;
long modinv(long a) {
long b = MOD, u = 1, v = 0;
while (b) {
long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;... | #include <bits/stdc++.h>
using namespace std;
// 関数
const long INF = 1000000000000000;
const long MOD = 1000000007;
long modinv(long a) {
long b = MOD, u = 1, v = 0;
while (b) {
long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;... | replace | 34 | 35 | 34 | 38 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MOD (long)(1e9 + 7)
#define MAX 1000000 // 階乗をいくつまで計算するか
class modlong;
void computeAll(long n);
modlong modComb(long n, long k);
modlong modFact(long n);
class modlong {
long val;
const lon... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define MOD (long)(1e9 + 7)
#define MAX 1000000 // 階乗をいくつまで計算するか
class modlong;
void computeAll(long n);
modlong modComb(long n, long k);
modlong modFact(long n);
class modlong {
long val;
const lon... | replace | 190 | 209 | 190 | 192 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ... | replace | 49 | 50 | 49 | 51 | 0 | |
p02990 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
long long int mod = 1000000007;
long long int f[1010100];
void init() {
f[0] = 1;
for (int i = 1; i < 1010100; i++)
f[i] = (f[i - 1] * i) % mod;
}
long long int inv(long long int x) {
long long int res = 1;
long long int k = mod - 2;
long long int y = x;
... | #include "bits/stdc++.h"
using namespace std;
long long int mod = 1000000007;
long long int f[1010100];
void init() {
f[0] = 1;
for (int i = 1; i < 1010100; i++)
f[i] = (f[i - 1] * i) % mod;
}
long long int inv(long long int x) {
long long int res = 1;
long long int k = mod - 2;
long long int y = x;
... | replace | 40 | 41 | 40 | 41 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll n) {
if (n == 0)
return 1;
else if (n == 1)
return a;
else if (n % 2)
return a * modpow(a * a % mod,... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll n) {
if (n == 0)
return 1;
else if (n == 1)
return a;
else if (n % 2)
return a * modpow(a * a % mod,... | replace | 34 | 35 | 34 | 35 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <io... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cstdlib>
#include <deque> // deque
#include <io... | replace | 54 | 55 | 54 | 59 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d", &x);
ll mpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d", &x);
ll mpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}... | replace | 43 | 44 | 43 | 45 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <complex>
#define ll long long
#define ld long double
#define F first
#define S second
#define Tsetso \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define pi acos(-1)
#de... | #include <bits/stdc++.h>
#include <complex>
#define ll long long
#define ld long double
#define F first
#define S second
#define Tsetso \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define pi acos(-1)
#de... | insert | 47 | 47 | 47 | 49 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const ll INF = 0x3f3f3f3f;
#define mod 1000000007
using namespace std;
// priority_queue
const ll Maxn = 1e5;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#define ll long long
const ll INF = 0x3f3f3f3f;
#define mod 1000000007
using namespace std;
// priority_queue
const ll Maxn = 1e5;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll kc(ll a, ll b) {
ll c = 1;
while (b) {
... | insert | 26 | 26 | 26 | 28 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
const int mod = (int)1e9 + 7;
void __print() { cerr << "]\n"; }
template <typename T, typename... V> void __print(T t, V... v) {
cerr << t;
if (sizeof...(v))
cerr << ", ";
__print(v...);
}
#define dbg(x..... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
const int mod = (int)1e9 + 7;
void __print() { cerr << "]\n"; }
template <typename T, typename... V> void __print(T t, V... v) {
cerr << t;
if (sizeof...(v))
cerr << ", ";
__print(v...);
}
#define dbg(x..... | insert | 37 | 37 | 37 | 44 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define IO ... | replace | 36 | 37 | 36 | 43 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
const ll Q = 1000000007;
ll fact_list[100005];
ll pow_q(ll x, ll y) {
if (y == 0)
return 1;
ll ans = 1;
ll z = x;
ll s = 0;
while (y >> s > 0) {
if ((y >> s) % 2)
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
const ll Q = 1000000007;
ll fact_list[100005];
ll pow_q(ll x, ll y) {
if (y == 0)
return 1;
ll ans = 1;
ll z = x;
ll s = 0;
while (y >> s > 0) {
if ((y >> s) % 2)
... | insert | 38 | 38 | 38 | 40 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
constexpr int MOD = 1e9 + 7;
constexpr int MAXN = 4003;
int sum(int a, int b, int mod = MOD) {
int c = a + b;
if (c >= mod) {
c -= ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
constexpr int MOD = 1e9 + 7;
constexpr int MAXN = 4003;
int sum(int a, int b, int mod = MOD) {
int c = a + b;
if (c >= mod) {
c -= ... | replace | 56 | 57 | 56 | 59 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int nCr[2003][2003];
int main() {
int N, K, MOD = 1000000007;
cin >> N >> K;
for (int i = 0; i < 2003; i++)
for (int j = 0; j < 2003; j++)
nCr[i][j] = 0;
nCr[0][0] = 1;
for (int i = 1; i < 2003; i++)
for (int j = 0; j <= i; j++) {
if... | #include <bits/stdc++.h>
using namespace std;
long long int nCr[2003][2003];
int main() {
int N, K, MOD = 1000000007;
cin >> N >> K;
for (int i = 0; i < 2003; i++)
for (int j = 0; j < 2003; j++)
nCr[i][j] = 0;
nCr[0][0] = 1;
for (int i = 1; i < 2003; i++)
for (int j = 0; j <= i; j++) {
if... | replace | 20 | 24 | 20 | 21 | 0 | |
p02990 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long kMod = 1e9 + 7;
vector<vector<long long>> nck;
long long combinations(long long n, long long k) {
if (n < (long long)nck.size() && k < (long long)nck.at(n).size()) {
return nck.at(n).at(k);
}
nck.resize(n + 1);
for ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long kMod = 1e9 + 7;
vector<vector<long long>> nck;
long long combinations(long long n, long long k) {
if (n < k) {
return 0;
}
if (n < (long long)nck.size() && k < (long long)nck.at(n).size()) {
return nck.at(n).at(k)... | insert | 10 | 10 | 10 | 13 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long modInverse(long long n, long long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long modInverse(long long n, long long ... | replace | 30 | 34 | 30 | 31 | -11 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##... | replace | 83 | 84 | 83 | 87 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD (1000000007)
using namespace std;
long long f(long long n) {
static long long memo[1000000] = {0};
if (memo[n] > 0)
return memo[n];
if (n == 0)
return 1;
return memo[n] = (n * f(n - 1)) % MOD;
}
long long expmod(long long b, long long e) {
if (e == 0)
retur... | #include <bits/stdc++.h>
#define MOD (1000000007)
using namespace std;
long long f(long long n) {
static long long memo[1000000] = {0};
if (memo[n] > 0)
return memo[n];
if (n == 0)
return 1;
return memo[n] = (n * f(n - 1)) % MOD;
}
long long expmod(long long b, long long e) {
if (e == 0)
retur... | replace | 44 | 46 | 44 | 50 | 0 | |
p02990 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int M = 1e9 + 7;
int n, k;
long long kaijo[2200];
int mpow(long long a, int n) {
if (n == 0)
return 1;
if (n % 2)
return mpow(a, n - 1) * a % M;
return mpow(a * a % M, n / 2);
}
long long cmb(int n, int r) {
return kaijo[n] * mpow(kaijo[r], M - 2) % M *... | #include <iostream>
using namespace std;
const int M = 1e9 + 7;
int n, k;
long long kaijo[2200];
int mpow(long long a, int n) {
if (n == 0)
return 1;
if (n % 2)
return mpow(a, n - 1) * a % M;
return mpow(a * a % M, n / 2);
}
long long cmb(int n, int r) {
return kaijo[n] * mpow(kaijo[r], M - 2) % M *... | replace | 29 | 30 | 29 | 33 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
// MOD
const int64_t MOD = 1e9 + 7;
struct Fp {
int64_t x;
Fp() : x(0) {}
Fp(int y) : x... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef int64_t ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
// MOD
const int64_t MOD = 1e9 + 7;
struct Fp {
int64_t x;
Fp() : x(0) {}
Fp(int y) : x... | replace | 80 | 82 | 80 | 86 | 0 | |
p02990 | Python | Runtime Error | import math
def combi(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n, k = map(int, input().split())
div_num = 10**9 + 7
for i in range(1, k + 1):
print(combi(n - k + 1, i) * combi(k - 1, i - 1) % div_num)
| import math
def combi(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n, k = map(int, input().split())
div_num = 10**9 + 7
for i in range(1, k + 1):
if n - k + 1 >= i:
print(combi(n - k + 1, i) * combi(k - 1, i - 1) % div_num)
else:
print(0)
| replace | 10 | 11 | 10 | 14 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll fact(ll n) {
if (n == 0) {
return 1;
}
return fact((n - 1) % MOD) * n % MOD;
}
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll fact(ll n) {
if (n == 0) {
return 1;
}
return fact((n - 1) % MOD) * n % MOD;
}
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
... | replace | 28 | 29 | 28 | 35 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(var, n) for (int var = 0; var < (n); ++var)
const ll MOD = 1e9 + 7;
#define MAX_V (long long)(1e5 * 2 + 200)
ll MAX_VAL;
ll fac[MAX_V], mmi[MAX_V];
inline void factorial() {
fac[0] = fac[1] = 1;
for (long long i = 2; i < MAX_VAL; f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(var, n) for (int var = 0; var < (n); ++var)
const ll MOD = 1e9 + 7;
#define MAX_V (long long)(1e5 * 2 + 200)
ll MAX_VAL;
ll fac[MAX_V], mmi[MAX_V], temp[MAX_V];
inline void factorial() {
fac[0] = fac[1] = 1;
for (long long i = 2; i... | replace | 11 | 12 | 11 | 12 | 0 | |
p02990 | Python | Runtime Error | import math
def combination_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N, K = map(int, input().split())
blue = K
red = N - K
num = 10**9 + 7
for k in range(K):
space_comb = combination_count(red + 1, k + 1)
ball_comb = combination_count(K - 1, k)
print(... | import math
def combination_count(n, r):
if n - r < 0:
return 0
else:
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N, K = map(int, input().split())
blue = K
red = N - K
num = 10**9 + 7
for k in range(K):
space_comb = combination_count(red + 1, k + 1)
ba... | replace | 4 | 5 | 4 | 8 | 0 | |
p02990 | Python | Runtime Error | import math
n, k = map(int, input().split())
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(1, k + 1):
tmp1 = combinations_count(k - 1, i - 1) % 1000000007
tmp2 = combinations_count(n - k + 1, i) % 1000000007
ans = (tmp1 * tmp2) ... | import math
n, k = map(int, input().split())
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(1, k + 1):
if n - k + 1 >= i:
tmp1 = combinations_count(k - 1, i - 1) % 1000000007
tmp2 = combinations_count(n - k + 1, i) % 1000... | replace | 10 | 16 | 10 | 17 | 0 | |
p02990 | Python | Runtime Error | import math
import sys
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
input = sys.stdin.readline
N, K = map(int, input().strip().split(" "))
div = 1000000000 + 7
for i in range(K):
perm = comb(N - K + 1, i + 1) * comb(K - 1, i)
print(perm % div)
| import math
import sys
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
input = sys.stdin.readline
N, K = map(int, input().strip().split(" "))
div = 1000000000 + 7
for i in range(K):
if i > N - K:
print(0)
else:
perm = comb(N - K + 1, i + 1) * com... | replace | 14 | 16 | 14 | 19 | 0 | |
p02990 | Python | Runtime Error | N, K = map(int, input().split())
ans = N - K + 1
for i in range(1, K + 1):
if i > N - K + 1:
ans = 0
print(int(ans % 1000000007))
ans = ans * (N - K + 1 - i) / (i + 1) * (K - i) / i
| N, K = map(int, input().split())
ans = N - K + 1
for i in range(1, K + 1):
if i > N - K + 1:
ans = 0
print(ans % 1000000007)
ans = ans * (N - K + 1 - i) * (K - i)
ans = ans // ((i + 1) * i)
| replace | 5 | 7 | 5 | 8 | 0 | |
p02990 | C++ | Runtime Error | void solve();
int main() {
solve();
return 0;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
#include <algorithm>
#include <assert.h>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <set>
#include <string>
#include ... | void solve();
int main() {
solve();
return 0;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
#include <algorithm>
#include <assert.h>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <set>
#include <string>
#include ... | replace | 145 | 146 | 145 | 149 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
std::vector<std::vector<long long>> comb(int n, int r) {
std::vector<std::vector<long long>> v(n + 1,
std::vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
std::vector<std::vector<long long>> comb(int n, int r) {
std::vector<std::vector<long long>> v(n + 1,
std::vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
... | replace | 25 | 27 | 25 | 28 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(... | insert | 40 | 40 | 40 | 44 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define P 1000000007
#define ll long long
using namespace std;
ll a[2001];
ll inv[2001];
long long modinv(long long a, long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 999999999
#define P 1000000007
#define ll long long
using namespace std;
ll a[2001];
ll inv[2001];
long long modinv(long long a, long long... | replace | 38 | 41 | 38 | 45 | 0 | |
p02990 | C++ | Runtime Error | //
// Created by Hideaki Imamura on 2020-03-17.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | //
// Created by Hideaki Imamura on 2020-03-17.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | replace | 83 | 84 | 83 | 91 | 0 | |
p02990 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | replace | 48 | 49 | 48 | 52 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.