Codeforces A. Again Twenty Five!【水】
2016-03-08 19:45
363 查看
http://www.codeforces.com/problemset/problem/630/A
A. Again Twenty Five!
time limit per test
0.5 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output
The HR manager was disa
ppointed 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, ncan
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
output
#include <stdio.h>
int main()
{
int n;
while(~scanf("%d",&n))
{
printf("25\n");
}
return 0;
}
A. Again Twenty Five!
time limit per test
0.5 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output
The HR manager was disa
ppointed 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, ncan
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
#include <stdio.h>
int main()
{
int n;
while(~scanf("%d",&n))
{
printf("25\n");
}
return 0;
}
相关文章推荐
- 1014. Waiting in Line (30)
- wait和notifyAll的方法使用案例分析
- Uva10976——Fractions Again?!
- ZOJ 3923 In the Rain(数学)
- 【Codeforces Round 345 (Div 2) B】【贪心 STL-set】Beautiful Paintings 安排顺序使得a[i]大于a[i-1]的i尽可能多
- Codeforces Round #345 (Div. 2) C (multiset+pair )
- freeswitch You must define a domain called * in your directory
- NSURLErrorDomain Code=-999
- PAT1003-Highest Price in Supply Chain
- Codeforces #345 Div2 B Beautiful Paintings 构造/结论
- HDU 5293 Tree chain problem [树链剖分+线段树+树形DP]
- codeforces 651B Beautiful Paintings (想法)
- codeforces 651B Beautiful Paintings【优先队列】
- 浅析AIDL的使用
- 开发错误记录2 .MainActivity (server)' ~ Channel is unrecoverably broken and will be disposed!
- Send an email using Telnet
- HDU 4819 Mosaic(二维线段树)
- uva 10090 So you want to be a 2n-aire?
- main
- RTAI安装与配置