Search found 120 matches

by Hisoka
Thu Sep 28, 2006 8:00 am
Forum: Volume 110 (11000-11099)
Topic: 11099 - Next Same-Factored
Replies: 24
Views: 10604

your output is correct.

but, maximum value for array of temp can be more than integer range (499958000882)

gutlak ...

hehehe
by Hisoka
Wed Sep 27, 2006 4:58 pm
Forum: Volume 7 (700-799)
Topic: 718 - Skyscraper Floors
Replies: 8
Views: 5792

Think about linear diophantine equation.

gutlak
by Hisoka
Tue Sep 26, 2006 2:12 pm
Forum: Volume 110 (11000-11099)
Topic: 11095 - Tabriz City
Replies: 14
Views: 6124

He wants to do this in a way that at least one of two junctions at the end of each street have a tourist information center
by Hisoka
Sun Sep 10, 2006 1:41 pm
Forum: Volume 110 (11000-11099)
Topic: 11087 - Divisibility Testing
Replies: 36
Views: 18095

Ouu, ic ... You can doing 2 N + K algo without sorting before ...

Thanks
by Hisoka
Sun Sep 10, 2006 3:54 am
Forum: Volume 110 (11000-11099)
Topic: 11087 - Divisibility Testing
Replies: 36
Views: 18095

why n lg n algo get TLE > 10 s ? since T < 100 and n < 100001 ?

thanks
by Hisoka
Fri May 07, 2004 5:49 pm
Forum: Volume 1 (100-199)
Topic: 195 - Anagram
Replies: 242
Views: 26694

hi b3yours3lf ... First : Your mistake is in next_permute function. int next_permute(char *str, int len) { int key = len - 1; int newkey = len - 1; while ((key > 0) && (str[key] <= str[key-1])) // == > here key--; key--; if (key < 0) return 0; newkey = len - 1; while ((newkey > key) && (str[newkey] ...
by Hisoka
Thu Dec 18, 2003 4:59 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 21320

hai dominik...

300.00 181490736388615

good luck
by Hisoka
Sun Nov 16, 2003 9:29 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 67233

maybe like this :

1. array [100][101] => because of string => "aaaa\0" => NULL character
2. when i || j == 0 => k=-1 || l=-1.
3. when i || j == 100 => k=101 || l=101.

I just found this...
by Hisoka
Wed Nov 12, 2003 9:22 pm
Forum: Volume 103 (10300-10399)
Topic: 10340 - All in All
Replies: 129
Views: 31845

Code: Select all

char [100000]
by Hisoka
Wed Nov 12, 2003 9:18 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21232

[c]int main()
{
scanf("%d\n",&testcase);
while(testcase--)
{
your_input ...
Process();
your_output ...
if(testcase) puts("");
}
return 0;
}[/c]
by Hisoka
Fri Sep 26, 2003 11:32 am
Forum: Volume 100 (10000-10099)
Topic: 10080 - Gopher II
Replies: 31
Views: 15838

My program handle that. So I think I have problem with my algorithm. I use pure algorithm for this problem, and I'm still comfuce why my program got WA. From previous message, this problem must be solved with max-flow.

Can you find a sample IO that can break my previous algo ? :)
by Hisoka
Sat Sep 13, 2003 1:01 pm
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 13918

for output we just print a sequence with profit more than 1 percent with minimal sequence, not the best profit only. So there are many correct answer for the third input : 1 2 4 1, 1 2 3 1, 2 4 3 2.

GOOD LUCK.
by Hisoka
Thu Aug 21, 2003 5:59 pm
Forum: Volume 3 (300-399)
Topic: 350 - Pseudo-Random Numbers
Replies: 56
Views: 16368

hey b3yours3lf... for output you must print

Code: Select all

Case n: ans
he..he..he.. bye........ :lol:
by Hisoka
Sat Aug 09, 2003 7:15 pm
Forum: Volume 100 (10000-10099)
Topic: 10098 - Generating Fast
Replies: 62
Views: 13938

aaaaaaaaaaaaaa ( only once ).

Because when you do permutation again you will get the same answer again, and for output you must print the combination only once not more.
by Hisoka
Sat Aug 09, 2003 7:06 pm
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 21650

Must be like mine. Try to solve it. ISBN is a serial number ( 0123456789X ) in 10 digits. X is a valid ISBN if in 10th digit. for example : 0-13-162959-X : 0 : valid character - : invalid char 1 : valid char 3 : valid char - : invalid char . . . X : valid char ( because in 10th digit ). if ISBN is X...

Go to advanced search