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
alpetrovski's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 11:48:17
public class NumberSequence { public int findDigit(int N) { int prev = 0; int n=1; while(N>(String.valueOf(n).length()+prev)) { N = N-(String.valueOf(n).length()+prev); prev = prev+String.valueOf(n).length(); n++; } //System.out.println(N); String temp = ""; for(int i=1;i<=n;i++) { temp = temp.concat(String.valueOf(i)); } return Integer.parseInt(String.valueOf(temp.charAt(N-1))); } }