Cod sursa(job #998391)
| Utilizator | Data | 16 septembrie 2013 21:48:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int CMMDC(int a, int b)
{
while(b != 0)
{
int t = b;
b = a % b;
a = t;
}
return a;
}
int main()
{
ifstream fisierCitire ("euclid2.in");
ofstream fisierIesire ("euclid2.out");
int contor;
int a,b;
fisierCitire >> contor;
for (int i=0; i<contor; i++)
fisierCitire>>a;
fisierCitire>>b;
fisierIesire<<CMMDC(a,b)<<endl;
}
fisierIesire.close();
}
