OJ Board

the LA-Z-BOy wrote:hi...

Thank you very much. I got accepted.

I got WA either but I got every problem stated here solved, and even eliminated some more bugs of my own. Would you all mind providing some extreme test cases for me...?

Maybe I'm irresponsible, but I'd used the n!/(n1!*n2!...) algorithm and got WA. I don't dare to use long long so I check if the range was exceeded then pause and just start dividing, and once it's indivisible with a certain number then build up the remaining factorial, and so forth:

[c]
#include ...

how can declare the own strcuture ?
can u tell me how to do it?

Strings are character arrays in C. This makes
manipulation on extremely big integers by string
easier.

For this question, you can consider the steps of
long division which helps the whole number handling
a lot.

Meanwhile, I get ...

Sorry that I have no choice but posting my code here to
check the bugs...

(The problem is Wrong Answer)


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

int Mdiff(char time[]) {
float difference;
int output;
if (strcmp(time, "UTC") == 0) difference = 0.0;
if (strcmp(time, "GMT ...

Output: January 1, 0 is a Thursday
January 1, 1 is a Saturday
March 1, 401 is a Friday
March 1, 801 is a Monday
February 29, 1000 is a Thursday
March 1, 1000 is a Friday
9/3/1752 is an invalid date.
9/13/1752 is an invalid date.
Do the days September 3rd 1752 until September 13th 1752 ever exist ...

Using long int works fine, since the sum of two 9-digit numbers is less than 2000000000 which fits in a long int, and in this case the sum is not even calculated.


So does that explains why my program gets a WA either?

int main() {
int a, b, c;
int i, count, carry;
do {
scanf("%d %d", &a, &b ...