NYOJ 686 An Interesting Sequence 【欧拉函数】

最新推荐文章于 2019-07-17 17:39:58 发布

nuanxin_520

最新推荐文章于 2019-07-17 17:39:58 发布

阅读量429

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/nuanxin_520/article/details/48292211

版权

数学专栏收录该内容

18 篇文章 0 订阅

订阅专栏

欧拉函数

An Interesting Sequence

时间限制： 1000 ms | 内存限制： 65535 KB

难度： 0

描述

YiYi is a smart boy, he is fascinated in solving eccentric problems. One day when he was reading a book, he came across a very interesting problem. After a few time’s thinking, he finally get the solution. YiYi considers this solution very heuristic, now he decides to show this problem to you so that you can also enjoy the happiness of solving this interesting problem. Here is the description of the problem:

Suppose at first you have a sequence, S₁, consists of two numbers: 1, 1. According to some rule you can get the sequence S_n from the sequence S_n-1.Once you get S_n-1, you will be asked to insert one n between a and b if a and b are two adjacent numbers in S_n-1 and a + b = n. After you have inserted all possible n you finally get S_n. You can also get the sequence S_n+1 using the same method and so on.

For example,S₁ = 1,1.Since 1 + 1 = 2, we will insert 2 between two 1s and then we get S₂, S₂ = 1,2,1. Now we will insert two 3s in the sequence to get S₃, as you can see, S₃ = 1,3,2,3,1. In the same way, we know S₄ = 1,4,3,2,3,4,1, S5 = 1,5,4,3,5,2,5,3,4,5,1 and so on.

Here the question comes: give you n, you will be asked to output the number of n in S_n. For example if n = 5, you will output 4 since there are 4 5s in S₅.

输入

The first line of the input contains a number k, the number of test cases to solve (1 ≤ k ≤ 200). Each test case consists of a single integer 2 ≤ n ≤ 10^10 on a separate line.

输出

For each test case, you are asked to output the number of n in Sn on a line.

样例输入

样例输出

来源

3rd Central South China Programming Contest

上传者 ACM_丁国强非常简单的欧拉函数应用代码在此：

#include<stdio.h>
const int MAX=10e10;
long long  eular(long long n)
{
    long long  ret=1,i;
    for(i=2; i*i<=n; i++)
    {
        if(n%i==0)

        {
            n/=i,ret*=i-1;
            while(n%i==0)
                n/=i,ret*=i;
        }
    }
    if(n>1)
        ret*=n-1;
    return ret;

}


int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        long long  m;
        scanf("%lld",&m);
        printf("%lld\n",eular(m));
    }
}