Cod sursa(job #1324464)
Utilizator | Data | 22 ianuarie 2015 13:11:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
void Euclid(int *a,int *b)
{
while(*a!=*b)
if(*a>=*b)
*a-=*b;
else
*b-=*a;
}
void citire()
{
f >> n;
for(int i=1;i<=n;i++)
{
f >> a >> b;
Euclid(&a,&b);
g << b << "\n";
}
f.close();
}
int main()
{
citire();
return 0;
}