Cod sursa(job #1426969)
Utilizator | Data | 1 mai 2015 10:36:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a,int b)
{
while(b != 0)
{
int r=a%b;
a=b;
b=r;
}
return a>0 ? a:-a;
}
int main()
{
ifstream f("date.in");
ofstream g("date.out");
int n,a,b;
f>>n;
for(int i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
}