## Search found 98 matches

Tue May 14, 2002 9:50 pm
Forum: Volume 3 (300-399)
Topic: 332 - Rational Numbers from Repeating Fractions
Replies: 83
Views: 20079

### Got PE

Thank u a lot!!!

The problem with my one was that I was using unsigned long, so I've changed it to unsigned long long and got PE. I'll see what's still wrong in my output later...

Thanx..............

Jo
Tue May 14, 2002 4:07 pm
Forum: Volume 3 (300-399)
Topic: 366 - Cutting Up
Replies: 7
Views: 3550

### My solution

I solved this problem this way: First, create two lists, to_cut and cutted. Than read the first piece and store it on the list to_cut. Than repeate the following steps: 1 Get the bigger piece from the list to_cut 2 remove it from the list to_cut 3 cut the bigger dimension by 2 and store the resultin...
Tue May 14, 2002 3:32 pm
Forum: Volume 3 (300-399)
Topic: 332 - Rational Numbers from Repeating Fractions
Replies: 83
Views: 20079

### Getting WA too...

I take care about cases where j == 0, but still got WA.

For:
0 0.5

For:
0 0.35

Can't get what's wrong...
BTW, should I compute the GCD between the denumerator and the numerator more than once? I think that the GCD will reduce it the most possible...
Thu May 09, 2002 3:04 pm
Forum: Volume 3 (300-399)
Topic: 330 - Inventory Maintenance
Replies: 26
Views: 7417

### 330 - Inventory Maintenance

Hi!

Can anyone tell me if there's any trick in this problem?

Should I report itens with qtd = 0?

Should I use blanks in the output to fill the row?

I'm getting WA and don't know why...

Sample input/output will be good for me too.
Tue Mar 26, 2002 9:30 pm
Forum: Volume 102 (10200-10299)
Topic: 10255 - The knight's Tour
Replies: 14
Views: 5593
Can't help u, my program works just fine with this input!!!
Tue Mar 19, 2002 1:48 pm
Forum: Volume 102 (10200-10299)
Topic: 10255 - The knight's Tour
Replies: 14
Views: 5593
I've just got ACC!!

Well, I've just looked for a starting point for my algorithm that gives me a circuit, then I
renumber it from the place given in the input.

Thanx anyway!!
Mon Mar 18, 2002 3:46 pm
Forum: Volume 102 (10200-10299)
Topic: 10255 - The knight's Tour
Replies: 14
Views: 5593

### 10255 - The knight's Tour

I've used the Warnsdorff rule to solve this problem and the euclidean distance, but got WA on the online judge!!
I also say that there's no circuito for n<=5 and for (n mod 2 == 1).
Can anyone help?
Thu Nov 01, 2001 1:50 pm
Forum: Volume 1 (100-199)
Topic: 126 - The Errant Physicist
Replies: 25
Views: 3632
Does someone have some input/output for this problem?
I've tested my solution with many case and it goes ok, but I just got WA.

PS: My output for 0 is two blank lines...

JPFarias
jpfarias@lcc.ufrn.br