|
Remote Training on Programming
|
||||||||||
|
|
|||||||||||
| Hello, Guest! Please login or register. |
1564. Again Twenty Five!
|
| View Problem Statistics | Submit | Problem added debug |
|
The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" — the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions." Could you pass the interview in the machine vision company in IT City? Input The only line of the input contains a single integer n (2 ≤ n ≤ 2·1018) — the power in which you need to raise number 5. Output Output the last two digits of 5n without spaces between them. Examples Input 2 Output 25 |
| View Problem Statistics | Submit | Problem discussion | Author/source: |
| Problems from Contests and Camps / | School olympiads and couses of Vologda region / | VolBIT / | VolBIT-2016 / |
| 1564. | 1565. B - Moore's Law | 1566. C - Lucky Numbers | 1567. D - Hexagons! |
| Educational Courses / | C++ Programming Language / | Formulas, Conditions / |
| 1564. | 1718. 02 - Weekday | 1565. 03 - Moore's Law | 1575. 04 - Cracking the Code |
| Problems from Contests and Camps / | School olympiads and couses of Vologda region / | Impulse - 2019 / | Final Olympiad / |
| 1564. | 1567. 02 - Hexagons! | 469. 03 - Linear combination | 1571. 04 - Benches |
| time generating 0.094 sec. |
| © Copyright VSU, AVT, Nosov D.A., Andrianov I.A. |