## Search found 56 matches

- Wed Oct 22, 2008 3:33 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11536 - Smallest Sub-Array
- Replies:
**9** - Views:
**2372**

### Re: 11536 - Smallest Sub-Array

This is weird! The input of the problem statement states that N(2 < N < 1000001), M(0 < M < 1001) and K(1< K < 101) . I found that my program outputs "sequence nai" for K == 1. I fixed that so the output become 1 for K == 1. And got accepted. Is in the judge data there was an input where K...

- Tue Oct 21, 2008 6:01 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11536 - Smallest Sub-Array
- Replies:
**9** - Views:
**2372**

### Re: 11536 - Smallest Sub-Array

Is there any tricky input I can check?

- Tue Oct 21, 2008 5:28 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11536 - Smallest Sub-Array
- Replies:
**9** - Views:
**2372**

### 11536 - Smallest Sub-Array

Hi, I'm getting WA in this problem. I can't figure my mistake out. Can anyone check my output to the following input with an AC code's output? Thanks in advance. INPUT: 15 20 12 4 20 12 8 3 5 3 1000000 10 12 3 1 2 1000000 1000 100 50 50 50 29 17 11 29 17 33 14 6 3 14365 66 3 353540 233 99 222222 222...

- Mon Nov 26, 2007 7:53 am
- Forum: Volume 113 (11300-11399)
- Topic: 11312 - Flipping Frustration
- Replies:
**4** - Views:
**2309**

I tried the following:

Seems correct to me. Are they wrong? Can anyone give me tricky I/O? Please help.

Thanks.

**Input:**Code: Select all

```
9
10 5 4 1
1000 2 1 42
100 2 4 66
101 60 70 51
100 2 3 98
10000000 1 1 10000000
35 3 10 35
35 3 10 34
29 13 5 29
```

**Output:**Code: Select all

```
0
41
uh-oh!
uh-oh!
34
9999999
6
15
uh-oh!
```

Thanks.

- Wed Nov 21, 2007 7:00 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11307 - Alternative Arborescence
- Replies:
**22** - Views:
**11548**

I tried with 10 colors but got WA. Here is my code: #include <iostream> #include <string> #include <sstream> using namespace std; #define MAX 10004 #define NCOLOR 10 unsigned long INF = (1 << 29); int degree[MAX], graph[MAX][MAX], cost[MAX][NCOLOR]; int main() { register int m, p; int n, i, j, k, co...

- Mon Nov 12, 2007 8:07 am
- Forum: Volume 113 (11300-11399)
- Topic: 11303 - Permutations
- Replies:
**11** - Views:
**3271**

- Sun Nov 11, 2007 6:21 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11303 - Permutations
- Replies:
**11** - Views:
**3271**

- Sat Nov 10, 2007 12:07 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11303 - Permutations
- Replies:
**11** - Views:
**3271**

- Sat Oct 27, 2007 6:37 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10800 - Not That Kind of Graph
- Replies:
**48** - Views:
**23293**

- Mon Sep 17, 2007 12:46 am
- Forum: Volume 112 (11200-11299)
- Topic: 11280 - Flying to Fredericton
- Replies:
**43** - Views:
**17525**

### 11280 - Flying to Fredericton

I tried Floyd-Warshall but getting WA. Can anyone tell me how to solve this problem?

Thanks.

Thanks.

- Sun Sep 09, 2007 2:44 pm
- Forum: Volume 2 (200-299)
- Topic: 264 - Count on Cantor
- Replies:
**47** - Views:
**15127**

my output to the above input is as follows: TERM 1000000 IS 1009/406 TERM 1234567 IS 240/1332 TERM 2897534 IS 495/1913 TERM 3897346 IS 1110/1683 TERM 4482323 IS 1802/1193 TERM 5809231 IS 3115/295 TERM 6898729 IS 3688/27 TERM 7829873 IS 1031/2927 TERM 8298733 IS 2032/2043 TERM 9908727 IS 801/3652 TER...

- Sat Jan 20, 2007 7:23 am
- Forum: Volume 7 (700-799)
- Topic: 712 - S-Trees
- Replies:
**3** - Views:
**4099**

- Fri Jan 19, 2007 11:15 am
- Forum: Volume 7 (700-799)
- Topic: 712 - S-Trees
- Replies:
**3** - Views:
**4099**

### 712 - S-Trees

for the following input:
both of the following outputs result PE:

Output 1
Output 2
why? please give suggestions on how to fix it!

Code: Select all

```
3
x1 x2 x3
00000111
4
000
010
111
110
3
x3 x1 x2
00010011
4
000
010
111
110
0
```

Output 1

Code: Select all

```
S-Tree #1:
0011
S-Tree #2:
0011
```

Code: Select all

```
S-Tree #1:
0011
S-Tree #2:
0011
```

- Tue Jan 16, 2007 5:25 pm
- Forum: Volume 8 (800-899)
- Topic: 825 - Walking on the Safe Side
- Replies:
**38** - Views:
**21667**

- Tue Jan 09, 2007 3:10 pm
- Forum: Volume 8 (800-899)
- Topic: 824 - Coast Tracker
- Replies:
**8** - Views:
**6396**