Cod sursa(job #553876)
| Utilizator |  Chis Ovidiu Cehashish |
Data | 14 martie 2011 13:15:42 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream.h>
#include<fstream.h>
int n,t,y;
int divi(int r,int a,int b)
{
if(r==0) return b;
else return divi(a%b,b,r);
}
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,t,y)<<endl;
}
f.close();
g.close();
return 1;
}