[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQZOKrjD6DtGGDfmGDThIAi0Al1pjagCb4NO8XZQTBr4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":29,"type":30},[],"2024-12-21 00:37:12",172740910,[8,9,10,11],"查找法","解析法","穷举法","排序法",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},10,"67283bba0503bdd4c3dc61ca6d7c5acc","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","算法设计与分析","85f12562aceb4a0887b28c6780524e81","穷举法测试题","如果一个4位数恰好等于它的各位数字的四次方之和,则这个数被称为"玫瑰花数".例如1634就是一个玫瑰花数,即\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F63cc681e027cb40b699aca506a3a709c.png\">.如果要求出所有的玫瑰花数,下列算法中合适的是( )",[21,31,40,49,58,63,66,71,80,89],{"answer":22,"createTime":23,"id":24,"options":25,"question":28,"source":29,"type":30},[],"2024-12-21 00:37:11",172740905,[9,26,27,10],"顺序查找算法","递归法","列举所有可能的情况,逐个判断哪些符合问题所要求的条件,从而得到问题的解,这是( )的思路","v1",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],172740906,[35,36,37,38],"一切问题","解的个数极多的问题","解的个数有限且可一一列举的问题","不适合设计算法的问题","穷举法的适用范围是( )",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":29,"type":30},[],172740907,[44,45,46,47],"穷举法是一种适用于解决小规模问题的方法","可作为产生其他有效算法的基础","可作为其他有效算法的衡量标准","以上都正确","以下关于穷举法的描述中正确的是( )",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":29,"type":30},[],172740908,[53,54,55,56],"穷举算法的时间复杂度一般都比较高,在求解问题时不可取","穷举算法的时间复杂度与枚举对象的数目有关,减少枚举对象的数目是提高穷举算法效率的重要手段","穷举算法只能用循环实现","穷举算法不能用递归实现","以下关于穷举算法的描述中正确的是( )",{"answer":59,"createTime":5,"id":60,"options":61,"question":62,"source":29,"type":30},[],172740909,[10,9,27,11],"有100块砖,100个人搬,一个男人搬4块,一个女人搬3块,两个小孩抬一块,要求一次全搬完,问需要男、女、小孩各多少人.该搬砖问题适合采用( )求解",{"answer":64,"createTime":5,"id":6,"options":65,"question":19,"source":29,"type":30},[],[8,9,10,11],{"answer":67,"createTime":5,"id":68,"options":69,"question":70,"source":29,"type":30},[],172740911,[10,9,11,8],"一张单据上有一个5位数的号码67??8,其中百位和十位上的数字看不清楚了,但知道该数能够被78整除,也能被67整除,设计一个算法求出该号码.下列算法中合适的是( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":29,"type":30},[],172740912,[75,76,77,78],"求两个实数之间所有实数的个数","对一个边数少于10的带权有向图求出其中一个顶点到另外一个顶点的所有路径","列出所有的汉字","给定一个三角形的边长求其面积","以下适合采用穷举法求解的是( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":29,"type":30},[],172740913,[84,85,86,87],"n皇后问题","查找某个班最高分的学生的姓名","在n个学生分数中选择总分数为k的m个分数","在一个递增有序的数组中查找一个元素","在采用穷举法求解以下问题时属于组合列举的是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":93,"source":29,"type":30},[],172740914,[84,85,86,87],"在采用穷举法求解以下问题时属于排列列举的是( )"]