Competitions » Main CodeFu Competitons » CodeFu 2007 » Results

CodeFu 2007 Results

CodeFu Final Round Results

ivan85mk's solution for 300: Integer Pair, written in Java

import java.lang.StringBuffer;
public class IntegerPair {
  int max=0, dolz=0, dolz1=0, i, j, k, br1[], br2[], dlbr=0, p;
    StringBuffer broj, brojpom;
    public int count(int N)
    {
        dolz1=Integer.toString(N).length();
        br1=new int[500];
        br2=new int[500];
        boolean test;
        for(i=10; i<=N; i++)
        {
            broj=new StringBuffer(Integer.toString(i));
            brojpom=new StringBuffer(Integer.toString(i));
            dolz=broj.length();
            
            for(j=0; j<dolz; j++)
            {
                broj=broj.deleteCharAt(j);
                k=Integer.parseInt(broj.toString());
                if((i+k)==N)
                {
                    test=false;
                    for(p=0; p<dlbr; p++)if(i==br1[p] && k==br2[p])test=true;
                    if(test==false)
                    {
                        max++;
                        System.out.println(i+"+"+k); 
                        br1[dlbr]=i; 
                        br2[dlbr]=k; 
                        dlbr++;
                    }
                }
                broj=new StringBuffer(brojpom);
            }
        }
        return max;
    }
}