OJ Board

My AC solution is as follows:

c = 1;
for (i=N,j=1;j<=R;i--,j++)
c=(c*i)/j;

Here, R is the minimum of M or N-M.
And the type of c is double or long long. All other variables are int.

It can also be solved by using c as an int. In that case, first divide c and j by gcd(c,j). Suppose the new ...

My AC solution is as follows:

c = 1;
for (i=N,j=1;j<=R;i--,j++)
c=(c*i)/j;

Here, R is the minimum of M or N-M.
And the type of c is double or long long. All other variables are int.

It can also be solved by using c as an int. In that case, first divide c and j by gcd(c,j). Suppose the new ...

I didn't find any wrong with this problem.

You have to careful about the intermediate calcualtions. Although the problem description says that the output will fit in 32 bit integer, but the intermediate values may be larger than that. So, use Horner's rule to evaluate the derivative of polynomial ...

See the following link:

http://www.comp.nus.edu.sg/~stevenha/pr ... rting.html

Natalya:

You did a very silly mistake.

Just check your code's output for the following input:
I think now you will be able to find your fault.

Also note that Pisano period is valid for all a and b.

If you know "Pisano period" then you can solve the problem very easily.

The last digit of Fibonacco number repeats with a period of 60. The last
two digits repeat with a period of 300, the last three with a period of
1500 and the last four digits have a period of 15000.

See the following link ...

The following code
[c]char* strTest="Hello";
printf(("%s World!!", strTest));
[/c]
gives output Can anyone explain the output.

Use Horner's Rule to solve the Problem.

No need to use BigInt. Long is enough to solve the problem.

Read the following input description
" Notice that all numbers in the input are given in the base 10."

So, 9240 is a 10 based number. Now, convert it in B1(11) based number
and take the digits (6)(10)(4)(0). I have parenthesized a single digit.
Now assume that it is a base B2(14) number and ...

This problem can be solved very easily with the frequency caluculation of each character. Suppose, the input strings are:

bbaccbacd
abbcdbaae

For the first string the frequency distribution is:
a 2
b 3
c 3
d 1

And for the second string the frequency distribution is:
a 3
b 3
c 1
d 1
e 1

Calculate ...

A polynomial function of degree n can be expressed as p (x) = (x - xr) q (x) where xr is the root of the polynomial p(x) and q(x) is the quotient polynomial of degree (n-1). By synthetic division we can obtain q(x) without performing the actual division. Synthetic division is performed as follows ...

Your Output is not correct. My AC program gives the following output:

R = 100, P = 0.33, Rope = 90.64
R = 100, P = 0.10, Rope = 47.16
R = 100, P = 0.50, Rope = 115.87

You are correct Dominik Michniewski. NR is Newton-Raphson Method.

Another very good problem of Numerical method is The roots (10428). At first I tried it with Bisection method. But got either TLE or WA. Then I got accepted by applying NR method with Synthetic Division.

I am intersted to know the ...

Railway (10263) is a good problem which can be solved by Bisection method.

Use the following

result = n * n * (n + 1) * (n + 1) /4;

instead of

result=(long long)pow(n*(n+1)/2,2);