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
BojanKostadinov's solution for 400: Square Count, written in Java
import java.util.*; public class SquareCount { public boolean isnot(int N) { for (int p=2; p*p<=N; p++) if (N%(p*p) == 0) return false; return true; } public int simple(int N) { int found = 0; for (int p=1; p<=3000000; p++) if (isnot(p)) { found++; if (found==N) return p; } return 2000000; } public int pos(int N) { return (simple(N)); } }