To A1.....
Really thanks..
That easy bug killed a lot of time..
Regards.....
Search found 60 matches
- Fri Aug 31, 2007 7:58 am
- Forum: ACM ICPC Archive Board
- Topic: LA-2894 Strange Research
- Replies: 6
- Views: 5027
- Mon Aug 27, 2007 1:02 pm
- Forum: ACM ICPC Archive Board
- Topic: LA-2894 Strange Research
- Replies: 6
- Views: 5027
- Sat Aug 25, 2007 8:58 pm
- Forum: ACM ICPC Archive Board
- Topic: LA-2894 Strange Research
- Replies: 6
- Views: 5027
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..
Regards...
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.....
- Wed Aug 22, 2007 7:52 pm
- Forum: ACM ICPC Archive Board
- Topic: LA_2702 - Get Them All
- Replies: 1
- Views: 2676
- Wed Jul 18, 2007 12:35 am
- Forum: Volume 3 (300-399)
- Topic: 350 - Pseudo-Random Numbers
- Replies: 56
- Views: 22274
- Wed Jul 18, 2007 12:14 am
- Forum: Volume 109 (10900-10999)
- Topic: 10959 - The Party, Part I
- Replies: 37
- Views: 21882
Initilize the matrix grafo with 0 everytime u take input..
Code: Select all
while (casos--){
//
//
scanf("%d %d", &pessoas, &pares);
// initialize grafo here
}
- Tue Jul 17, 2007 11:35 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11059 - Maximum Product
- Replies: 96
- Views: 47971
- Mon Jul 16, 2007 9:49 pm
- Forum: Volume 9 (900-999)
- Topic: 929 - Number Maze
- Replies: 92
- Views: 52023
- Mon Jul 16, 2007 7:23 pm
- Forum: Volume 5 (500-599)
- Topic: 574 - Sum It Up
- Replies: 46
- Views: 20396
inputoutput
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
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
- Sun Jul 15, 2007 8:55 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11063 - B2-Sequence
- Replies: 73
- Views: 48153
change..
then fix PE...
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;
- Sun Jul 15, 2007 8:12 am
- Forum: Volume 112 (11200-11299)
- Topic: 11236 - Grocery store
- Replies: 9
- Views: 5735
- Sat Jul 14, 2007 5:25 pm
- Forum: Volume 8 (800-899)
- Topic: 865 - Substitution Cypher
- Replies: 28
- Views: 19699
- Sat Jul 14, 2007 4:12 pm
- Forum: Volume 9 (900-999)
- Topic: 929 - Number Maze
- Replies: 92
- Views: 52023
- Sat Jul 07, 2007 10:36 am
- Forum: Volume 9 (900-999)
- Topic: 929 - Number Maze
- Replies: 92
- Views: 52023
- Sat Jul 07, 2007 7:46 am
- Forum: Volume 4 (400-499)
- Topic: 496 - Simply Subsets
- Replies: 48
- Views: 13897
take input simply as..
though after resolving tle u'll get wa...
ur program doesn't produce right ans for the test i/o..
Code: Select all
while( gets(tempA) )
{
gets(tempB);
}
ur program doesn't produce right ans for the test i/o..