Cod sursa(job #1042385)

Utilizator Iustin_BulimarFMI Iustin Bulimar Iustin_Bulimar Data 26 noiembrie 2013 22:49:06
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("ssnd.in");
ofstream cout("ssnd.out");

int t;
long long n, s, k, d, ;
const int x=9973;
const int y=1000000;

void ciur()
{
    int k, r, i, y, j;
    k=1;
    p[1]=2;
    r=sqrt(y);
    for(i=4; i<=y; i+=2) x[i]=1;
    for(i=3; i<=y; i+=2)
        if(x[i]==0)
        {
            p[++k]=i;
            if(i<=r)
                for(j=i*i; j<=y; j+=i) x[j]=1;
        }

}
int main()
{
    for(cin>>t; t>0; t--)
    {
        cin>>n;
        k=2;
        s=n+1;
        for(i=1; i<=k; i++)
        {
            j=0;
            while(n%p[i]==0)
            {
                n/=p[i];
                j++;
                s+=j*p[i];
            }
        if(d*d==n)
        {
            k++;
            s+=d;
        }
        cout<<k<<" "<<s%x<<'\n';
    }
    return 0;
}