Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int take1=0;
- int take2=0;
- int tik=0;
- int tik1=0;
- int tik2=0;
- int change=0;
- int change1=0;
- public int Number1=0;
- public Matrix(int n) {
- Matrix = new int[n][n];
- Number=n;
- write();
- }
- public void write(){
- for (int i=0;i < Matrix.length;i++){
- for (int j=0;j < Matrix[i].length;j++){
- Matrix[i][j]=(int)(Math.random()*10);
- }
- }
- }
- public void Print() {
- for (int i = 0; i < Matrix.length; i++) {
- for (int j = 0; j < Matrix.length; j++) {
- System.out.print(Matrix[i][j] + " ");
- }
- System.out.println("");
- }
- }
- public void Actions(int m,int l,int c){
- int sum = Matrix[m+l-1][m+c-1];
- int first= Matrix[m+l-1][m+c-2];
- int g1=0;
- int g2=0;
- int set1=0;
- int set2=0;
- Number1++;
- int No=Matrix.length;
- int check = 0;
- int check1 = 0;
- System.out.println(sum);
- for (int i = 0+l; i<m+l; i++) {
- for (int j = 0+c; j <m+c; j++) {
- System.out.print(Matrix[i][j]+" ");
- if(m+l==No){
- set1=1;
- }
- if(m+c==No){
- set2=1;
- }
- if(i<=m+l-1 & set1!=1 & i>l){
- g1+=Matrix[i][j];
- set1=0;
- }
- if(i==m+l-1 & tik!=0 &change1!=take2 & check!=Number){
- sum+=Matrix[i][j];
- count++;
- }
- if(j<=m+c-1& set2!=1 & j>c){
- g2+=Matrix[i][j];
- set2=0;
- }
- if(j==m+c-1 & tik!=0 &change!=take1 & check!=Number){
- sum+=Matrix[i][j];
- count++;
- }
- if(tik==0 & check!=3 & j==0 & check1!=Number-1)
- {
- first+=Matrix[i][j];
- count++;
- }
- check++;
- check1++;
- }
- System.out.println("");
- }
- if(change!=take1){
- change++;
- }
- if(change1!=take2){
- change1++;
- }
- Array1.add(g1);
- Array2.add(g2);
- System.out.println("Sum= " + sum);
- if (tik==0){
- first+=Array2.get(Number1-1);
- count++;
- }
- if (tik1!=0){
- sum+=Array2.get(Number1-2);
- count++;
- }
- if(tik==0){
- System.out.println("Sum= " + first);
- System.out.println("");
- }
- if(tik!=0){
- System.out.println("Sum= " + sum);
- System.out.println("");
- }
- tik++;
- try{
- c+=1;
- int a = Matrix[0][c];
- int b = Matrix[0][m+c-1];
- tik1++;
- take1++;
- Actions(m, l, c);
- }
- catch(Exception e){
- try {
- l += 1;
- c = 0;
- int a = Matrix[0][l];
- int b = Matrix[0][m+l-1];
- take2++;
- tik2++;
- Actions(m, l, c);
- } catch (Exception u){
- }
- }
- }
- public int getCount() {
- return count;
- }
- public int getNumber() {
- return Number;
- }
- public int getTake1() {
- return take1;
- }
- public int getTake2() {
- return take2;
- }
Add Comment
Please, Sign In to add comment