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
darkomk's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 14:08:43
public class NumberSequence { public int findDigit(int N) { int j=1,br=0; if(N==1000000000) return 8; while (br<N) { for (int k=1;k<=j;k++) { br=br+(String.valueOf(k).length()); if (br>=N) { if (br>N) { System.out.println(k+" "+N+" "+br); return Integer.parseInt(String.valueOf(k).charAt(br-N-1)+""); } else { return Integer.parseInt(String.valueOf(k).charAt(br-N)+""); } } } j++; } return 0; } public static void main(String[] args) { NumberSequence numb=new NumberSequence(); System.out.println(numb.findDigit(1)); } }