Cod sursa(job #640631)
Utilizator | Data | 26 noiembrie 2011 10:30:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int u(int a,int b)
{int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n[100][200],b,d,i,j;
f>>d;
for(i=1;i<=d;i++)
for(j=1;j<=2;j++)
f>>n[i][j];
for(i=1;i<=d;i++)
g<<u(n[i][1],n[i][2])<<endl;
return 0;
}