HOJ1987 Recursive Function

最新推荐文章于 2020-03-21 22:56:50 发布

码蹄疾

最新推荐文章于 2020-03-21 22:56:50 发布

阅读量1k

点赞数

分类专栏： Data structure and Algorithm 文章标签： function input each output tags

本文链接：https://blog.csdn.net/hit1110310422/article/details/8014709

版权

Data structure and Algorithm 专栏收录该内容

58 篇文章 2 订阅

订阅专栏

Recursive Function

My Tags	(Edit)

	Source : SCU Programming Contest 2005 Preliminary
	Time limit : 1 sec		Memory limit : 32 M

Submitted : 12941, Accepted : 3290

Function f(n) is recursively defined as:

f(n) = f(n-1) + f(n-3), n > 3
f(n) = n, n <= 3

Write a program to calculate f(n) modulo m.

n <= 10000, 2 <= m <= 10000.

Input

There are multiple test cases. Each test case consists of two integers: n and m. n = 0 and m = 0 denotes the end of input, and you should not process this case.

Output

For each test case, print f(n) modulo m in a single line.

Sample Input

1 2
10000 999
0 0

Sample Output

1
433

Author: wiltord

/*注意n<0的情况*/
#include <iostream>
#include<stdio.h>
using namespace std;
#define MAX 10000
int  a[MAX+1];
int main()
{
    int n,m,i;
    while(cin >> n >> m && (n!=0||m!=0))
    {
        if(n < 0)
        {
            while(n < 0)
            {
                n += m;
            }
           cout << n%m << endl;
        }
        else
        {
            for(i=0; i<=n; i++)
            {
                if(i < 4)   a[i]=i%m;
                else a[i]=(a[i-1]+a[i-3])%m;
            }
           cout << a[n] << endl;
        }
    }
    return 0;
}