Competitions » Main CodeFu Competitons » CodeFu 2007 » Results

CodeFu 2007 Results

CodeFu Final Round Results

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

public class IntegerPair {
	public int count(int N) {
		int cifri = (Integer.toString(N-1)).length();
		
		// najmaliot broj sto moze da se razgleduva kako prv broj
		// N-1 - najmaliot broj so "cifri" broj na cifri
		int min = (N-1) - (int)Math.pow((double)10, (double)cifri-1);
		//System.out.println( (int)Math.pow((double)10, (double)cifri-1) );
		//System.out.println("min = " + min);
		
		int t1;
		int t2;
		String s1;
		String s2;
		String p1;
		String p2;
		String c1;
		String c2;
		
		int rez = 0;
		for (int i=N; i>min; i--) {
			t1 = i;
			t2 = N-t1;
			//t1 = 10000;
			//t2 = 0;
			
			
			// broevite kako stringovi 
			s1 = Integer.toString(t1);
			s2 = Integer.toString(t2);
			int razl = s1.length() - s2.length();
	
			if (s1.length() - s2.length() > 1) {
				for (int k=0; k<razl-1; k++) s2 = "0" + s2;
			}
			//System.out.println("s1 = " + s1 + " s2 = " + s2);
			
			if (s1.length() == s2.length()+1) {
				for (int j=0; j<=s2.length(); j++) {
					p1 = s2.substring(0,j);
					p2 = s2.substring(j);
					c2 = p1+"0"+p2;
				
					p1 = s1.substring(0,j);
					p2 = s1.substring(j+1);
					c1 = p1+"0"+p2;
				
					if (c1.equals(c2)) {
						//System.out.println("s1 = " + s1 + " s2 = " + s2);
						//System.out.println("c2 = " + c2 + " c2 = " + c2);
						rez++;
						j=s1.length()+1;
					}
					
				}
			}
		}
		
		return rez;
	}
}