Advertisement
Guest User

Untitled

a guest
Nov 13th, 2018
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.26 KB | None | 0 0
  1. System.out.println(" ");
  2. System.out.println("zadanie 3 ");
  3. char tab[][] = {
  4. {'S', 'a', 'm', 's', 'u', 'n', 'g'},
  5. {'N', 'o', 'k', 'i', 'a'},
  6. {'A', 'p', 'p', 'l', 'e'},
  7. {'B', 'l', 'a', 'c', 'k', 'B', 'e', 'r', 'r', 'y'},
  8. {'A', 'l', 'c', 'a', 't', 'e', 'l'},
  9. {'S', 'o', 'n', 'y'},
  10. {'J', 'o', 'l', 'l', 'a'}
  11. };
  12. int[] tab33 = new int[tab.length];
  13. for (int i = 0; i < tab.length; i++) {
  14. boolean b = false;
  15. for (int j = 0; j < tab[i].length; j++) {
  16. for (int jk = j + 1; jk < tab[i].length; jk++) {
  17. if (tab[i][j] == tab[i][jk] || tab[i][j] - ('a' - 'A') == tab[i][jk] || tab[i][j] == tab[i][jk] - ('a' - 'A')) {
  18. b = true;
  19. }
  20. }
  21. }
  22. if (b) { tab33[i] += 1;
  23. }
  24. }
  25. for (int i = 0; i < tab.length; i++) {
  26. int wart = 0;
  27. for (int j = 0; j < tab[i].length; j++) {
  28. wart = wart + tab[i][j];
  29. }
  30. if (wart > 255) {
  31. tab33[i] = tab33[i] + 1;
  32. }
  33. }
  34. for (int i = 0; i < tab.length; i++) {
  35. boolean z = false;
  36. for (int j = 0; j < tab[i].length; j++) {
  37. if (tab[i][j] == 'i' && z == false) {
  38. tab33[i] = tab33[i] + 1;
  39. z = true;
  40. }
  41. }
  42. }
  43. for (int i = 0; i < tab.length; i++) {
  44. boolean b = false;
  45. for (int j = 0; j < tab[i].length; j++) {
  46. for (int jk = j + 1; jk < tab[i].length; jk++) {
  47. if (tab[i][j] == tab[i][jk]) {
  48.  
  49. b = true;
  50. }
  51. }
  52. }
  53. if (b) {
  54. tab33[i] = tab33[i] + 1;
  55. }
  56. }
  57. for (int i = 0; i < tab33.length; i++) {
  58. if (tab33[i] >= 3) {
  59. for (int j = 0; j < tab[i].length; j++) {
  60. System.out.print(tab[i][j] + "\t");
  61. }
  62. System.out.println("");
  63. }
  64.  
  65. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement