Cod sursa(job #540244)
| Utilizator |  vlad dobrescu vlad996 |
Data | 23 februarie 2011 20:26:54 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream>
using namespace std;
unsigned long n,p,i,s;
int main()
{ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>t;
for(i=1;i<=t;i++)
f>>a;f>>b;
max=1;
if(a>b) u=a; else u=b;
for(j=1;j<=u;j++)
if(a%j==0&&b%j==0&&j>max)
max=j;
g<<max<<endl;
return 0;}
