ada/prog.l_ada
1
0
Fork 0
mirror of https://github.com/ada-dmitry/prog.l_ada.git synced 2026-09-24 01:00:15 +00:00
Code Issues Packages Projects Releases Wiki Activity

dir.main added

Browse Source
This commit is contained in:
ada-dmitry
2023-04-25 08:05:41 +03:00
parent 62d99ba675
commit 1f8e90cb3d
37 changed files with 1018 additions and 321 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Home/PL/HW/array_xor/gen.c
+22 -14
View File
@@ -1,29 +1,37 @@
#include "header.h"
int main(int argc, char* argv[]) {
int main(int argc, char *argv[])
{
printf("Cto-Nibud\n");
srand(time(0));
Node* n1 = NULL;
Node* n2 = NULL;
Node* n3 = NULL;
if ((n1 = malloc(sizeof(Node))) == NULL || (n2 = malloc(sizeof(Node))) == NULL || (n3 = malloc(sizeof(Node))) == NULL) {
Node *n1 = NULL;
Node *n2 = NULL;
Node *n3 = NULL;
if ((n1 = malloc(sizeof(Node))) == NULL || (n2 = malloc(sizeof(Node))) == NULL || (n3 = malloc(sizeof(Node))) == NULL)
{
printf("could not malloc\n");
exit(2);
}
printf("Error here 1");
n1 = add_tail(n1, "bebebe");
printf("Error here 1\n");
int i;
for (i = 0; i < COUNT; i++) {
for (i = 0; i < COUNT; i++)
{
char s[LEN];
int j;
for (j = 0; j < LEN - 1; j++)
printf("sss\n");
for (j = 0; j < LEN - 1; j++)
s[j] = 'a' + rand() % 2;
s[LEN - 1] = '\0';
n1 = add_tail(n1, s);
for (j = 0; j < LEN - 1; j++)
s[j]= 'a' + rand() % 2;
n1 = add_tail(n1, s);
printf("11");
for (j = 0; j < LEN - 1; j++){
s[j] = 'a' + rand() % 2;
printf("22");
}
s[LEN - 1] = '\0';
n2 = add_tail(n2, s);
}