Guest User

Untitled

a guest
Jan 19th, 2019
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.97 KB | None | 0 0
  1. int take1=0;
  2. int take2=0;
  3. int tik=0;
  4. int tik1=0;
  5. int tik2=0;
  6. int change=0;
  7. int change1=0;
  8. public int Number1=0;
  9.  
  10. public Matrix(int n) {
  11. Matrix = new int[n][n];
  12. Number=n;
  13. write();
  14. }
  15.  
  16. public void write(){
  17. for (int i=0;i < Matrix.length;i++){
  18. for (int j=0;j < Matrix[i].length;j++){
  19. Matrix[i][j]=(int)(Math.random()*10);
  20. }
  21. }
  22. }
  23.  
  24. public void Print() {
  25. for (int i = 0; i < Matrix.length; i++) {
  26. for (int j = 0; j < Matrix.length; j++) {
  27. System.out.print(Matrix[i][j] + " ");
  28. }
  29. System.out.println("");
  30. }
  31. }
  32.  
  33. public void Actions(int m,int l,int c){
  34. int sum = Matrix[m+l-1][m+c-1];
  35. int first= Matrix[m+l-1][m+c-2];
  36. int g1=0;
  37. int g2=0;
  38. int set1=0;
  39. int set2=0;
  40. Number1++;
  41. int No=Matrix.length;
  42. int check = 0;
  43. int check1 = 0;
  44. System.out.println(sum);
  45. for (int i = 0+l; i<m+l; i++) {
  46. for (int j = 0+c; j <m+c; j++) {
  47. System.out.print(Matrix[i][j]+" ");
  48.  
  49. if(m+l==No){
  50. set1=1;
  51. }
  52. if(m+c==No){
  53. set2=1;
  54. }
  55.  
  56. if(i<=m+l-1 & set1!=1 & i>l){
  57. g1+=Matrix[i][j];
  58. set1=0;
  59. }
  60.  
  61. if(i==m+l-1 & tik!=0 &change1!=take2 & check!=Number){
  62.  
  63. sum+=Matrix[i][j];
  64. count++;
  65.  
  66. }
  67. if(j<=m+c-1& set2!=1 & j>c){
  68. g2+=Matrix[i][j];
  69. set2=0;
  70. }
  71.  
  72. if(j==m+c-1 & tik!=0 &change!=take1 & check!=Number){
  73.  
  74. sum+=Matrix[i][j];
  75. count++;
  76.  
  77.  
  78. }
  79. if(tik==0 & check!=3 & j==0 & check1!=Number-1)
  80. {
  81. first+=Matrix[i][j];
  82. count++;
  83. }
  84.  
  85. check++;
  86. check1++;
  87.  
  88. }
  89.  
  90. System.out.println("");
  91. }
  92. if(change!=take1){
  93. change++;
  94. }
  95. if(change1!=take2){
  96. change1++;
  97. }
  98. Array1.add(g1);
  99. Array2.add(g2);
  100.  
  101. System.out.println("Sum= " + sum);
  102. if (tik==0){
  103. first+=Array2.get(Number1-1);
  104. count++;
  105. }
  106. if (tik1!=0){
  107. sum+=Array2.get(Number1-2);
  108. count++;
  109.  
  110.  
  111. }
  112.  
  113. if(tik==0){
  114. System.out.println("Sum= " + first);
  115. System.out.println("");
  116. }
  117. if(tik!=0){
  118. System.out.println("Sum= " + sum);
  119. System.out.println("");
  120. }
  121. tik++;
  122. try{
  123. c+=1;
  124. int a = Matrix[0][c];
  125. int b = Matrix[0][m+c-1];
  126. tik1++;
  127. take1++;
  128. Actions(m, l, c);
  129. }
  130.  
  131. catch(Exception e){
  132. try {
  133. l += 1;
  134. c = 0;
  135. int a = Matrix[0][l];
  136. int b = Matrix[0][m+l-1];
  137. take2++;
  138. tik2++;
  139. Actions(m, l, c);
  140. } catch (Exception u){
  141.  
  142. }
  143. }
  144. }
  145.  
  146. public int getCount() {
  147. return count;
  148. }
  149. public int getNumber() {
  150. return Number;
  151. }
  152. public int getTake1() {
  153. return take1;
  154. }
  155. public int getTake2() {
  156. return take2;
  157. }
Add Comment
Please, Sign In to add comment