Cod sursa(job #1773455)
Utilizator | Data | 7 octombrie 2016 21:16:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in") ;
ofstream g("euclid2.out") ;
int cmmdc ( int a , int b )
{
while(a!= b )
{
if ( a > b )
a = a - b ;
else
b = b - a ;
}
return a ;
}
int main()
{
int n ;
f >> n ;
for ( int i = 1 ; i <= n ; i ++ )
{
int a , b ;
f >> a >> b ;
g << cmmdc(a,b) << endl ;
}
return 0;
}