Search found 11 matches

Wed Nov 24, 2004 12:39 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33694

Re: WA in 0.000 s

Hi, I think i know what might be the problem of your program. You declare 'p' as an unsigned long integer, but you print it with "%ld". This converts it to an singed long int, so it might end up as a negative value if it is above 2^31. You should print unsigned long int with "%lu", to be sure that v...
Tue Nov 23, 2004 1:44 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31974
Thanks, i finally got accepted by parsing the numbers just until whitespaces. They seems so be seperated by whitespaces in the sample in. There are no test cases like .5.5 but always .5 .5 This makes this problem a lot easier, because the numbers in the inputs seems not just be of the form +1.2 but ...
Wed Nov 17, 2004 1:40 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31974
can anyone who got accepted give me the output to:

Code: Select all

``````5

3 1 2
32.0 54.7 -2
4 1 3 2
- 9.1 + 3. .9 .7
1 2 3
.1.2.3
4 3 2 1
-7.+.3.9     9.9
1 2
1.2.3
``````
Thu Nov 04, 2004 10:47 am
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31974
Unfortunately i had no luck, even with your high number.
Has anyone mean test cases?
Mon Nov 01, 2004 3:31 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31974

482 - Permutation Arrays

Hello, i have some problems with 482 . Acually it seems not very hard, but the lack of given sizes makes it a bit trickier. What i am doing to try to solve it: First i read every indices and store them in an array. Then i read the next line and parse every number and remember each start position in ...
Mon Oct 25, 2004 10:55 am
Forum: Volume 106 (10600-10699)
Topic: 10625 - GNU = GNU'sNotUnix
Replies: 16
Views: 8780
Well, i solved it at last. It was just a stupid output problem. Remember that the output will be an unsigned 64bit integer. Stupid me .
It seems that some values will overflow a 64bit unsigned integer. But they wont have an influence on your result.
Tue Oct 19, 2004 8:32 pm
Forum: Other words
Topic: "Mondriaan's Dream" made me crazy
Replies: 3
Views: 2164
We had this problem at a local contest and we couldnt solve it in time. You can try a backtracking approach. But actually a friend of mine told me that there is even a closed formular for this problem.
Sat Oct 02, 2004 2:43 pm
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 31974
Hello.
I am trying to solve the problem too, but i cant get it accepted.
Are there any tricky inputs? My programm can handle following input correctly:
Input:

Code: Select all

``````1

4 3 2 1
-7.+.3.9     9.9
``````
Output:

Code: Select all

``````9.9
.9
+.3
-7.
``````
The length of my input line is 50000 and i handle up to 2048 different numbers.
Mon Aug 02, 2004 12:02 am
Forum: Volume 106 (10600-10699)
Topic: 10625 - GNU = GNU'sNotUnix
Replies: 16
Views: 8780
Hello. I am trying to solve problem 10625 but i got wa a couple of times and cant figure out why. I use a simulating approach. I store the current number of each printable char and in every recursion step i add for every rule the number of the the char which i substitute to the number of the chars w...
Fri Jul 30, 2004 10:12 am
Forum: Volume 106 (10600-10699)
Topic: 10625 - GNU = GNU'sNotUnix
Replies: 16
Views: 8780
I read this thread already, but it wasnt realy useful for me, because the discussion went in some other directions. So i started a new thread.
Thu Jul 29, 2004 9:11 pm
Forum: Volume 106 (10600-10699)
Topic: 10625 - GNU = GNU'sNotUnix
Replies: 16
Views: 8780

10625 GNU = GNU'sNotUnix

Hello. I am trying to solve problem 10625 but i got wa a couple of times and cant figure out why. I use a simulating approach. I store the current number of each printable char and in every recursion step i add for every rule the number of the the char which i substitute to the number of the chars w...