Cod sursa(job #1218892)
Utilizator | Data | 12 august 2014 20:05:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
long long a,b,r,n;
f>>n;
for (int i=0;i<n;i++)
{
f>>a>>b;
r=a%b;
if (!r) g<<min(a,b)<<'\n';
else
{
while (r)
{
r=a%b;
a=b;
b=r;
}
g<<a<<'\n';
}
}
}