Cod sursa(job #1465316)
Utilizator | Data | 26 iulie 2015 23:29:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t, a, b, i;
int div (int x, int y)
{
while (y)
{
x=y;
y=x%y;
}
return x;
}
int main()
{
f>>t;
for(i=1; i<=t; i++)
{ f>>a>>b;
g<<div(a, b)<<"\n";
}
return 0;
}