Cod sursa(job #1441264)
| Utilizator | Data | 23 mai 2015 23:42:22 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,n;
int cm(int x,int y)
{
if(y==0) return x;
return cm(y,x%y);
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a>>b;
g<<cm(a,b)<<"\n";
}
return 0;
}
