hello dear friends
can anyone help me with this problem?? I have checked almost all case posted before but my code gives correct output..can anyone help me to find bug of my code??? please help..
here is my code...
#include<cstdio>
#include<cstring>
long long mem[1000][1000];
int main()
{
int w,n,i,k,j,C,l,linef;
char str[10000],subs[10000];
scanf("%d",&C);
getchar();
linef=0;
while(C--)
{
if(linef) printf("\n");
linef=1;
scanf("%d%d",&w,&n);
//for(i=0;i<w;i++) for(j=0;j<n;j++) mem[j]=0;
mem[0][0]=1;
/*for(i=0;i<w;i++)
{
for(j=0;j<n;j++)
{
if(i==0)
mem[j]=0;
if(j==0)
mem[j]=0;
if(i&&j) mem[j]=0;
}
}*/
getchar();
for(i=0;i<w;i++)
{
gets(str);
//puts(str);
int len=strlen(str);
int howmany=0;
k=0;
for(j=0;j<len;j++) /*number conversion from string*/
{
if(str[j]==' ' || j==len-1)
{
if(j==len-1) subs[k++]=str[j];
subs[k]='\0';
//puts(subs);
k=0;
int sublen=strlen(subs);
int num=0;
int p=1;
for(l=sublen-1;l>=0;l--)
{
num+=(p*(subs[l]-'0'));
}
if(howmany>=1) mem[num-1]=-1;
//printf("%d\n",num);
howmany++;
}
else
{
subs[k++]=str[j];
}
}
}
for(i=1;i<n;i++) /*initializing base case*/
{
if(mem[0]!=-1)
mem[0]=mem[0][i-1];
}
for(i=1;i<w;i++)
{
if(mem[0]!=-1)
mem[0]=mem[i-1][0];
}
//mem[0][0]=1;
for(i=1;i<w;i++)
{
for(j=1;j<n;j++)
{
if(mem[j]!=-1)
{
if(mem[i-1][j]==-1 && mem[i][j-1]==-1)
{
mem[i][j]=-1;
}
else if(mem[i-1][j]==-1)
{
mem[i][j]=mem[i][j-1];
}
else if(mem[i][j-1]==-1)
{
mem[i][j]=mem[i-1][j];
}
else
{
mem[i][j]=mem[i][j-1]+mem[i-1][j];
}
}
}
}
if(mem[w-1][n-1]==-1) printf("0\n");
//else if(mem[w-1][n-1]==0) printf("1\n");
else
printf("%lld\n",mem[w-1][n-1]);
//getchar();
for(i=0;i<w;i++) /*initializing arrays*/
{
for(j=0;j<n;j++)
{
mem[i][j]=0;
}
}
}
return 0;
}
getting WA
General topic about Valladolid Online Judge
Moderator: Board moderators
Jump to
- Real Time Contests and Last Minute Information
- ↳ General
- ↳ Real Time Clarification
- ↳ Fixing Mistakes
- ↳ HOWTOs
- ↳ Bugs and suggestions
- New system
- ↳ FAQ
- ↳ Bugs and suggestions
- Let's make some programs!
- ↳ Other words
- ↳ Algorithms
- ↳ New features
- Help on the Problemset
- ↳ Volume 1 (100-199)
- ↳ Volume 2 (200-299)
- ↳ Volume 3 (300-399)
- ↳ Volume 4 (400-499)
- ↳ Volume 5 (500-599)
- ↳ Volume 6 (600-699)
- ↳ Volume 7 (700-799)
- ↳ Volume 8 (800-899)
- ↳ Volume 9 (900-999)
- ↳ Volume 10 (1000-1099)
- ↳ Volume 11 (1100-1199)
- ↳ Volume 12 (1200-1299)
- ↳ Volume 13 (1300-1399)
- ↳ Volume 14 (1400-1499)
- ↳ Volume 15 (1500-1599)
- ↳ Volume 16 (1600-1699)
- ↳ Volume 17 (1700-1799)
- ↳ Volume 100 (10000-10099)
- ↳ Volume 101 (10100-10199)
- ↳ Volume 102 (10200-10299)
- ↳ Volume 103 (10300-10399)
- ↳ Volume 104 (10400-10499)
- ↳ Volume 105 (10500-10599)
- ↳ Volume 106 (10600-10699)
- ↳ Volume 107 (10700-10799)
- ↳ Volume 108 (10800-10899)
- ↳ Volume 109 (10900-10999)
- ↳ Volume 110 (11000-11099)
- ↳ Volume 111 (11100-11199)
- ↳ Volume 112 (11200-11299)
- ↳ Volume 113 (11300-11399)
- ↳ Volume 114 (11400-11499)
- ↳ Volume 115 (11500-11599)
- ↳ Volume 116 (11600-11699)
- ↳ Volume 117 (11700-11799)
- ↳ Volume 118 (11800-11899)
- ↳ Volume 119 (11900-11999)
- ↳ Volume 120 (12000-12099)
- ↳ Volume 121 (12100-12199)
- ↳ Volume 122 (12200-12299)
- ↳ Volume 123 (12300-12399)
- ↳ Volume 124 (12400-12499)
- ↳ Volume 125 (12500-12599)
- ↳ Volume 126 (12600-12699)
- ↳ Volume 127 (12700-12799)
- ↳ Volume 128 (12800-12899)
- ↳ Volume 129 (12900-12999)
- ↳ Volume 130 (13000-13099)
- ↳ Volume 131 (13100-13199)
- Help on languages
- ↳ C
- ↳ C++
- ↳ Pascal
- ↳ Java
- Off Topic
- ↳ Off topic (General chit-chat)
- Category
- ↳ ACM ICPC Archive Board