Search found 12 matches

by T.T.
Mon Aug 19, 2002 5:17 am
Forum: Volume 2 (200-299)
Topic: 275 - Expanding Fractions
Replies: 47
Views: 21863

Input:
1 1
0 1
my output is
.
This expansion terminates.

.
This expansion terminates.

and my program output a blank line after last input :wink:
by T.T.
Sun Aug 18, 2002 10:39 am
Forum: Volume 2 (200-299)
Topic: 275 - Expanding Fractions
Replies: 47
Views: 21863

WA

Hi, I find a WA in your program
when the input is
1 300
your output is
.00
This expansion terminates.
but my output is
.003
The last 1 digits repeat forever. :wink:
by T.T.
Sat Aug 17, 2002 5:05 pm
Forum: Volume 4 (400-499)
Topic: 423 - MPI Maelstrom
Replies: 17
Views: 9598

I get the input carefully, in it's input 5 50 30 5 100 20 50 10 x x 10 every number represent ( except the size 5 ) arr[2][1] arr[3][1] arr[3][2] arr[4][1] arr[4][2] arr[4][3] arr[5][1] arr[5][2] arr[5][3] arr[5][4] then I use the Floyd's algorithm too but I do't know why you get WA, you can check i...
by T.T.
Mon Aug 12, 2002 8:48 am
Forum: Volume 2 (200-299)
Topic: 290 - Palindroms <---> smordnilaP
Replies: 31
Views: 7147

WA

try the input
1
A

my output is
0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 ? ? ? ? ? ? ? ? ?

but your output is
1 1 1 1 1 1 1 1 1 1 1 1 1 2
2 2 2 2 2 ? ? ? ? ? ? ? ? ?
by T.T.
Mon Aug 12, 2002 8:31 am
Forum: Volume 2 (200-299)
Topic: 275 - Expanding Fractions
Replies: 47
Views: 21863

wrong answer

you can try this 1 397 my output is .0025188916876574307304785894206549118387909319899 24433249370277078085642317380352644836272040302267 The last 99 digits repeat forever. but your output is .0025188916876574307304785894206549118387909319899 24433249370277078085642317380352644836272040302267 The la...
by T.T.
Thu Aug 08, 2002 5:16 am
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23583

a tree

oh, the case 1 2 1 2 0 0 1 2 2 1 0 0 -1 -1 they are different, why? the first case have two nodes '1' , '2', and two paths from node '1' to node '2'. But the second case is a cycle, one path from node '1' to node '2', and another is from node '2' to node '1' so the output is Case 1 is not a tree. Ca...
by T.T.
Wed Aug 07, 2002 8:02 am
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23583

input

you can try it:
1 2
1 2
0 0

-1 -1
of course, it's output is
Case 1 is not a tree
by T.T.
Thu Jul 25, 2002 10:02 am
Forum: Volume 3 (300-399)
Topic: 357 - Let Me Count The Ways
Replies: 90
Views: 7604

change

I try to change the loop, it becomes

[cpp] for( i = 1 ; i < 5 ; i++ )
for( j = cent ; j < MAX ; j++ )
way[j] = way[j] + way[j-cent];[/cpp]

but I still get a WA..., is it has other bug?
by T.T.
Thu Jul 25, 2002 8:02 am
Forum: Volume 3 (300-399)
Topic: 357 - Let Me Count The Ways
Replies: 90
Views: 7604

357WA..

I do'nt know why I always get WA? can someone help me? [cpp]#include<stdio.h> #define MAX 101 int way[MAX] = {0}; void Dynamic() { int i, j; int cent[] = { 1, 5, 10, 25, 50 }; for( i = 0 ; i < MAX ; i++ ) way = 1; for( i = 1 ; i < 5 ; i++ ) for( j = i ; j < MAX ; j++ ) way[j] = way[j] + way[j-cent ]...
by T.T.
Fri Jul 19, 2002 2:22 pm
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23583

AC

thanks, after test the input, I get AC again&#65374; :D
by T.T.
Thu Jul 11, 2002 11:06 am
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23583

Before the judge, I use array[100][100], can get 100 nodes, you means
it have 100000 nodes...?
by T.T.
Thu Jul 11, 2002 8:02 am
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23583

615 New Judge

Before the New Judge, I get a AC , but after the New Judge
I get a WA , can anyone can help me ~ ?

~ 2002 / 7 / 11 ~[/cpp]

Go to advanced search