UVA - 12119 The Bells are Ringing (枚举)

Description

 

Perhaps you all have heard the mythical story about Tower of Hanoi (The details of this story is not required to solve this problem): “There is a tower of Hanoi with 64 disks and three pegs and the preists make one move everyday and the earth will be destroyed when all the pegs have been moved from one peg to the other following the rules of Tower of Hanoi.” In this problem we deal with a similar story – The story of an ancient temple. The ancient temple has three incredibly large bells. At the beginning of time the three bells rang together. Then the three bells never rang together and when they will ring together again the earth will be destroyed. The three bells have cycle length of t₁, t₂ and t₃ (Here t₁<t₂<t₃ and all are expressed in miliseconds). By this I mean that the first bell rings at every t₁ seconds from the beginning, the second bell rings at every t₂ second from the beginning and the third bell rings at every t₃ second from the beginning. Also note that the difference of the values of t₁, t₂ and t₃ is not that much different so that ordinary people think many time that they are ringing together.

 

Given the time difference between destruction of earth and beginning of time you will have to find the values of t₁, t₂ and t₃.

 

Input

The input file contains at most 600 lines of inputs. Each line contains an integer which denotes (in millisecond) the time difference between the beginning of time and the time of the bells ringing together. Input is terminated by a line containing a single zero. All the input numbers will fit in a 64 bit signed integer.

 

Output

For each line of input produce two lines or more of output. The first line contains the serial of output. Each of the next lines contains three integers which denote the values of t₁, t₂ and t₃ respectively. The value of t₁, t₂ and t₃ is such that t₁<t₂<t₃ and 0<t₁, t₂, t₃≤1000000 and |t₁-t₃|≤25. If you cannot find values of t₁, t₂, t₃ with such constraints then print the line “Such bells don’t exist” instead. In case there is more than one solution sort the output in ascending order of the value of t₁, then (in case of a tie) in the ascending order of the value of t₂ and then (still a tie) in ascending order of the value t₃. Print a blank line after the output for each test case. Look at the output for sample input for details.

 

 

 

 

 

 

 

Sample Input                             Output for Sample Input

10 103 0

Scenario 1: 1 2 5 1 2 10 1 5 10 2 5 10   Scenario 2: Such bells don't exist

---

Problem setter: Shahriar Manzoor, Special Thanks: Derek Kisman

题意：输出整数N，统计有多少组t1,t2,t3，满足：1<t1<t2<t3<=1000000，t3-t1<=25,且t1,t2,t3的最小公倍数是N

思路：枚举，注意j，k的范围，j的范围也要是在i+25里内，否则k是满足不了的

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
typedef long long ll;
using namespace std;
const int maxn = 1000000;

ll gcd(ll a, ll b) {
	return b==0 ? a : gcd(b, a%b);	
}

int main() {
	ll lcm;
	int cas = 1;
	while (scanf("%lld", &lcm) != EOF && lcm) {
		printf("Scenario %d:\n", cas++);
		int flag = 0;
		for (ll i = 1; i <= maxn && i <= lcm; i++) {
			if (lcm % i)
				continue;
			for (ll j = i+1; j-i <= 25; j++) {
				if (lcm % j)
					continue;
				ll tmp = (i * j) / gcd(i, j);
				for (ll k = j+1; k-i <= 25 && k <= maxn; k++) {
					if (lcm % k)
						continue;
					ll ans = (tmp * k) / gcd(tmp, k);
					if (ans == lcm) {
						printf("%lld %lld %lld\n", i, j, k);
						flag = 1;
					}
				}
			}
		}
		if (!flag) 
			printf("Such bells don't exist\n");
		printf("\n");
	}
	return 0;
}