Cod sursa(job #1747528)
| Utilizator | Data | 25 august 2016 02:18:13 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
long gcd(long a, long b)
{
return ( b == 0 ) ? a : gcd(b,a%b);
}
int main()
{
int nrQueries = 0,a,b;
ifstream inFile("euclid2.in");
ofstream outFile("euclid2.out");
if(!inFile.is_open())
{
outFile<<"Y U No Provide files?";
outFile.close();
return 0;
}
inFile>>nrQueries;
while(nrQueries > 0)
{
inFile>>a>>b;
nrQueries--;
outFile<<gcd(a,b)<<endl;
}
inFile.close();
outFile.close();
return 0;
}
