文件名称:f.c
- 所属分类：
- 数学计算/工程计算
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1kb
- 下载次数：
- 0次
- 提 供 者：
- Cynth******
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
Obtaining a sum from a subsequence of digits
Write a program that prompts the user for two numbers: an unsigned long , say digits, and an int, say sum, and outputs the number of ways of selecting digits from digits that sum up to sum. For instance, if digits is 12234 and sum is 5 then there are 4 solutions:
• one solution is obtained by selecting 1 and both occurrences of 2 (1 + 2 + 2 = 5) • one solution is obtained by selecting 1 and 4 (1 + 4 = 5)
• one solution is obtained by selecting the first occurrence of 2 and 3 (2 + 3 = 5)
• one solution is obtained by selecting the second occurrence of 2 and 3 (2 + 3 = 5).-Obtaining a sum from a subsequence of digits
Write a program that prompts the user for two numbers: an unsigned long long, say digits, and an int, say sum, and outputs the number of ways of selecting digits from digits that sum up to sum. For instance, if digits is 12234 and sum is 5 then there are 4 solutions:
• one solution is obtained by selecting 1 and both occurrences of 2 (1+ 2+ 2 = 5) • one solution is obtained by selecting 1 and 4 (1+ 4 = 5)
• one solution is obtained by selecting the first occurrence of 2 and 3 (2+ 3 = 5)
• one solution is obtained by selecting the second occurrence of 2 and 3 (2+ 3 = 5).
Write a program that prompts the user for two numbers: an unsigned long , say digits, and an int, say sum, and outputs the number of ways of selecting digits from digits that sum up to sum. For instance, if digits is 12234 and sum is 5 then there are 4 solutions:
• one solution is obtained by selecting 1 and both occurrences of 2 (1 + 2 + 2 = 5) • one solution is obtained by selecting 1 and 4 (1 + 4 = 5)
• one solution is obtained by selecting the first occurrence of 2 and 3 (2 + 3 = 5)
• one solution is obtained by selecting the second occurrence of 2 and 3 (2 + 3 = 5).-Obtaining a sum from a subsequence of digits
Write a program that prompts the user for two numbers: an unsigned long long, say digits, and an int, say sum, and outputs the number of ways of selecting digits from digits that sum up to sum. For instance, if digits is 12234 and sum is 5 then there are 4 solutions:
• one solution is obtained by selecting 1 and both occurrences of 2 (1+ 2+ 2 = 5) • one solution is obtained by selecting 1 and 4 (1+ 4 = 5)
• one solution is obtained by selecting the first occurrence of 2 and 3 (2+ 3 = 5)
• one solution is obtained by selecting the second occurrence of 2 and 3 (2+ 3 = 5).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
question1.c