• Home
  • About
    • Ryureka Moment photo

      Ryureka

      Sin Prisa, Sin Pausa

    • About Me
    • Facebook
    • Github
    • Youtube
  • Projects
  • Posts
    • Posts
    • ProblemSolvings
    • Tags
    • Blog
    • Examples
  • ProblemSolving
    • ProblemSolving
    • BOJ
    • Programmers
    • SWEA
    • LeetCode
  • FrontEnd
    • FrontEnd
    • HTML
  • BackEnd
    • BackEnd
    • Server
      • Server
      • Spring
      • NodeJS
    • DataBase
      • DataBase
      • MySQL
      • MongoDB
  • Programming
    • Programming
    • Java
    • JS
    • Python
    • CleanCode
  • ComputerScience
    • DataStructure
    • Algorithm

[BOJ] 4673. 셀프 넘버

15 Apr 2026

Reading time ~1 minute

  • 풀이

풀이

import java.util.Scanner;

public class Main {
	static Scanner sc=new Scanner(System.in);
 	public static void main(String[] args) {
		boolean check[]=new boolean[10001];
		
		for (int i = 1; i < check.length; i++) {				
			int result=d(i);
			if(result<=10000)
				check[result]=true;
		}

		for (int i = 1; i < check.length; i++) {
			if(!check[i])
				System.out.println(i);
		}
	}
 	
 	public static int d(int n) {
 		int init=n;
 		int sum=0;
 		while(true) {
 			sum+=n%10;
 			if((n/=10)==0) {
 				break;
 			}
 		}
 		sum+=init;
 		return sum;
 	}
}


브루트포스 Share