Cod sursa(job #1018329)
Utilizator | Data | 29 octombrie 2013 13:08:35 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
#define mod 9973
using namespace std;
int main(){
ifstream f("ssnd.in");
ofstream o("ssnd.out");
int n=0;f>>n;
int x=0;
for(int i=0;i<n;i++){
f>>x;
int s=0;int nr=0;
for(long long j=1;j<=x;j++){
if(x%j==0){
nr++;
s+=j;
s=s%mod;
}
}
o<<nr<<" "<<s%mod<<"\n";
}
}