Register
|
Login
Home
News
Competitions
Practice
How to
Rankings
Calendar
Arena
CodeFu 2010
CodeFu'10 Highlights
Jazoon'10 Highlights
Schedule
Rules
Prizes
Results
Competitions
»
Main CodeFu Competitons
»
CodeFu 2010
»
Results
CodeFu 2010 Results
Final Round Results
Ilija139's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 14:12:00
import java.util.ArrayList; import java.util.List; public class NumberSequence { public static int findDigit(int N) { int curSum = 0; List<Integer> s = new ArrayList<Integer>(); for (int i = 1; curSum < N; ++i) { if(i > 9){ curSum += i-9; } if(i > 99){ curSum += i-99; } curSum += i; s.add(curSum); } return curSum - N; } public static void main(String[] args) { System.out.println(findDigit(100)); } }