Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 40121

Segmentation Fault

$
0
0
#include<stdio.h>

include<conio.h>

int main() { int i,j,k,T; long int N[1000000],S[1000000]; scanf("%d",&T); for(i=0;i<T;i++) { scanf("\n%d",&N[i]); } for(j=0;j<T;j++) { S[j]=N[j]+1; } for(k=0;k<T;k++) { printf("%d\n",S[k]); } getch(); return 0; }


Viewing all articles
Browse latest Browse all 40121

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>