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
zdr_vlad's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 12:44:44
public class NumberSequence { public int findDigit(int N) { int pos = 0; String res = new String(""); for(Integer i=1;i<=N;i++){ res+= i.toString(); int q=res.length(); pos+=q; //System.out.println(pos); if(pos == N) return Integer.parseInt(new String(i.toString().charAt(0)+"")); if(pos > N) return Integer.parseInt(new String(res.charAt(N -pos + q -1)+"")); } return 0; } }