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
prankmaster's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:44:05
import java.util.StringTokenizer; public class TrainRoute { public String findActualSchedule(String plannedSchedule, String updates) { char []stanici=new char[50]; int []min= new int[50]; int []cas = new int[50]; StringTokenizer raspored = new StringTokenizer(plannedSchedule," :"); StringTokenizer update = new StringTokenizer(updates," :"); int brStanici=0; while(raspored.hasMoreTokens()) { stanici[brStanici]=raspored.nextToken().charAt(0); cas[brStanici]=Integer.parseInt(raspored.nextToken()); min[brStanici]=Integer.parseInt(raspored.nextToken()); brStanici++; } String pom; char pom1; while(update.hasMoreTokens()) { pom1=update.nextToken().charAt(0); for(int i=0;i<brStanici;i++) if(stanici[i]==pom1) { cas[i]=Integer.parseInt(update.nextToken()); min[i]=Integer.parseInt(update.nextToken()); } } pom=""; pom+=stanici[0]+" "; if(cas[0]<10) pom+="0"; pom+=cas[0]+":"; if(min[0]<10) pom+="0"; pom+=min[0]; for(int i=1;i<brStanici;i++) {pom+=" "+stanici[i]+" "; if(cas[i]<10) {pom+="0";System.out.println("sdas");} pom+=cas[i]+":"; if(min[i]<10) pom+="0"; pom+=min[i];} return pom; } }