Cod sursa(job #1567936)
Utilizator | Data | 13 ianuarie 2016 20:24:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include<fstream>
using namespace std;
int v[40000],a[40000],n;
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int i,r;
in>>n;
for(i=1;i<=n;i++)
{in>>v[i];
in>>a[i];}
for(i=1;i<=n;i++)
{
while(a[i]!=0)
{r=v[i]%a[i];
v[i]=a[i];
a[i]=r;}
out<<v[i]<<"\n";
}
in.close();
out.close();
}