Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
2 size mas
#include <stdio.h> #include <string.h> int main(void) { size_t n = 0; size_t k = 0; scanf("%lu", &n); scanf("%lu", &k); char list[n][k]; memset( list, '\0', n*k*sizeof(char) ); char *addr[n]; for (int i = 0; i < n; ++i) addr[i] = list[i]; char buff[1000] = {'\0'}; return 0; }
run
|
edit
|
history
|
help
0
Test2
pointer example 3
recurs fibo1
02468
13
MergeSort
sum of arrays
120465-11.1-3E
Swiss Infotech Tutorial
Assignment 8 pt 2