UVa 10696 f91 (water ver.)

麦卡锡F91函数计算程序

最新推荐文章于 2023-03-02 08:51:40 发布

原创最新推荐文章于 2023-03-02 08:51:40 发布 · 1.6k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acm #c++ #UVa

UVa 专栏收录该内容

407 篇文章

订阅专栏

本文介绍了一个用于计算麦卡锡F91函数的程序，该函数定义了在给定正整数N的情况下返回另一个正整数。程序接受一系列不超过1,000,000的正整数作为输入，对于每个输入，它会计算并输出F91(N)的结果，直到遇到输入为0为止。

10696 - f91

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1637

Background

McCarthy is a famous theorician of computer science. In his work, he defined a recursive function, called f91, that takes as input a positive integer N and returns a positive integer defined as follows:

If N ≤ 100, then f91(N) = f91(f91(N+11));
If N ≥ 101, then f91(N) = N-10.

The Problem

Write a program, that computes McCarthy's f91.

The Input

The input tests will consist of a series of positive integers, each integer is at most 1,000,000. There will be at most 250,000 test cases. Each number is on a line on its own. The end of the input is reached when the number 0 is met. The number 0 shall not be considered as part of the test set.

Output

The program shall output each result on a line by its own, following the format given in the sample output.

Sample input

500
91
0

Sample output

f91(500) = 490
f91(91) = 91

完整代码：

/*0.078s*/

#include<cstdio>

int main(void)
{
	int N;
	while (scanf("%d", &N), N)
		if (N <= 100) printf("f91(%d) = 91\n", N);
		else printf("f91(%d) = %d\n", N, N - 10);
	return 0;
}