//MAIN
int main() {
print23();
for(int i = 0; i < 5; i++){
printHowManyTimesImCalled();
}
correctMistake();
return 0;
}
int main(int argc, char *argv[])
{
int i;
int j;
int print_hash_value = 0;
if ((argc == 2) && (strcmp(argv[1], "1") == 0))
print_hash_value = print18(1, 126);
platform_main_begin();
crc32_gentab();
func_1();
transparent_crc(g_3, "g_3", print_hash_value);
transparent_crc(g_13, "g_13", print_hash_value);
for (i = print19(0, 132); i < 8; i++)
{
for (j = print20(0, 134); j < 3; j++)
{
transparent_crc(g_14[i][j], "g_14[i][j]", print_hash_value);
if (print_hash_value)
printf("index = [%d][%d]\n", i, j);
}
}
for (i = print21(0, 141); i < 3; i++)
{
for (j = print22(0, 143); j < 8; j++)
{
transparent_crc(g_29[i][j], "g_29[i][j]", print_hash_value);
if (print_hash_value)
printf("index = [%d][%d]\n", i, j);
}
}
for (i = print23(0, 141); i < 3; i++)
{
transparent_crc(g_30[i], "g_30[i]", print_hash_value);
if (print_hash_value)
printf("index = [%d]\n", i);
}
transparent_crc(g_43, "g_43", print_hash_value);
platform_main_end(crc32_context ^ 0xFFFFFFFFUL, print_hash_value);
return 0;
}
int main(int argc, char* argv[])
{
int i = 0;
char select;
int insert;
tree23* tree = makeTree23();
while(1){
printf("[i]Insert [d]Delete [p]Print [f]Find [q]quit\n");
printf("Select : ");
scanf("%c", &select);
fflush(stdin);
switch(select){
case 'i':
printf("Input : ");
scanf("%d", &insert);
fflush(stdin);
insert23(tree, insert);
break;
case 'd':
printf("Delete : ");
scanf("%d", &insert);
fflush(stdin);
delete23(tree, insert);
break;
case 'p':
printf("***** Print *****\n");
print23(tree);
printf("\n");
break;
case 'f':
printf("Find : ");
scanf("%d", &insert);
fflush(stdin);
if(search23(tree->root, insert))
printf("Exist : %d \n", insert);
else
printf("Not Exist\n");
break;
case 'q':
return 0;
}
}
}
