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
alexhris's solution for 300: Integer Pair, written in Java
public class IntegerPair { public static int count(int N) { int brojac=0; for (int i = N; i>=N/2; i--) { if (proverka(i,N-i)) brojac++; } return brojac; } public static boolean proverka(int n, int m) { int[] nc=new int[7]; int[] mc=new int[7]; for (int j=0;j<7;j++) { nc[j]=mc[j]=-1; } int i=0; while (n>0) { nc[i]=n%10; n/=10; i+=1; } int k=0; if (m==0) { k=i-1; for (int s=0;s<k;s++) mc[s]=0; } else { while (m>0) { mc[k]=m%10; m/=10; k+=1; } } if (Math.abs(k-i)!=1) return false; int ok=0; for (int j=0;j<k;j++) { for (int l=j;l<i;l++) { if (mc[j]==nc[l]) { nc[l]=mc[j]=-1; break; } } } for (int j=0;j<i;j++) { if (nc[j]!=-1) ok+=1; } if (ok==1) return true; return false; } }