Cod sursa(job #590883)
| Utilizator | Data | 20 mai 2011 21:35:49 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int a,b,i,n;
int verificare (int a, int b)
{int x,i;
if (a<b)
{x=a;
for (i=x;i>=1;i--)
if (a%i==0&&b%i==0)
break;
return i;}
else
{x=b;
for (i=x;i>=1;i--)
if (a%i==0&&b%i==0)
break;
return i;}}
int main ()
{f>>n;
for (i=1;i<=n;i++)
{f>>a;f>>b;
g<<verificare(a,b)<<'\n';}
}
