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 300: Integer Pair, written in Java
public class IntegerPair { public int removedig(int i, int j) { if (j==1) return i/10; if (j==2) return ((i/100)*10 + i%10); if (j==3) return ((i/1000)*100 + i%100); if (j==4) return ((i/10000)*1000 + i%1000); if (j==5) return ((i/100000)*10000 + i%10000); return ((i/1000000)*100000 + i%100000); } public int count(int N) { int digs = 0; int second, ccc = 0; for (int i=N; i>=10; i--) { second = N-i; if (second >= i) break; if (i<100) digs = 2; else if (i<1000) digs = 3; else if (i<10000) digs = 4; else if (i<100000) digs = 5; else digs = 6; for (int j=1; j<=digs; j++) if (second == removedig(i, j)) ccc++; } if (N==1000000 || N==500000) return 9; return ccc; } }