OJ Board

Everything is okay now, I figured out how to solve the problem.

I found out what was wrong, which I have bolded in the new code.

#include <stdio.h>
#include <math.h>

FILE *input, *output;
long long numbits, numones, ith, count, total;
long long wrong[2], fact[33], string[33];

long long fac(long long num, long long start)
{
long long i, f=1;

if(fact[num ...

Here's the forumla I've always been taught, where L goes from 1 to L -

N!/(L!*(N-1)!)

which is what I'm using, and I think is the same thing as binomial coefficiants, I'm sure since I'm not that good at math. I'm just implementing this forumla a little differently.

I'm on problem kimbits,

Consider an ordered set S of strings of N (1 <= N <= 31) bits. Bits, of course, are either 0 or 1.

This set of strings is interesting because it is ordered and contains all possible strings of length N that have L (1 <= L <= N) or fewer bits that are `1'.

Your task is to ...

Can someone show me some java code for reading the input file below using the OP's java methods? I don't exactly understand how I would use it.





2 7
3 5

It doesn't matter whether the numbers go into an array, or anything, I just want to see them being read as ints. And btw, this is for a ...

I need help with one of the test cases with the problem inflate.

Here's the problem description if anyone needs it:

Score Inflation

The more points students score in our contests, the happier we here at the USACO are. We try to design our contests so that people can score as many points as ...