Cod sursa(job #2852292)
Utilizator | Data | 19 februarie 2022 12:18:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,t,i;
int euclid(int x,int y)
{
while(x!=y)
if(x>y)
x=x-y;
else
y=y-x;
return x;
}
void read()
{
f>>t;
for(i=1;i<=t;i++)
{
f>>a>>b;
g<<euclid(a,b)<<endl;
}
}
int main()
{
read();
return 0;
}