結果

問題 No.207 世界のなんとか
ユーザー threepipes_sthreepipes_s
提出日時 2015-05-15 23:45:03
言語 Java19
(openjdk 21)
結果
AC  
実行時間 44 ms / 5,000 ms
コード長 2,751 bytes
コンパイル時間 2,754 ms
コンパイル使用メモリ 75,224 KB
実行使用メモリ 33,892 KB
最終ジャッジ日時 2023-07-30 14:59:28
合計ジャッジ時間 4,737 ms
ジャッジサーバーID
(参考情報)
judge11 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
33,532 KB
testcase_01 AC 40 ms
33,456 KB
testcase_02 AC 44 ms
33,572 KB
testcase_03 AC 40 ms
33,360 KB
testcase_04 AC 40 ms
33,464 KB
testcase_05 AC 41 ms
33,676 KB
testcase_06 AC 39 ms
33,456 KB
testcase_07 AC 39 ms
33,812 KB
testcase_08 AC 40 ms
33,500 KB
testcase_09 AC 41 ms
33,780 KB
testcase_10 AC 42 ms
33,712 KB
testcase_11 AC 40 ms
33,516 KB
testcase_12 AC 42 ms
33,544 KB
testcase_13 AC 42 ms
33,840 KB
testcase_14 AC 42 ms
33,892 KB
testcase_15 AC 40 ms
33,452 KB
testcase_16 AC 38 ms
33,440 KB
testcase_17 AC 40 ms
33,440 KB
testcase_18 AC 39 ms
33,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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.ArrayList;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		long a = in.nextLong();
		long b = in.nextLong();
		for(; a <= b; a++){
			long tmp = a;
			boolean flag = a%3==0;
			while(tmp > 0){
				if(tmp%10==3){
					flag = true;
					break;
				}
				tmp /= 10;
			}
			if(flag) System.out.println(a);
		}
	}
	
}

class Node{
	int id;
	HashSet<Node> edge = new HashSet<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

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 println(Object obj) {
		out.println(obj);
	}

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

	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());
	}
}
0