Advertisement
Guest User

C

a guest
Jan 17th, 2019
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.48 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int main()
  5. {
  6. int SZ, i, j;
  7. char buf[100];
  8. printf("Introdu un numar: ");
  9. SZ = atoi(gets(buf));
  10.  
  11. for(i = 0; i < SZ; i++) {
  12. for(j = 0; j < SZ; j++) {
  13. if(i == SZ - 1 || j == 0 || i == j) {
  14. printf("# ");
  15. } else {
  16. printf(" ");
  17. }
  18. }
  19.  
  20. printf("\n");
  21. }
  22.  
  23. printf("\n");
  24. printf("\n");
  25. printf("\n");
  26. printf("\n");
  27.  
  28. for(i = 0; i < SZ; i++) {
  29. for(j = 0; j < SZ; j++) {
  30. if(i == SZ - 1 && j != 0) {
  31. printf("# ");
  32. }
  33.  
  34. else if(i >= SZ / 2 && i == j) {
  35. printf("# ");
  36. }
  37.  
  38. else if(i > SZ / 2 && j == SZ - i) {
  39. printf("# ");
  40. }
  41.  
  42. else {
  43. printf(" ");
  44. }
  45. }
  46.  
  47. printf("\n");
  48. }
  49. return 0;
  50. }
  51.  
  52. /*
  53. #include <stdio.h>
  54. #include <stdlib.h>
  55.  
  56. int main()
  57. {
  58. printf("Dati un numar: ");
  59. int SZ, i, j;
  60. char buf[100];
  61. SZ = atoi(gets(buf));
  62.  
  63. //trebe sa te gandesti la asta ca o matrice de patratele de SZ x SZ patratele
  64. //gandeste ca toate is albe la inceput
  65. //si mai gandestet ca fiecare patratica are o coordonata
  66. /*
  67. (0,0) (0,1) (0,2) (0,3) (0,4)
  68. (1,0) (1,1) (1,2) (1,3) (1,4)
  69. (2,0) (2,1) (2,2) (2,3) (2,4)
  70. (3,0) (3,1) (3,2) (3,3) (3,4)
  71. (4,0) (4,1) (4,2) (4,3) (4,4)
  72. */
  73. //daca observi o diagonala se formeaza din patratici care au coordonatele i si j egale
  74. //aia ii o latura atriughiului
  75. //mai ai nevoie de patraticile de pe prima colona, daca te uiti la coordonate observi ca j tot timpu ii zero
  76. //si mai iti trebe patracicile din ultima linie, daca te uiti vezi ca tot timpu i ii 4 sau SZ - 1 in cazu tau
  77. //si tu doar pui conditiile daca i = SZ - 1 sau j = 0 sau i = j printeaza "#" altfel spatiu gol " "
  78. /*
  79. for(i = 0; i < SZ; i++) {
  80. for(j = 0; j < SZ; j++) {
  81. if(i == SZ - 1 || j == 0 || i == j) {
  82. printf("# ");
  83. } else {
  84. printf(" ");
  85. }
  86. }
  87.  
  88. printf("\n");
  89. }
  90.  
  91. printf("\n");
  92. printf("\n");
  93. printf("\n");
  94. printf("\n");
  95.  
  96.  
  97. //la fel ca mai sus da aici iti trebe ultima linie deci o conitie ii ca i = SZ - 1
  98. //iti trebe diagonala de pe care i = j da numa jumate din ea asa ca i trebe sa fie mai mare decat SZ / 2
  99. //si cealata diagonala daca vezi j = SZ - i
  100. /*
  101. (0,0) (0,1) (0,2) (0,3) (0,4)
  102. (1,0) (1,1) (1,2) (1,3) (1,4)
  103. (2,0) (2,1) (2,2) (2,3) (2,4)
  104. (3,0) (3,1) (3,2) (3,3) (3,4)
  105. (4,0) (4,1) (4,2) (4,3) (4,4)
  106. */
  107. /*
  108. (0,4) 0 = 4 - 4
  109. (1,3) 1 = 4 - 3
  110. (2,2) 2 = 4 - 2
  111. (3,1) 3 = 4 - 1
  112. (4,0) 4 = 4 - 0
  113. */
  114. /*
  115. for(i = 0; i < SZ; i++) {
  116. for(j = 0; j < SZ; j++) {
  117. if(i == SZ - 1 && j != 0) {
  118. printf("# ");
  119. }
  120.  
  121. else if(i >= SZ / 2 && i == j) {
  122. printf("# ");
  123. }
  124.  
  125. else if(i > SZ / 2 && j == SZ - i) {
  126. printf("# ");
  127. }
  128.  
  129. else {
  130. printf(" ");
  131. }
  132. }
  133.  
  134. printf("\n");
  135. }
  136. }
  137. */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement