Cod sursa(job #3255037)
| Utilizator | Data | 9 noiembrie 2024 11:42:26 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
void div(long x)
{
int d = 1;
int rad = sqrt(x);
int k = 0;
while(d<=x)
{
if(x%d==0)
{
k++;
int s = s+d;
}
d++;
}
g<<k<<" "<<s<<endl;
}
int main()
{
int n,i,x;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<=n;i++)
div(x[i]);
return 0;
}
