# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7717 | baneling100 | 앵무새 (IOI11_parrots) | C++98 | 11 ms | 2432 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 "encoder.h"
#include "encoderlib.h"
static int A[21];
static long long C[41][41];
long long static H(int X, int Y) {
return C[X+Y-1][X];
}
void static MakeSequence(long long Num, int K) {
int i, j;
long long Temp;
for(i=1 ; i<=K ; i++)
for(j=A[i-1] ; j<=16 ; j++) {
Temp=H(K-i,17-j);
if(Num<=Temp || !Temp) {
A[i]=j;
break;
}
else
Num-=Temp;
}
}
void encode(int N, int M[]) {
# | 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... |