A10186 | Again Twenty Five!
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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?
Could you pass the interview in the machine vision company in IT City?
输入格式
The only line of the input contains a single integer $n$ ( $2<=n<=2·10^{18}$ ) — the power in which you need to raise number $5$ .
输出格式
Output the last two digits of $5^{n}$ without spaces between them.
输入输出样例
输入 #1
2
输出 #1
25
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted