OJ Board

I believe there is something funny within this problem. i solved the problem in java, by working on the formula (n-m-1)*...*n / m!, but try first to reduce every multiplier in the numerator with each multiplier in the denominator by their gcd (greatest common devisor), such that we can guarantee ...

I've tried really hard and enormous different approaches but still cannot get it work..... i even copy-pasted exactly the same code from C to JAVA except for difference from input/output, but it still gave a TLE error while the same code in C got AC, depresssssed....

Could any JAVA experts who has ...

the second version with TLE. in fact i've seen people with exactly the same algorithm got accepted in C, just dont know why it doesn't work for JAVA.....


import java.util.StringTokenizer;

/**@author Eric
* Created on 2005-6-9
*/
class Main {

public static void main(String[] args) {
short ...

hi dudes, i am extremely desperate.... i implemented problem 10013 by JAVA using 2 different algorithms and submitted over 25 times, one got Memory Limit Exceeded, and the other Time Limit excceeded.... could any java experts please give me a hand?

the first version got MTE:

import java.util ...

I thought it should be an easy one, but i don't know why i didn't get through.....
i used the bubble sort and count the steps of sorting, is this algorithm all right for problem 299?? Thanks in advance! here is my code: (in Java)

[java]
import java.util.*;

class Main{
public static void main ...

great job!
what could i say, nobody knows how frustrated i used to be facing inputs...
thanx a lot!