Beacuse memory requird to store (1000 * 1000) bytes is more than stack can
hold for the program..Dats y its giving segmentation fault...
On Tue, Sep 20, 2011 at 7:29 AM, Deependra pratap singh <
dsdeependraprat...@gmail.com> wrote:
> for n>1000 , m>1000... m getting the fault. but lesser than th
What are the values of n and m you are providing???
On Tue, Sep 20, 2011 at 7:02 PM, deependra wrote:
> long int n,m;
> cin>>n>>m;
> long int a[n][m];
> a[0][0]=1;
> for(long int i=1;i a[i][0]=0;
> for(long int i=1;i
for n>1000 , m>1000... m getting the fault. but lesser than that code is
working fine...
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send em
long int n,m;
cin>>n>>m;
long int a[n][m];
a[0][0]=1;
for(long int i=1;ihttp://groups.google.com/group/algogeeks?hl=en.
