Search found 9 matches

by MegaS
Thu Mar 14, 2002 6:56 am
Forum: Volume 100 (10000-10099)
Topic: 10009 - All Roads Lead Where?
Replies: 60
Views: 14484

Oh!.. You are right, thanks..
by MegaS
Tue Mar 12, 2002 4:56 pm
Forum: Volume 100 (10000-10099)
Topic: 10009 - All Roads Lead Where?
Replies: 60
Views: 14484

I can't find a error in my program - I even see that there can be no bugs. Please help to find a bug in: #include <stdio.h> const int u=27; const long max=100000; //#define _BUG_ long n,p,i,j,k,r; long a ,w ; char ch; FILE *f,*f1; long readCity(){ fscanf(f," "); fscanf(f,"%c",&ch); r=ch-'A'; fscanf(...
by MegaS
Tue Mar 12, 2002 4:52 pm
Forum: Volume 102 (10200-10299)
Topic: 10252 - Common Permutation
Replies: 150
Views: 51549

Print 'a' min('a' in s1, 'a' in s2) times...
But there can be blank lines too (n)
by MegaS
Sun Feb 24, 2002 10:46 pm
Forum: Other words
Topic: is the online judge system broken ?
Replies: 6
Views: 3009

Hey.. smb knows when the Judge will work again?
by MegaS
Sun Feb 10, 2002 10:00 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 182847

Note that "between x and y" can be
from x to y (x<y) or form y to x (y<x)
by MegaS
Fri Feb 08, 2002 11:36 am
Forum: Volume 1 (100-199)
Topic: 163 - City Directions
Replies: 24
Views: 10382

I don't no the answer
I just want to tell that I've got the same problem: maybe someone knows for sure that test in this problem wrong?
by MegaS
Fri Feb 08, 2002 7:16 am
Forum: Volume 1 (100-199)
Topic: 143 - Orchard Trees
Replies: 90
Views: 12607

3
by MegaS
Wed Feb 06, 2002 4:33 pm
Forum: Volume 1 (100-199)
Topic: 164 - String Computer
Replies: 120
Views: 11334

I really tried to accept this problem many times. I even wrote a test program - and I'm sure my program outs right answer - I mean correct to transform String1 to String2.
Maybe it's not a best solution, but I'm sure it's right. Maybe someone know a small gluk in this problem?
by MegaS
Tue Feb 05, 2002 12:17 pm
Forum: Volume 1 (100-199)
Topic: 135 - No Rectangles
Replies: 24
Views: 4575

Just try to get the formula of positions in the (n-1)^2 * (n-1)^2 square(right and down)
see the result for n=4:
1 2 3 4
1 5 6 7
1 8 9 10
1 11 12 13
2 5 8 11
2 6 9 12
2 7 10 13
3 5 9 13
3 6 10 11
3 7 8 12
4 5 10 12
4 6 8 13
4 7 9 11

Go to advanced search