Cod sursa(job #1120805)
Utilizator | Data | 25 februarie 2014 10:15:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int cmmdc(int a, int b)
{
int t;
while(b!=0)
{
t=b;
b=a%b;
a=t;
}
return a;
}
int main()
{
int t,i,a,b;
f>>t;
for(i=0;i<t;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
}