ZOJ -2095 Divisor Summation

最新推荐文章于 2020-02-01 18:32:02 发布

名字太长容易被发现并打死

最新推荐文章于 2020-02-01 18:32:02 发布

阅读量489

点赞数

分类专栏： 2018暑假ACM集训 # ACM_数论、计算几何

本文链接：https://blog.csdn.net/weixin_44606097/article/details/99620429

版权

2018暑假ACM集训同时被 2 个专栏收录

128 篇文章 1 订阅

订阅专栏

ACM_数论、计算几何

24 篇文章 0 订阅

订阅专栏

Divisor Summation

Time Limit: 5 Seconds	Memory Limit: 32768 KB

Give a natural number n (1 <= n <= 500000), please tell the summation of all its proper divisors.
Definition: A proper divisor of a natural number is the divisor that is strictly less than the number.

e.g. number 20 has 5 proper divisors: 1, 2, 4, 5, 10, and the divisor summation is: 1 + 2 + 4 + 5 + 10 = 22.

Input
An integer stating the number of test cases, and that many lines follow each containing one integer between 1 and 500000.

Output
One integer each line: the divisor summation of the integer given respectively.

Sample Input
3
2
10
20

Sample Output
1
8
22

求n的因子和，先打表

#include<stdio.h>
#include<iostream>
using namespace std;

int f[500005];

int main()
{
    int t;
    int n;
    scanf("%d", &t);
    f[0]=f[1]=0;
    for(int i=1; i<=500001/2; i++)
    {
        for(int j=i*2; j<=500001; j+=i)//j只会取i的倍数
        {
            f[j]+=i;//在f[j]加i就是这个数的因子和
        }

    }


    while(t--)
    {
        scanf("%d",&n);
        printf("%d\n",f[n]);
    }
    return 0;
}