Pagini recente » Borderou de evaluare (job #2611363) | Cod sursa (job #489015) | Cod sursa (job #457632) | Cod sursa (job #763442) | Cod sursa (job #770495)
Cod sursa(job #770495)
#include <iostream>
#include <fstream>
//#include <math.h>
using namespace std;
#include "../utils/PerformanceTimer.h"
//returns the greatest common divisior
int gcd(int a, int b)
{
int a1 = max(a, b);
int b1 = min(a, b);
int r = b1;
while (r != 0)
{
r = a1%b1;
a1 = b1;
b1 = r;
}
return a1;
}
//int e_000_euclid()
int main()
{
PerformanceTimer timer;
timer.init();
char* in_file = "euclid2.in";
char* out_file = "euclid2.out";
int T;
ifstream ifs(in_file);
ofstream ofs(out_file);
ifs>>T;
for (int i = 0; i < T; i++)
{
int a, b;
ifs>>a>>b;
ofs<<gcd(a, b)<<"\n";
}
ifs.close();
ofs.close();
cout<<timer.getElapsedTime()<<endl;
return 0;
}