编程介的小学生 2018-12-10 03:06 采纳率: 20.5%
浏览 655
已采纳

一个有关于:逻辑推理方面的算法,用C语言解决,谢谢了

Problem Description
Mike has many friends. Here are nine of them: Alice, Bob, Carol, Dave, Eve, Frank, Gloria, Henry and Irene.

Mike is so skillful that he can master n languages (aka. programming languages).

His nine friends are all weaker than he. The sets they can master are all subsets of Mike's languages.

But the relations between the nine friends is very complex. Here are some clues.

  1. Alice is a nice girl, so her subset is a superset of Bob's.
  2. Bob is a naughty boy, so his subset is a superset of Carol's.
  3. Dave is a handsome boy, so his subset is a superset of Eve's.
  4. Eve is an evil girl, so her subset is a superset of Frank's.
  5. Gloria is a cute girl, so her subset is a superset of Henry's.
  6. Henry is a tall boy, so his subset is a superset of Irene's.
  7. Alice is a nice girl, so her subset is a superset of Eve's.
  8. Eve is an evil girl, so her subset is a superset of Carol's.
  9. Dave is a handsome boy, so his subset is a superset of Gloria's.
  10. Gloria is a cute girl, so her subset is a superset of Frank's.
  11. Gloria is a cute girl, so her subset is a superset of Bob's.

Now Mike wants to know, how many situations there might be.

Input
The first line contains an integer T(T≤20) denoting the number of test cases.

For each test case, the first line contains an integer n(0≤n≤3000), denoting the number of languages.

Output
For each test case, output ''Case #t:'' to represent this is the t-th case. And then output the answer.

Sample Input
2
0
2

Sample Output
Case #1: 1
Case #2: 1024

  • 写回答

2条回答

  • threenewbee 2019-06-21 00:05
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥15 lammps拉伸应力应变曲线分析
  • ¥15 C++ 头文件/宏冲突问题解决
  • ¥15 用comsol模拟大气湍流通过底部加热(温度不同)的腔体
  • ¥50 安卓adb backup备份子用户应用数据失败
  • ¥20 有人能用聚类分析帮我分析一下文本内容嘛
  • ¥15 请问Lammps做复合材料拉伸模拟,应力应变曲线问题
  • ¥30 python代码,帮调试,帮帮忙吧
  • ¥15 #MATLAB仿真#车辆换道路径规划
  • ¥15 java 操作 elasticsearch 8.1 实现 索引的重建
  • ¥15 数据可视化Python