# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9519 | eternalklaus | Your life (kriii2_Y) | C++98 | 0 ms | 1752 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.
/*
* y.cpp
*
* Created on: 2014. 9. 28.
* Author: minque
*/
#include <iostream>
using namespace std;
int d[100+1][100+1];
int ds[100+1][100+1];
int dream(int curr){
if(curr == 1) return 0;
int n = -1;
int v = 0;
for(int i = 1; i <= curr; i++){
if(d[curr][i] && ds[curr][i]){
v=dream(i);
if(v == -1) ds[curr][i] = 0;
if(n == -1 || v < n) n = v;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |