Submission #1689647


Source Code Expand

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		final Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		if(64 <= N) {
			System.out.println(64);
		} else if(32 <= N) {
			System.out.println(32);
		} else if(16 <= N) {
			System.out.println(16);
		} else if(8 <= N) {
			System.out.println(8);
		} else if(4 <= N) {
			System.out.println(4);
		} else if(2 <= N) {
			System.out.println(2);
		} else {
			System.out.println(1);
		}
	}
}

Submission Info

Submission Time
Task B - Break Number
User naoppy
Language Java8 (OpenJDK 1.8.0)
Score 200
Code Size 512 Byte
Status AC
Exec Time 102 ms
Memory 23252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 17
Set Name Test Cases
Sample example0, example1, example2, example3
All example0, example1, example2, example3, handmade0, handmade1, handmade2, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9
Case Name Status Exec Time Memory
example0 AC 93 ms 21716 KB
example1 AC 96 ms 21588 KB
example2 AC 94 ms 20820 KB
example3 AC 95 ms 20820 KB
handmade0 AC 97 ms 22868 KB
handmade1 AC 94 ms 20180 KB
handmade2 AC 94 ms 21844 KB
rand0 AC 91 ms 20692 KB
rand1 AC 92 ms 19924 KB
rand2 AC 92 ms 21844 KB
rand3 AC 92 ms 18644 KB
rand4 AC 92 ms 18644 KB
rand5 AC 94 ms 18900 KB
rand6 AC 94 ms 16980 KB
rand7 AC 102 ms 23252 KB
rand8 AC 92 ms 21844 KB
rand9 AC 93 ms 19796 KB