Cod sursa(job #2007669)
| Utilizator | Data | 3 august 2017 17:23:10 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
unsigned long long a[100000],b[100000],cmmdc[100000];
int T,i,j;
int main(){
fin>>T;
for(i=0;i<T;i++)
{
fin>>a[i]>>b[i];
fout<<endl;
}
for(i=0;i<T;i++)
if(a[i]<b[i])
for(j=2;j<a[j];j++)
if(a[i]%j==0&&b[i]%j==0)
cmmdc[i]=j;
for(i=0;i<T;i++)
fout<<cmmdc[i]<<endl;
return 0;
}
