## Search found 149 matches

- Sat Oct 29, 2005 6:01 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10295 - Hay Points
- Replies:
**20** - Views:
**8921**

### SOLARIS ... thanks.

scanf("%s", str) is well enough to get ACC. THANKS SOLARIS , i am honored to be your friend. Thanks again.

- Fri Oct 28, 2005 11:36 am
- Forum: Volume 102 (10200-10299)
- Topic: 10295 - Hay Points
- Replies:
**20** - Views:
**8921**

### 10295 Hay Points

hi, i am stuck with this problem(10295)... i have some inquiries ... a dollar value (a real number between 0 and 1,000,000) Does that mean that point is a floating point number ? Then how come the sample output is without decimal point... (Is it because the sample input produces result without fract...

- Thu Oct 27, 2005 3:33 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10009 - All Roads Lead Where?
- Replies:
**60** - Views:
**13717**

I 've declared array big enough to read lines from input file, still i am getting runtime error (after executing for around 00.00.039s), i am trying FLOYD-WARSHALL to solve this... would anyone care to tell me why else i may get RE ??? [to Yile, what was your fault in your code??? may be same here :...

- Wed Oct 26, 2005 6:37 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10061 - How many zero's and how many digits ?
- Replies:
**43** - Views:
**20839**

### Some more i/o:

input:
output:

Code: Select all

```
2 9
100 23
23 101
23233 344
34 799
```

Code: Select all

```
0 1
4 117
0 12
552 36014
0 14
```

- Tue Oct 25, 2005 8:59 am
- Forum: Algorithms
- Topic: Help with TSP problem
- Replies:
**7** - Views:
**2072**

### With brute force and branch and bound ...

I need some good links on brute force solution with pruning for tsp. I 've googled it but nothing seems to fit me. I know the dp solution but don't think i can implement with proper data structure (for look up .. :-? ). Any good discussion or links will be a great help ... EDIT: [ i 've found some l...

- Sun Oct 09, 2005 1:25 pm
- Forum: Volume 5 (500-599)
- Topic: 568 - Just the Facts
- Replies:
**39** - Views:
**16291**

### I need help on this !!!

I 've tried several ways and it is still WA. Any critical I/O for which my above program fails will be a great help. Can you help me to find me my bugs (coz i 've failed to find )??? Thanks anyway.

EDIT: ACC now

EDIT: ACC now

- Mon Oct 03, 2005 6:27 pm
- Forum: Volume 5 (500-599)
- Topic: 583 - Prime Factors
- Replies:
**171** - Views:
**35272**

### Better algo ...

Hi, I 've solved the problem with precalculating prime numbers withing the range of the square root of the highest number(2^31 - 1) which is around 46342 ..... If i have primes upto 46342 then i can check any number withing the range whether it is divisible( if so, then how many times by which prime...

- Mon Oct 03, 2005 5:59 pm
- Forum: Volume 5 (500-599)
- Topic: 568 - Just the Facts
- Replies:
**39** - Views:
**16291**

### Keep getting WA !!!

Hi, i am getting WA in this problem, i tried several inputs and it seems okay, I tried to precalculate the last digit, what is wrong with my code ??? ACC NOW :D, code removed... I submitted it several times with different modification and every time its WA. Can anyone help me to find me my bug or wi...

- Sun Sep 18, 2005 8:16 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10820 - Send a Table
- Replies:
**34** - Views:
**13958**

Dear Ryan pai, Thanks a lot, I just got ACC :D , now it takes 0.096sec(Now, i 've passed the limit...). I use Euler's phi function just as you 've mentioned, my factoring was a bit okay, but to factor out the multiples of factors, I used something like sieve ... and for marking and unmarking, I use ...

- Sun Sep 18, 2005 4:49 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10820 - Send a Table
- Replies:
**34** - Views:
**13958**

### I need to know how to deal with this ...

I 've tried to solve this problem, but i am never passing time limit. I tried something like this : i. for 1 ... Jimmy had to precalculate 1 value namely (1, 1) ii. for i = 2 .. N, number of precalculated value = precalculated value for (i-1) + (2*(no. of j(= 1..i-1) that are relatively prime to i))...

- Wed Aug 31, 2005 11:48 am
- Forum: Volume 100 (10000-10099)
- Topic: 10036 - Divisibility
- Replies:
**37** - Views:
**10459**

I 've tried to solve this problem with dp, my code is producing WA. This is the portion of my code which incorporates the recurrence. I 've checked several inputs ... it seems okay. Anyway, any suggestions, bugs in my code or tricky inputs ??? CODE REMOVED AFTER ACC, while subtracting, i better be a...

- Wed Aug 31, 2005 6:28 am
- Forum: Volume 4 (400-499)
- Topic: 471 - Magic Numbers
- Replies:
**29** - Views:
**10747**

I 've tried this problem a several times, but getting WA. i 've submitted the code here so that you may check what goes wrong. anyway, i know its not a good idea to post code on this forum, i 'll remove the code while its ACC.

Code: Select all

```
ACC now, it was a silly mistake :(
```

- Sat Aug 27, 2005 4:00 pm
- Forum: Volume 4 (400-499)
- Topic: 413 - Up and Down Sequences
- Replies:
**22** - Views:
**5091**

### 413 some more input/ output

i need some more sample input and output, can anyone post some? thanks in advance.

- Sat Feb 19, 2005 5:02 pm
- Forum: Algorithms
- Topic: BigInteger
- Replies:
**10** - Views:
**3158**

### How to write faster BigInteger routine ???

I 've learnt that it is possible to do the computation in higher base, so, less computation is needed . But, if the base is somewhat higher like 1000 or 10000, how the remainders are represented for computation ? say, if base is 16 , we represent 10 -15 by A-F. What is the catch for base like 1000 o...