# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
269711 | sebinkim | Ruins 3 (JOI20_ruins3) | C++14 | 753 ms | 13688 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
ll C[1212][1212], K[666][1212][2], D[666], B[666];
bool A[1212];
ll n, s;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll i, j, l, c0, c1;
cin >> n;
for(i = C[0][0] = 1; i <= n; i ++){
for(j = C[i][0] = 1; j <= n; j ++){
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
}
}
K[0][0][0] = 1;
for(i = 1; i <= n; i ++){
c0 = c1 = 0;
for(j = 1; j <= n + n; j ++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |