Cod sursa(job #2093412)
Utilizator | Data | 23 decembrie 2017 17:21:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{ int n,i,x,y;
f>>n;
for(i=1;i<=n;i++)
{
f>>x>>y;
g<<euclid(x,y)<<endl;
}}