# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50292 | mra2322001 | Bootfall (IZhO17_bootfall) | C++14 | 450 ms | 4588 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 f0(i, n) for(int i=(0); i<n; i++)
#define f1(i, n) for(int i=(1); i<=n; i++)
using namespace std;
typedef long long ll;
const int N = 502;
int n, a[N], f[N*N], tmp[N*N], sum = 0, dd[N*N];
void add(int x){
for(int i = sum; i >= 0; i--){
f[i] += f[i - x];
}
}
void del(int x){
for(int i = 0; i <= sum; i++) tmp[i] = f[i];
for(int i = 0; i <= sum; i++){
if(i >= x)
tmp[i] -= tmp[i - x];
}
}
int main(){
ios_base::sync_with_stdio(0);
cin >> n;
f[0] = 1;
f1(i, 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... |