zoukankan      html  css  js  c++  java
  • codeforces 630A Again Twenty Five!

    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 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

    题意:给你一个数n让你输出5的n次方的后两位数
    题解:打表发现规律5的所有的数的次方后两位都是25
    #include<stdio.h>      //codeforce    a
    #include<string.h>
    #include<stdlib.h>
    #include<algorithm>
    #include<math.h>
    #include<queue>
    #include<stack>
    #define INF 0x3f3f3f
    #define MAX 100100
    #define LL long long
    using namespace std;
    int main()
    {
    	int i,j,n,m;
    	while(scanf("%lld",&n)!=EOF)
    	{
    		//m=pow(5,n);
    		printf("25
    ");
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    AVL Trees & Huffman Tree
    线索二叉树
    w10 端口转发
    springboot 注解属性配置
    java 性能分析工具
    JAVA
    ffmpeg ffplay播放延时大问题:播放延时参数设置
    springboot jodconverter openoffice 实现 office 文件 在线预览
    oracle 字符串 正则表达式 拆分,排序,合并
    润乾填报-(自定义)自动计算
  • 原文地址:https://www.cnblogs.com/tonghao/p/5202155.html
Copyright © 2011-2022 走看看