OJ Board

It won't get TLE, forget about anupam's posts -- he's wrong (btw, never trust posts written in bold (and italic) fonts).
Even if you'll declare array as char facts[1001][2600] it will only takes 2.5M of memory. Is this too much? Don't think so.
About computation, it's trivial:

BigInteger facts ...

Test your code with input:
1
2
3
...
999
1000

And you'll figure out why it gots TLE.
[Something like a hint] While you're computing 1000! you're computing all other factorial values as well... what's the reason to do same calculations several times?..

Of course, gets faster than cin, as well as fread faster than gets. About fread parameters -- you can use stdin (and stdout for fwrite). STL, obviously, very slow for this problem because it contains too much unnecessary code (for this problem especially). Own stack routines + own I/O routines are ...

Zaheed, the only reason of your accepted result is that you've been enough lucky to make the same mistake as the author of judge's test input/output. Nothing else.

Yeah, bigint is necessary to solve this problem. However my accepted solution for input 9876 produces this answer:

Actually it's easy to solve 4-8 problems per day (as I did) and if you have good education (not as mine) you can increase this value twice or more. So it's possible to solve 1200+ problems within 4-6 months not 'few years' . The question is in free time + motivation.

It's possible to use assembly but it must be in GAS format, i.e. something like this: __asm__ __volatile__ (
"pushal\n"
"movl $tbl, %ebx\n"
"movl %ebx, %edx\n"
"xorl %eax, %eax\n"
".align 16\n"
"__0:\n"
"movl %eax, (%edx)\n"
"addl $4, %edx\n"
"addl $34943, %eax\n"
...

Input: Your output:

Congrats to Anton!

Reuber Guerra Duarte was first for a long time a couple of years ago. And AFAIR Shahriar Manzoor was first before him (when I've joined uva.es at Feb 1999). Also Dmitry Lyubshin was first for several monthes.

Here this a part from my code:[c]void getexpression(void);

void getfact(void)
{
if (*st == '(') {
st++;
getexpression();
assert(*st == ')');
st++;
if (isdigit(*st)) {
printf("%c", *st);
st++;
}
return;
}
while (isdigit(*st)) {
printf("%c", *st);
st++;
}
}[/c]
The fix itself here is ...

[c]void strchrcat(char *s, char c)
{
while (*s != 0) s++;
*s = c;
*(s + 1) = 0;
}[/c]

Caesum wrote:Can anyone give the output for:
1600-01-01
5000-12-31

Bates-Sun-Second-4-399bd
Bates-Sun-Second-5-3003

Oops, sorry, I was wrong! Yeah, the walls are inside the grid.

Do not skip blank lines. And there no "\r"'s in unix text files (but it doesn't really matters). Use gets() to read input and everything will be fine.

epsilon0 wrote:also i assumed walls were within the grid. ie playground 4x4 means only 2x2 "non-wall" positions.

No, walls are outside the grid, so 4x4 means it's really 4x4 playground.