Cod sursa(job #627056)

Utilizator manuelciosiciManuel R. Ciosici manuelciosici Data 28 octombrie 2011 22:03:19
Problema Algoritmul lui Euclid Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
/* 
 * File:   main.cpp
 * Author: manuel
 *
 * Created on October 28, 2011, 8:33 PM
 */

#include <cstdlib>
#include <fstream>
#include <iostream>

using namespace std;
int gcd(int a, int b);
/*
 * 
 */

int gcd2(int a, int b){
    int temp;
    while (b != 0){
        temp = a;
        a = b;
        b = temp % a;
    }
    return a;
}

int main(int argc, char** argv) {
    int numberOfPairs = 0;
    ifstream inputFile ("euclid2.in");
    ofstream outputFile ("euclid2.out");
    inputFile >> numberOfPairs;
    int a = 0, b = 0;
    int greatestDivisor = 0;
    for (unsigned short i = 1; i <= numberOfPairs; i++){
        inputFile >> a;
        inputFile >> b;
        greatestDivisor = gcd2(a, b);
        outputFile<<greatestDivisor<<endl;
    }
    inputFile.close();
    outputFile.close();
    return 0;
}



int gcd(int a, int b){
    if (b == 0)
        return a;
    gcd(b, a % b);
}