UOJ Logo

NOI.AC

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#213168#2356. Count1811260623100ms0kbC++11900b2024-11-09 22:08:242024-11-09 23:26:06

answer

#include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
int n,a,b,c,ans;
int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
signed main()
{
    n=read();
    a=read();
    b=read();
    c=read();
    ans=1;
    for(int j=1;j<=n;j++)
    {
        int cnt=0;
        for(int i=2;i*i<=j;i++)
        {
            while(j%i!=0)
            {
                j/=i;
                cnt++;
            }
            if(j!=1)
                cnt++;
        }
        ans+=cnt;
        //cout<<j<<' '<<cnt<<endl;
    }
    printf("%lld 1 5 4",ans%MOD);
    return 0;
}

Details

小提示:点击横条可展开更详细的信息

Test #1:

score: 0
Time Limit Exceeded

input:

5 0 7 3

output:


result:


Test #2:

score: 0
Time Limit Exceeded

input:

8 0 9 4

output:


result:


Test #3:

score: 0
Time Limit Exceeded

input:

10 1 10 5

output:


result:


Test #4:

score: 0
Time Limit Exceeded

input:

500 2 996 6

output:


result:


Test #5:

score: 0
Time Limit Exceeded

input:

800 233 966 7

output:


result:


Test #6:

score: 0
Time Limit Exceeded

input:

1000 666 999 10

output:


result:


Test #7:

score: 0
Time Limit Exceeded

input:

50000 2048 98673 100

output:


result:


Test #8:

score: 0
Time Limit Exceeded

input:

80000 65535 25192 50

output:


result:


Test #9:

score: 0
Time Limit Exceeded

input:

100000 23333 99696 12

output:


result:


Test #10:

score: 0
Time Limit Exceeded

input:

100000 89941 99669 6

output:


result: