Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package com.Shan;
- public class Main {
- int maxX = 30
- int maxY = 30
- public static void main(String[] args) {
- int tab[][] = new int[maxX][maxY];
- for(int i = 0; i < tab.length; i++){
- for(int j = 0; j < tab.length; j++){
- tab[i][j] = 0;
- }
- }
- tab[0][15] = 1;
- // tab[0][11] = 1;
- // tab[0][16] = 1;
- for(int i = 1; i < tab.length-1; i++){
- for(int j = 1; j < tab.length-1; j++){
- int lewy = tab[i-1][sprawdz(j-1)]
- int srodkowy = tab[i-1][j]
- int prawy = tab[i-1][sprawdz(j+1)]
- //tutaj na dole zamiast j-1 daj lewy j to srodkowy j+1 to prawy czyli if (prawy == 1) && srodkowy == 1...
- if(tab[i-1][j-1]==1 && tab[i-1][j]==1 && tab[i-1][j+1]==1)
- tab[i][j] = 0;
- if(tab[i-1][j-1]==1 && tab[i-1][j]==1 && tab[i-1][j+1]==0)
- tab[i][j] = 1;
- if(tab[i-1][j-1]==0 && tab[i-1][j]==0 && tab[i-1][j+1]==1)
- tab[i][j] = 0;
- if(tab[i-1][j-1]==1 && tab[i-1][j]==0 && tab[i-1][j+1]==0)
- tab[i][j] = 1;
- if(tab[i-1][j-1]==0 && tab[i-1][j]==1 && tab[i-1][j+1]==1)
- tab[i][j] = 1;
- if(tab[i-1][j-1]==0 && tab[i-1][j]==1 && tab[i-1][j+1]==0)
- tab[i][j] = 0;
- if(tab[i-1][j-1]==0 && tab[i-1][j]==0 && tab[i-1][j+1]==1)
- tab[i][j] = 1;
- if(tab[i-1][j-1]==0 && tab[i-1][j]==0 && tab[i-1][j+1]==0)
- tab[i][j] = 0;
- }
- }
- for(int i = 0; i < tab.length; i++){
- for(int j = 0; j < tab.length; j++){
- System.out.print(tab[i][j] + " ");
- }
- System.out.println();
- }
- }
- private int sprawdzW(int w){
- if k < 0 return kMax-1
- if k >= kMax return 0
- Return k
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement