Cod sursa(job #534646)
Utilizator | Data | 15 februarie 2011 22:19:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
int cmmdc(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
using namespace std;
int n,a,b,i;
int main ()
{
ifstream f("euclid2.in");
ofstream g("euclud2.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
}