Cod sursa(job #2206446)
Utilizator | Data | 22 mai 2018 18:32:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
int main()
{ int a, b, n, r;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=1; i<=n; i++)
{ f>>a>>b;
if(a<b){r=a; a=b; b=r;}
while(b){
r=a%b;
a=b;
b=r;}}
return 0;
}