OJ Board

Problem 10030 can be solved by max flow.

This might be a little late, but i just thought i'll try and explain his algo.. let f(n) denote the no of ways to make numbers with the sum n. The number of ways to make n is the same as the number of ways to make n-1 + no of ways to make n-2 + no of ways to make + no of ways to make n-3 + no of way...

It seems that the number of problems solved has dropped for almost everyone? Or is it just me?

not sure how accurate this is, but u can get pi by using
[c]
2*acos(0);
[/c]

My -1 cents.

Correct me if i'm wrong but 195 has both upper case and lower case.
Your sort function ( or what i managed to make out ) only handles upper case letters

Your code will get accepted with slight modifications. The main redundancy there is repeatedly checking certain n. for example, the input set 0 300 0 10000 will regenerate all the numbers from 0 to 300. As such, you should pre-generate and check for primality all the numbers. After which, just loop ...

Actually, the method is sufficient for this problem. Although there is a faster method, which must be used in qn 100.
It turns out that certain points of the computation exceeds the capacity of long int

The problem no was 836. I sumbitted the problem while the judge was being flooded.
I checked my mail after and hour or so and it said i got nan time. As such i can't tell what the status showed.

The last referred to the last post i saw about nan.

Its really digusting that people take advantage of this free OJ that people have put alot of work into. To think that person flooded the judge with TLE entries is a sad thought. On another note, maybe related to the high volume of submission, my program ran in "nan" time. I read about the ...

i get the same problem and btw..as far as my measly knowledge of c++ is concerned... setprecisio(0) sets it back to the default of infinite precision, no?

the following code gets WA. any help would be appreciated :D [c]#include <stdio.h> #include <string.h> #include <stdlib.h> char input[100][100]; int sort_function( const void *a, const void *b); int main() { int a,b,c,d,e,f,g,h,i,n; while (scanf("%d%*c", &n) == 1) { for (i=0; i< n; i++...

[c]#include <stdio.h> int main() { long l,h,v, i,e,t,c; scanf("%ld %ld", &l,&h); while((l != 0) && (h != 0)) { if (l > h) { v = l; l = h; h = v; } v = 0; for (i =l; i<=h; i++) { e = i; t = 0; do { if ( e % 2 ==0 ) e /= 2; else e = e*3 +1; t++; } while ( e != 1); if (t > v) ...