Cod sursa(job #2044664)
Utilizator | Antoniu Ficard AntoniuFic | Data | 21 octombrie 2017 11:52:30 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define NUMBER 9973
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
void nr(int t, long long n, int card)
{
long long sum=0;
for(int d=1; d*d<=n; d++)
{
if(n%d==0)
{
card+=2;
sum+=(d+n/d);
}
}
g<<card<<" "<<sum%NUMBER<<endl;
}
int main()
{
int t, card;
long long n;
f>>t;
for(int i=0; i<t; i++)
{
f>>n;
card=0;
nr(t, n, card);
}
return 0;
}