Cod sursa(job #410912)
Utilizator | Data | 4 martie 2010 17:25:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream.h>
#include<math.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,i,r,v[100001][3];
int main(){
f>>n;
for(int i=1;i<=n;i++){f>>v[i][1]>>v[i][2];
r=v[i][1]%v[i][2];
while(r){v[i][1]=v[i][2];v[i][2]=r;r=v[i][1]%v[i][2];}
g<<v[i][2]<<'\n';}
g.close();
f.close();
return 0;
}