Mai intai trebuie sa te autentifici.
Cod sursa(job #1846597)
Utilizator | Data | 13 ianuarie 2017 16:28:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
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 n;
int euclid(int x, int y)
{
int aux;
while(y)
{
aux = y;
y = x%y;
x = aux;
}
return x;
}
int main()
{
int x,y;
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
g<<euclid(x,y)<<"\n";
}
return 0;
}