Search found 60 matches

by ayeshapakhi
Fri Aug 31, 2007 7:58 am
Forum: ACM ICPC Archive Board
Topic: LA-2894 Strange Research
Replies: 6
Views: 3885

To A1.....

Really thanks.. :)
That easy bug killed a lot of time..

Regards.....:)
by ayeshapakhi
Mon Aug 27, 2007 1:02 pm
Forum: ACM ICPC Archive Board
Topic: LA-2894 Strange Research
Replies: 6
Views: 3885

Please someone help......

i admit that the code is a bit lengthy....but it's straight forward sorting and searching....:(

or someone pls provide some i/o..
thanks
by ayeshapakhi
Sat Aug 25, 2007 8:58 pm
Forum: ACM ICPC Archive Board
Topic: LA-2894 Strange Research
Replies: 6
Views: 3885

LA-2894 Strange Research

Please someone have a look at the prob
http://acmicpc-live-archive.uva.es/nuev ... php?p=2894

I got several WA..... but couldn't find what's missing...:(
Please help..

Code: Select all

Removed.....
Regards...
by ayeshapakhi
Wed Aug 22, 2007 7:52 pm
Forum: ACM ICPC Archive Board
Topic: LA_2702 - Get Them All
Replies: 1
Views: 1972

someone please share the idea behind that problem..
i also need help..

:roll:
by ayeshapakhi
Wed Jul 18, 2007 12:35 am
Forum: Volume 3 (300-399)
Topic: 350 - Pseudo-Random Numbers
Replies: 56
Views: 16166

avoid checking the already appeared values with looping..
try to do this in O(1) time...
Hint: all parameters will have no more than four digits..
by ayeshapakhi
Wed Jul 18, 2007 12:14 am
Forum: Volume 109 (10900-10999)
Topic: 10959 - The Party, Part I
Replies: 37
Views: 18120

Initilize the matrix grafo with 0 everytime u take input..

Code: Select all

while (casos--){
       //
      //        
      scanf("%d %d", &pessoas, &pares); 
      // initialize grafo here
}
by ayeshapakhi
Tue Jul 17, 2007 11:35 pm
Forum: Volume 110 (11000-11099)
Topic: 11059 - Maximum Product
Replies: 96
Views: 36870

hi...
fix this...

input.........
3
-1 0 -1

output.......
Case #1: The maximum product is 0.

>> but urs code outputs 1..
by ayeshapakhi
Mon Jul 16, 2007 9:49 pm
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 39808

:wink:
by ayeshapakhi
Mon Jul 16, 2007 7:23 pm
Forum: Volume 5 (500-599)
Topic: 574 - Sum It Up
Replies: 46
Views: 13813

input

Code: Select all

4 5 1 2 3 4 1
100 3 50 50 4
3 3 1 1 1
500 12 40 20 30 99 60 90 80 20 19 10 1 10
6 6 1 1 1 1 1 1
1 6 1 1 1 1 1 1
0 0
output

Code: Select all

Sums of 4:
4
3+1
2+1+1
Sums of 100:
50+50
Sums of 3:
1+1+1
Sums of 500:
NONE
Sums of 6:
1+1+1+1+1+1
Sums of 1:
1
by ayeshapakhi
Sun Jul 15, 2007 8:55 pm
Forum: Volume 110 (11000-11099)
Topic: 11063 - B2-Sequence
Replies: 73
Views: 39662

change..

Code: Select all

if(arr[0] <= 0)   flag = 1; 
        
        for(int i=0;i<n;i++) 
            if(arr[i] <= 0 || arr[i]>10000)    flag = 1; 
            
        for(int i=1;i<n;i++) 
            if(arr[i] <= arr[i-1])   flag = 1; 
then fix PE...
by ayeshapakhi
Sun Jul 15, 2007 8:12 am
Forum: Volume 112 (11200-11299)
Topic: 11236 - Grocery store
Replies: 9
Views: 4662

>>sclo

here it is not exactly 2000^3
optimization is possible because a<=b<=c<=d.
and (a+b+c+d) <= 2000
by ayeshapakhi
Sat Jul 14, 2007 5:25 pm
Forum: Volume 8 (800-899)
Topic: 865 - Substitution Cypher
Replies: 28
Views: 15914

>>chetan

did u really got WA??
i submitted ur code without any making change and it got ACC!!

however, remove ur code from here.. :wink:
by ayeshapakhi
Sat Jul 14, 2007 4:12 pm
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 39808

to monish
:roll:
:wink:
:D
by ayeshapakhi
Sat Jul 07, 2007 10:36 am
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 39808

are u sure that ur heap is working properly?
by ayeshapakhi
Sat Jul 07, 2007 7:46 am
Forum: Volume 4 (400-499)
Topic: 496 - Simply Subsets
Replies: 48
Views: 9078

take input simply as..

Code: Select all

while( gets(tempA) )
{
       gets(tempB);
}
though after resolving tle u'll get wa...
ur program doesn't produce right ans for the test i/o..

Go to advanced search