Cod sursa(job #686460)
| Utilizator | Data | 21 februarie 2012 17:05:09 | |
|---|---|---|---|
| Problema | Frac | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.87 kb |
#include<fstream>
#include <bitset>
using namespace std;
ifstream cin("frac.in");
ofstream cout("frac.out");
int main()
{ long long i,d=2,factor[100000],nr_factori,gasit,numarator,nr_frac=0,n,nr;
cin>>n>>nr;
i=0;
while (n>1)
{
if (n%d==0) {i++;
factor[i]=d;
while (n%d==0) n=n/d;
}
d++;
}
nr_factori=i;
numarator=0;
while(nr_frac<nr)
{numarator++;
gasit=0;
for(i=1;i<=nr_factori;i++)
if (numarator%factor[i]==0) {gasit=1;break;}
if (gasit==0)
nr_frac++;
}
cout<<numarator;
return 0;
}
