Cod sursa(job #2428527)
Utilizator | Data | 5 iunie 2019 17:53:42 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
const long long MOD=9973;
long long s,nr;
long long n,a,x;
int main()
{
f>>n;
while(n)
{
n--;
f>>x;
nr=0;
s=0;
for(long long i=1; i<=n; ++i)
if(n % i == 0)
{
++nr,
s+=i,
s%=MOD;
}
g<<nr<<' '<<s+x+1<<'\n';
}
return 0;
}