## Search found 147 matches

Sat Dec 11, 2004 3:12 am
Forum: Volume 107 (10700-10799)
Topic: 10775 - Mystical Matrix
Replies: 12
Views: 5658
my solution is based on that of the magic square... but i am curious as to the others' approaches since there are possibly literally zillions of ways to generates these monsters
Mon Nov 29, 2004 12:31 am
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189

### Re: 10778 - Why WA?

your program fails on a lot of test cases... I sent you a PM (actually sending u one right now)
Sun Nov 28, 2004 11:40 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189
This is not clear: Output all distinct solutions in lexicographical order, one in each line. Should I output only distinct solutions? But sample output gives them. Lexicographical order - what is it? It means 1 < 21 because 1 is less 2 lexicographicaly. But problem text clearly says that roots must ...
Sun Nov 28, 2004 11:32 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189
i'll look at that...
Mon Nov 22, 2004 9:36 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189
two ppl got accepted, either both of us have the same bug in our code, or that the answer is correct The 2nd one is Anupam, so it doesn't count (I guess he send your code). Anyway, I don't want to say your program is wrong, only to clarify that there is only one solution so far. thanks for letting ...
Mon Nov 22, 2004 9:17 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189
Some of the biggest problems with the problem statement (in order of magnitude) are the following: 1) "Each n-tuple solution should be outputted in exactly one line and in the form of: kx_{a_1} ... kx_{a_m} such that ...". That's an m-tuple, what is m?! I'm guessing that what you mean is: "in the f...
Mon Nov 22, 2004 9:14 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189

### Re: This problem

Michael Goldshteyn wrote:I refuse to even bother working on this problem for the following reasons:
good for you, since you are not going to work on it, i dont care what your reasons are. and your sacrasm does not amuse me. excuse me for not laughing. Also, please do not bother to give advice to me.
Mon Nov 22, 2004 9:11 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189
ok i know that you've solved over 1000 problems, and you ar third on the list. but so what? let me reiterate. The problem statement is precise, but it seems to me that you just dont understand math notation, which is taken from mathworld. And thats too bad. if you dont like it, then go solve some ot...
Mon Nov 22, 2004 4:27 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189

i wonder whether the only person who ACCEPTED this problem is just the author... two ppl got accepted, either both of us have the same bug in our code, or that the answer is correct from contest time till today we (i and my teammates) are submitting our code again and again and again (but got WRONG...
Mon Nov 22, 2004 4:20 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189
To author bugzpodder: I tried a lot of times to solve this problem, but all got WA. i think what this problem ask us to do is this: 1.Buid up a n-polynomial equation of x ; 2.find all rational solutions from small to large, say x[1]<=x[2]<=......<=x[m]; 3.if m equals zero, print "No soltution.", ot...
Sun Nov 21, 2004 9:35 pm
Forum: C
Topic: sort
Replies: 8
Views: 3174

### sort

how do u sort character arrays in C
Sun Nov 21, 2004 8:17 pm
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 12189
okay I purposely made the problem confusing so that an relatively easy problem would seem hard (so the problem statement which describes the problem gets a little messy, but everything you need to know is there). So it is unfair to say this is the worst problem statement ever (i agree that it is har...
Sun Nov 21, 2004 1:24 am
Forum: Other words
Topic: Foundation Contest 2004
Replies: 12
Views: 3687
not quiet. There is a problem with the Time limit for F. My solution runs in ~2.5 seconds where as the time limit for it was 1 seconds (there is only one person who submitted a solution, and he was the top guy so it didnt affect the rankings). I apologize for this. However, when it is moved to the p...
Tue Nov 02, 2004 11:10 pm
Forum: Algorithms
Topic: I'm collecting cool graph algorithms problems
Replies: 13
Views: 4854
117
125
793
10608
20731

and those annoying questions with all possible 4 letter combinations of {a,b,c,d} appears once in a string
like
aaaabaaac etc
Sat Oct 23, 2004 5:05 am
Forum: Volume 107 (10700-10799)
Topic: 10744 - The Optimal Super-Highway
Replies: 29
Views: 14951
Why do you say 10203 is too big for counting sort??? The numbers ax + by will always be in the range -40000...40000, so you need an array of 80000 integers, which easily fits into memory. Hmm, you're right man. 80000 is not so big. By the way, I tried to use integer arithmetic and sort. Algo O(Nlog...