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
gella's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 14:12:39
public class NumberSequence { public static int findDigit(int N){ int t[]=new int[30000]; int p[]=new int[30000]; int k=1; p[0]=t[0]=0; for(int i=1;i<30000;i++){ t[i]=t[i-1]+(int)Math.log10(k)+1; p[i]=t[i]+p[i-1]; k++; //System.out.println(t[i]); //System.out.println(p[i]); } for(int i=1;i<30000;i++){ if(p[i]<N&&p[i+1]>N) {k=i; break;} if(p[i]==N) return i%10; } //System.out.println(k); //System.out.println(p[k]); int res=p[k]; k=0; for(int i=res+1;i<=N;i++){ k++; } return k%10; } }