Anindilyakwa（简单）

最新推荐文章于 2025-08-23 14:13:23 发布

weixin_30737363

最新推荐文章于 2025-08-23 14:13:23 发布

阅读量56

点赞数

CC 4.0 BY-SA版权

文章标签： c/c++

原文链接：http://www.cnblogs.com/cszlg/archive/2012/08/24/2910481.html

本文探讨了澳大利亚原住民安迪利雅克瓦的语言特点，该语言无数字概念。教授布特沃斯在一片草原上放置了三堆石头，要求原住民通过石头数量的差异来判断是否能计数。实验通过原住民指引两堆石头数量差异最小的情况，并带来相应数量的石头返回。文章详细记录了实验过程，最终确定需要回答愚蠢问题的原住民人数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Anindilyakwa

Time Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status Practice URAL 1777

Description

The language of Australian aborigines anindilyakwa has no numerals. No anindilyakwa can say: “I've hooked eight fishes”. Instead, he says: “I've hooked as many fishes as many stones are in this pile”.

Professor Brian Butterworth found a meadow with three piles of stones. He decided to determine whether aborigines can count. Professor asked one of the aborigines to point at two piles with the minimal difference of numbers of stones in them and tell what this difference is. The aborigine pointed correctly! He was unable to express the difference with words, so he went to a shore and returned with a pile of the corresponding number of stones.

Professor decided to continue his experiments with other aborigines, until one of them points at two piles with equal number of stones. All piles that aborigines bring from the shore are left at the meadow. So, the second aborigine will have to deal with one more pile, the one brought by the first aborigine.

Input

The only input line contains space-separated pairwise distinct integers x ₁, x ₂ and x ₃ (1 ≤ x ₁, x ₂, x ₃ ≤ 10 ¹⁸), which are the numbers of stones in piles that were lying on the meadow at the moment professor Butterworth asked the first aborigine.

Output

Output the number of aborigines that will have to answer a stupid question by professor.

Sample Input

input	output
11 5 9	3

Hint

The first aborigine will point at piles of 11 and 9 stones and will bring a pile of two stones. The second aborigine will point at the same piles and will bring another pile of two stones. The third aborigine will point at two piles of two stones, and the experiments will be over.

AC CODE：

 1 //Memory: 288 KB        Time: 31 MS
 2 //Language: C++        Result: Accepted
 3 
 4 #include <iostream>
 5 using namespace std;
 6 
 7 long long Min(long long a, long long b)
 8 {
 9     return a > b ? b : a;
10 }
11 
12 long long Abs(long long a)
13 {
14     return a >= 0 ? a : -a;
15 }
16 
17 int main()
18 {
19     long long x[10000], min;
20     int k;
21     while(cin >> x[0] >> x[1] >> x[2])
22     {
23         min = Min(Abs(x[0] - x[1]), Abs(x[0] - x[2]));
24         min = Min(min, Abs(x[1] - x[2]));
25         k = 3;
26         x[k] = min;
27         while(min)
28         {
29             for(int i = 0; i < k; i++)
30                 min = Min(Abs(x[k] - x[i]), min);
31             if(min)
32                 x[++k] = min;
33         }
34         cout << k - 1 << endl;
35     }
36     return 0;
37 }