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
nemaime's solution for 300: NumberSequence, written in Java, submitted on 09.05.2010 12:43:16
public class NumberSequence { int cifra(int poz,int end){ int cur=0; for(int i=1;i<=end;i++){ String str = Integer.toString(i); int len=str.length(); if(cur+len>=poz){ String s=""+str.charAt(poz-cur-1); int pom=Integer.parseInt(s); return pom; } cur+=len; } return 0; } public int findDigit(int N){ int poz=0; int pom=1; int prethoden=1,segasen=1; int zbirP=1,zbirS=1,posleden=1; if(N==1)return 1; for(;;){ pom++; String str= Integer.toString(pom); int len=str.length(); zbirS=zbirP+posleden+len; if(zbirS>=N)break; zbirP=zbirS; posleden+=len; } return cifra(N-zbirP,pom); } }