# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150706 | akzytr | Sateliti (COCI20_satellti) | C++20 | 621 ms | 64880 KiB |
#include <bits/stdc++.h>
#define ve vector
#define ar array
#define pb push_back
#define ins insert
#define endl '\n'
#define ll long long
using namespace std;
const int MXN = 2000;
const ll P = 2;
const ll Q = 3;
const ll B = 1e9+7;
ll p[MXN][MXN];
ll s[MXN][MXN];
int n, m;
void po(){
for(int i = 0; i < 2 * n; i++){
for(int j = 0; j < 2 * m; j++){
if(i == 0 && j == 0){
p[i][j] = 1;
}
else if(i == 0){
p[i][j] = (p[i][j-1] * Q)%B;
}
else{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |