Cod sursa(job #2252037)
Utilizator | Data | 2 octombrie 2018 11:45:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | musai_must | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
void euclid(int a, int b)
{
while(a != b)
{
if(a < b)
b -= a;
else a-=b;
}
g<<a;
}
int main()
{
int n, x ,y;
for(int i = 1; i <= n ; i++)
{ f>>x>>y;
euclid(x,y);
}
return 0;
}