# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883470 | dejandenib | Parrots (IOI11_parrots) | C++17 | 4 ms | 5980 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>
#include "encoder.h"
#include "encoderlib.h"
#include <string>
#include<map>
#include<algorithm>
using namespace std;
long long mapa2[92400];
int broj = 0;
map<long long ,int> mapa;
void rec(int posledno, int n, long long s,int depth){
if(depth==n)
{
mapa[s]=broj;
// mapa2[broj]=s;
//cout<<s<<" "<<broj<<endl;
broj++;
return;
}
for(long long i =posledno;i<n;i++)
{
rec(i,n,s*10LL+i,depth+1);
}
}
Compilation message (stderr)
# | 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... |