Submission #366341

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>

using namespace std;

#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()

#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]

typedef complex<double> P;
typedef vector<P> Poly;

const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };
#define MOD 1000000007



//等差数列の和
inline LL sum(LL st, LL ed, LL d){
	LL n = (ed - st) / d+1;
	return (n*(st + ed)) / 2;
}


inline  vector<LL> divisor(LL N){
	list<LL> res;
	LL i;
	for (i = 1ll; i*i < N; i++)
		if (N%i == 0){ res.push_back(i); res.push_back(N / i); }
	if (N%i==0)res.push_back(i);
	vector<LL> ans(all(res));
	sort(all(ans),greater<LL>());
	return ans;
}

int main(void){
	LL N, K;
	cin >> N >> K;
	auto div = divisor(K);
	vector<LL> res(div.size());
	rT(i, (int)div.size()){
		res[i] = sum(div[i], div[i]*(N / div[i]),div[i]);
		rT(j, i)if (div[j] % div[i] == 0)res[i] -= res[j];
	}
	LL ans = 0;
	rT(i, (int)div.size()){
		LL X = K / div[i];
		ans = (ans + (X*(res[i] % MOD)) % MOD) % MOD;

	}

	cout << ans << endl;
	return(0);
}

Submission Info

Judge Result