# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308924 | shrek12357 | Mate (COCI18_mate) | C++14 | 1904 ms | 39416 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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
using namespace std;
#define ll long long
//cin.tie(0);
//ios_base::sync_with_stdio(0);
const int MOD = 1e9 + 7;
const int MAXN = 2005;
int main() {
ll bin[MAXN + 5][MAXN + 5];
for (int i = 0; i <= MAXN; i++)
{
for (int j = 0; j <= i; j++)
{
if (j == 0 || j == i)
bin[i][j] = 1;
else
bin[i][j] = (bin[i - 1][j - 1] +
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |