集訓(xùn)隊(duì)作業(yè)題目推薦

1、題目來源：Ural Ural AirlineTime Limit: 5 second MemoryLimit:An airline company is a sponsor of the nniversary ration at the Se University. In return for it the company wants the 題目來源：Ural Ural AirlineTime Limit: 5 second MemoryLimit:An airline company is a sponsor of the nniversary ration at the Se Unive

2、rsity. In return for it the company wants the University to help it. company serves N airports and carries out flights n some of them. In order simplify the work the flights are numbered egers from 1 up to M. If there is flight n two airports a plane s in the both directions with the same number.The

3、remaybeonlyoneflightn anytwo The airline company understandst its planes may attract terrorists. In order to create difficulties for terrorists the company wants to number the flights in l manner. If there are several t depart from one airport then greatest common divisor of their flight numbers sho

4、uld be equal to 1. The company turns to you for help (remember, this is a sponsor; you are to work properly).You should write a t finds a required numbering or t it sible to satisfy the requirements. If several numberings sible, it sufficienttofind anyone ofline of ontains numbers n and m separated

5、space (2 = n 50). The next m lines contain information on flights. Each flight is determined by numbers of the t it connects. The numbers of the airports are line of an output should contain YES, if it sible to find a numbering, and NO otherwise. If the answer is YES, the second line numbering, and

6、NO otherwise. If the answer is YES, the second line should contain sible numbering of flights. The numbersare tobe ordered asit is he Flightnumbersareto beseparated Sle6 1 2 245 Sle 423 1時(shí)間限制: 5 內(nèi)存限制: Ural Uraln 個(gè)機(jī)場，這些機(jī)場之間有若干1M依次標(biāo)號。如果兩個(gè)機(jī)場之間有一分子， 為了給時(shí)間限制: 5 內(nèi)存限制: Ural Uraln 個(gè)機(jī)場，這些機(jī)場之間有若干1M依次標(biāo)號。如果兩個(gè)機(jī)場之