Search found 277 matches

by UFP2161
Tue Nov 09, 2004 2:53 am
Forum: Volume 3 (300-399)
Topic: 325 - Identifying Legal Pascal Real Constants
Replies: 63
Views: 14889

You don't even pass the sample output correctly.

Third line should be:
1.0e-55 is legal.
by UFP2161
Tue Nov 09, 2004 2:46 am
Forum: Volume 6 (600-699)
Topic: 612 - DNA Sorting
Replies: 122
Views: 16022

It's a multiple input problem (the blue checkmark next to the problem's name in the volume's index).

http://online-judge.uva.es/problemset/minput.html
by UFP2161
Fri Oct 01, 2004 1:36 am
Forum: Volume 4 (400-499)
Topic: 495 - Fibonacci Freeze
Replies: 222
Views: 30371

itoa is not part of the ANSI standard.. you'll have to write your own.. or use sscanf instead..
by UFP2161
Fri Sep 17, 2004 1:54 am
Forum: C++
Topic: Is it possible to install gcc compiler under Windows?
Replies: 11
Views: 3202

It may also be possible to use C:\Cygwin\bin\gcc.exe (or g++.exe) with your editor.. I would search google for that though..
by UFP2161
Tue Sep 14, 2004 1:10 pm
Forum: C++
Topic: Is it possible to install gcc compiler under Windows?
Replies: 11
Views: 3202

You can try installing Cygwin.
by UFP2161
Mon Sep 06, 2004 3:42 am
Forum: Algorithms
Topic: Prime Number
Replies: 8
Views: 1664

Also depends on how many numbers you want to check of primeness.. if just a few, the simple check all numbers up to sqrt(n) is probably fastest.. If you need to do it a lot more times, then sieving up to 10,000,000 and using a O(1) lookup is probably faster.. If the numbers are even higher than that...
by UFP2161
Mon Sep 06, 2004 2:27 am
Forum: Algorithms
Topic: Prime Number
Replies: 8
Views: 1664

Depends on how big n is...
by UFP2161
Sun Sep 05, 2004 7:17 am
Forum: Volume 100 (10000-10099)
Topic: 10042 - Smith Numbers
Replies: 75
Views: 22999

[c]for(j=2;j<=20250000/i;j++)
b[i*j]=1;[/c]

i*j can become quite large...
by UFP2161
Sat Sep 04, 2004 4:17 am
Forum: Volume 106 (10600-10699)
Topic: 10622 - Perfect P-th Powers
Replies: 47
Views: 23993

Floating point precision.. pow might return something like 2.999999999999999999999999999 for pow(9, 1/2)... you should stick to using integers..
by UFP2161
Thu Sep 02, 2004 6:03 pm
Forum: Algorithms
Topic: Binary Trees
Replies: 1
Views: 902

10701

It's about post/in/pre and given one of them, convert to another format.
by UFP2161
Sun Aug 29, 2004 1:57 am
Forum: Volume 8 (800-899)
Topic: 814 - The Letter Carrier's Rounds
Replies: 5
Views: 2630

Did you consider this line in the output section?
Also a message is addressed to the same user only once.
by UFP2161
Thu Aug 26, 2004 7:22 pm
Forum: Volume 4 (400-499)
Topic: 450 - Little Black Book
Replies: 57
Views: 6321

You may have to increase the size of your arrays.. there may be more than 250 people [and each string may or may not be longer than your limits].. there's no limits stated in the problem which kind of sucks having to guess at them..
by UFP2161
Thu Aug 26, 2004 2:41 am
Forum: Other words
Topic: can problemsetters please note
Replies: 2
Views: 843

I actually made the same exact mistake during the contest.
by UFP2161
Thu Aug 12, 2004 4:42 am
Forum: Volume 106 (10600-10699)
Topic: 10690 - Expression Again
Replies: 23
Views: 9503

DP
by UFP2161
Sun Aug 08, 2004 5:21 pm
Forum: C
Topic: printf(), C string & Comma operator
Replies: 2
Views: 2390

The comma operator evaluates things from left to right, and returns the result of the last operation, i.e. tries to evaluate "%s World!" and then tries to evaluate strTest .. then it returns strTest, which is a string, which printf can directly print, and thus you get "Hello"

Go to advanced search