JavaExamples/SomeTasks (1).java at master · nathanforester/JavaExamples · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
 public class SomeTasks {
 public static void main(final String[] args) {
   final int length = args.length;
   final int STUDENT_NUMBER = 590850;
     if (length == 0) {
       System.out.println(STUDENT_NUMBER);
       return;
	 }
     if (length == 1) {
	   final int N = Integer.parseInt(args[0]);
       long sum = 0;
         for (long i = 1; i <= N; i++) {
           long old_sum = i * (long) i;
	       sum = old_sum + sum;
             if (sum < old_sum) {
              System.err.println("Overflow at i = " + (i -1));
			 System.exit(1);
		     }
	     }
		 {
		 System.out.println(sum);
	     }
         return;
	 }
	 if (length == 2) {
	   final long x = Long.parseLong(args[0]);
       final long y = Long.parseLong(args[1]);
	     if (y > 0){
		   System.out.println(x/y);
		 }
	     else if (x > 0){
	       System.out.println(y/x);
		 }
	    else if (x <= 0 || y <= 0) {
	      System.out.println((-x) + (-y));
	     }
	     return;
	 }
     if (length == 3) {
	   final int a = Integer.parseInt(args[0]);
       final int b = Integer.parseInt(args[1]);
       final boolean c = Boolean.parseBoolean(args[2]);
         for (int i = a; i < b; i++) {
	       System.out.print(i+" ");
         }
         if (c == true) {
           System.out.println(b+ " " + b);
	     }
         else if (c == false) {
           System.out.println(b);
         }
         return;
	 }
	 if (length == 4) {
       final int N = args.length;
       final String[] a  = new String[N];
       final int[] Len = new int [100];
	     for (int i = 0; i < N; i++) {
           a[i] = args[i];
		   Len[i] = a[i].length();
	     }
	     int min_length = Len[0];
           for (int i = 1; i < N; i++) {
		     if (Len[i] < min_length) min_length = Len[i];
	       }
		   for (int i = 0; i < N; i++) {
		     if (a[i].length() == min_length)
		       System.out.println("\"" + a[i] + "\"");
	       }
		   return;
	 }
	 if (length >= 5){
       final int N = args.length;
       final int[] a = new int [N];
       boolean b = true;
         for (int i = 0; i < N; i++) {
           a[i] = Integer.parseInt(args[i]); }
             int t = 0;
               for (int i = 0; i < N; i++) {
	             for (int j = i; j < N-1; j++) {
	               if (a[j+1]<a[i]) {
		             t = a[j+1];
		             a[j+1] = a[i];
		             a[i] = t;
	               }
	             }
	           }
               for (int i = 0; i < N-1; i++) {
                 if ((a[i+1] - a[i]) != 1) {
	               b = false;
 	             }
               }
	           System.out.println(b);
               return;
			   }
  }
}