OJ Board

In this problem we must precalculate all possible factorials, and print them out when requested. Calculate factorials of 1 to 1000 takes so mush time. What is the good way to find them?

bignum f[1001];

int main(){
int n;
f[0] = bignum("1");
f[1] = bignum("1");
for (int i = 2; i <= 1000; i ...

I got TL for this problem. My algorithm that find n'th fibonacci number is not fast. Can someone help me?

int main(){
int n;
while (cin >> n)
{
bignum a, b;
a = bignum(); // This means a = 0
b = bignum();
b.digits = 1;
b.a[0] = '1'; // This means b = 1
if (n == 0)
cout << "The Fibonacci ...

Thank you Brian...

Hello. I was wondering if you might be able to help me! Why I got RE for this problem? Here is my code:
Thank You

Can Someone help me?
What's the problem of this code??? :-/
#include <iostream>

using namespace std;

int main(){
int n;
while (cin >> n)
{
int m, j, d;
cin >> m;
bool jolly = true;
bool inc1 = false;
if (n > 1)
{
cin >> j;
d = max(j, m) - min(j, m);
if (d == n - 1)
inc1 = false ...

Hi guys! What is the wrong of this code?
#include <iostream>
#include <cstring>
#include <string>

using namespace std;

string s;

void Shift(int i){
s += s[s.length() - 1];
for (int j = s.length() - 2; j > i; j--)
s[j + 1] = s[j];
}

int main(){
while (getline(cin, s))
{
if (s.length() > 0 ...