Register
|
Login
Home
News
Competitions
Practice
How to
Rankings
Calendar
Arena
CodeFu 2010
CodeFu'10 Highlights
Jazoon'10 Highlights
Schedule
Rules
Prizes
Results
Competitions
»
Main CodeFu Competitons
»
CodeFu 2010
»
Results
CodeFu 2010 Results
Final Round Results
zdr_vlad's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:59:27
import java.util.StringTokenizer; public class TrainRoute { public String findActualSchedule(String plannedSchedule, String updates) { StringTokenizer stin = new StringTokenizer(plannedSchedule); StringTokenizer stout = new StringTokenizer(updates); int total = stin.countTokens()/2; int tups = stout.countTokens()/2; String [][] planned = new String[total][2]; String [][] ups = new String[tups][2]; String result = new String(""); int i=0; while(stin.hasMoreTokens()){ planned[i][0] = stin.nextToken(); planned[i][1] = stin.nextToken(); //System.out.println(planned[i][0]+" "+planned[i][1]+" "); i++; } i=0; while(stout.hasMoreTokens()){ ups[i][0] = stout.nextToken(); ups[i][1] = stout.nextToken(); //System.out.println("u:"+ups[i][0]+" "+ups[i][1]); for(int j=0;j<total;j++){ if(planned[j][0].charAt(0)==ups[i][0].charAt(0)){ planned[j][1] = ups[i][1]; //System.out.println(planned[j][1]); } } i++; } for(i=0;i<total;i++){ result += " "+planned[i][0]+" "+planned[i][1]; } return result.trim(); } }