Cod sursa(job #2093537)
| Utilizator | Data | 23 decembrie 2017 22:41:35 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int main()
{
int t,i,n,k,s,d;
f>>t;
for(i=1;i<=t;i++)
{ f>>n;
k=0;s=0;
for(d=1;d<=n/2;d++)
{ if(n%d==0){k++;s+=d;}}
g<<k+1<<" "<<(s+n)%9973<<endl;
}
f.close();
g.close();
return 0;}
