OJ Board

Anyone show me where to get ISO C for windows ??
thanks you verymuch.

I did solve this problem. My program run in 0.13s.
But I see that someone can run in 0.02s.
That's great. Anyone know how ??
Ah.., here is my program.
I used Dynamic Programing. But, it's very special ???

[pascal]
type
tab1 = array [1..15] of integer;


var
S: tab1;
max, n, i: integer ...

i used DP to solve this problem. The complexity: n*n*V.
It's really too slow. Please show me if u have a better algorithm.
Thanks you

I try to do this problem. I found a very special DP. I think that I was right.
Here's my program. It's really short. But I get WA. I cannot find what wrong. But I did test it carefully. Anyone help me ??
(I use TP7)


[pascal]
const fi = 'lottery.in';
fo = 'lottery.out';

type
tab1 = array [1..15 ...

I try to do this problem. I found a very special DP. I think that I was right.
Here's my program. It's really short. But I get WA. I cannot find what wrong. But I did test it carefully. Anyone help me ??
(I use TP7)


[pascal]
const fi = 'lottery.in';
fo = 'lottery.out';

type
tab1 = array [1..15 ...

I had a solution but it's too slow.
If you don't mind, please help me....show me a better one ???
Thank you.

I don't know how to solve this poblem. It seems to be so tricky !!!.
Anyone would like to help me ???[pascal] [/pascal]