Cod sursa(job #1581401)
Utilizator | Data | 26 ianuarie 2016 19:50:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int v[100005],t[100005];
int main()
{
int n,i,r=1;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
f>>t[i];
}
for(i=1;i<=n;i++)
{
r=1;
while(r!=0)
{
r=v[i]%t[i];
v[i]=t[i];
t[i]=r;
}
g<<v[i]<<endl;
}
return 0;
}