Submit Time:2024-01-04 13:31:47

运行 ID: 119155

#include<bits/stdc++.h> using namespace std; const int N=1000001; int bf[N],n,m,a[N]; int main() { cin>>n>>m; for(int p=1; p<=n; p++) scanf("%d",&a[p]); for(int p=1; p<=m; p++){ int x,y,opt,j; scanf("%d",&opt); if(opt==1){ scanf("%d%d",&x,&y); bf[x]+=y; } else{ scanf("%d",&j); int num=a[j]; for(int i=1; i*i<=j; i++) if(j%i==0){ num+=bf[i]; if(i!=(j/i)) num+=bf[j/i]; } printf("%d\n",num); } } return 0; }