Cod sursa(job #1962386)
| Utilizator | Data | 11 aprilie 2017 18:47:45 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ int a, b, i, j, div, nr, maxim;
ifstream f;
ofstream g;
f.open("euclid2.in");
g.open("euclid2.out");
f>>nr;
for(i=0;i<nr;i++)
{
f>>a;
f>>b;
if(a>b) {maxim=b;} else {maxim=a;}
j=1;
while(j!=maxim+1)
{
if((a%j==0) && (b%j==0))
{
div=j;
}
j++;
}
g<<div<<"\n";
}
f.close();
g.close();
return 0;
}
