黑龙江省第七届大学生程序设计竞赛-Heap

最新推荐文章于 2023-04-03 20:24:20 发布

吃葡萄不吐葡萄皮丿

最新推荐文章于 2023-04-03 20:24:20 发布

阅读量2k

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/zhangweiacm/article/details/10913475

水题专栏收录该内容

61 篇文章

订阅专栏

本博客探讨了如何计算具有N个整数的不同N节点堆的数量，并提供了实现该计算的代码示例。

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

描述

A heap is a full binary tree; for each node, its key is greater than its two sub-node’s key. Two heaps are different if there are two nodes which have different keys at the same location. Now we have a problem for you: tell me how many different N-Nodes heaps we can make with N integers?

输入

There are many test cases; for each test case, one line contains only one integer N (1<=N<=1000000) indicating how many nodes the heap has.

输出

For each test case, output one line contains an integer indicating the number of the kinds of the heaps. Because the result might be very large, you can just output the result modular 20000003.

样例输入

1
2
3

样例输出

1
1
2

#include<iostream>
#include<cstdio>
#define MX 1000010
using namespace std;
__int64 a[MX];
int main()
{
     __int64 i;
     __int64 n=5;
     a[1]=1;a[2]=1;
     for(i=3;i<MX-1;i++)
        a[i]=(a[i-1]+a[i-2])%20000003;
     while(~scanf("%lld",&n))
     {
       //  cout<<a[n]<<endl;
         printf("%lld\n",a[n]);
     }
     return 0;
}