fork(1) download
  1. import java.util.*;
  2. import java.lang.*;
  3. import java.io.*;
  4.  
  5.  
  6. final class Number {
  7. //1-ый способ решение задачи
  8. public static int swap_set1(int n) {
  9. byte arr[] = {0, 0, 0, 0, 0, 0, 0, 0, 0};
  10. int cnt = 0;
  11.  
  12. arr[cnt++] = 1;
  13. do {
  14. arr[cnt++] = (byte) (n % 10);
  15. } while ((n /= 10) != 0);
  16. arr[cnt] = 1;
  17.  
  18. byte tmp = arr[1];
  19. arr[1] = arr[cnt - 1];
  20. arr[cnt - 1] = tmp;
  21.  
  22. n = 0;
  23. for (int i = cnt; i >= 0; --i)
  24. n = n * 10 + (int) arr[i];
  25. return n;
  26. }
  27.  
  28. //2-ой способ решение задачи
  29. public static int swap_set2(int n) {
  30. int d = 1;
  31. for (int i = n / 10; i != 0; i /= 10)
  32. d *= 10;
  33.  
  34. int m = n % d / 10;
  35. int w = (d * 10) + (n % 10 * (d / 10) + m) * 10 + n / d;
  36. return w * 10 + 1;
  37. }
  38. }
  39.  
  40.  
  41.  
  42. class Project {
  43. public static void main (String[] args) {
  44. int n = 234;
  45. System.out.println(n);
  46. System.out.println(Number.swap_set1(n));
  47. System.out.println();
  48.  
  49. n = 5678;
  50. System.out.println(n);
  51. System.out.println(Number.swap_set2(n));
  52. }
  53. }
Success #stdin #stdout 0.09s 320320KB
stdin
Standard input is empty
stdout
234
14321

5678
186751