# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444355 | KiriLL1ca | Bootfall (IZhO17_bootfall) | C++14 | 489 ms | 3920 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;
/*
written on phone :)))))
*/
const int N = 505;
unsigned long long dp[N*N];
int ans[N*N];
void add (int x) {
for (int i = N*N-x-1; i >= 0; i--) {
dp[i+x] += dp[i];
}
}
void del (int x) {
for (int i = x; i < N*N; i++) {
dp[i] -= dp[i-x];
}
}
int main ()
{
dp[0] = 1;
int n; cin >> n;
vector <int> a (n);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |