UVA12119 - The Bells are Ringing

链接

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3271

题解

显然$t_1,t_2,t_3$都是$N$的约数，且不大于$1000000$
那我就找出所有这样的约数，然后枚举就行了
这题要注意的一个坑点就是:
样例给出的Such bells don’t exist中的单引号格式是全角单引号，而提交的程序中必须使用半角单引号才能$AC$

代码

//数学
#include <bits/stdc++.h>
#define maxn 1000010
#define ll long long
using namespace std;
ll N, lis[maxn], ans;
void init()
{
	ll i;
	*lis=0;
	for(i=1;i<=N and i<=1000000;i++)if(N%i==0)lis[++*lis]=i;
}
ll gcd(ll a, ll b){return !b?a:gcd(b,a%b);}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}
ll lcm(ll a, ll b, ll c){return lcm(lcm(a,b),c);}
int main()
{
	ll i, j, k, flag, kase=0;
	while(scanf("%lld",&N),N)
	{
		printf("Scenario %lld:\n",++kase);
		init();
		flag=0;
		for(i=1;i<=*lis;i++)for(j=i+1;j<=*lis and lis[j]-lis[i]<=25;j++)for(k=j+1;k<=*lis and lis[k]-lis[i]<=25;k++)
			if(lcm(lis[i],lis[j],lis[k])==N)printf("%lld %lld %lld\n",lis[i],lis[j],lis[k]), flag=1;
		if(!flag)printf("Such bells don't exist\n");
		printf("\n");
	}
	return 0;
}