Cod sursa(job #561464)
Utilizator | Data | 20 martie 2011 14:57:52 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <stdio.h>
#include <ctype.h>
using namespace std;
int n, x, s;
int putere(int &x, int d)
{
int p = 0;
while(x%d == 0)
{
p++;
x = x/10;
}
return 0;
}
int main()
{
freopen("ssdn.in", "r", stdin);
freopen("ssdn.out", "w", stdout);
scanf("%d", &n);
while(!f.eof())
{
scanf("%d", &x);
s += x;
int cati *= (putere(n,2) +1),s =1;
for(int i=1;i<=cati+1;i++)
s *= 2;
for(int d = 3;d*d<=x;d+=2)
cati *= (putere(n,d) +1);
printf("%d", cati);
}
return 0;
}