Cod sursa(job #2278102)
Utilizator | Data | 7 noiembrie 2018 11:45:05 | |
---|---|---|---|
Problema | Frac | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("frac.in");
ofstream fout("frac.out");
long long a,n,i,b;
int euclid (long long a,long long b){
long long c;
while (b) {
c = a % b;
a = b;
b = c;
}
return (a==1);
}
int main()
{
fin>>n>>a;
for(i=1;i<=a;++i){
if(!euclid(i,n))
a++;
}
fout<<a;
return 0;
}