Cod sursa(job #2548180)
| Utilizator | Data | 16 februarie 2020 12:52:15 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int x,int y)
{
while(x!=y)
{
if(x>y)
x-=y;
else
y-=x;
}
return x;
}
int main()
{
int n,x,y;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<'\n';
}
return 0;
}
