Advertisement
kokusz19

Untitled

Dec 9th, 2017
179
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.00 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. #define COLS 7
  4. #define ROWS 6
  5.  
  6. void feltolt(char feltolt[COLS][ROWS]){
  7. int i, j, szam = 65;
  8. for(i = 0; i < ROWS; i++){
  9. for(j = 0; j < COLS; j++){
  10. feltolt[i][j] = szam++;
  11. }
  12. }
  13. }
  14.  
  15. void kiir(char kiirat[COLS][ROWS]){
  16. int i, j;
  17. for(i = 0; i < ROWS; i++){
  18. for(j = 0; j < COLS; j++)
  19. printf("%c ", kiirat[i][j]);
  20. printf("\n");
  21. }
  22. printf("*************\n");
  23. printf("*************\n");
  24. }
  25.  
  26. void bele1(char tomb[COLS][ROWS], int place){
  27. int i;
  28. for(i = COLS-1; i >= 0; i--){
  29. if(tomb[i][place-1] == '-'){
  30. tomb[i][place-1] = 'X';
  31. break;
  32. }
  33. }
  34. }
  35.  
  36. void bele2(char tomb[COLS][ROWS], int place){
  37. int i;
  38. for(i = COLS-1; i >= 0; i--){
  39. if(tomb[i][place-1] == '-'){
  40. tomb[i][place-1] = 'O';
  41. break;
  42. }
  43. }
  44. }
  45.  
  46. /*
  47. int checkforwin(char tomb[COLS][ROWS]){
  48. int i, j;
  49.  
  50. for(i = 0; i < COLS-3; i++){ // SORBAN
  51. for(j = 0; i < ROWS-3; j++){
  52. if(tomb[i][j] == tomb[i+1][j] && tomb[i][j] == tomb[i+2][j] && tomb[i][j] == tomb[i+3][j]) return 1;
  53. }
  54. }
  55.  
  56. for(i = 0; i < COLS-3; i++){ // OSZLOPBAN
  57. for(j = 0; i < ROWS-3; j++){
  58. if(tomb[i][j] == tomb[i][j+1] && tomb[i][j] == tomb[i][j+2] && tomb[i][j] == tomb[i][j+3]) return 1;
  59. }
  60. }
  61.  
  62. for(i = 0; i < COLS-3; i++){ // ATLOBAN FELFELE
  63. for(j = 0; i < ROWS-3; j++){
  64. if(tomb[i][j] == tomb[i+1][j+1] && tomb[i][j] == tomb[i+2][j+2] && tomb[i][j] == tomb[i+3][j+3]) return 1;
  65. }
  66. }
  67.  
  68. for(i = COLS-3; i >= 0; i--){ // ATLOBAN LEFELE
  69. for(j = 0; i < ROWS-3; j++){
  70. if(tomb[i][j] == tomb[i+1][j-1] && tomb[i][j] == tomb[i+2][j-2] && tomb[i][j] == tomb[i+3][j-3]) return 1;
  71. }
  72. }
  73. }
  74. */
  75. int main(){
  76. int i, j;
  77.  
  78. char table[COLS][ROWS];
  79.  
  80. feltolt(table);
  81. kiir(table);
  82.  
  83. //table[4][5] = 'X';
  84.  
  85. //bele1(table, 5);
  86. //kiir(table);
  87.  
  88. /*
  89. char tomb[10][5];
  90. for(i = 0; i < 5; i ++){
  91. for(j = 0; j < 10; j++){
  92. tomb[i][j] == 'X';
  93. }
  94. }
  95.  
  96. for(i=0; i<5; i++){
  97. for(j=0;j<10;j++)
  98. printf("%c ", tomb[i][j]);
  99. printf("\n");
  100. }
  101. */
  102. return 0;
  103. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement