Cod sursa(job #2218407)
Utilizator | Data | 4 iulie 2018 13:43:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
while(a!=b)
{
if(a>b)a=a-b;
else b=b-a;
}
return a;
}
int main()
{
int a[1000][2],t;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>t;
for(int i=0;i<t;i++)f>>a[i][0]>>a[i][1];
for(int i=0;i<t;i++)
{
g<<cmmdc(a[i][0],a[i][1]);
g<<endl;
}
f.close();
g.close();
return 0;
}