Cod sursa(job #3158439)
Utilizator | Data | 18 octombrie 2023 18:54:20 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
void oszto(int n){
int db=0,s=0;
for(int i=1;i<=n;i++){
if(n%i==0){
db++;
s+=i;
}
}
g<<db<<" "<<s<<endl;
}
int main()
{
int t,n;
f>>t;
for(int i=1;i<=t;i++){
f>>n;
oszto(n);
}
return 0;
}