Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public void solve(){
- int n = field.length;
- int h = (int)Math.pow(n,0.5);
- Cell [] tq = new Cell[n*n];
- int o = 0;
- for(int l = 0; l < h; l++){
- for(int j = 0; j < h; j++){
- for(int m = 0; m < h; m++){
- for(int p = 0; p < h; p++) {
- tq[o] = field[l * (h) + m][j * (h) + p];
- o++;
- }
- }
- }
- }
- o = 0;
- Cell [][] s = new Cell [n][n];
- for(int i = 0; i < n; i++){
- for(int j = 0; j < n; j++){
- s[i][j] = tq [o];
- o++;
- }
- }
- for(int i = 0; i < n; i++) {
- update(s[i]);
- update(field[i]);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement