Sigma Function_clearresults();-CSDN博客

本文链接：https://blog.csdn.net/weixin_45484967/article/details/99689784

本文介绍了一种高效算法，用于计算1到n（n最大可达10^12）范围内所有整数中，其因子和为偶数的数量。通过数学公式和代码实现，展示了如何快速解决这一复杂问题。示例输入输出帮助理解算法效果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

006
1~n (n:1~10^12)中，因子和为偶数的有几个。

例如:σ(24) = 1+2+3+4+6+8+12+24=60 24的因子和即为偶数

AC代码：

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<set>
#include<queue>
#include<cstring>
#include<cmath>
const double r=0.57721566490153286060651209; //欧拉常数
using namespace std;
typedef long long ll;

int main()
{
    ll n;
    int t;
    scanf("%d", &t);
    for(int i = 1; i <= t; i++)
    {
        scanf("%lld", &n);
        ll a = (ll)sqrt(double(n));
        ll b = (ll)sqrt(double(n/2.0));

        printf("Case %d: %lld\n", i, n-a-b);
    }
}

Sigma Function

igma function is an interesting function in Number Theory. It is denoted by the Greek letter Sigma (σ). This function actually denotes the sum of all divisors of a number. For example σ(24) = 1+2+3+4+6+8+12+24=60. Sigma of small numbers is easy to find but for large numbers it is very difficult to find in a straight forward way. But mathematicians have discovered a formula to find sigma. If the prime power decomposition of an integer is

在这里插入图片描述

Then we can write,
在这里插入图片描述

For some n the value of σ(n) is odd and for others it is even. Given a value n, you will have to find how many integers from 1 to n have even value of σ.

Input
Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 1012).

Output
For each case, print the case number and the result.

Sample Input
4
3
10
100
1000

Sample Output
Case 1: 1
Case 2: 5
Case 3: 83
Case 4: 947

大佬连接：https://www.cnblogs.com/shentr/p/5285134.html