首先,这是一道模拟题,但数据范围很大,1e18.
所以,我们先暴力求解+打表,发现一下规律:
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#define ll long long
using namespace std;
const int maxn=1e6+10;
int a[maxn];
int main()
{
memset(a,0,sizeof(a));
int N;
//cin>>N;
for(N=1; N<=100; N++)
{
cout<<N<<": ";
memset(a,0,sizeof(a));
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
{
if(j%i==0)
{
a[j]=!a[j];
}
}
}
ll sum=0;
ll x=1e9+7;
fo