Pagini recente » Cod sursa (job #1938132) | Cod sursa (job #340551) | Cod sursa (job #2663502) | Cod sursa (job #1555574) | Cod sursa (job #2418241)
#include <fstream>
#include <vector>
#define MAX 1000000
#define MOD 9975
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
int main()
{
ios_base::sync_with_stdio(0);
in.tie(0);
vector<bool> prim(MAX+1,1);
for(int i = 2; i <= MAX; i++)
if(prim[i])
for(long long j = 1LL*i*i; j <= 1LL*MAX; j+=i) prim[j] = 0;
int n;
in >> n;
while(n--)
{
long long tmp;
in >> tmp;
int sum = 0, cnt = 0;
for(int i = 1; 1LL*i*i <= tmp; i++)
if(tmp%i == 0)
{
sum = (sum+i) % MOD;
cnt++;
if(i != tmp/i)
{
sum = (sum + tmp/i) % MOD;
cnt++;
}
}
out << cnt << ' ' << sum << '\n';
}
return 0;
}