OJ Board

Shantanu

I used this algorithm. But still WA. I think the Knigths causing me the problem. Can anyone help me with some input.

Thanks for the reply

Shantanu

Can anyone give me some critical input. I am trying this quite a some time. I am getting WA.

Thanks in advanced

Shantanu

I use the pre calculate proecess and find the res using this.
But i got TLE. Help me

Code: Select all

long double do_it(long n)
{
	n-=2;
                long double rs=1,r1;
	long p=n/2;

	for(;p>0;)
	{
		r1=p*4;
		r1=n/r1;
		rs*=r1;
		n--;p--;
	}
	rs=1-rs;
	return rs;
}

Shantanu

There is a method to find the prime factors and the power risen
by them to produce any number n.
Just see that.

m=summation of(floor(n/(p^i))) where p is a prime and i is 1,2...
until n/(p^i) become 0.

By this way u can find m such that p^m is a factor of n and m is the
highest power raised by ...

Shantanu

Don't Worry Rony

Try to catch me,
1. First run a all pair shortest paths.
2. Then find the nodes which are in the shortest path of boss (source to dest)
3. The run a single source shortest path of the employee excluding the
nodes of the boss's shortest path.
4. If exist then print the cost
5 ...

Shantanu

Thanks, I have fixed my problem

Shantanu

Sorry, the number of the problem 332

Shantanu

Can anyone tell me where is my fault: :cry:
#include <stdio.h>

#include <math.h>

double gcd(double m,double n)
{
double r=fmod(m,n);
while(r)
{
m=n;
n=r;
r=fmod(m,n);
}
return n;
}

void main(void)
{

double cse=1,x,nn,dd,j,k,div,pp,d,f;
unsigned long long dummy;
double dum;

while(2 ...

OJ Board

Search found 8 matches

278 - Chess

Fix my problem