Mai intai trebuie sa te autentifici.
Cod sursa(job #1539239)
Utilizator | Data | 30 noiembrie 2015 15:33:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream InF ("euclid2.in");
ofstream OutF ("euclid2.out");
unsigned T,a,b;
unsigned i;
unsigned GCD (unsigned a,unsigned b);
int main()
{ InF>>T;
for (i=1;i<=T;i++)
{
InF>>a>>b;
OutF<<GCD (a,b)<<"\n";
}
return 0;
}
unsigned GCD(unsigned x,unsigned y)
{
unsigned r;
r=0;
while (y!=0)
{r=x%y;
x=y;
y=r;
}
return x;
}