├── .DS_Store
├── README.md
└── ex00
    └── my_christmas_tree.c


/.DS_Store:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/To-Rex/MyChristmasTree-C/HEAD/.DS_Store


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # Welcome to My Christmas Tree
 2 | ***
 3 | 
 4 | ## Task
 5 | TODO - What is the problem? And where is the challenge?
 6 | 
 7 | ## Description
 8 | TODO - How have you solved the problem?
 9 | 
10 | ## Installation
11 | TODO - How to install your project? npm install? make? make re?
12 | 
13 | ## Usage
14 | TODO - How does it work?
15 | ```
16 | ./my_project argument1 argument2
17 | ```
18 | 
19 | ### The Core Team
20 | 
21 | 
22 | <span><i>Made at <a href='https://qwasar.io'>Qwasar Silicon Valley</a></i></span>
23 | <span><img alt='Qwasar Silicon Valley Logo' src='https://storage.googleapis.com/qwasar-public/qwasar-logo_50x50.png' width='20px'></span>
24 | 


--------------------------------------------------------------------------------
/ex00/my_christmas_tree.c:
--------------------------------------------------------------------------------
 1 | #include<stdio.h>
 2 | #include<stdlib.h>
 3 | #include<stdbool.h>
 4 | int minf(int x){
 5 |  int n = 1;
 6 |  int k = 3;
 7 |  int m = 0;
 8 |  bool c = false;
 9 |  int l = 0;
10 |  while(x>2){
11 |   if(++m>k){
12 |    k++;
13 |    m = 0;
14 |    c = !c;
15 |    if(c) l++;
16 |    n -= 2*l;
17 |    x--;
18 |   }else{
19 |    n += 2;
20 |   }
21 |  }
22 |  return n;
23 | }
24 | int maxf(int x){
25 |  int n = 1;
26 |  int k = 3;
27 |  int m = 0;
28 |  bool c = false;
29 |  int l = 0;
30 |  while(x>2){
31 |   if(++m>k){
32 |    x--;
33 |    if(x>2){
34 |     k++;
35 |     m = 0;
36 |     c = !c;
37 |     if(c) l++;
38 |     n -= 2*l;
39 |    }
40 |   }else{
41 |    n += 2;
42 |   }
43 |  }
44 |  return n;
45 | }
46 | void space(int n){
47 |  while(n-->0){
48 |   printf(" ");
49 |  }
50 | }
51 | void star(int n){
52 |  while(n-->0){
53 |   printf("*");
54 |  }
55 | }
56 | void plank(int n){
57 |  while(n-->0){
58 |   printf("|");
59 |  }
60 | }
61 | 
62 | int main(int argc,char *argv[]){
63 |  int n = atoi(argv[1]);
64 |  int min = minf(n+1);
65 |  int max = maxf(n+2);
66 |  int length = max / 2;
67 |  int k = 0;
68 |  while(k++<n){
69 |   int blokmin = minf(k+1);
70 |   int blokmax = maxf(k+2);
71 |   while(blokmin <= blokmax){
72 |    int j = length - blokmin/2;
73 |    space(j);
74 |    star(blokmin);
75 |    blokmin += 2;
76 |    printf("\n");
77 |   }
78 |  }
79 |  k = 0;
80 |  while(k++<n){
81 |   if(n%2==0){
82 |    space(length - n/2 + 1);
83 |   }else{
84 |    space(length - n/2);
85 |   }
86 |   plank(n);
87 |   printf("\n");
88 |  }
89 |  return 0;
90 | }


--------------------------------------------------------------------------------