Search found 22 matches

by Tamagodzi
Mon Oct 01, 2007 4:21 pm
Forum: Volume 113 (11300-11399)
Topic: 11302 - Hexadecimal Digits of an Integral
Replies: 10
Views: 2781

Hint: The result is a wellknown constant
by Tamagodzi
Mon Oct 01, 2007 3:20 pm
Forum: Volume 113 (11300-11399)
Topic: 11302 - Hexadecimal Digits of an Integral
Replies: 10
Views: 2781

The hexadecimal expansion of 1/11 isnt 0.0F0F.. that is the hexadecimal expansion of 1/17 ...
by Tamagodzi
Mon Oct 01, 2007 2:55 pm
Forum: Volume 112 (11200-11299)
Topic: 11299 - Separating Rods
Replies: 5
Views: 2377

You dont have to use K separations, the 2 ways are:

(1+1) (10) with 1 separation
(1)(1)(10) with 2 separations
by Tamagodzi
Sat Dec 03, 2005 3:27 am
Forum: Volume 109 (10900-10999)
Topic: 10975 - Dueue's Quiz
Replies: 39
Views: 16276

My Guess is some input like:

Code: Select all

3 3
aaa
bbb
ccc

aaa
bbb
ccc
by Tamagodzi
Sat Dec 03, 2005 2:53 am
Forum: Volume 109 (10900-10999)
Topic: 10975 - Dueue's Quiz
Replies: 39
Views: 16276

Try to read m and n with cin >> m >> n and surprisingly u will get wa.

Does anyone know whats the difference between cin and scanf("%d.. in reading integers?

There is definitly something wrong around some inputs for m and n which scanf can handle somehow and cin not.
by Tamagodzi
Wed Nov 23, 2005 8:10 pm
Forum: Volume 109 (10900-10999)
Topic: 10975 - Dueue's Quiz
Replies: 39
Views: 16276

Dont know whats wrong with input yet. But this simple input checker gets tle :-) #include <iostream> #include <string> using namespace std; string s; char c; int t,d,q,m,n,i,j; int main() { cin >> t; while(t--) { cin >> d; while(d--) { cin >> s; } cin >> q; while(q--) { cin >> m >> n; cin.get(); whi...
by Tamagodzi
Wed Nov 23, 2005 4:33 am
Forum: Volume 109 (10900-10999)
Topic: 10941 - Words adjustment
Replies: 19
Views: 6052

by Tamagodzi
Wed Nov 23, 2005 4:27 am
Forum: Volume 109 (10900-10999)
Topic: 10975 - Dueue's Quiz
Replies: 39
Views: 16276

WORD w[100000];

why is that array only 100000 big ?

if all words differ in first 3 letters and are 100 letters long u need 98*words entrys

i'll write and submit an input checker tomorrow :evil:
by Tamagodzi
Thu Nov 17, 2005 7:07 pm
Forum: Volume 109 (10900-10999)
Topic: 10962 - Don Giovanni's Last Dinner
Replies: 15
Views: 5753

int d[2000*d_rate*l_rate], l[2000*l_rate*d_rate];

that arrays are to big.
if d_rate=l_rate=100 they are 76 MB :-)
by Tamagodzi
Mon Oct 31, 2005 3:02 am
Forum: Volume 109 (10900-10999)
Topic: 10954 - Add All
Replies: 80
Views: 27478

an array is enough :-)

first solver under 0.1 s with scanf ^^
by Tamagodzi
Tue Oct 25, 2005 3:13 pm
Forum: Volume 109 (10900-10999)
Topic: 10946 - You want what filled?
Replies: 38
Views: 17913

It reads a string from input into the chararray with ending '\0'
i always use an array long enough and there were no bugs yet
by Tamagodzi
Sat Oct 22, 2005 4:21 pm
Forum: Volume 109 (10900-10999)
Topic: 10947 - Bear with me, again..
Replies: 23
Views: 2913

Thnx mjf ... 0.150 seconds after that without using optimized io :-) Official solution uses a non-logical algorithm, that says that you can't go from one island to another if they overlap. We're going to change the input, so that no 2 islands intersect. And a negative island number is logical? ... 0...
by Tamagodzi
Thu Oct 20, 2005 8:30 pm
Forum: Volume 109 (10900-10999)
Topic: 10941 - Words adjustment
Replies: 19
Views: 6052

My Solution takes about 40 sec with same answer :-)
by Tamagodzi
Thu Oct 20, 2005 6:41 pm
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 31527

The sequence is composed by integers, each integer is greater than or equal to 1 and less than or equal to 1000.

Wrong ... there are inputs that are not in that range ... another way making an easy problem hard ...
by Tamagodzi
Mon May 30, 2005 9:54 pm
Forum: Volume 108 (10800-10899)
Topic: 10854 - Number of Paths
Replies: 25
Views: 9036

The correct answer is 81. Lets take this simple Programm to show you the idea: IF ELSE END_IF IF ELSE END_IF IF ELSE END_IF ENDPROGRAM Here all IF-Conditions can be true, short: TTT Or the first two are true and the third false, short: TTF And so on to FFF So at all there are 2*2*2=8 possibilities. ...

Go to advanced search