Skip to content

Commit febd051

Browse files
naveenverma1naveenverma1
committed
AtCoder Beginner Contest 214>
1 parent 6c2111f commit febd051

File tree

2 files changed

+668
-0
lines changed

2 files changed

+668
-0
lines changed

‎AtCoder Beginner Contest 214/a.java

Lines changed: 337 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,337 @@
1+
import java.text.DecimalFormat;
2+
import java.util.stream.LongStream;
3+
import java.util.stream.IntStream;
4+
import java.io.*;
5+
import java.util.*;
6+
7+
public class Main {
8+
9+
public static void main(String[] args) {
10+
FastScanner sc = new FastScanner();
11+
PrintWriter out = new PrintWriter(System.out);
12+
// int t = sc.nextInt();
13+
// while(t-->0){
14+
Naveen problem = new Naveen(sc);
15+
problem.solve(out);
16+
// }
17+
out.flush();
18+
}
19+
20+
}
21+
22+
class Naveen {
23+
24+
int n;
25+
//int[] arr;
26+
27+
28+
Naveen(FastScanner sc) {
29+
30+
n = sc.nextInt();
31+
// arr = sc.arrayInt(n);
32+
}
33+
34+
void solve(PrintWriter out) {
35+
36+
37+
38+
if(n>=1 && n<=125)
39+
{
40+
System.out.println("4");
41+
}
42+
else if(n>=126 && n<=211)
43+
{
44+
System.out.println("6");
45+
}
46+
else
47+
{
48+
System.out.println("8");
49+
}
50+
51+
52+
53+
54+
}
55+
56+
57+
}
58+
59+
class FastScanner {
60+
61+
private final InputStream in = System.in;
62+
private final byte[] buffer = new byte[1024];
63+
private int ptr = 0;
64+
private int buflen = 0;
65+
66+
private boolean hasNextByte() {
67+
if (ptr < buflen) {
68+
return true;
69+
} else {
70+
ptr = 0;
71+
try {
72+
buflen = in.read(buffer);
73+
} catch (IOException e) {
74+
e.printStackTrace();
75+
}
76+
if (buflen <= 0) {
77+
return false;
78+
}
79+
}
80+
return true;
81+
}
82+
83+
private int readByte() {
84+
if (hasNextByte()) {
85+
return buffer[ptr++];
86+
} else {
87+
return -1;
88+
}
89+
}
90+
91+
private static boolean isPrintableChar(int c) {
92+
return 33 <= c && c <= 126;
93+
}
94+
95+
public boolean hasNext() {
96+
while (hasNextByte() && !isPrintableChar(buffer[ptr])) {
97+
ptr++;
98+
}
99+
return hasNextByte();
100+
}
101+
102+
public String next() {
103+
if (!hasNext()) {
104+
throw new NoSuchElementException();
105+
}
106+
StringBuilder sb = new StringBuilder();
107+
int b = readByte();
108+
while (isPrintableChar(b)) {
109+
sb.appendCodePoint(b);
110+
b = readByte();
111+
}
112+
return sb.toString();
113+
}
114+
115+
public long nextLong() {
116+
if (!hasNext()) {
117+
throw new NoSuchElementException();
118+
}
119+
long n = 0;
120+
boolean minus = false;
121+
int b = readByte();
122+
if (b == '-') {
123+
minus = true;
124+
b = readByte();
125+
}
126+
if (b < '0' || '9' < b) {
127+
throw new NumberFormatException();
128+
}
129+
while (true) {
130+
if ('0' <= b && b <= '9') {
131+
n *= 10;
132+
n += b - '0';
133+
} else if (b == -1 || !isPrintableChar(b)) {
134+
return minus ? -n : n;
135+
} else {
136+
throw new NumberFormatException();
137+
}
138+
b = readByte();
139+
}
140+
}
141+
142+
public int nextInt() {
143+
long nl = nextLong();
144+
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
145+
throw new NumberFormatException();
146+
}
147+
return (int) nl;
148+
}
149+
150+
public double nextDouble() {
151+
return Double.parseDouble(next());
152+
}
153+
154+
public int[] arrayInt(int N) {
155+
int[] array = new int[N];
156+
for (int i = 0; i < N; i++) {
157+
array[i] = nextInt();
158+
}
159+
return array;
160+
}
161+
162+
public long[] arrayLong(int N) {
163+
long[] array = new long[N];
164+
for (int i = 0; i < N; i++) {
165+
array[i] = nextLong();
166+
}
167+
return array;
168+
}
169+
170+
public double[] arrayDouble(int N) {
171+
double[] array = new double[N];
172+
for (int i = 0; i < N; i++) {
173+
array[i] = nextDouble();
174+
}
175+
return array;
176+
}
177+
178+
public String[] arrayString(int N) {
179+
String[] array = new String[N];
180+
for (int i = 0; i < N; i++) {
181+
array[i] = next();
182+
}
183+
return array;
184+
}
185+
186+
public int randomInt() {
187+
Random r = new Random();
188+
int value = r.nextInt((int) 1e6);
189+
System.out.println(value);
190+
return value;
191+
}
192+
193+
public int[] randomInt(int N) {
194+
int[] array = new int[N];
195+
Random r = new Random();
196+
for (int i = 0; i < N; i++) {
197+
array[i] = r.nextInt((int) 1e6);
198+
}
199+
System.out.println(Arrays.toString(array));
200+
return array;
201+
}
202+
203+
}
204+
205+
class My {
206+
207+
public static long lower(long arr[],long key){
208+
int low = 0;
209+
int high = arr.length-1;
210+
while(low < high){
211+
int mid = low + (high - low)/2;
212+
if(arr[mid] >= key){
213+
high = mid;
214+
}
215+
else{
216+
low = mid+1;
217+
}
218+
}
219+
return low;
220+
}
221+
public static int upper(int arr[],int key){
222+
int low = 0;
223+
int high = arr.length-1;
224+
while(low < high){
225+
int mid = low + (high - low+1)/2;
226+
if(arr[mid] <= key){
227+
low = mid;
228+
}
229+
else{
230+
high = mid-1;
231+
}
232+
}
233+
return low;
234+
}
235+
static void ans(boolean b) {
236+
System.out.println(b ? "Yes" : "No");
237+
}
238+
239+
static void ANS(boolean b) {
240+
System.out.println(b ? "YES" : "NO");
241+
}
242+
243+
static String sort(String s) {
244+
char[] ch = s.toCharArray();
245+
Arrays.sort(ch);
246+
return String.valueOf(ch);
247+
}
248+
249+
static String reverse(String s) {
250+
return new StringBuilder(s).reverse().toString();
251+
}
252+
253+
static int[] reverse(int[] array) {
254+
for (int i = 0; i < array.length / 2; i++) {
255+
int temp = array[i];
256+
array[i] = array[array.length - 1 - i];
257+
array[array.length - 1 - i] = temp;
258+
}
259+
return array;
260+
}
261+
262+
static long[] reverse(long[] array) {
263+
for (int i = 0; i < array.length / 2; i++) {
264+
long temp = array[i];
265+
array[i] = array[array.length - 1 - i];
266+
array[array.length - 1 - i] = temp;
267+
}
268+
return array;
269+
}
270+
271+
static double[] reverse(double[] array) {
272+
for (int i = 0; i < array.length / 2; i++) {
273+
double temp = array[i];
274+
array[i] = array[array.length - 1 - i];
275+
array[array.length - 1 - i] = temp;
276+
}
277+
return array;
278+
}
279+
280+
static String[] reverse(String[] array) {
281+
for (int i = 0; i < array.length / 2; i++) {
282+
String temp = array[i];
283+
array[i] = array[array.length - 1 - i];
284+
array[array.length - 1 - i] = temp;
285+
}
286+
return array;
287+
}
288+
289+
static char[] reverse(char[] array) {
290+
for (int i = 0; i < array.length / 2; i++) {
291+
char temp = array[i];
292+
array[i] = array[array.length - 1 - i];
293+
array[array.length - 1 - i] = temp;
294+
}
295+
return array;
296+
}
297+
298+
static long min(long... numbers) {
299+
Arrays.sort(numbers);
300+
return numbers[0];
301+
}
302+
303+
static int min(int... numbers) {
304+
Arrays.sort(numbers);
305+
return numbers[0];
306+
}
307+
308+
static double min(double... numbers) {
309+
Arrays.sort(numbers);
310+
return numbers[0];
311+
}
312+
313+
static long max(long... numbers) {
314+
Arrays.sort(numbers);
315+
return numbers[numbers.length - 1];
316+
}
317+
318+
static int max(int... numbers) {
319+
Arrays.sort(numbers);
320+
return numbers[numbers.length - 1];
321+
}
322+
323+
static double max(double... numbers) {
324+
Arrays.sort(numbers);
325+
return numbers[numbers.length - 1];
326+
}
327+
328+
static int sum(long number) {
329+
int sum = 0;
330+
while (number > 0) {
331+
sum += number % 10;
332+
number /= 10;
333+
}
334+
return sum;
335+
}
336+
337+
}

0 commit comments

Comments
 (0)