OJ Board

Replying to follow the thread.

plamplam,
Thanks for the great test cases.

Your code is producing a RE on the sample input. 20! will fit in long long. Also see:
http://www.algorithmist.com/index.php/BigNum

http://acm.uva.es/board/viewtopic.php?f=20&t=1353

Search the board first using the search option located at top-right. Don't create a new thread for a problem that already exists. Make your post in an existing thread.

i am not getting perfect answer .
if u see my code carefully then u find my ...

http://acm.uva.es/board/viewtopic.php?f=20&t=1353

Search the board first using the search option located at top-right. Don't create a new thread for a problem that already exists. Make your post in an existing thread.

here is my code:
#include<stdio.h>
unsigned long long int binnas(int i)
{
unsigned long long int n=1;
for(;i>1;) n*=i--;
return n;
}

int main()
{
unsigned long long int n,r;
int i,j,x,count,in,in1;
char arr[21];
in1=1;
scanf("%d",&in);
getchar();
while(in1++<=in){
for(i=0;arr[i-1]!='\n ...

Well well, look what we have here. The problem description is actually wrong, although the problem itself is not. It says that
"The number of arrangements will always be able to fit into an unsigned long int. Note that 12! is the largest factorial that can fit into an unsigned long int." Notice that ...

i have considered k=0;
but still it is WA
here is the code:

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

char line[100];
long same[100];
long long ans,fact;
int i,j;

long long factorial[22]={1,2,6,24,120,720,5040,4320,362880,3628800LL,39916800LL,479001600LL,6227020800LL ...

abid_iut wrote:I have changed the code accordingly
But now it is WA
pls anyone help
here is the code:

I don't fully understand your code.. but, what if k == 0 ??

I have changed the code accordingly
But now it is WA
pls anyone help
here is the code:

abid_iut wrote:getting CE!!
I thought unsigned long long can handle 20!
is it? or any other problem
where should I change

2432902008176640000 is a representation of 32 bit integer
You should code it like 2432902008176640000LL or 2432902008176640000ULL

getting CE!!
I thought unsigned long long can handle 20!
is it? or any other problem
where should I change
here is the code: pls help

I don't know why I am WA???
#include<stdio.h>
#include<string.h>
int main()
{
char st[21],a[21];
int n,i,j,k,r,len,num[21],c=0;
bool found,enter;
scanf("%d",&n);getchar();
while(n--)
{
c++;
gets(st);
len = strlen(st);j=0;k=1;
for(i=0;st[i];i++)
{
if(i>0)
{
found=0;
for(j=0;j<k;j ...

I am facing RTE. Can anybody help me? Is my algorithm is correct for solving this problem? Here is my code

one of them is
10338