#22286 (Java21) No.192 合成数

• 問題: No.192 合成数
• ユーザー: threepipes_s
• 提出日時: 2015-04-26 22:08:09
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 45 ms / 2,000 ms
• コード長: 2,771 bytes
• コンパイル時間: 2,257 ms
• コンパイル使用メモリ: 74,896 KB
• 実行使用メモリ: 49,868 KB
• 最終ジャッジ日時: 2023-09-09 08:19:05
• 合計ジャッジ時間: 5,071 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	45 ms; 49,376 KB
testcase_01	AC	45 ms; 49,352 KB
testcase_02	AC	43 ms; 49,216 KB
testcase_03	AC	44 ms; 49,256 KB
testcase_04	AC	45 ms; 49,640 KB
testcase_05	AC	44 ms; 49,364 KB
testcase_06	AC	44 ms; 49,212 KB
testcase_07	AC	44 ms; 49,292 KB
testcase_08	AC	44 ms; 49,376 KB
testcase_09	AC	45 ms; 49,628 KB
testcase_10	AC	44 ms; 49,628 KB
testcase_11	AC	44 ms; 49,868 KB
testcase_12	AC	44 ms; 49,592 KB
testcase_13	AC	44 ms; 49,256 KB
testcase_14	AC	43 ms; 49,200 KB
testcase_15	AC	43 ms; 49,316 KB
testcase_16	AC	44 ms; 49,248 KB
testcase_17	AC	44 ms; 49,288 KB
testcase_18	AC	43 ms; 49,276 KB
testcase_19	AC	43 ms; 49,260 KB
testcase_20	AC	42 ms; 49,328 KB
testcase_21	AC	44 ms; 49,392 KB
testcase_22	AC	43 ms; 49,388 KB
testcase_23	AC	44 ms; 49,136 KB
testcase_24	AC	44 ms; 49,436 KB
testcase_25	AC	45 ms; 49,276 KB
testcase_26	AC	43 ms; 49,624 KB

ソースコード

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Comparator;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Queue;

public class Main {
	public static int[][] dist;
	public static int[][] distCp;
	public static int minId;
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		if(n%2==0){
			System.out.println(n);
		}else System.out.println(n+1);
	}
}

class Node implements Comparable<Node>{
	int id;
	HashSet<Node> edge = new HashSet<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
	
	@Override
	public int compareTo(Node o) {
		// TODO 自動生成されたメソッド・スタブ
		return Main.distCp[Main.minId][id]-Main.distCp[Main.minId][o.id];
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}

	public void print(String str) {
		out.print(str);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}