Search found 131 matches

by Farid Ahmadov
Thu Apr 24, 2003 5:30 pm
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 19582

103 Stacking Boxes. Appeal to everyone who can help.

I think my program is OK. But I don't know why I WA??? Maybe you can help me. :-? My program: [pascal]program Stacking_Boxes; var i,j,k,d,x,y,maxx: Integer; a: array[1..30,1..10] of Integer; b,f,sum: array[1..30] of Integer; z: array[1..30] of boolean; procedure swap(var a,b: Integer); var c: Integ...
by Farid Ahmadov
Wed Apr 23, 2003 6:29 pm
Forum: Volume 5 (500-599)
Topic: 591 - Box of Bricks
Replies: 80
Views: 11123

Hello.
Try to write it without
if ( !feof ( stdin ) ) printf ( "\n" ) ;

just write printf( "\n"); and all will be OK.
Bye.
by Farid Ahmadov
Wed Apr 23, 2003 12:59 am
Forum: Volume 5 (500-599)
Topic: 505 - Moscow time
Replies: 6
Views: 2938

505 question about TIME_ZONEs

Hello.
Can be difference between TIME_ZONEs > 12 ?
(I mean in this problem).
Thank you.
by Farid Ahmadov
Sun Apr 20, 2003 10:09 pm
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 38143

Thank you very much for looking at this topic.
But I have already got AC.
by Farid Ahmadov
Sun Apr 20, 2003 5:42 pm
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 38143

I am getting crazy of 101

People, programmers, somebody please help me to do this problem. :oops: I always get WA. Why I don't know. Maybe you can help me to solve this problem. Please help as you can. I am tired of this problem. It will be better if you give me some tests. Thank you for reading it. I will wait for your repl...
by Farid Ahmadov
Sun Apr 20, 2003 12:56 pm
Forum: Volume 104 (10400-10499)
Topic: 10473 - Simple Base Conversion
Replies: 46
Views: 13394

Thank you very much Eric.
But I have already got AC with another program.
by Farid Ahmadov
Sat Apr 19, 2003 11:59 pm
Forum: Volume 104 (10400-10499)
Topic: 10473 - Simple Base Conversion
Replies: 46
Views: 13394

10473 give me some test

Hello. Here is my code: [pascal]program Simple_Base_Convertion; const hex : array[0..15] of char = ('0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'); var S: string; i: integer; d: longint; function decm(X: char): integer; begin if X in ['0'..'9'] then decm:=ord(X)-48 else if X in ['A...
by Farid Ahmadov
Sat Apr 19, 2003 9:18 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 37736

The fragment of code: A is first bin B is second bin C is third bin this is a cycle. the other part of program you must do yourself :wink: for i:=1 to 3 do for j:=1 to 3 do if j<>i then for k:=1 to 3 do if (k<>j)and(k<>i) then if A +B[j]+C[k]>max then with this I have got AC. Your program is tooooo ...
by Farid Ahmadov
Sat Apr 19, 2003 5:58 pm
Forum: Volume 7 (700-799)
Topic: 727 - Equation
Replies: 156
Views: 34550

727

I know that there is an input here like:

1(2+4)3 or 1*2(1+2)1+2

I have checked it many times
I guess that it means that there is not only one input, but more than one...
I think the answers are:

124+3 and 12*12+12+

I ask ones who solved this problem and got AC.
Please explain it if you can
by Farid Ahmadov
Sat Apr 19, 2003 3:53 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 37736

I have got AC.
This is a very easy problem.
Just check all variations of BCG in a cycle to get the maximum sum of the glasses in bins. And don't forget to choose first in alphabetical order.
Good luck. I hope that it can help you.
by Farid Ahmadov
Thu Apr 17, 2003 3:45 pm
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 38143

101. Somebody help. I did'n understand the problem.

move a onto b where a and b are block numbers, puts block a onto block b after returning any blocks that are stacked on top of blocks a and b to their initial positions pile a onto b where a and b are block numbers, moves the pile of blocks consisting of block a, and any blocks that are stacked abov...

Go to advanced search