Cod sursa(job #1060802)
Utilizator | Data | 18 decembrie 2013 19:21:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
int cmmdc(int a,int b)
{while(a!=b)if(a>b)a-=b;else b-=a;
return a;
}
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int main()
{
int a,b,t;
f>>t;
for(int i=1;i<=t;i++)
{f>>a>>b;
g<<cmmdc(a,b)<<endl;}
return 0;
}