# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15212 | hodduc | 맛있는 과자 (kriii3_A) | C++98 | 0 ms | 1216 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<stdio.h>
#include<cmath>
#include<algorithm>
int a,b,n;
long long k;
long long pyt[50][50];
double base, lna, lnb, lnc;
struct L {
double val;
long long cnt;
}ll[50];
bool acomp(L a, L b) {
return a.val < b.val;
}
int main()
{
pyt[0][0] = 1;
for(int i=1;i<41;i++){
pyt[i][0]=1;
pyt[i][i]=1;
for(int j=1;j<i;j++) pyt[i][j]=pyt[i-1][j]+pyt[i-1][j-1];
}
scanf("%d %d %d %lld", &a, &b, &n, &k);
lna = log(a)*2;
lnb = log(b)*2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |