/
Trees1.c
70 lines (64 loc) · 1.63 KB
/
Trees1.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include<stdio.h>
int main(){
int T[500],kok[250],sol[250],sag[250],N,K,i;
printf("Dizinizdeki ELeman Sayisini Giriniz ");
scanf("%d",&N);
for(i=1; i<=N; i++){
printf("Dizinin %d. Elemani : ",i);
scanf("%d",&T[i]);
}
for(i=1; i<=N/2; i++){
kok[i]=T[i];
printf("kok %d ",kok[i]);
sol[i]=T[i*2];
printf("sol %d ",sol[i]);
sag[i]=T[(i*2)+1];
printf("sag %d ",sag[i]);
}
printf("\nK Sayisini Giriniz ");
scanf("%d",&K);
if(N%2==0){
for(i=1; i<N/2; i++){
if(kok[i]+sol[i]+sag[i]>=K){
printf("%d + %d + %d = %d \n",kok[i],sol[i],sag[i],kok[i]+sol[i]+sag[i]);
}
if(i*i<=N/2){
if(kok[i]+sol[i]+sol[i*i]>=K){
printf("%d + %d + %d = %d\n",kok[i],sol[i],sol[i*i],kok[i]+sol[i]+sol[i*i]);
}
}
if(i+i+1<=N/2){
if(kok[i]+sag[i]+sag[i+i+1]>=K){
printf("%d + %d + %d = %d\n",kok[i],sag[i],sag[i+i+1],kok[i]+sag[i]+sag[i+i+1]);
}
}
if(i+i<=N/2){
if(kok[i]+sol[i]+sag[i+i]>=K){
printf("%d + %d + %d = %d \n",kok[i],sol[i],sag[i+i],kok[i]+sol[i]+sag[i+i]);
}
}
}
}
else if(N%2==1){
for(i=1; i<=N/2; i++){
if(kok[i]+sol[i]+sag[i]>=K){
printf("%d + %d + %d = %d \n",kok[i],sol[i],sag[i],kok[i]+sol[i]+sag[i]);
}
if(i*i<=N/2){
if(kok[i]+sol[i]+sol[i*i]>=K){
printf("%d + %d + %d = %d\n",kok[i],sol[i],sol[i*i],kok[i]+sol[i]+sol[i*i]);
}
}
if(i+i+1<=N/2){
if(kok[i]+sag[i]+sag[i+i+1]>=K){
printf("%d + %d + %d = %d\n",kok[i],sag[i],sag[i+i+1],kok[i]+sag[i]+sag[i+i+1]);
}
}
if(i+i<=N/2){
if(kok[i]+sol[i]+sag[i+i]>=K){
printf("%d + %d + %d = %d \n",kok[i],sol[i],sag[i+i],kok[i]+sol[i]+sag[i+i]);
}
}
}
}
}