Pagini recente » Cod sursa (job #1990313) | Cod sursa (job #447286) | Cod sursa (job #330987) | Cod sursa (job #540483) | Cod sursa (job #2248952)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("divprim.in");
ofstream g ("divprim.out");
int prim(int x)
{
int nr=0;
if(x%2==0)
{ nr++;
while(x%2==0)
x/=2;
}
for(int d=3;d*d<x;d+=2)
if(x%d==0)
{nr++;
while(x%d==0)
x/=d;
}
g<<nr;
}
int main()
{
int T, N, K,X;
f>>T;
f>>N;
f>>K;
do
{
if(prim(X)==K)
g<<X;
else
X--;
}while(X<N || X==N);
return 0;
}