Franek2279

Untitled

Dec 14th, 2022
33
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.17 KB | Source Code | 0 0
  1. #define _CRT_SECURE_NO_WARNINGS
  2. #include<stdio.h>
  3. #include<stdlib.h>
  4. #include<math.h>
  5. #include"winbgi2.h"
  6. #include<windows.h>
  7. void wypelnij(int (&a)[100][100]) {
  8. for (int i = 0; i < 40; i++) { setlinestyle(0,1,2); line(i * 25, 0, i * 25, 1000); line(0, i * 25, 1000, i * 25); }
  9. for (int i = 0; i < 40; i++) {
  10. for (int j = 0; j < 40; j++) {
  11.  
  12. if(a[i+1][j+1]==1) { setfillstyle(SOLID_FILL, DARKGRAY);
  13. rectangle(i*25,j*25,i*25+25,j*25+25);
  14. floodfill(i * 25 + 13, j * 25 + 13, DARKGRAY);}
  15. }
  16. }
  17. }
  18. void tzwroszada(int (&a)[100][100], int (&b)[100][100]) {
  19.  
  20. for (int i = 1; i <= 40; i++) {
  21. for (int j = 1; j <= 40; j++) {
  22. int sum = 0;
  23. if (a[i-1][j-1] == 1) { sum++; }
  24. if (a[i][j-1] == 1) { sum++; }
  25. if (a[i+1][j-1] == 1) { sum++; }
  26.  
  27. if (a[i-1][j] == 1) { sum++; }
  28. if (a[i+1][j] == 1) { sum++; }
  29.  
  30. if (a[i-1][j+1] == 1) { sum++; }
  31. if (a[i][j+1] == 1) { sum++; }
  32. if (a[i+1][j+1] == 1) { sum++; }
  33.  
  34.  
  35. if (a[i][j] == 1) {
  36. if (sum == 2) { b[i][j] = 1; }
  37. else { if (sum == 3) { b[i][j] = 1; } else { b[i][j] = 0; } }
  38. }
  39.  
  40.  
  41. if (a[i][j] == 0) {
  42. if (sum == 3) { b[i][j] = 1;}else { b[i][j] = 0; }
  43. }
  44.  
  45. sum = 0;
  46. }
  47. }
  48. }
  49. void zerowanie(int (&a)[100][100], int (&b)[100][100]) {
  50. for (int i = 0; i <100; i++) {
  51. for (int j = 0; j < 100; j++) {
  52. a[i][j] = b[i][j];
  53. b[i][j] = 0;
  54. }
  55. }
  56. }
  57. int a[100][100];
  58. int b[100][100];
  59.  
  60. int main(void) {
  61. FILE* f;
  62. f = fopen("start.txt", "r");
  63. int g; fscanf(f, "%i", &g);
  64. for (int i = 1; i <= g; i++) {
  65. fscanf(f,"%i %i %i %i %i %i %i %i %i %i", &a[11][i+10], &a[12][i+10], &a[13][i+10], &a[14][i+10], &a[15][i+10], &a[16][i+10], &a[17][i+10], &a[18][i+10], &a[19][i+10], &a[20][i+10]);
  66. }
  67. fclose(f);
  68. //for (int i = 1; i <= g; i++) { printf("%i %i %i %i %i\n", a[1][i], a[2][i], a[3][i], a[4][i], a[5][i]); }
  69.  
  70. int GraphDriver = DETECT, GraphMode;
  71. initgraph(&GraphDriver, &GraphMode, "", 1010, 1015);
  72. setpalette(15,DARKGRAY);
  73. setbkcolor(WHITE);
  74. cleardevice();
  75. for (int i = 0; i <= 1000; i++) {
  76. cleardevice();
  77. wypelnij(a);
  78. tzwroszada(a, b);
  79. zerowanie(a, b);
  80. Sleep(100);
  81. }
  82.  
  83.  
  84. int k=0; scanf("%i", &k);
  85. closegraph();
  86. return 0;
  87. }
Advertisement
Add Comment
Please, Sign In to add comment