# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199050 | Andrei_Cotor | Lucky Numbers (RMI19_lucky) | C++14 | 52 ms | 10892 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.
//aparent substring e subsecventa, nu subsir
#include<iostream>
#define MOD 1000000007
using namespace std;
class dynamic
{
public:
int Dp[2][2],len; //prima-pe primu 3, a doua-pe ultimu 1
int st,dr;
bool eq; //posibil ca nr sa fie egal cu cel din secventa
void init(int x)
{
Dp[0][0]=Dp[0][1]=Dp[1][0]=Dp[1][1]=0;
len=1;
eq=1;
int nr=0;
if(x>1)
{
nr++;
Dp[0][1]=1;
}
if(x>3)
{
# | 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... |