提出 #342416

---

ソースコード 拡げる

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#define rep(x, to) for (int x = 0; x < to; x++)
#define REP(x, a, to) for (int x = (a); x < to; x++)


using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;

const ll MOD = (ll)1e9 + 7LL;
ll A, B;
ll ans = 1LL;

map<ll, ll> freq;


void count(ll x) {
	for (ll i = 2LL; i * i <= x; i++) {
		if (x % i == 0) {
			ll res = 0;
			while (x % i == 0) {
				x /= i;
				res++;
			}
			if (freq.find(i) == freq.end()) {
				freq[i] = res;
			} else {
				freq[i] += res;
				//freq[i] %= MOD;
			}
		}
	}
	if (x != 1) {
		if (freq.find(x) == freq.end()) {
			freq[x] = 1;
		} else {
			freq[x] += 1;
		}
	}
}

int main() {
	cin >> A >> B;
	for (ll i = B+1; i <= A; i++) {
		count(i);
	}
	map<ll, ll>::iterator itr = freq.begin();
	while (itr != freq.end()) {
		//cout << (*itr).first << " " << (*itr).second << endl;
		ll value = (*itr).second;
		ans *= value + 1;
		ans %= MOD;
		itr++;
	}
	cout << ans << endl;
	return 0;
}

提出情報

ジャッジ結果