提交时间:2024-01-21 14:03:58
运行 ID: 120947
#include <bits/stdc++.h> #define int long long using namespace std; int n,m; int a[1000005]; int mp[1000005]; signed main() { cin >> n >> m; for (int i = 1; i <= n; i++) cin >> a[i]; while (m--) { int op; cin >> op; if (op == 1) { int x,y; cin >> x >> y; mp[x] += y; } else { int x; cin >> x; int cnt = 0; int xx = (int)(sqrt(x)); for (int i = 1; i <= xx; i++) if (x % i == 0 && i * i != x) cnt += mp[i] + mp[x / i]; else if (x % i == 0) cnt += mp[i]; printf("%lld\n",a[x] + cnt); } } return 0; }