penis burka

SUBMITTED BY: Guest

DATE: Nov. 8, 2014, 12:32 p.m.

FORMAT: Text only

SIZE: 1.6 kB

Raw Download

HITS: 760

Report
  1. public class Path
  2. {
  3. public Path()
  4. {
  6. }
  8. public rout(int matrix[][])
  9. {
  11. }
  12. public int[][] putInto(int mat[][])
  13. {
  14. int [][]retmat=new int[mat[0].length][mat[0].length];
  15. for(int i=10;i<mat[0].length;i++)
  16. {
  17. for(int j=0;j<mat[0].length;j++)
  18. {
  19. retmat[i][j]=mat[i][j];
  20. }
  21. }
  22. return retmat;
  23. }
  26. public int[][] multiply(int matrix1[][],int matrix2[][])
  27. {
  28. int finmat[][]=new int[matrix1.length][matrix1[0].length];
  29. int result;
  30. for(int i=0;i<finmat.length;i++)
  31. {
  32. for(int j=0;j<finmat[0].length;j++)
  33. {
  34. finmat[i][j]=getmul(matrix1,matrix2,i,j);
  35. }
  36. }
  37. return finmat;
  38. }
  40. public int[][] add(int matrix1[][],int matrix2[][])
  41. {
  42. int finmat[][]=new int[matrix1.length][matrix1[0].length];
  43. int result;
  44. for(int i=0;i<finmat.length;i++)
  45. {
  46. for(int j=0;j<finmat[0].length;j++)
  47. {
  48. if(matrix1[i][j]==1||matrix2[i][j]==1)
  49. {
  50. finmat[i][j]=1;
  51. }
  52. else
  53. {
  54. finmat[i][j]=0;
  55. }
  56. }
  57. }
  58. return finmat;
  59. }
  62. public int getadd(int mat1[][],int mat2[][],int i, int j)
  63. {
  64. int res=0;
  65. for(int k=0;k<mat2.length;k++)
  66. {
  67. if(mat1[i][k]==1&&mat2[k][j]==1)
  68. {
  69. res=1;
  70. }
  71. }
  72. return res;
  73. }
  75. public int getmul(int mat1[][],int mat2[][],int i, int j)
  76. {
  77. int res=0;
  78. for(int k=0;k<mat2.length;k++)
  79. {
  80. if(mat1[i][k]==1&&mat2[k][j]==1)
  81. {
  82. res=1;
  83. }
  84. }
  85. return res;
  86. }
  87. }
comments powered by Disqus