Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
lab5
#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+1]; memset( list, '\0', sizeof(list) ); char *addr[n]; for (int i = 0; i < n; ++i) addr[i] = list[i]; char buff[1000] = {'\0'}; for (int i = 0; i < n; ++i) { scanf("%s", &buff); if (strlen(buff) > k) { printf("Строка больше указаной длины (%lu символа)", k); exit(-1); } else { strcpy(addr[i], buff); } memset( buff, '\0', sizeof(buff) ); } for (int i = 0; i < n; ++i) printf("%s\n", addr[i]); return 0; }
run
|
edit
|
history
|
help
0
FileCat
LinkedListTest
Homework 2 Code
staircase
20171117_FUNCIONES
A_141117_Primo02
Divisibility :- #simple-math #ad-hoc-1 #basics
FUNTION3
A_141117_Primo01
Null deref