文件名称:jj
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.35kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
问题描述:
给定n位正整数a,去掉其中任意k个数字后,剩下的数字按原次序排列成一个新的正整数。
算法设计:
给定n (1<=n<=200)位的正整数a和k,此时,k小于n。
试着设计一个算法,找出删去k个数,剩下数字组成的新数最小的删数方案。-Descr iption of the problem: given n-bit positive integer a, which removed the arbitrary k-figures, the remaining figures as originally arranged in the order of a new positive integer. Algorithm design: a given n (1 <= n <= 200)-bit positive integers a and k, at this time, k is less than n. Try to design an algorithm to find k by deleting the number, the remaining digits of the new cut the number of the smallest programs.
给定n位正整数a,去掉其中任意k个数字后,剩下的数字按原次序排列成一个新的正整数。
算法设计:
给定n (1<=n<=200)位的正整数a和k,此时,k小于n。
试着设计一个算法,找出删去k个数,剩下数字组成的新数最小的删数方案。-Descr iption of the problem: given n-bit positive integer a, which removed the arbitrary k-figures, the remaining figures as originally arranged in the order of a new positive integer. Algorithm design: a given n (1 <= n <= 200)-bit positive integers a and k, at this time, k is less than n. Try to design an algorithm to find k by deleting the number, the remaining digits of the new cut the number of the smallest programs.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建 文本文档 (2).txt
deleted.txt
deleted.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.