[ create a new paste ] login | about

Link: http://codepad.org/OKC05OMQ    [ raw code | output | fork ]

C, pasted on Mar 24:
#include <stdio.h>
#define size1 5
#define size2 10
int main(){
    int i,j,k=0;
    int **mem=malloc(size1*sizeof(int*));
    for(i=0;i<size1;i++){
        mem[i]=malloc(size2*sizeof(int));
    }
    
    for(i=0;i<size1;i++){
        for(j=0;j<size2;j++){
            mem[i][j]=k;
            k++;
            printf("%d",mem[i][j]);
            if(k%10==0){
                printf("\n");
            }
        }
    }
    
    for(i=0;i<size1;i++){
        free(mem[i]);
    }
    free(mem);
    return 0;
}


Output:
1
2
3
4
5
0123456789
10111213141516171819
20212223242526272829
30313233343536373839
40414243444546474849


Create a new paste based on this one


Comments: