Cod sursa(job #1569249)
Utilizator | Data | 15 ianuarie 2016 10:49:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#define s second
#define f first
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
pair <short,short> v[100000];
int n;
int main(){
in>>n;
for(int i=0;i<n;i++)
in>>v[i].f>>v[i].s;
for(int i=0; i<n;i++)
while(v[i].s!=0 && v[i].f!=0)
if(v[i].f>v[i].s)
v[i].f=v[i].f%v[i].s;
else
v[i].s=v[i].s%v[i].f;
for(int i=0;i<n;i++)
out<<max(v[i].f,v[i].s);
out.close();
return 0;
}