BetinaUKTC

Mop1

Nov 15th, 2021
134
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.00 KB | None | 0 0
  1. public class Utilities1 {
  2. public static int retries(String num, String number) {
  3. String[] arr = num.split("");
  4. int sum = 0;
  5.  
  6. for (int i = 0; i < num.length(); i++) {
  7. if(arr[i].contains(number)){
  8. sum++;
  9. }
  10. }
  11. return sum;
  12. }
  13. public static String decToBin(int dec){
  14. String bin = "";
  15. int num = TheGreatestExtent(dec);
  16.  
  17. for (int i = 0; num > 1; i++) {
  18. if(dec >= num){
  19. bin += "1";
  20. dec -= num;
  21. }else{
  22. bin += "0";
  23. }
  24. num /= 2;
  25. }
  26.  
  27. if(dec%2 == 1){
  28. bin += "1";
  29. }else{
  30. bin += "0";
  31. }
  32. return bin;
  33. }
  34. public static int TheGreatestExtent(int dec){
  35. int num = 1;
  36.  
  37. while(num*2 <= dec){
  38. num *= 2;
  39. }
  40. return num;
  41. }
  42. public static String reverseCode(int num) {
  43. String str = decToBin(num);
  44. String sim = "";
  45.  
  46. if (num > 0) {
  47. sim = "0|";
  48. } else if (num < 0) {
  49. sim = "1|";
  50.  
  51. str = decToBin(num*-1);
  52. String[] arr = str.split("");
  53.  
  54. str = "";
  55. for (int i = 0; i < arr.length; i++) {
  56. if(arr[i].equals("1")){
  57. str+="0";
  58. }else{
  59. str+="1";
  60. }
  61. }
  62. }
  63. return sim + str;
  64. }
  65. public static String straightCode(int num) {
  66. String str = decToBin(num);
  67. String sim = "";
  68.  
  69. if (num > 0) {
  70. sim = "0|";
  71. } else if (num < 0) {
  72. str = decToBin(num*-1);
  73. sim = "1|";
  74. }
  75. return sim + str;
  76. }
  77. public static int zeros(String num, String number) {
  78. String[] arr = num.split("");
  79. int retries = 0;
  80.  
  81. for (int i = 0; i < num.length(); i++) {
  82. if(arr[i].contains(number)){
  83. retries++;
  84. }
  85. }
  86. return retries;
  87. }
  88. }
  89. //////////////////////////////////////////////////////////////////////////
  90. public class Add {
  91. public static void main(String[] args) {
  92. Scanner scanner = new Scanner(System.in);
  93.  
  94. String bin = scanner.nextLine();
  95. System.out.println(Utilities1.retries(bin,"1"));
  96. }
  97. }
  98. ///////////////////////////////////////////////////////////////////////////
  99. public class DecToBin {
  100. public static void main(String[] args) {
  101. Scanner scanner = new Scanner(System.in);
  102.  
  103. int dec = scanner.nextInt();
  104. System.out.println(Utilities1.decToBin(dec));
  105. }
  106. }
  107. //////////////////////////////////////////////////////////////////////////
  108.  
  109. public class ReverseCode {
  110. public static void main(String[] args) {
  111. Scanner scanner = new Scanner(System.in);
  112.  
  113. int num = scanner.nextInt();
  114. System.out.println(Utilities1.reverseCode(num));
  115. }
  116. }
  117. ////////////////////////////////////////////////////////////////////////
  118. public class StraightCode {
  119. public static void main(String[] args) {
  120. Scanner scanner = new Scanner(System.in);
  121.  
  122. int num = scanner.nextInt();
  123. System.out.println(Utilities1.straightCode(num));
  124. }
  125.  
  126. }
  127. /////////////////////////////////////////////////////////////////////////////
  128. public class StraightCode {
  129. public static void main(String[] args) {
  130. Scanner scanner = new Scanner(System.in);
  131.  
  132. int num = scanner.nextInt();
  133. System.out.println(Utilities1.straightCode(num));
  134. }
  135.  
  136. }
  137. ////////////////////////////////////////////////////////////////////////////////
  138. public class Zeros {
  139. public static void main(String[] args) {
  140. Scanner scanner = new Scanner(System.in);
  141.  
  142. String bin = scanner.nextLine();
  143. System.out.println(Utilities1.zeros(bin,"0"));
  144. }
  145. }
  146. ////////////////////////////////////////////////////////////////////////////////
  147.  
Advertisement
Add Comment
Please, Sign In to add comment