Windows 7 SP1 – 2015/03 ; DJUCED 40° 2.0.70. macOS 10.9 – 2014/02 ; DJUCED 39° 2.3.4. Windows 8/8.1 – 2013/09 ; DJUCED 39° 3.2.6. Windows XP – 2012/06 ; DJUCED 38° 2.8.6. Windows Vista SP2 – 2011/06 ; DJUCED 38° 2.8.6. Windows 7 SP1 – 2010/06 ; DJUCED 38° 2.8.6. Windows 7 SP2 – 2009/06 ; DJUCED 38° 2.8.6. Windows 7 – 2008/06 ; DJUCED 37° 2.8.6. Windows XP – 2007/06 ; DJUCED 36° 2.4.5. Mac OS X – 2006/06 ; DJUCED 35° 2.4.2. Windows Vista SP1 – 2005/06 ; DJUCED 35° 2.4.2. Mac OS X – 2004/06 ; DJUCED 35° 1.0.2. Mac OS X – 2003/06 ; DJUCED 34° 1.0.0. Apple, the Apple logo, and iPhone are trademarks of Apple Inc., registered in the U.S. and other countries. App Store is a service mark of Apple Inc. and is used under license.Q:
How can I tell if a city has been visited before and what was the winning number?
This challenge deals with cities and your objective is to find out which city has been visited most times and what was the winning number.
Let's say we have a map of Italy and some cities are colored.
Input
Your input is given as a string that contains city names separated by whitespace, for example:
Quindici, Italia V, C
Where:
Quindici is the starting city
Italia V is the capital of Italy
C is the city Cinque Terre
Output
Your output should be a single integer: the highest number of times that city was visited, and the winning number:
the winner has been visited x times
winning number is y
The winning number is determined by the number of times that city has been visited.
The output can be in any convenient format, like the number of visits to each city, the winning number, or a table with those
Related links:
Comentários