Cod sursa(job #305916)
Utilizator | Dan Florescu danutz_flo | Data | 18 aprilie 2009 21:03:50 |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<iostream>
#include<fstream>
using namespace std;
void prim(int a,int b)
{
int i,j,l,x=0,y=0,z=0;
ofstream out("divprim.out");
for(i=a;i>=1;i--)
{
for(j=2;j<=i/2;j++)
{
if(i%j!=0) x++;
for(l=2;l<=j/2;l++)
if(j%l!=0) y++;
if((x==0)&&(y==0)) z++;
}
if(z==b) out<<a<<" "<<b<<" "<<endl;
x=0;
y=0;
z=0;
}
}
int main()
{
int t,n,k,i;
ifstream in("divprim.out");
in>>t;
for(i=1;i<=t;i++)
{
in>>n;
in>>k;
prim(n,k);
}
return 0;
}