Submission #615734


Source Code Expand

import java.io.*;
import java.util.*;
 
public class Main{
	public void solve(){
		int N = nextInt();
		out.println(N / 25);
		
	}

	private static PrintWriter out;
	public static void main(String[] args){
		out = new PrintWriter(System.out);
		new Main().solve();
		out.flush();
	}
	
	
	
	public static int nextInt(){
		int num = 0;
		String str = next();
		boolean minus = false;
		int i = 0;
		if(str.charAt(0) == '-'){
			minus = true;
			i++;
		}
		int len = str.length();
		for(;i < len; i++){
			char c = str.charAt(i);
			if(!('0' <= c && c <= '9')) throw new RuntimeException();
			num = num * 10 + (c - '0');
		}
		return minus ? -num : num;
	}
	
	public static long nextLong(){
		long num = 0;
		String str = next();
		boolean minus = false;
		int i = 0;
		if(str.charAt(0) == '-'){
			minus = true;
			i++;
		}
		int len = str.length();
		for(;i < len; i++){
			char c = str.charAt(i);
			if(!('0' <= c && c <= '9')) throw new RuntimeException();
			num = num * 10l + (c - '0');
		}
		return minus ? -num : num;
	}
	public static String next(){
		int c;
		while(!isAlNum(c = read())){}
		StringBuilder build = new StringBuilder();
		build.append((char)c);
		while(isAlNum(c = read())){
			build.append((char)c);
		}
		return build.toString();
	}
	
	
	private static byte[] inputBuffer = new byte[1024];
	private static int bufferLength = 0;
	private static int bufferIndex = 0;
	private static int read(){
		if(bufferLength < 0) throw new RuntimeException();
		if(bufferIndex >= bufferLength){
			try{
				bufferLength = System.in.read(inputBuffer);
				bufferIndex = 0;
			}catch(IOException e){
				throw new RuntimeException(e);
			}
			if(bufferLength <= 0) return (bufferLength = -1);
		}
		return inputBuffer[bufferIndex++];
	}
	
	private static boolean isAlNum(int c){
		return '!' <= c && c <= '~';
	}
}

Submission Info

Submission Time
Task A - ニコニコ数
User a3636tako
Language Java (OpenJDK 1.7.0)
Score 60
Code Size 1909 Byte
Status AC
Exec Time 339 ms
Memory 22540 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 60 / 60
Status
AC × 2
AC × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 310 ms 22540 KB
sample_02.txt AC 301 ms 22424 KB
test_01.txt AC 312 ms 22444 KB
test_02.txt AC 307 ms 22412 KB
test_03.txt AC 332 ms 22436 KB
test_04.txt AC 316 ms 22412 KB
test_05.txt AC 330 ms 22324 KB
test_06.txt AC 334 ms 22496 KB
test_07.txt AC 339 ms 22396 KB
test_08.txt AC 327 ms 22384 KB
test_09.txt AC 313 ms 22412 KB
test_10.txt AC 307 ms 22440 KB
test_11.txt AC 312 ms 22352 KB
test_12.txt AC 309 ms 22412 KB
test_13.txt AC 303 ms 22436 KB
test_14.txt AC 332 ms 22412 KB
test_15.txt AC 332 ms 22404 KB