Codeforces Round #146 (Div. 2) B. Easy Number Challenge

B. Easy Number Challenge

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Let's denote d(n) as the number of divisors of a positive integer n. You are given three integers a, b and c. Your task is to calculate the following sum:

Find the sum modulo 1073741824 (2³⁰).

Input

The first line contains three space-separated integers a, b and c (1 ≤ a, b, c ≤ 100).

Output

Print a single integer — the required sum modulo 1073741824 (2³⁰).

Sample test(s)

input

2 2 2

output

20

input

5 6 7

output

1520

Note

For the first example.

• d(1·1·1) = d(1) = 1;
• d(1·1·2) = d(2) = 2;
• d(1·2·1) = d(2) = 2;
• d(1·2·2) = d(4) = 3;
• d(2·1·1) = d(2) = 2;
• d(2·1·2) = d(4) = 3;
• d(2·2·1) = d(4) = 3;
• d(2·2·2) = d(8) = 4.

So the result is 1 + 2 + 2 + 3 + 2 + 3 + 3 + 4 = 20.

水题。

求数的约数的个数，然后一个累积的过程，每步可取余

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 1000001
typedef long long ll;
const ll mod=(1<<30);
ll d[maxn];
ll fuck(ll n)
{
    if(d[n]!=-1)
    return d[n];
    d[n]=0;
    for(ll i=1;i*i<=n;i++)
    {
        if(n%i==0)
        {
            if(i*i==n)
            ++d[n];
            else
            d[n]+=2;
        }
    }
    return d[n];
}
int main()
{
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    memset(d,-1,sizeof(d));
    ll ans=0;
    for(int i=1;i<=a;i++)
    for(int j=1;j<=b;j++)
    for(int k=1;k<=c;k++)
    {
        ans+=fuck(i*j*k);
        ans%=mod;
    }
    printf("%I64d\n",ans);
    return 0;
}