Cod sursa(job #1747142)
Utilizator | Data | 24 august 2016 16:04:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
/* Varianta 60 puncte
*/
int cmmdc(int a, int b)
{
if(a==b)return a;
if(a > b) return (a-b, b);
else return (a, b-a);
}
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
int a, b, n;
f>>n;
for(int i = 0; i < n; i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
}