ChaseKeskinyan

2D UPDATED

Feb 13th, 2020
553
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.08 KB | None | 0 0
  1. /**
  2. Chase Keskinyan
  3. AP COMPSCI A
  4. Mr Goldman
  5. 2D Array
  6. */
  7. public class TwoDArray
  8. {
  9. public static void main(String [] args)
  10. {
  11. int[][] multTable = new int[11][11];
  12.  
  13. for(int c = 1; c < multTable[0].length; c++)
  14. {
  15. multTable[0][c] = c - 1;
  16. }
  17.  
  18. for(int r = 1 ; r < multTable.length; r++)
  19. {
  20. multTable[r][0] = r - 1;
  21. }
  22.  
  23. for(int r = 2; r < multTable.length; r++)
  24. {
  25. for(int c = 2; c < multTable[0].length; c++)
  26. {
  27. multTable[r][c] = multTable[0][c] * multTable[r][0];
  28. }
  29. }
  30.  
  31. for(int r = 0; r < multTable.length; r++)
  32. {
  33. for(int c = 0; c < multTable[0].length; c++)
  34. {
  35. if(r != 0 || c != 0)
  36. {
  37. System.out.print(multTable[r][c] + "\t");
  38. }
  39. else
  40. System.out.print("\t");
  41. }
  42. System.out.println();
  43. System.out.println();
  44. }
  45.  
  46. int[][] pascalTriangle = new int[7][13];
  47.  
  48. for(int r = 0; r < pascalTriangle.length; r++)
  49. {
  50. pascalTriangle[r][6 + r] = 1;
  51. pascalTriangle[r][6 - r] = 1;
  52. }
  53.  
  54. for(int r = 1; r < pascalTriangle.length; r++)
  55. {
  56. for(int c = 1; c < pascalTriangle[0].length - 1; c++)
  57. {
  58. pascalTriangle[r][c] = pascalTriangle[r-1][c+1] + pascalTriangle[r-1][c-1];
  59. }
  60. }
  61.  
  62. for(int r = 0; r < pascalTriangle.length; r++)
  63. {
  64. for(int col = 0; col < pascalTriangle[0].length; col++)
  65. {
  66. if(pascalTriangle[r][col] == 0)
  67. {
  68. System.out.print("\t");
  69. }
  70. else
  71. {
  72. System.out.print(pascalTriangle[r][col] + "\t");
  73. }
  74. }
  75. System.out.println();
  76. }
  77.  
  78. System.out.println();
  79.  
  80. int[][] attempt = new int[2][3];
  81.  
  82. for(int r = 0; r < attempt.length; r++)
  83. {
  84. for(int c = 0; c < attempt[0].length; r++)
  85. {
  86. attempt[r][c] = (int)(Math.random() * 10);
  87. System.out.println(attempt[r][c]);
  88. }
  89. }
  90.  
  91. magnifyTable(attempt, 3);
  92.  
  93. for(int r = 0; r < attempt.length; r++)
  94. {
  95. for(int c = 0; c < attempt[0].length; r++)
  96. {
  97. asdasd;
  98. }
  99. }
  100.  
  101.  
  102. }
  103.  
  104. public static int[][] magnifyTable(int[][] table, int f)
  105. {
  106. int[][] newTable = new int[table.length * f][table[0].length * f];
  107.  
  108. for(int r = 0; r < newTable.length; r++)
  109. {
  110. for(int c = 0; c < newTable[0].length; c++)
  111. {
  112. newTable[r][c] = table[r/f][c/f];
  113. }
  114. }
  115.  
  116. return newTable;
  117. }
  118. }
Advertisement
Add Comment
Please, Sign In to add comment