Cod sursa(job #699381)
| Utilizator |  Cruciat Lavinia lavinia92 |
Data | 29 februarie 2012 19:05:15 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<iostream>
#include<fstream>
using namespace std;
long cmmdc(long a, long b)
{long l=0;
while(a%b!=0)
{l=a%b; a=b; b=l;}
return b;}
int main()
{long T, a, b, i;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>T;
for(i=1;i<=T;i++)
{f>>a>>b;
g<<cmmdc(a, b)<<'\n';}
return 0;}