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
mg's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 13:47:35
public class NumberSequence { /** * @param args */ public int findDigit(int N) { StringBuffer sb = new StringBuffer(); StringBuffer golema = new StringBuffer(); // StringBuilder golema = new StringBuilder(); for (int i = 1; i <=1000000; i++) { sb.append(String.valueOf(i)); golema.append(sb); if (golema.length() > N) break; } return Integer.parseInt((golema.charAt(N-1) + "")); } public static void main(String[] args) { System.out.println(new NumberSequence().findDigit(10000000)); } }