GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

  GeekInterview.com  >  Placement Papers  >  CTS

 Print  |  
Question:  9 Cities Numbered 1 to 9

Answer: There are 9 cities numbered 1 to 9. From how many cities the flight can start so as to reach the city 8 either directly or indirectly such the path formed is divisible by 3.


July 07, 2009 14:07:32 #1
 anand3186   Member Since: July 2009    Total Comments: 12 

RE: 9 Cities Numbered 1 to 9
 
9 cities.
1 - 8 (1+8 = 9)
2-5-8(2+5+8=15)
3-4-8
4-(3 or 6)-8
5-2-8
6-(4 or 1)-8
7-8
8-2-8
9-1-8
     

 

Back To Question