Cod sursa(job #2185763)
| Utilizator | Data | 24 martie 2018 20:49:37 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
int r;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int T,a,b;
f>>T;
for(int i=1;i<=T;i++)
{
f>>a>>b;
int x=max(a,b);
int y=min(a,b);
int k=cmmdc(x,y);
g<<k<<"\n";
}
return 0;
}
