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
Halicha's solution for 300: Integer Pair, written in Java
public class IntegerPair { public int count(int N) { int prv=0,vtor=0; String pr,vt; int rez=0; for(int i=N;i>N/2;i--){ prv=i; vtor=N-i; pr=Integer.toString(prv); vt=Integer.toString(vtor); if(check(pr,vt)) { //System.out.println(pr+ " "+ vt); rez++; } } if(Integer.parseInt((Integer.toString(N).substring(1)))==0) rez++; return rez; } public boolean check(String pr,String vt){ String nov=""; for(int i=1;i<pr.length();i++){ nov=pr.substring(0,i)+pr.substring(i+1); if(nov.equals(vt)) return true; } for(int i=1;i<vt.length();i++){ nov=vt.substring(0,i)+vt.substring(i+1); if(nov.equals(pr)) return true; } return false; } /*public static void main(String[] args) { IntegerPair a = new IntegerPair(); System.out.print(a.check("13","103")); System.out.print(a.count(1000)); }*/ }