Search found 35 matches

by albet_januar
Wed Jul 25, 2007 6:45 pm
Forum: Volume 112 (11200-11299)
Topic: 11234 - Expressions
Replies: 15
Views: 7059

Code: Select all

delete
by albet_januar
Wed Jun 06, 2007 6:25 pm
Forum: Volume 108 (10800-10899)
Topic: 10827 - Maximum sum on a torus
Replies: 52
Views: 26726

i had solve prob 108.. i use o(n^4)
i cannot think bout the o(n^3) algorithms..
by albet_januar
Fri Jun 01, 2007 6:44 am
Forum: Volume 100 (10000-10099)
Topic: 10004 - Bicoloring
Replies: 93
Views: 28657

is a dfs probleM??
by albet_januar
Wed May 16, 2007 7:31 pm
Forum: Volume 100 (10000-10099)
Topic: 10004 - Bicoloring
Replies: 93
Views: 28657

10004 - Bicoloring

Code: Select all

Acc after I use DFS
I REALLY CONFUSE BOUT THIS PROBLEM..
I THINK IT'S ONLY USE BFS..
am i wrong??
by albet_januar
Sat Apr 28, 2007 5:35 pm
Forum: Volume 5 (500-599)
Topic: 544 - Heavy Cargo
Replies: 32
Views: 14373

thx.. i got my mistake..
Gbu..
by albet_januar
Thu Apr 26, 2007 8:16 pm
Forum: Volume 5 (500-599)
Topic: 544 - Heavy Cargo
Replies: 32
Views: 14373

can anybody help me???

i got CE, but i run well in my compiler..
thx..

Code: Select all

delete after AC..
by albet_januar
Sun Apr 22, 2007 7:15 pm
Forum: Volume 108 (10800-10899)
Topic: 10827 - Maximum sum on a torus
Replies: 52
Views: 26726

any idea for doing O( n^3 )??

i don't have idea..
by albet_januar
Wed Apr 18, 2007 6:35 pm
Forum: Volume 7 (700-799)
Topic: 776 - Monkeys in a Regular Forest
Replies: 51
Views: 18370

em.. how i can speed up my code ??

any idea??
thx
by albet_januar
Wed Apr 18, 2007 6:29 pm
Forum: Volume 108 (10800-10899)
Topic: 10827 - Maximum sum on a torus
Replies: 52
Views: 26726

i got TLE for this problem..
i really confuse bout the O( n^3 ), can anybody help me??

Code: Select all

Deleted
by albet_januar
Wed Apr 11, 2007 6:48 pm
Forum: Volume 7 (700-799)
Topic: 776 - Monkeys in a Regular Forest
Replies: 51
Views: 18370

i got WA.. but i do the sample i/o pliz help me.. can anybody give sample input?? thx;; #include <cstdio> #include <cstring> #define MAX 500 char input[ MAX + 1 ][ MAX + 1 ]; char out[ MAX + 1 ][ MAX + 1 ]; int check[ MAX + 1 ]; int ind; void floodfill( char huruf, int i, int j , int c) { if( i >= 0...
by albet_januar
Mon Mar 12, 2007 5:29 pm
Forum: Volume 2 (200-299)
Topic: 202 - Repeating Decimals
Replies: 82
Views: 10400

i really confuse.. why always get WA??...

Code: Select all

Accepted after re-code.. 
Thx for Jan.. I know my mistake..
by albet_januar
Sat Jan 13, 2007 12:11 pm
Forum: Volume 102 (10200-10299)
Topic: 10209 - Is This Integration ?
Replies: 37
Views: 12058

can anybody explain me how to get the formula?
i really confuse bout this one..

THx..
GBU.. :cry:
by albet_januar
Wed Jan 03, 2007 10:06 am
Forum: Volume 102 (10200-10299)
Topic: 10279 - Mine Sweeper
Replies: 102
Views: 27688

got AC..
at last i know where i do mistake..

:) :wink:
by albet_januar
Tue Jan 02, 2007 9:25 am
Forum: Volume 3 (300-399)
Topic: 389 - Basically Speaking
Replies: 94
Views: 22057

my code give WA.. can anybody help..
did I do something wrong??

Code: Select all

ACC after i know my silly mistake..
hix..
by albet_januar
Wed Dec 27, 2006 6:45 pm
Forum: Volume 101 (10100-10199)
Topic: 10190 - Divide, But Not Quite Conquer!
Replies: 105
Views: 23278

i got RTE.. plz hlp.. #include <stdio.h> #include <math.h> long array[100000001]; int ind; int rec(n, m) { if(n==1) return 1; else { if(n%m==0) { array[ind++] = n/m; return rec(n/m, m); } else return 0; } } int main() { long n , m, i; long count; while(scanf("%ld %ld", &n, &m)!=EOF) { array[0] = n; ...

Go to advanced search