OJ Board

Towhid

Can anyone tell me the maximum value for n???????

Towhid

Among all pairs with minimum sum of values I always take the one with minimum first element. So my code passes your test case.
It fails this test case:
7
2 4 6 6 7 9 9
Your greedy would choose 9,2,9 as the first team, and wouldn't be able to make a second team.
But When there are 7 persons, I ...

Towhid

as soyoja wrote:

Quote:
The only trick of this problem is distinguish between clockwise and
counter-clocwise.
Counting angle for clockwise is (start point) - ( end point )
Counting angle for counter clockwise is (end point) - (start point )

i know, in above way the problem will be ...

Towhid

Well, thanks. A small modification and got AC. The interesting thing is when both side has more than 3 soldiers, then the optimal way is to send most possible of them. However, the statement of the problem should be clearer.........

Towhid

1. no it is not necessary to send 3 armies always. they are the best possible player so they both plays optimally.

Is it? But the problem statement says:

It

Towhid

You cannot use all your army in attack. Read When attacking, at least one army must remain on the origin territory, so a player with 3 armies can only use 2 of them to attack an adjacent territory. The defense, however, can use all the available number of armies to defend, up to a maximum allowed ...

Towhid

altaf hussain(sust_2002) wrote: for( j=0 ; j < num ; j++ ) {
if( array[j] != 0 ) {
sum = num + j ;
array[ sum ]++ ;
}
}
}

}

Still problem here. Try

Code: Select all

1 6 8 10 25

This is not an A sequence, but your program outputs the opposite...

Towhid

altaf hussain(sust_2002) wrote:
for( i = 0 ; i<n ; i++){
array[ num ]++;
for( j=0 ; j < num ; j++ ) {
if( array[j] != 0 ) {
sum = num + j ;
array[ sum ]++ ;
}
}
}
}

I think this doesn't work correctly. Try the input:

Code: Select all

5 1 6 8 10 12

This is an A-sequence, but what your program says?????

Towhid

shanto86 wrote:and when the rest + colored < best i will cutoff... is there any other things?

What is best? Is it the number of elements in the largest set? But you also have to count the number of possible sets. How can you cut off?

Towhid

The first thing is you should not sort the data. And 2nd thing when there is a thread containing the same problem use that thread, don't create a new one. However you haven't checked if the data are strictly increasing order. Try it...

Towhid

I think now I understand the problem. I had some wrong idea. But now
I have same kind of problem. My code outputs 172 for 100. for 171 the probability is 0.4986... Most of the outputs matches. I have used:

p(m,n)=p1*p(m,n-3)+p2*(m-1,n-2)+p3*(m-2,n-1)+p4*(m-3,n)
where
p1=6420.0/46656.0;
p2=10017.0 ...

Towhid

Hi kodder
I have found your problem.Your code fails to give the correct output to the following input.
Input:

4 0
6 0

Your program terminates here while the correct output is:

Sums of 4:
NONE
Sums of 6:
NONE

I don't think that is the case. Because when n==0 the program should terminate ...

Towhid

well... in my process i had written PRIME() function which returns 0/1 according to whether it is prime or not when i need to check primality for a number > sqrt(10^9) but no one here mentioned for such process. so am i doing inefficient some where?
You can use 3*10^7 size char array for flagging ...

Towhid

Well........ I have found my mistake. A silly one. Got Ac in 6.6 secs.......

Towhid

fh wrote:I used backtracking to consider all possibilities... I'm also curious whether it can be solved using greedy?

I have used Greedy approach. The code is a bit big with some if else condition. I started from the first entry....

OJ Board

Search found 38 matches

What is the Range

Re: Help On 574