Cod sursa(job #1152758)
Utilizator | Data | 24 martie 2014 22:16:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
fstream f("cmmdc.in", ios::in);
fstream g("cmmdc.out", ios::out);
int c (int a, int b)
{
while(a!=b)
{
if(a>b) a=a-b;
else b=b-a;
}
return a;
}
int main()
{
long long a,b,t;
f >> t >> a >> b;
for (int i=0;i<t;i++)
{
g << c(a,b);
g << endl;
}
return 0;
}