I am solving Bytelandian gold coin problem(under “practise”->“medium”->most successful submissions):
#include<stdio.h>
#include<stdlib.h>
long long int calculateDollars(long long int);
int main(){
int testCases;
long long int n,result;
scanf("%d",&testCases);
while(testCases--!=0){
scanf("%lld",&n);
result = calculateDollars(n);
printf("%lld\n",result);
}
return 0;
}
long long int calculateDollars(long long int n){
if(n<=11)
return n;
if((n/2+n/3+n/4)<=n)
return n;
return(calculateDollars(n/2)+calculateDollars(n/3)+calculateDollars(n/4));
}