# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330926 | ZwariowanyMarcin | K-th path (IZhO11_kthpath) | C++14 | 1 ms | 512 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>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
using ll = long long;
using namespace std;
const int N = 100;
const ll INF = 1LL << 60;
void add(ll &a, ll b) {
a += b;
a = min(a, INF);
}
ll qq(ll a, ll b) {
if (a > INF / b) return INF;
return a * b;
}
int n, m;
char s[N][N];
ll dp[N][N], k, C[N][N];
vector <pair<int, int>> lvl[N];
int main() {
for (int i = 0; i < N; ++i) {
C[i][0] = C[i][i] = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |