## Search found 151 matches

- Sun Oct 21, 2012 11:33 am
- Forum: Bugs and suggestions
- Topic: Forum for volume 125
- Replies:
**3** - Views:
**2589**

### Forum for volume 125

There are problems now for volume 125, but no subforum yet. It sould be nice if someone could create this.

- Mon Jun 25, 2012 3:43 am
- Forum: Volume 5 (500-599)
- Topic: 511 - Do You Know the Way to San Jose?
- Replies:
**8** - Views:
**3128**

### Re: 511 - Do You Know the Way to San Jose?

Thanks for the info, Brian! Seems like this problem could use a new dataset...

- Sat Jun 23, 2012 1:18 pm
- Forum: Volume 7 (700-799)
- Topic: 723 - Comment Removal
- Replies:
**16** - Views:
**10297**

### Re: 723 - Comment Removal_Clarification

My program outputs:

Hope this helps.

Code: Select all

```
begin;
myfunc }
end;
```

- Fri Jun 15, 2012 11:12 pm
- Forum: Volume 5 (500-599)
- Topic: 511 - Do You Know the Way to San Jose?
- Replies:
**8** - Views:
**3128**

### Re: 511 - Do You Know the Way to San Jose?

I'm stuck on this problem, and I can't even get the example right. Could someone tell me where I'm wrong here (or verify that the example is wrong)? In the second query (San Francisco, level 2), there are three eliglble maps: Level 1: NCalif, area 572, distance to center sqrt(121.16) Level 2: SanMat...

- Thu Jun 07, 2012 2:21 pm
- Forum: General
- Topic: Colombian Collegiate Programming League 2012 Problems
- Replies:
**8** - Views:
**10149**

### Re: Colombian Collegiate Programming League 2012 Problems

12465 - Number theory (number of divisors) 12466 - Topological sort, DP 12469 - Combinatorial game theory (win/loss-minimax with memoization) 12470 - Convert recurrence into matrix, fast matrix exponentiation I think it's better to ask questions about individual problems in their own threads in orde...

- Tue Jun 05, 2012 12:57 pm
- Forum: Volume 3 (300-399)
- Topic: 364 - Constitutional Computing
- Replies:
**13** - Views:
**3106**

### 364 - Constitutional Computing

I'm stumped on the sample input on this problem. The output of the first test case doesn't make sense to me. For the first case, I get the following numbers of representatives (basically taken from the problem statement): State H J A W ----- -- -- -- -- Anxit 2 2 2 2 Bored 8 9 8 8 Confu 11 11 10 11 ...

- Thu Sep 24, 2009 9:31 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11666 - Logarithms
- Replies:
**16** - Views:
**6346**

### Re: 11666 Logarithms WA again and agian

Is this even possible to do in Java? I just get TLE: You probably get TLE because there are a lof of test cases, and hence a lot of output. Try buffering the output, for instance: StringBuffer bf=new StringBuffer(); // calculate answer bf.append(answer); // print all output System.out.print(bf);

- Mon Sep 14, 2009 3:31 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11675 - Happy Friends
- Replies:
**6** - Views:
**3252**

### Re: 11675 -Happy Friends

N(1 ? N ? 30), M(N-1 ? M ? N*(N-1)/2), K(0 ? K ? N-1) and D(0 ? D ? 1000000000), number of nodes, number of friendships, initial happy person and number of days" see highlighted section. Thanks! D'oh, can't believe I missed this after reading the problem statement several times, looking for an expl...

- Mon Sep 14, 2009 2:52 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11675 - Happy Friends
- Replies:
**6** - Views:
**3252**

### Re: 11675 -Happy Friends

How did you discover this? I couldn't see that the K was explained in the problem statement. I only saw it in the input format section, without explanation.mak(cse_DU) wrote:step4: print K-th row of resultant matrix.

- Mon May 25, 2009 4:11 am
- Forum: Volume 116 (11600-11699)
- Topic: 11616 - Roman Numerals
- Replies:
**2** - Views:
**1131**

### Re: 11616 - Roman Numerals

Please have the code surrounded by the code tag!

I spotted one error in your code,
the DCC should be DCCC.

I spotted one error in your code,

Code: Select all

```
else if( temp == 8) printf("DCC");
```

- Sat May 09, 2009 10:20 pm
- Forum: Volume 4 (400-499)
- Topic: 463 - Polynomial Factorization
- Replies:
**7** - Views:
**2798**

### Re: 463 Polynomial factorization, unsure about what to output

And now it's time to ask for help again. I believe that my algorithm is correct, but I haven't been able to get accepted on this problem yet, even after all these years. My algorithm is based on what I wrote in my previous post. Here's an outline: For each input a_4 x^4 + a_3 x^3 + a_2 x^2 + a_1 x +...

- Sat May 09, 2009 10:05 pm
- Forum: Volume 4 (400-499)
- Topic: 463 - Polynomial Factorization
- Replies:
**7** - Views:
**2798**

### Re:

Could you please tell me how to find roots? Because, my prog is kinda good, but gets WA. If someone would give good test cases to check my prog, I'll appreciate it. Please, help me, someone with AC. For monic polynomials a_0 + a_1x + ... + x^n, all roots will divide a_0. The input contains non-moni...

- Sat Oct 27, 2007 11:51 pm
- Forum: Volume 2 (200-299)
- Topic: 295 - Fatman
- Replies:
**3** - Views:
**3748**

If I understood your algorithm correctly, it will give wrong answer to both of these cases: 2 9 6 18 1 2 2 2 3 2 4 2 5 2 6 2 1 3 1 4 1 5 8 1 8 2 8 3 8 4 7 4 6 4 5 4 4 4 3 4 4 10 12 1 4 1 5 1 6 1 7 1 8 1 9 3 1 3 2 3 3 3 4 3 5 3 6 The first case is a zigzag maze where the man must go right, down, left...

- Sat Jul 21, 2007 1:38 pm
- Forum: Volume 9 (900-999)
- Topic: 900 - Brick Wall Patterns
- Replies:
**16** - Views:
**9443**

In the function str_add, you are allocating res[10000] on the stack, which is then returned by the function. This array will be overwritten with garbage when other functions are called. This is likely the cause for run-time error. If your program did work, you would get Memory limit exceeded because...

- Thu Jul 05, 2007 3:44 pm
- Forum: Volume 1 (100-199)
- Topic: 113 - Power of Cryptography
- Replies:
**163** - Views:
**18526**