Cod sursa(job #2859861)
| Utilizator | Data | 2 martie 2022 08:16:10 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include<bits/stdc++.h>
#define nmax 1000005
#define mod 9973
#define ll long long
using namespace std;
FILE *in = fopen("ssnd.in","r");
FILE *out = fopen("ssnd.out","w");
int n;
void solve()
{
fscanf(in,"%d",&n);
int sum,ans,d=2;
sum=ans=1;
if(n>0)
sum+=n,ans++;
for(d=2;d*d<=n;d++)
{
if(n%d==0)
{
ans++;
sum+=d;
sum%=mod;
if(d*d<n)
{
ans++;
sum+=n/d;
sum%=mod;
}
}
}
fprintf(out,"%d %d\n",ans,sum);
}
int main()
{
int t;
fscanf(in,"%d",&t);
for(int i=0;i<t;i++)
solve();
}
