Cod sursa(job #1107342)
Utilizator | Data | 13 februarie 2014 20:40:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int t, i, k=1, x, y;
ifstream a("euclid2.in");
ofstream b("euclid2.out");
a>>t;
int v[2*t+1];
for (i=1; i<=2*t; i++)
a>>v[i];
while (k<=2*t-1)
{
x=v[k]; y=v[k+1];
while (x!=y)
if (x>y)
x=x-y;
else
y=y-x;
b<<x<<endl;
k=k+2;
}
a.close(); b.close();
return 0;
}