Cod sursa(job #553929)
| Utilizator |  Chis Ovidiu Cehashish |
Data | 14 martie 2011 13:45:07 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream.h>
#include<fstream.h>
int n,t,y;
int divi(int a,int b)
{
if(!b) return a;
else return divi(b,a%b);
}
int main()
{
ifstream f;
f.open("euclid2.in");
ofstream g;
g.open("euclid2.out");
f>>n;
for(int i=1;i<=n;i++)
{
f>>t>>y;
g<<divi(t,y)<<'\n';
}
f.close();
g.close();
return 0;
}