Advertisement
Guest User

Untitled

a guest
Oct 15th, 2019
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.22 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int main()
  5. {
  6. int n;
  7. printf("Iveskite skaiciu N - ");
  8. scanf("%d", &n);
  9.  
  10. int **grid = malloc(n*sizeof(int*));
  11. int i, j, z;
  12. int bound = n;
  13. for(i = 0; i < n; i++){
  14. grid[i]=malloc(n*sizeof(int));
  15. }
  16.  
  17. ///
  18.  
  19. int val = 1, loop = 0;
  20.  
  21. for(z = 0; z < n/2; z++){
  22. for(i = loop; i < bound-loop; i++){
  23. grid[i][j] = val;
  24. val++;
  25. }
  26. val--;
  27. printf("test");
  28. for(j = loop; j < bound-loop; j++){
  29. printf("test");
  30. grid[i][j] = val;
  31. printf("test");
  32. val++;
  33. }
  34. //////////////
  35. printf("test");
  36. val--;
  37. for(; i > 0+loop; i--){
  38. grid[i][j] = val;
  39. val++;
  40. }
  41. val--;
  42. for(; j > 0+loop; j--){
  43. grid[i][j] = val;
  44. val++;
  45. }
  46. loop++;
  47. }
  48.  
  49. if(n % 2 != 0){
  50. grid[n/2+1][n/2+1] = n*n;
  51.  
  52. }
  53.  
  54. ///
  55.  
  56.  
  57. /*for(i = 0; i < x; i++){
  58. for(j = 0; j < n; j++){
  59. grid[i][j] = val;
  60. val++;
  61. }
  62. }*/
  63.  
  64. for(i = 0; i < n; i++){
  65. for(j = 0; j < n; j++){
  66. printf("%d ", grid[i][j]);
  67. }
  68. printf("\n");
  69. }
  70.  
  71.  
  72. return 0;
  73. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement