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
martinancevski's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 14:14:03
import java.util.LinkedList; public class NumberSequence { public static int findDigit(int N) { int sum=0,i,br,pom,br2; for (i=0;;) { if (sum+i>=N) break; sum+=i; pom=i+1; br2=1; while (pom/10>0) { pom/=10; br2++; } i+=br2; //System.out.println(i); } //System.out.println(sum); sum=N-sum; //System.out.println(sum); if (sum<10) return sum; else { int [] niza=new int[sum]; for (i=1,br=1;i<=sum;br++) { pom=br; String brojot=new Integer (br).toString(); // System.out.println(brojot); for (int k=0;k<brojot.length() && i<=sum;k++,i++) niza[i-1]=Integer.parseInt(""+brojot.charAt(k)); } LinkedList<Integer> lista=new LinkedList<Integer>(); for (int r:niza) lista.addLast(r); //System.out.println(lista); return niza[sum-1]; } } }