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
peceps's solution for 300: Integer Pair, written in Java
import java.util.LinkedList; import java.util.List; public class IntegerPair { /** * @param args */ public static void main(String[] args) { IntegerPair pair = new IntegerPair(); System.out.println(pair.count(500000)); } public int count(int N) { int c = 0; for (int i = 10; i <= N; i++) { c += getX(i, N); } return c; } int getX(int x, int sum) { int count = 0; //System.out.println(x); String sX = String.valueOf(x); int sXLen = sX.length(); for (int i = 0; i < sXLen; i++) { String newSX = sX.substring(0, i) + sX.substring(i+1); int newX = Integer.parseInt(newSX); //System.out.println("Test " + newX); if(x+ newX == sum) { //System.out.println(" OK Nov " + newX); count++; } } return count; } }