Cod sursa(job #1143076)
Utilizator | Meriniuc Razvan- Dumitru meriniucr | Data | 14 martie 2014 18:08:02 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
while(a>0 and b>0)
{
if(a>b) a=a%b;
else b=b%a;
}
return max(a,b);
}
int main()
{
ifstream mama("euclid2.in");
ofstream tata("euclid2.out");
int n,a,b,i;
mama>>n;
for(i=1;i<=n;i++)
{
mama>>a>>b;
tata<<cmmdc(a,b)<<'\n';
}
return 0;
}