Cod sursa(job #1901801)
Utilizator | Data | 4 martie 2017 11:19:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int x,y,n;
int gcd(int a,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int main()
{
f>>n;
while(n--)
{
f>>x>>y;
g<<gcd(x,y)<<'\n';
}
return 0;
}