Register
|
Login
Home
News
Competitions
Practice
How to
Rankings
Calendar
Arena
CodeFu 2007
CodeFu'07 Highlights
Jazoon'07 Highlights
Schedule
Rules
Prizes
Results
Competitions
»
Main CodeFu Competitons
»
CodeFu 2007
»
Results
CodeFu 2007 Results
CodeFu Final Round Results
tomazi's solution for 400: Square Count, written in Java
public class SquareCount { public int pos(int N) { int[] primes=new int[1000]; boolean[] p=new boolean[100000]; int k=0; for(int i=2; i<1000; i++) { if(!p[i]) { primes[k++]=i; } else continue; for(int j=i; j<1000; j*=i) p[j]=true; } int c=0; int sq; int i=0, del, n=1, kk=1; while(true) { boolean ok=true; while((sq=primes[i]*primes[i])<=kk) { if(kk%sq==0) { ok=false; break; } } i++; if(!ok) n++; if(n==N) return kk; kk++; } } }