Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define COLS 7
- #define ROWS 6
- void feltolt(char feltolt[COLS][ROWS]){
- int i, j, szam = 65;
- for(i = 0; i < ROWS; i++){
- for(j = 0; j < COLS; j++){
- feltolt[i][j] = szam++;
- }
- }
- }
- void kiir(char kiirat[COLS][ROWS]){
- int i, j;
- for(i = 0; i < ROWS; i++){
- for(j = 0; j < COLS; j++)
- printf("%c ", kiirat[i][j]);
- printf("\n");
- }
- printf("*************\n");
- printf("*************\n");
- }
- void bele1(char tomb[COLS][ROWS], int place){
- int i;
- for(i = COLS-1; i >= 0; i--){
- if(tomb[i][place-1] == '-'){
- tomb[i][place-1] = 'X';
- break;
- }
- }
- }
- void bele2(char tomb[COLS][ROWS], int place){
- int i;
- for(i = COLS-1; i >= 0; i--){
- if(tomb[i][place-1] == '-'){
- tomb[i][place-1] = 'O';
- break;
- }
- }
- }
- /*
- int checkforwin(char tomb[COLS][ROWS]){
- int i, j;
- for(i = 0; i < COLS-3; i++){ // SORBAN
- for(j = 0; i < ROWS-3; j++){
- if(tomb[i][j] == tomb[i+1][j] && tomb[i][j] == tomb[i+2][j] && tomb[i][j] == tomb[i+3][j]) return 1;
- }
- }
- for(i = 0; i < COLS-3; i++){ // OSZLOPBAN
- for(j = 0; i < ROWS-3; j++){
- if(tomb[i][j] == tomb[i][j+1] && tomb[i][j] == tomb[i][j+2] && tomb[i][j] == tomb[i][j+3]) return 1;
- }
- }
- for(i = 0; i < COLS-3; i++){ // ATLOBAN FELFELE
- for(j = 0; i < ROWS-3; j++){
- 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;
- }
- }
- for(i = COLS-3; i >= 0; i--){ // ATLOBAN LEFELE
- for(j = 0; i < ROWS-3; j++){
- 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;
- }
- }
- }
- */
- int main(){
- int i, j;
- char table[COLS][ROWS];
- feltolt(table);
- kiir(table);
- //table[4][5] = 'X';
- //bele1(table, 5);
- //kiir(table);
- /*
- char tomb[10][5];
- for(i = 0; i < 5; i ++){
- for(j = 0; j < 10; j++){
- tomb[i][j] == 'X';
- }
- }
- for(i=0; i<5; i++){
- for(j=0;j<10;j++)
- printf("%c ", tomb[i][j]);
- printf("\n");
- }
- */
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement