Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- int main(){
- int N, i, X, CanX, j, k, USngtomax=5;
- long long TongUS=0;
- int Songto[250], Nngto=2, FirstTime=0;
- Songto[0]=2; Songto[1]=3;
- for(j = 5; j<=1500; j=j+2){
- for(k=0;k<Nngto;k++){
- if(j%Songto[k]==0){
- break;
- }
- }
- if(k==Nngto){
- Songto[Nngto]=j;
- Nngto++;
- }
- }
- scanf("%ld", &N);
- for(i=1;i<=N;i++){
- scanf("%d", &X);
- CanX = sqrt(X);
- for(j=0;Songto[j]<=CanX;j++){
- while(X%Songto[j]==0){
- TongUS += Songto[j];
- X /= Songto[j];
- }
- }
- if(X!=1){
- TongUS += X;
- }
- }
- printf("%lld", TongUS);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement