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
aleksp's solution for 300: Integer Pair, written in Java
import java.util.*; public class IntegerPair { public static int brCifri(int n) { int b=0; while (n>0) { n/=10; b++; } return b; } public static int stepen(int x, int y) { int v=1; for (int i=0; i<y; i++) v*=x; return v; } public static int removeDigit(int d, int N) { int lev=(N/stepen(10,d))*stepen(10, d-1); int desen=(N%stepen(10, d-1)); return lev+desen; } public static int[] removeDigits(int N) { int niza[]=new int[brCifri(N)]; for (int i=0; i<niza.length;i++) niza[i]=removeDigit(i+1,N); return niza; } public static int count(int N) { int co=0; List<Integer> ls=new ArrayList<Integer>(); for (int i=10; i<=N; i++) { int niza[]=removeDigits(i); int k=0; for (int j=0; j<niza.length; j++) if (i+niza[j]==N) if (!ls.contains(i)) { co++; ls.add(i); } } return co; } }