Pagini recente » Cod sursa (job #1934238) | Cod sursa (job #1902531) | Cod sursa (job #4317) | Cod sursa (job #644520) | Cod sursa (job #720441)
Cod sursa(job #720441)
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream f("sasori.in");
ofstream g("sasori.out");
long long int t,i,j, n,v[1000],ok,nr,s;
f>>t;
for (i=1;i<=t;i++)
f>>v[i];
for (i=1;i<=t;i++)
{
nr=0; s=0;
j=1;
ok=1;
while (j<=v[i] && ok)
{
if (v[i]%j==0)
{
nr++;
s=s+j;
//cout<<j<<" ";
}
j++;
}
cout<<'\n';
cout<<nr<<" "<<s%9973<<'\n';
}
f.close();
g.close();
return 0;
}
/*#include<iostream> //inmultirea unui nr mare cu un nr mic
#include<fstream>
using namespace std;
int main ()
{
ifstream f("sasori.in");
ofstream g("sasori.out");
int a[102],i,j,t,b;
f>>a[0]>>b;
for (i=1;i<=a[0];i++)
f>>a[i];
t=0;
i=1;
while (i<=a[0] ||t)
{
t=t+a[i]*b;
a[i]=t%10;
t=t/10;
i++;
}
a[0]=i-1;
for (i=1;i<=a[0];i++)
cout<<a[i];
f.close();
g.close();
return 0;
}*/