1 \(s / 64\) \(MB / 50\) points

After successfully conquering the South Pole, Davor is preparing for new challenges. Next

up is the Arctic expedition to Siberia, Greenland and Norway. He begins his travels on 31

December 2018, and needs to collect \(N\) kunas (Croatian currency) by then. In order to do

this, he has decided to put away \(X\) ( \(X \le 100\)) kunas every Monday to his travel fund, \(X + K\)

kunas every Tuesday, \(X + 2\)* \(K\) every Wednesday, and so on until Sunday, when he will put

away \(X + 6\)* \(K\) kunas. This way, he will collect money for 52 weeks, starting with 1 January

2018 (Monday) until 30 December 2018 (Sunday).

If we know the amount of money \(N\) , output the values \(X\) and \(K\) so that it is possible to collect

the exact money amount in the given timespan. The solution will always exist, and if there

are multiple, output the one with the greatest \(X\) and smallest \(K\) .

The first line of input contains the integer \(N\) (1456 ≤ \(N\) ≤ 145600), the number from the task.

The first line of output must contain the value of X ( 0 < \(X\) ≤ 100 ) , and the second the value of
K (K > 0 ) .

생성자가 기록되지 않았습니다.

출처 COCI 2017/2018 Contest 6