Search found 120 matches

by deddy one
Thu Jun 05, 2003 7:21 pm
Forum: Volume 1 (100-199)
Topic: 195 - Anagram
Replies: 242
Views: 26907

Hi try to search SEPA algoithm on the net resources
by deddy one
Sat May 31, 2003 4:40 pm
Forum: Volume 4 (400-499)
Topic: 454 - Anagrams
Replies: 97
Views: 21449

hi Hisoka

may I know how big array size for character that
you use in your code ???


thx.
by deddy one
Thu May 29, 2003 3:49 pm
Forum: Volume 4 (400-499)
Topic: 454 - Anagrams
Replies: 97
Views: 21449

now that you mention it, after I check my stat, my Acc 454 is missing. :o here's my algo/pseudocode 1.scan multiple input 2.for each case do the following 3.scan for the input and put them in an array until the input is an empty string 4.sort the input in the array once (lexicographicly) 5.check ana...
by deddy one
Mon May 26, 2003 4:15 pm
Forum: Volume 2 (200-299)
Topic: 232 - Crossword Answers
Replies: 12
Views: 6676

maybe the problem is scanning the input in your solution while(1) { scanf("%d %d\n",&h,&w); if(h==0||w==0) return 0; for(i=0;i<h;i++) { for(j=0;j<w;j++) buffer[i][j]=getchar(); scanf("\n"); } ....... while in my solution while (scanf ("%d",&r) == 1) { if (r==0) break; scanf ("%d",&c); for (i=0;i<r;i...
by deddy one
Mon May 26, 2003 2:14 pm
Forum: Volume 2 (200-299)
Topic: 232 - Crossword Answers
Replies: 12
Views: 6676

I only increase the array size with no further change in my code and it get Accepted. :D I think something funny like this could happen, like when they say you that the max row and col is 10 , but actually you need to initialize more than that. :-? In this case, just declare abundant array size like...
by deddy one
Sat May 17, 2003 3:16 pm
Forum: Other words
Topic: I can't download the problems from this website!!
Replies: 12
Views: 1700

the ftp doesn't have the problems for volume VIII,
103 and 104.

someone pls post in this thread after those
problems available to download

thx :P
by deddy one
Wed May 14, 2003 11:47 am
Forum: Volume 1 (100-199)
Topic: 145 - Gondwanaland Telecom
Replies: 62
Views: 8731

the input could looked like this

Code: Select all

A 123-1234 11 12 11 12
can you handle that input ??
by deddy one
Wed May 07, 2003 6:22 pm
Forum: Other words
Topic: acm solve sites
Replies: 51
Views: 25999

I must agree that NUS page were good.
by deddy one
Wed May 07, 2003 6:13 pm
Forum: Other words
Topic: Idea
Replies: 3
Views: 1465

That's a good idea
I agree :D
by deddy one
Wed May 07, 2003 5:55 pm
Forum: Off topic (General chit-chat)
Topic: How old are you? Statistics.
Replies: 121
Views: 175825

age : 19.
joined acm since october 2002.

solved 190+ problems.
by deddy one
Wed May 07, 2003 1:02 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 30193

btw the algorithm that I describe above
(without any sorting and bsearch)
is accepted in 0.9 sec

but I see that in top ten rank
for this problem,
the time to get accepted is incredible

and I still couldn't figure out how
to do this in linear time
:oops: :oops: :oops:
by deddy one
Wed May 07, 2003 12:57 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 30193

to anupam :

I declare

[c]int sum[1000000][/c]

before this I always get Run time error
by deddy one
Mon May 05, 2003 4:31 pm
Forum: Volume 5 (500-599)
Topic: 594 - One Little, Two Little, Three Little Endians
Replies: 46
Views: 13487

594 : about negative number

How do you convert a negative number into
base 2 number (32 bit) ?
by deddy one
Mon May 05, 2003 4:17 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 30193

10487 - Closest Sums

hi this is my algorithm

1.scan the input
2.store each two distinct closest sum in array
3.scan the query
4.search the answer from the array sequentially


but it's slow to get accepted.
can anyone give me a better approach in this problem???
by deddy one
Fri May 02, 2003 1:18 pm
Forum: Volume 103 (10300-10399)
Topic: 10336 - Rank the Languages
Replies: 21
Views: 9501

I've given up this problem months ago,
until I tried to solve it again today,
and I get Accepted after experimenting with
a lot of submission

the max row and column never exceed 15,
hope this could help anyone out there that still
got time limit or memory limit in this problem

bye

Go to advanced search