OJ Board

we know fact(n)=nfact(n-1)
->fact(n-1)=fact(n)/n
->fact(n)=fact(n+1)/(n+1)

if n=-1 ,
-1!=fact(0)/0=infinity so overflow
if n=-2
-2!=fact(-1)/(-1)=-infinity so underflow

nd so on

i found the fault myself,yet thanx to raiyan

i used lcs for this prigram so why wa?
[cpp]#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int cor[40],stu[40],array[40][40],n;

void work()
{
int i,j;

for(i=0;i<40;i++)
memset(array ,0,sizeof(int)*40);

for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
if(stu ==cor[j])
array[i+1][j+1]=array [j ...

i can't understand why it is wa?
[cpp]
what a funny mistake
[/cpp]

i tried with extra newline but still got wa.i am tired with it

yet i got wa.in problem it was told the sum will be no longer than the given integer.so why extra place.i think there is problem in taking input.
plssss will you check

it's a multiple input problem.i think i can't manage multiple input
problem.please tell what should be code change to provide multiple
input correctly.i took array outside main function but got wa.

why it is wa?i am confused about input 000.will i then increase instruction?

[cpp]#include<stdio.h>
#include<string.h>

long int ram[1001],r[11];

int main()
{
long int test,n,ip,i,k;
int f,d,s;

scanf("%ld",&test);

for(k=0;k<test;k++)
{
i=0;
ip=0;
while(1==(scanf("%ld",&ram[i++])));

for ...

is my algorithm correct?
need some input&output.

at first i sorted the iputs.entered 1st man in group1&2nd man in group 2.
kept track for man in 2 groups with man1&man2 variable.
then for every next input checked if there is equal man in 2 groups.
if man number is equal then checked in which group ...

is my algorithm correct?
need some input&output.

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

int n;
int a[105];

void input()
{
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a );
return;
}
void work()
{
int temp,i,j,k,p1,p2,t1,t2,man1,man2,test;

scanf("%d",&test);

for(k=0 ...

why compile error?
is my algorithm correct?

[cpp]
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int main()
{
long int a[1000000];
char array[1000000][1000];
char str[1000000],s[1000];

long int in,i,num,n,j,len,k;
double p;
scanf("%ld",&n);
fflush(stdin);

for(k=0;k<n;k++){

in ...

why it's wa?i need some input& output.
is my algorithm correct?then why wa?

#include<stdio.h>

int d1,d2;
long int n,m,i,j,num;
int a[1000001];

int main()
{
int c,k;
scanf("%ld",&n);

for(i=0;i<n;i++)
{
scanf("%ld",&m);

for(j=0;j<m;j++)
{
scanf("%d %d",&d1,&d2);
a[j]=(d1+d2)%10;
c=(d1 ...

why compile error?
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int main()
{
long int a[1000];
char array[1000][20];
char str[1000],s[100];

long int in,i,num,n,j,len,k;
double p;
scanf("%ld",&n);
fflush(stdin);

for(k=0;k<n;k++){

in=0;
gets(str);
len=strlen(str);

for(i=0;i ...

why wa?
need some sample input&output
my coding:

[cpp]
#include<stdio.h>
#include<string.h>

int posn[258],travel[258],nmtrv[258];

int main()
{
long int num,i,in;
char str[10000],res[10000],s[5];
long int match=0,notm=0,len,len1;

for(;;)
{
scanf("%ld",&num);
gets(s);
if(num==-1)
break ...

why wa?

#include<stdio.h>
#include<ctype.h>
#include<string.h>

struct freq{
char c;
unsigned long int f;

};
struct freq letter[26];

unsigned long int i,n,l,j;
int index;
char str[150000000];

int main(){

scanf("%lu",&n);
for(;n>0;n--){

fflush(stdin);
gets(str);
l=strlen(str);
for(i=0 ...