Cod sursa(job #1383776)
Utilizator | Data | 10 martie 2015 17:06:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
int euclid(long a,long b)
{int c;
while(b)
{c=a%b;
a=b;
b=c;}
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;
}