下列问题的C程序 [英] C program for following problem
本文介绍了下列问题的C程序的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
一个正整数n的分区是一个总和为n的正整数序列.用psedocode编写算法,然后实现该算法(用C语言)以打印n的所有非递增分区.
例如.如果n = 4
4
3 1
2 2
2 1 1
1 1 1 1
A partition of a positive integer n is a sequence of positive integers that sum to n. Write an algorithm in psedocode and then implement the algorithm (in C) to print all non-increasing partitions of n.
eg. If n=4
4
3 1
2 2
2 1 1
1 1 1 1
推荐答案
显然,这是一项任务,这里没有人会为您做功课.遇到困难时,请回去问一个问题.
:thumbsup:
Hi,
This is obviously an assignment and no one here will do your homework for you. Have a go and come back with a question when you get stuck.
:thumbsup:
这篇关于下列问题的C程序的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文