Cod sursa(job #1060362)
Utilizator | Data | 17 decembrie 2013 21:59:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
ifstream f("euclid.in");
ofstream g("euclid.out");
int cmmdc(int x,int y)
{
int c;
while(x>1&&y>1)
{
c=x%y;
if(c==0)
return y;
x=y;
y=c;
}
return 1;
}
int main()
{
int n,x,y;
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
g<<cmmdc(x,y);
}
}