Thanks jurajz ....

i should Try convex ...

Keep Posting ...

## Search found 108 matches

- Sat Oct 09, 2010 6:41 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11800 - Determine the Shape
- Replies:
**47** - Views:
**13241**

- Sat Oct 09, 2010 6:40 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11859 - Division Game
- Replies:
**8** - Views:
**3131**

### 11859 - Division Game

How To solve This Problem ??

i think we should count the number of all devisors of all numbers of each row ...

but From here i dont know how to solve the Problem ...

(

Edit : ok solved it ) so easy problem ...

i think we should count the number of all devisors of all numbers of each row ...

but From here i dont know how to solve the Problem ...

(

Edit : ok solved it ) so easy problem ...

- Sat Oct 09, 2010 6:37 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11866 - Triangle
- Replies:
**6** - Views:
**2361**

### 11866 - Triangle

How To solve this Problem ...

any idea ??????

any idea ??????

- Sat Oct 09, 2010 7:58 am
- Forum: Volume 118 (11800-11899)
- Topic: 11800 - Determine the Shape
- Replies:
**47** - Views:
**13241**

### 11800 - Determine the Shape

got many WA's for this simple Problem ...

How should we construct the Shape .... ??

Thanks in advance

How should we construct the Shape .... ??

Thanks in advance

- Fri Oct 08, 2010 10:19 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11853 - Paintball
- Replies:
**3** - Views:
**1768**

### Re: 11853 - Paintball

The Case where solution does not exist is quite easy ...

how to get the output when solution exists is the problem .

how to get the output when solution exists is the problem .

- Fri Oct 08, 2010 7:03 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10086 - Test the Rods
- Replies:
**10** - Views:
**4648**

### Re: 10086 - Test the Rods

HI alll could somebody help me ...

whats The underlying algorithm ...

how to solve this problem ...

i'll be glad if any one could help ....

Thanks :*

whats The underlying algorithm ...

how to solve this problem ...

i'll be glad if any one could help ....

Thanks :*

- Fri Oct 08, 2010 10:46 am
- Forum: Volume 118 (11800-11899)
- Topic: 11853 - Paintball
- Replies:
**3** - Views:
**1768**

### 11853 - Paintball

any hints how to solve this problem ...

i absolutely have no idea about this problem ...

keep learning ...

i absolutely have no idea about this problem ...

keep learning ...

- Fri Oct 08, 2010 8:28 am
- Forum: Volume 118 (11800-11899)
- Topic: 11851 - Celebrity Split
- Replies:
**9** - Views:
**2928**

### Re: 11851 - Celebrity Split

Uhum ... Excellent Problem ....

Thanks igor ... Thanks Leo for that link ... i learned many things ...

Got Ac in 0.204 s ...

Keep Posting ...

[could some body help on problem 11853-Paint Ball ...]

Thanks igor ... Thanks Leo for that link ... i learned many things ...

Got Ac in 0.204 s ...

Keep Posting ...

[could some body help on problem 11853-Paint Ball ...]

- Thu Oct 07, 2010 2:31 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11851 - Celebrity Split
- Replies:
**9** - Views:
**2928**

### Re: 11851 - Celebrity Split

i have read somewhere in the web it could be solved in 3^(n/2) ...

but dont know how to get this ... Time ...

but dont know how to get this ... Time ...

- Wed Oct 06, 2010 7:40 am
- Forum: Volume 118 (11800-11899)
- Topic: 11851 - Celebrity Split
- Replies:
**9** - Views:
**2928**

### Re: 11851 - Celebrity Split

I have Tried this ...But getTime Limit ... 2^n with pruning .... to Generate all Subsets with Sum S .. i could be as much as ... ^25 ... for test Case 24 1000001 1000002 1000004 1000008 1000016 . . . then for each S .. (S .size)*(S .size ) to find 2 non-intersecting subsets.... This works even Slowe...

- Tue Oct 05, 2010 3:56 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11851 - Celebrity Split
- Replies:
**9** - Views:
**2928**

### 11851 - Celebrity Split

Hi, Experts ...

i get TL consistently ...

How To avoid it ...

i try backtarcking 3^n with some Pruning s ...

can any body give some hints ...??

Thanks in advance ...

i get TL consistently ...

How To avoid it ...

i try backtarcking 3^n with some Pruning s ...

can any body give some hints ...??

Thanks in advance ...

- Tue Oct 05, 2010 5:55 am
- Forum: Volume 118 (11800-11899)
- Topic: 11856 - Ferry Loading V
- Replies:
**2** - Views:
**2547**

### 11856 - Ferry Loading V

Could some body give some Hints how to solve this in Time ??

i Use Knapsack algorithm to find the nearest match to Sum/2 ....

Edit : solved it ...

i Use Knapsack algorithm to find the nearest match to Sum/2 ....

Edit : solved it ...

- Mon Oct 04, 2010 11:09 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11852 - Knight's Trip
- Replies:
**7** - Views:
**3435**

### Re: 11852 - Knight's Trip

A Pure Greedy algorithm will solve it ... generate the output for a Board n*n and by induction find the solution to (n+1)*(n+1) the minimum number of moves are at least the (x+1)/2 , and also at least (y+1)/2 since you can more at most 2 row or column each time ... and the total of 3 cells each time...

- Mon Oct 04, 2010 10:49 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11855 - Buzzwords
- Replies:
**21** - Views:
**5549**

### Re: 11855 - Buzzwords

)

now i get it ... Nice ...

got AC in 0. 464 -- used int instead of long long ...

but i still believe that some test Case would break this solution ...

Thanks for your help Igor ...

now i get it ... Nice ...

got AC in 0. 464 -- used int instead of long long ...

but i still believe that some test Case would break this solution ...

Thanks for your help Igor ...

- Mon Oct 04, 2010 3:45 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11855 - Buzzwords
- Replies:
**21** - Views:
**5549**

### Re: 11855 - Buzzwords

Then what do you do with This Array ? sort and unify and then Count ??? i wonder why your time is so good ... would you please Explain more .... 1- you try all N*(N-1) strings and make a hashCode FOR each sub string ... 2- make an aray of pair <hashCode ,Counter > 3- sort the Araay .... 4- combine a...