1.找1-n的3个边互质的三角形。
欧几里得算法判断两两是否互质,假设a,b,c三边,在a
#include<vector>
#include<iostream>
#include<sstream>
#include<string>
#include<set>
#include<algorithm>
#include<map>
#include<utility>
#include<queue>
#include<math.h>
using namespace std;
int gcd(int a, int b)
{
return b == 0 ? a : gcd(b, a%b);
}
int main()
{
int M,N;//M大于0,N小于0
while (cin>>M>>N)
{
if (M + N * 6 < 0)
{
int max = N * 7, mark_i = 0;
for (int i = 1; i < 7; ++i)
{
int mark = i*M + (7 - i)*N;
if (mark<0 && mark>max)
{
max = mark;
mark_i = i;
}
}
cout << mark_i << endl;
cout << (7 - mark_i) * 2 * N + (17 - (7 - mark_i) * 2)*M << endl;
}
else
{
cout << 17 * N << endl;
}
}
return 0;
}