Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- //#define S_length 11
- //wielkosc kopca=S_length-1
- //#define root S[1]
- #define true 1
- #define false 0
- int zmienna;
- int S[1001];
- int szukanie_max(int tab[],int n){
- if(n==1){
- return tab[1];
- }
- int a=tab[n];
- int b=szukanie_max(tab,n-1);
- if(a>b){
- return a;
- }
- else{
- return b;
- }
- }
- int Parent(int i){
- return i/2;
- }
- int main()
- {
- zmienna=false;
- int i;
- int n;
- S[0]=-1000;
- scanf("%d",&n);
- if(n==1){
- printf("1\n");
- exit(EXIT_SUCCESS);
- }
- for(i=1;i<n;i++){
- scanf("%d",&S[i]);
- }
- int max=szukanie_max(S,n);
- //printf("%d\n",max);
- if(max==S[1]){
- //printf("max==korzen\n");
- for(i=2;i<n;i++){
- if(S[Parent(i)]>S[i]){
- zmienna=true;
- }
- else{
- zmienna=false;
- break;
- }
- }
- if(zmienna==true){
- printf("1\n");
- }
- else{
- printf("0\n");
- }
- }
- else{
- printf("0\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement