Cod sursa(job #1383766)
Utilizator | Data | 10 martie 2015 17:00:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include<fstream>
using namespace std;
int euclid(long a,long b)
{while(a!=b)
if(a>b)
a=a-b;
else
b=b-a;
return a;
}
int main()
{ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t,a,b;
f>>t;
for(int i=1;i<=t;i++)
{f>>a>>b;
g<<euclid(a,b)<<"\n";}
return 0;
}