Cod sursa(job #1496307)
Utilizator | Data | 4 octombrie 2015 18:47:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,x,y;
int euclid(int a,int b){
while(b){
int c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
f>>n;
while(n){
f>>x>>y;
if(x<y)
swap(x,y);
g<<euclid(x,y)<<'\n';
n--;
}
return 0;
}