Cod sursa(job #1193120)
| Utilizator | Data | 30 mai 2014 23:24:28 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main(){
int n;
long a,b,r;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(int i=1;i<=n;i++){
fin>>a>>b;
if(b==0)
fout<<a<<'\n';
else{
r=a%b;
while(r){
a=b;
b=r;
r=a%b;
}
fout<<b<<'\n';
}
}
return 0;
}
