Cod sursa(job #2146235)
Utilizator | Data | 27 februarie 2018 21:19:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int euclid (int a, int b)
{
int r;
while (b) {
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
long long t,a,b;
fin>>t;
for (int i=1;i<=t;i++) {
fin>>a>>b;
fout<<euclid(a,b)<<"\n";
}
return 0;
}