Cod sursa(job #1567195)
Utilizator | Data | 12 ianuarie 2016 23:16:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid (int a, int b)
{
int t;
while (b!=0)
{
t=b;
b=a%b;
a=t;
}
return a;
}
int main()
{
int n,a,b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=0;i<n;i++)
{
f>>a>>b;
g<<euclid(a,b)<<'\n';
}
return 0;
}