[Algorithm] 백준알고리즘_OneNumber(한수)

OneNumber(한수)

1. Question    

- There is a integer X

- X has digit that is made of arithmetical sequence like 123, 468, 369

- You enter a number N( 1 <= N <=1000)

- To get a count of X within 1 <= N 

2. Solution

import java.util.Scanner; public class ArithmeticalSequence { void count(int a){ int count = 0; if(a <= 1000){ for(int i = 1; i<=a; i++){ int thousandsDigit = i/1000; int hundredDigit = i/100%10; int tenDigit = i/10%10; int unitDigit = i%10; int temp0 = thousandsDigit - hundredDigit; int temp = hundredDigit - tenDigit; int temp1 = tenDigit - unitDigit; if(thousandsDigit != 0){ if(temp0 == temp && temp==temp1){ count = count + 1; } }else{ if(hundredDigit != 0){ if(99<i){ if( temp == temp1){ count = count + 1; } } }else{ count = count + 1; } } } } System.out.println(count); } public static void main(String[]args){ ArithmeticalSequence cc = new ArithmeticalSequence(); Scanner aa = new Scanner(System.in); int b = aa.nextInt(); cc.count(b); aa.close(); } }