Cod sursa(job #1662268)
| Utilizator | Data | 24 martie 2016 17:07:28 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,c,t;
bool v[100005],a[2000000005],b[2000000005];
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>t;
for(int i=1;i<=t;i++)
{
f>>a[i];
f>>b[i];
}
for(int i=1;i<=t;i++)
{
while(b[i]!=0)
{
c=a[i]%b[i];
a[i]=b[i];
b[i]=c;
}
v[i]=a[i];
}
for(int i=1;i<=t;i++)
g<<v[i]<<endl;
return 0;
}
