68 lines
1.5 KiB
C
68 lines
1.5 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#define SIZE 20
|
|
|
|
int checkMinHeap(const long* arr, const int size){
|
|
if(size == 1){
|
|
return 1;
|
|
}
|
|
for (int i = 0; i<=(size-2)/2; i++) {
|
|
if(arr[2*i] < arr[i]) return -1;
|
|
if(arr[2*i+1] < arr[i]) return -1;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
long int* strToInt(const char* chArr){
|
|
int j = strlen(chArr);
|
|
//int i = 0;
|
|
int counter=0;
|
|
//printf("dlength %d\n",j/2-1);
|
|
long int* tmp = (long int*)calloc(j,sizeof(long));
|
|
char* pEND;
|
|
for(int i=0; i<j; i++){
|
|
tmp[i] = strtol(chArr, &pEND, 10);
|
|
//printf("%ld \n", dArr[i]);
|
|
if(tmp[i] == 0) break;
|
|
counter++;
|
|
chArr = pEND;
|
|
}
|
|
/* for(int i = 0; i<j/2-1; i++){
|
|
printf("%ld ", dArr[i]);
|
|
}*/
|
|
printf("counter %d\n", counter);
|
|
long* dArr = (long*)calloc(counter, sizeof(long));
|
|
for(int i; i < counter; i++){
|
|
dArr[i] = tmp[i];
|
|
}
|
|
free(tmp);
|
|
return dArr;
|
|
}
|
|
|
|
void print_tree(const long* arr){
|
|
long size = sizeof(&arr)/sizeof(arr[0]);
|
|
for(int i = 0; i < size; i++){
|
|
printf("%ld\n", arr[i]);
|
|
}
|
|
}
|
|
|
|
int main(){
|
|
char chArr[SIZE];
|
|
while(1){
|
|
char* r = fgets(chArr, SIZE, stdin);
|
|
if(r == NULL){
|
|
break;
|
|
}
|
|
}
|
|
long int* dArr = strToInt(chArr);
|
|
|
|
int heap = checkMinHeap(dArr, sizeof(&dArr)/sizeof(long));
|
|
if(heap == 1){
|
|
printf("Je to taka kopa:\n");
|
|
print_tree(dArr);
|
|
}
|
|
free(dArr);
|
|
return 0;
|
|
} |