【线段树 数学】JZOJ_4638 第三条跑道

题意

给出一个序列，对它有两种操作：
1、区间乘。
2、求区间中每个数值$\phi$的积。

思路

$$\phi (n)=n\ast \prod \frac{p_i-1}{p_i}$$
根据这个性质，我们可以维护区间数的乘积以及区间中质因子的指数就好了。
由于题中给出的数据$600$内只有$109$个质数，所以我们就可以用$109$个线段树来维护。

代码

#include<cstdio>

const int mod = 100000007;
int n, q;
int prime[]={1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599};
int a[10001];

long long power(long long a, int b) {
	long long res = 1;
	for (; b; b >>= 1) {
		if (b & 1) res = res * a % mod;
		a = a * a % mod;
	}
	return res;
}

struct treeNode {
	int l, r;
	long long dat, add;
};

struct segmentTree1 {
	treeNode t[40001];
	void build(int p, int l, int r, int w) {
		t[p].l = l;
		t[p].r = r;
		if (l == r) {
			t[p].dat = !(a[l] % w);
			return;
		}
		int mid = (l + r) / 2;
		build(p * 2, l, mid, w);
		build(p * 2 + 1, mid + 1, r, w);
		t[p].dat = t[p * 2].dat + t[p * 2 + 1].dat;
	}
	void spread(int p) {
		if (t[p].add) {
			t[p * 2].add = 1;
			t[p * 2 + 1].add = 1;
			t[p * 2].dat = t[p * 2].r - t[p * 2].l + 1;
			t[p * 2 + 1].dat = t[p * 2 + 1].r - t[p * 2 + 1].l + 1;
			t[p].add = 0;
		}
	}
	void change(int p, int l, int r) {
		if (l <= t[p].l && t[p].r <= r) {
			t[p].add = 1;
			t[p].dat = t[p].r - t[p].l + 1;
			return;
		}
		spread(p);
		int mid = (t[p].l + t[p].r) / 2;
		if (l <= mid) change(p * 2, l, r);
		if (r > mid) change(p * 2 + 1, l, r);
		t[p].dat = t[p * 2].dat + t[p * 2 + 1].dat;
	}
	long long ask(int p, int l, int r) {
		if (l <= t[p].l && t[p].r <= r) return t[p].dat;
		spread(p);
		int mid = (t[p].l + t[p].r) / 2;
		long long res = 0;
		if (l <= mid) res += ask(p * 2, l, r);
		if (r > mid) res += ask(p * 2 + 1, l, r);
		return res;
	}
}tree[110];

struct segmentTree2 {
	treeNode t[40001];
	void build(int p, int l, int r) {
		t[p].add = 1;
		t[p].l = l;
		t[p].r = r;
		if (l == r) {
			t[p].dat = a[l];
			return;
		}
		int mid = (l + r) / 2;
		build(p * 2, l, mid);
		build(p * 2 + 1, mid + 1, r);
		t[p].dat = t[p * 2].dat * t[p * 2 + 1].dat % mod;
	}
	void spread(int p) {
		if (t[p].add != 1) {
			t[p * 2].add = (t[p * 2].add * t[p].add) % mod;
			t[p * 2 + 1].add = (t[p * 2 + 1].add * t[p].add) % mod;
			t[p * 2].dat = t[p * 2].dat * power(t[p].add, t[p * 2].r - t[p * 2].l + 1) % mod;
			t[p * 2 + 1].dat = t[p * 2 + 1].dat * power(t[p].add, t[p * 2 + 1].r - t[p * 2 + 1].l + 1) % mod;
			t[p].add = 1;
		}
	}
	void change(int p, int l, int r, int w) {
		if (l <= t[p].l && t[p].r <= r) {
			t[p].add = t[p].add * w % mod;
			t[p].dat = t[p].dat * power(w, t[p].r - t[p].l + 1) % mod;
			return;
		}
		spread(p);
		int mid = (t[p].l + t[p].r) / 2;
		if (l <= mid) change(p * 2, l, r, w);
		if (r > mid) change(p * 2 + 1, l, r, w);
		t[p].dat = t[p * 2].dat * t[p * 2 + 1].dat % mod;
	}
	long long ask(int p, int l, int r) {
		if (l <= t[p].l && t[p].r <= r) return t[p].dat;
		spread(p);
		int mid = (t[p].l + t[p].r) / 2;
		long long res = 1;
		if (l <= mid) res = res * ask(p * 2, l, r) % mod;
		if (r > mid) res = res * ask(p * 2 + 1, l, r) % mod;
		return res;
	}
}tre;

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	for (int i = 1; i <= 109; i++)
		tree[i].build(1, 1, n, prime[i]);
	tre.build(1, 1, n);
	scanf("%d", &q);
	int op, l, r, x;
	while (q--) {
		scanf("%d", &op);
		if (op) {
			scanf("%d %d", &l, &r);
			long long ans = 1, fenmu = 1, index;
			for (int i = 1; i <= 109; i++) {
				index = tree[i].ask(1, l, r);
				ans = ans * power(prime[i] - 1, index) % mod;
				fenmu = fenmu * power(prime[i], index) % mod;
			}
			ans = ans * tre.ask(1, l, r) % mod;
			ans = ans * power(fenmu, mod - 2) % mod;
			printf("%lld\n", ans);
		} else {
			scanf("%d %d %d", &l, &r, &x);
			for (int i = 1; i <= 109; i++)
				if (!(x % prime[i])) tree[i].change(1, l, r);
			tre.change(1, l, r, x);
		}
	}
}