Cod sursa(job #1443547)
Utilizator | Data | 28 mai 2015 03:22:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
fstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a,int b)
{
while(b)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n,x,y;
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<"\n";
}
return 0;
}