اين كد منه اما اعداد بزرگ رو ساپورت نميكنه ..........
#include <conio.h>
#include <iostream>
using namespace std;
long long f(long long k)
{
long long ans=1;
for(long long i=1;i<=k;i++)
ans*=i;
return ans;
}
int main()
{
int n,k,count=0...
SABB قبلا نوشته بود :
1.
We can find an odd coin (which is lighter) in 9 coins (8 original & 1 odd) by using a beam balance in just 3 measuring levels, it can be proven easily that 3 is the minimum amount. let L(n) be the minimum number of levels to find an odd...