Search found 454 matches

by ..
Thu Apr 21, 2005 5:53 pm
Forum: Volume 105 (10500-10599)
Topic: 10512 - A Day in Math-land
Replies: 52
Views: 12121

If you are typing the correct problem number,
then no data structure is needed to solve the problem.
This is a maths problem that can be solved in O(1), search for old post you will find the key to solve.
by ..
Tue Apr 19, 2005 5:14 am
Forum: Volume 6 (600-699)
Topic: 623 - 500!
Replies: 187
Views: 40972

Cygwin is a bit complicate for beginner....You can try DevC++, just google it and you will find it.
by ..
Mon Apr 18, 2005 5:17 am
Forum: Volume 6 (600-699)
Topic: 623 - 500!
Replies: 187
Views: 40972

tmp=long long(a.val)*b+carry;

Wrong syntax, the correct should be

tmp=(long long)(a.val)*b+carry;

Don't argue why VC can compile, the judge is using gcc/g++
by ..
Thu Apr 14, 2005 5:24 pm
Forum: Volume 4 (400-499)
Topic: 464 - Sentence/Phrase Generator
Replies: 11
Views: 1880

the small dogrestlessly jumped through the quick dog fish a dogtook the quick computer a computertook the quick man a mantook the quick fish the small computernearly saw the small dog a dogsaw the small computer a computersaw the small man computer a fishtook the quick waves the small mansuddenly j...
by ..
Thu Apr 14, 2005 4:52 pm
Forum: Volume 4 (400-499)
Topic: 464 - Sentence/Phrase Generator
Replies: 11
Views: 1880

Output from my program: the small dogrestlessly jumped through the quick dog fish a dogtook the quick computer a computertook the quick man a mantook the quick fish the small computernearly saw the small dog a dogsaw the small computer a computersaw the small man computer a fishtook the quick waves ...
by ..
Wed Apr 13, 2005 5:44 pm
Forum: Other words
Topic: Search for problems
Replies: 3
Views: 1058

Excuse me.....
You don't think the "search" function available now can do what you need? Do I miss anything???
by ..
Tue Apr 12, 2005 6:08 am
Forum: Other words
Topic: Which problem is the easiest problem of this site?
Replies: 27
Views: 23043

10055 has a trap of overflow.
I think 10071 is easier.
by ..
Fri Apr 08, 2005 10:10 am
Forum: Volume 8 (800-899)
Topic: 813 - Robot
Replies: 5
Views: 2834

Hi, Have you solved the problem? I am getting WA on this problem, maybe we can compare our output to see what's wrong. Input: 1 12.09 -45 2 4.50 15.68 90 45 1 14.65 90 7 0.57 0.46 13.55 4.65 8.16 7.07 7.85 -90 90 90 45 0 45 0 5 14.85 3.17 9.08 3.66 8.14 45 -90 -90 45 45 2 14.17 8.98 0 0 2 7.36 12.51...
by ..
Tue Apr 05, 2005 8:45 am
Forum: Algorithms
Topic: Q-Matrix and matrix exponentiation related problems
Replies: 2
Views: 1368

10754
by ..
Tue Mar 29, 2005 8:15 pm
Forum: Volume 104 (10400-10499)
Topic: 10492 - Optimal Mastermind Strategy
Replies: 12
Views: 3589

Adrian Kuegel wrote:I got accepted with following assumption: only in first two steps I try all possible guesses, after that I still restrict it to possible solutions like in my WA program.
Thanks Adrain, I get AC with that trick.
By the way......do you think that is some kind of hardcoding? :wink:
by ..
Tue Mar 29, 2005 6:06 am
Forum: Volume 104 (10400-10499)
Topic: 10492 - Optimal Mastermind Strategy
Replies: 12
Views: 3589

Great~~ :D
At first I make the same guess as you and get WA at 2.x s, but after I fix my mistake, my code gets TLE :(
by ..
Mon Mar 28, 2005 7:47 pm
Forum: Volume 4 (400-499)
Topic: 400 - Unix ls
Replies: 93
Views: 15752

You are doing something like this:
a = b / 0;
or
a = b % 0;
where b is an integer.

Read this:
http://online-judge.uva.es/board/viewforum.php?f=31
by ..
Mon Mar 28, 2005 7:45 pm
Forum: Volume 104 (10400-10499)
Topic: 10492 - Optimal Mastermind Strategy
Replies: 12
Views: 3589

I don't have the data on hand now.
But as I know, there should be some cases like this:
in some node of the search tree, you already know that the answer will not be a certain string, say 1234, but you still have to make guess 1234 as it will help you to decrease the height of subtrees.
by ..
Wed Mar 23, 2005 8:44 am
Forum: Other words
Topic: How can I contact with system administrators?
Replies: 6
Views: 1024

Sometimes when he is busy, he won't give reply for 1 or 2 weeks.
Remember he won't get paid for his work :wink:
by ..
Mon Mar 21, 2005 10:03 pm
Forum: Volume 108 (10800-10899)
Topic: 10830 - A New Function
Replies: 33
Views: 15148

In my previous post I don't want to give too much detail as I don't want to write spoiler..... Here is the detail: CSOD(n)=((n div 2)-1)*2+((n div 3)-1)*3 +...+((n div n)-1)*n =(n div 2)*2 + (n div 3)*3 + ..... + (n div n)*n - sum(2,n) The value of "n div x" will repeat when x becomes larger, and wh...

Go to advanced search