小学奥数编程题（4）

最新推荐文章于 2022-09-28 10:55:03 发布
最新推荐文章于 2022-09-28 10:55:03 发布
阅读量657 收藏
点赞数
分类专栏： 写给喜欢编程的小朋友 文章标签： java 奥数 排列组合
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/yujiaao/article/details/84759352
版权
:x 题目：
ABCDE FGHIJ 为0~9的不同数字组成的两个数,首数字不为零,具有两倍关系, 即FGHIJ=2*ABCDE,问ABCDE在所有可能数里,最大和最小数是多少? :wink:

需要的类库可以从 https://github.com/raistlic/raistlic-lib-commons-core 下载

编程解法： :arrow: :arrow: 


import org.raistlic.common.permutation.Combination;
import org.raistlic.common.permutation.Permutation;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * ABCDE FGHIJ 为0~9的不同数字组成的两个数,首数字不为零,具有两倍关系, 即FGHIJ=2XABCDE,问ABCDE在所有可能数里,最大和最小数是多少?
 * Created by xwx on 16/1/2.
 */
public class NumMax {

        static  long min = Long.MAX_VALUE;
        static  long max = Long.MIN_VALUE;

        public static void main(String[] args) {

            System.out.println("===== demo Combination :");

            final List<Integer> full_list = Arrays.asList(0, 1, 2, 3, 4, 5, 6, 7, 8, 9);

            for(List<Integer> list : Combination.of(full_list,5)){

                List<Integer> list2 = new ArrayList<Integer>();
                list2.addAll(full_list);
                list2.removeAll(list);

                System.out.println(list+"-"+list2);

                for(List<Integer> slist1:Permutation.of(list))
                   for(List<Integer> slist2:Permutation.of(list2))
                      isAnswer(slist1, slist2);

            }

            System.out.println("min = " + min + " : " + (min * 2) + " max=" + max +" : "+ (max * 2));

        }

        public static int  sum( List<Integer> list){
            return  list.get(0)+
                    list.get(1)*10+
                    list.get(2)*100+
                    list.get(3)*1000+
                    list.get(4)*10000;
        }

        public static boolean isAnswer(List<Integer> list1, List<Integer> list2){
            if(list1.get(4)==0 || list2.get(4) ==0) return false;
            if(list1.get(4)>4 || list2.get(4) <2) return false;

            long presum  = sum(list1);
            long thissum = sum(list2);
            if(2*presum == thissum) {
                System.out.println("ABCDE=" + presum + " FGHIJ=" + thissum);
                if(min>presum) min = presum;
                if(max<presum) max = presum;
                return true;
            }
            return false;
        }

}




本程序采用maven进行编译 

<?xml version="1.0" encoding="UTF-8"?>
<project xmlns="http://maven.apache.org/POM/4.0.0"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
    <modelVersion>4.0.0</modelVersion>

    <groupId>so.qsn</groupId>
    <artifactId>mathtests</artifactId>
    <version>1.0-SNAPSHOT</version>
<dependencies>
    <dependency>
        <groupId>org.raistlic.lib</groupId>
        <artifactId>commons-core</artifactId>
        <version>1.4-SNAPSHOT</version>
    </dependency>

</dependencies>

</project>



打印的结果为：
===== demo Combination :
[0, 1, 2, 3, 4]-[5, 6, 7, 8, 9]
[0, 1, 2, 3, 5]-[4, 6, 7, 8, 9]
[0, 1, 2, 3, 6]-[4, 5, 7, 8, 9]
[0, 1, 2, 3, 7]-[4, 5, 6, 8, 9]
[0, 1, 2, 3, 8]-[4, 5, 6, 7, 9]
[0, 1, 2, 3, 9]-[4, 5, 6, 7, 8]
[0, 1, 2, 4, 5]-[3, 6, 7, 8, 9]
[0, 1, 2, 4, 6]-[3, 5, 7, 8, 9]
[0, 1, 2, 4, 7]-[3, 5, 6, 8, 9]
[0, 1, 2, 4, 8]-[3, 5, 6, 7, 9]
[0, 1, 2, 4, 9]-[3, 5, 6, 7, 8]
[0, 1, 2, 5, 6]-[3, 4, 7, 8, 9]
[0, 1, 2, 5, 7]-[3, 4, 6, 8, 9]
[0, 1, 2, 5, 8]-[3, 4, 6, 7, 9]
[0, 1, 2, 5, 9]-[3, 4, 6, 7, 8]
[0, 1, 2, 6, 7]-[3, 4, 5, 8, 9]
[0, 1, 2, 6, 8]-[3, 4, 5, 7, 9]
[0, 1, 2, 6, 9]-[3, 4, 5, 7, 8]
[0, 1, 2, 7, 8]-[3, 4, 5, 6, 9]
[0, 1, 2, 7, 9]-[3, 4, 5, 6, 8]
[0, 1, 2, 8, 9]-[3, 4, 5, 6, 7]
[0, 1, 3, 4, 5]-[2, 6, 7, 8, 9]
[0, 1, 3, 4, 6]-[2, 5, 7, 8, 9]
[0, 1, 3, 4, 7]-[2, 5, 6, 8, 9]
[0, 1, 3, 4, 8]-[2, 5, 6, 7, 9]
[0, 1, 3, 4, 9]-[2, 5, 6, 7, 8]
[0, 1, 3, 5, 6]-[2, 4, 7, 8, 9]
[0, 1, 3, 5, 7]-[2, 4, 6, 8, 9]
[0, 1, 3, 5, 8]-[2, 4, 6, 7, 9]
[0, 1, 3, 5, 9]-[2, 4, 6, 7, 8]
[0, 1, 3, 6, 7]-[2, 4, 5, 8, 9]
[0, 1, 3, 6, 8]-[2, 4, 5, 7, 9]
[0, 1, 3, 6, 9]-[2, 4, 5, 7, 8]
[0, 1, 3, 7, 8]-[2, 4, 5, 6, 9]
[0, 1, 3, 7, 9]-[2, 4, 5, 6, 8]
[0, 1, 3, 8, 9]-[2, 4, 5, 6, 7]
[0, 1, 4, 5, 6]-[2, 3, 7, 8, 9]
[0, 1, 4, 5, 7]-[2, 3, 6, 8, 9]
[0, 1, 4, 5, 8]-[2, 3, 6, 7, 9]
[0, 1, 4, 5, 9]-[2, 3, 6, 7, 8]
[0, 1, 4, 6, 7]-[2, 3, 5, 8, 9]
[0, 1, 4, 6, 8]-[2, 3, 5, 7, 9]
[0, 1, 4, 6, 9]-[2, 3, 5, 7, 8]
[0, 1, 4, 7, 8]-[2, 3, 5, 6, 9]
[0, 1, 4, 7, 9]-[2, 3, 5, 6, 8]
[0, 1, 4, 8, 9]-[2, 3, 5, 6, 7]
[0, 1, 5, 6, 7]-[2, 3, 4, 8, 9]
[0, 1, 5, 6, 8]-[2, 3, 4, 7, 9]
[0, 1, 5, 6, 9]-[2, 3, 4, 7, 8]
[0, 1, 5, 7, 8]-[2, 3, 4, 6, 9]
[0, 1, 5, 7, 9]-[2, 3, 4, 6, 8]
[0, 1, 5, 8, 9]-[2, 3, 4, 6, 7]
[0, 1, 6, 7, 8]-[2, 3, 4, 5, 9]
[0, 1, 6, 7, 9]-[2, 3, 4, 5, 8]
[0, 1, 6, 8, 9]-[2, 3, 4, 5, 7]
[0, 1, 7, 8, 9]-[2, 3, 4, 5, 6]
[0, 2, 3, 4, 5]-[1, 6, 7, 8, 9]
[0, 2, 3, 4, 6]-[1, 5, 7, 8, 9]
[0, 2, 3, 4, 7]-[1, 5, 6, 8, 9]
[0, 2, 3, 4, 8]-[1, 5, 6, 7, 9]
[0, 2, 3, 4, 9]-[1, 5, 6, 7, 8]
[0, 2, 3, 5, 6]-[1, 4, 7, 8, 9]
[0, 2, 3, 5, 7]-[1, 4, 6, 8, 9]
[0, 2, 3, 5, 8]-[1, 4, 6, 7, 9]
[0, 2, 3, 5, 9]-[1, 4, 6, 7, 8]
[0, 2, 3, 6, 7]-[1, 4, 5, 8, 9]
[0, 2, 3, 6, 8]-[1, 4, 5, 7, 9]
[0, 2, 3, 6, 9]-[1, 4, 5, 7, 8]
[0, 2, 3, 7, 8]-[1, 4, 5, 6, 9]
[0, 2, 3, 7, 9]-[1, 4, 5, 6, 8]
ABCDE=30792 FGHIJ=61584
ABCDE=29073 FGHIJ=58146
ABCDE=27093 FGHIJ=54186
ABCDE=20793 FGHIJ=41586
ABCDE=29307 FGHIJ=58614
ABCDE=32907 FGHIJ=65814
ABCDE=30927 FGHIJ=61854
ABCDE=27309 FGHIJ=54618
ABCDE=32709 FGHIJ=65418
ABCDE=30729 FGHIJ=61458
ABCDE=32079 FGHIJ=64158
ABCDE=23079 FGHIJ=46158
[0, 2, 3, 8, 9]-[1, 4, 5, 6, 7]
[0, 2, 4, 5, 6]-[1, 3, 7, 8, 9]
[0, 2, 4, 5, 7]-[1, 3, 6, 8, 9]
[0, 2, 4, 5, 8]-[1, 3, 6, 7, 9]
[0, 2, 4, 5, 9]-[1, 3, 6, 7, 8]
[0, 2, 4, 6, 7]-[1, 3, 5, 8, 9]
[0, 2, 4, 6, 8]-[1, 3, 5, 7, 9]
[0, 2, 4, 6, 9]-[1, 3, 5, 7, 8]
[0, 2, 4, 7, 8]-[1, 3, 5, 6, 9]
[0, 2, 4, 7, 9]-[1, 3, 5, 6, 8]
[0, 2, 4, 8, 9]-[1, 3, 5, 6, 7]
[0, 2, 5, 6, 7]-[1, 3, 4, 8, 9]
[0, 2, 5, 6, 8]-[1, 3, 4, 7, 9]
[0, 2, 5, 6, 9]-[1, 3, 4, 7, 8]
[0, 2, 5, 7, 8]-[1, 3, 4, 6, 9]
[0, 2, 5, 7, 9]-[1, 3, 4, 6, 8]
[0, 2, 5, 8, 9]-[1, 3, 4, 6, 7]
[0, 2, 6, 7, 8]-[1, 3, 4, 5, 9]
[0, 2, 6, 7, 9]-[1, 3, 4, 5, 8]
ABCDE=26907 FGHIJ=53814
ABCDE=29067 FGHIJ=58134
ABCDE=26709 FGHIJ=53418
ABCDE=27069 FGHIJ=54138
ABCDE=20769 FGHIJ=41538
ABCDE=20679 FGHIJ=41358
[0, 2, 6, 8, 9]-[1, 3, 4, 5, 7]
[0, 2, 7, 8, 9]-[1, 3, 4, 5, 6]
[0, 3, 4, 5, 6]-[1, 2, 7, 8, 9]
[0, 3, 4, 5, 7]-[1, 2, 6, 8, 9]
[0, 3, 4, 5, 8]-[1, 2, 6, 7, 9]
[0, 3, 4, 5, 9]-[1, 2, 6, 7, 8]
[0, 3, 4, 6, 7]-[1, 2, 5, 8, 9]
[0, 3, 4, 6, 8]-[1, 2, 5, 7, 9]
[0, 3, 4, 6, 9]-[1, 2, 5, 7, 8]
[0, 3, 4, 7, 8]-[1, 2, 5, 6, 9]
[0, 3, 4, 7, 9]-[1, 2, 5, 6, 8]
[0, 3, 4, 8, 9]-[1, 2, 5, 6, 7]
[0, 3, 5, 6, 7]-[1, 2, 4, 8, 9]
[0, 3, 5, 6, 8]-[1, 2, 4, 7, 9]
[0, 3, 5, 6, 9]-[1, 2, 4, 7, 8]
[0, 3, 5, 7, 8]-[1, 2, 4, 6, 9]
[0, 3, 5, 7, 9]-[1, 2, 4, 6, 8]
[0, 3, 5, 8, 9]-[1, 2, 4, 6, 7]
[0, 3, 6, 7, 8]-[1, 2, 4, 5, 9]
[0, 3, 6, 7, 9]-[1, 2, 4, 5, 8]
[0, 3, 6, 8, 9]-[1, 2, 4, 5, 7]
[0, 3, 7, 8, 9]-[1, 2, 4, 5, 6]
[0, 4, 5, 6, 7]-[1, 2, 3, 8, 9]
[0, 4, 5, 6, 8]-[1, 2, 3, 7, 9]
[0, 4, 5, 6, 9]-[1, 2, 3, 7, 8]
[0, 4, 5, 7, 8]-[1, 2, 3, 6, 9]
[0, 4, 5, 7, 9]-[1, 2, 3, 6, 8]
[0, 4, 5, 8, 9]-[1, 2, 3, 6, 7]
[0, 4, 6, 7, 8]-[1, 2, 3, 5, 9]
[0, 4, 6, 7, 9]-[1, 2, 3, 5, 8]
[0, 4, 6, 8, 9]-[1, 2, 3, 5, 7]
[0, 4, 7, 8, 9]-[1, 2, 3, 5, 6]
[0, 5, 6, 7, 8]-[1, 2, 3, 4, 9]
[0, 5, 6, 7, 9]-[1, 2, 3, 4, 8]
[0, 5, 6, 8, 9]-[1, 2, 3, 4, 7]
[0, 5, 7, 8, 9]-[1, 2, 3, 4, 6]
[0, 6, 7, 8, 9]-[1, 2, 3, 4, 5]
[1, 2, 3, 4, 5]-[0, 6, 7, 8, 9]
[1, 2, 3, 4, 6]-[0, 5, 7, 8, 9]
[1, 2, 3, 4, 7]-[0, 5, 6, 8, 9]
[1, 2, 3, 4, 8]-[0, 5, 6, 7, 9]
[1, 2, 3, 4, 9]-[0, 5, 6, 7, 8]
[1, 2, 3, 5, 6]-[0, 4, 7, 8, 9]
[1, 2, 3, 5, 7]-[0, 4, 6, 8, 9]
[1, 2, 3, 5, 8]-[0, 4, 6, 7, 9]
[1, 2, 3, 5, 9]-[0, 4, 6, 7, 8]
[1, 2, 3, 6, 7]-[0, 4, 5, 8, 9]
[1, 2, 3, 6, 8]-[0, 4, 5, 7, 9]
[1, 2, 3, 6, 9]-[0, 4, 5, 7, 8]
[1, 2, 3, 7, 8]-[0, 4, 5, 6, 9]
[1, 2, 3, 7, 9]-[0, 4, 5, 6, 8]
[1, 2, 3, 8, 9]-[0, 4, 5, 6, 7]
[1, 2, 4, 5, 6]-[0, 3, 7, 8, 9]
[1, 2, 4, 5, 7]-[0, 3, 6, 8, 9]
[1, 2, 4, 5, 8]-[0, 3, 6, 7, 9]
[1, 2, 4, 5, 9]-[0, 3, 6, 7, 8]
[1, 2, 4, 6, 7]-[0, 3, 5, 8, 9]
[1, 2, 4, 6, 8]-[0, 3, 5, 7, 9]
[1, 2, 4, 6, 9]-[0, 3, 5, 7, 8]
[1, 2, 4, 7, 8]-[0, 3, 5, 6, 9]
[1, 2, 4, 7, 9]-[0, 3, 5, 6, 8]
[1, 2, 4, 8, 9]-[0, 3, 5, 6, 7]
[1, 2, 5, 6, 7]-[0, 3, 4, 8, 9]
[1, 2, 5, 6, 8]-[0, 3, 4, 7, 9]
[1, 2, 5, 6, 9]-[0, 3, 4, 7, 8]
[1, 2, 5, 7, 8]-[0, 3, 4, 6, 9]
[1, 2, 5, 7, 9]-[0, 3, 4, 6, 8]
[1, 2, 5, 8, 9]-[0, 3, 4, 6, 7]
[1, 2, 6, 7, 8]-[0, 3, 4, 5, 9]
[1, 2, 6, 7, 9]-[0, 3, 4, 5, 8]
[1, 2, 6, 8, 9]-[0, 3, 4, 5, 7]
[1, 2, 7, 8, 9]-[0, 3, 4, 5, 6]
[1, 3, 4, 5, 6]-[0, 2, 7, 8, 9]
[1, 3, 4, 5, 7]-[0, 2, 6, 8, 9]
[1, 3, 4, 5, 8]-[0, 2, 6, 7, 9]
ABCDE=48531 FGHIJ=97062
ABCDE=48351 FGHIJ=96702
ABCDE=38451 FGHIJ=76902
ABCDE=34851 FGHIJ=69702
ABCDE=45381 FGHIJ=90762
ABCDE=35481 FGHIJ=70962
ABCDE=48513 FGHIJ=97026
ABCDE=14853 FGHIJ=29706
ABCDE=48135 FGHIJ=96270
ABCDE=14835 FGHIJ=29670
ABCDE=38145 FGHIJ=76290
ABCDE=13845 FGHIJ=27690
ABCDE=31485 FGHIJ=62970
ABCDE=13485 FGHIJ=26970
ABCDE=45138 FGHIJ=90276
ABCDE=14538 FGHIJ=29076
ABCDE=35148 FGHIJ=70296
ABCDE=13548 FGHIJ=27096
[1, 3, 4, 5, 9]-[0, 2, 6, 7, 8]
[1, 3, 4, 6, 7]-[0, 2, 5, 8, 9]
[1, 3, 4, 6, 8]-[0, 2, 5, 7, 9]
[1, 3, 4, 6, 9]-[0, 2, 5, 7, 8]
[1, 3, 4, 7, 8]-[0, 2, 5, 6, 9]
[1, 3, 4, 7, 9]-[0, 2, 5, 6, 8]
[1, 3, 4, 8, 9]-[0, 2, 5, 6, 7]
[1, 3, 5, 6, 7]-[0, 2, 4, 8, 9]
[1, 3, 5, 6, 8]-[0, 2, 4, 7, 9]
[1, 3, 5, 6, 9]-[0, 2, 4, 7, 8]
[1, 3, 5, 7, 8]-[0, 2, 4, 6, 9]
[1, 3, 5, 7, 9]-[0, 2, 4, 6, 8]
[1, 3, 5, 8, 9]-[0, 2, 4, 6, 7]
[1, 3, 6, 7, 8]-[0, 2, 4, 5, 9]
[1, 3, 6, 7, 9]-[0, 2, 4, 5, 8]
[1, 3, 6, 8, 9]-[0, 2, 4, 5, 7]
[1, 3, 7, 8, 9]-[0, 2, 4, 5, 6]
[1, 4, 5, 6, 7]-[0, 2, 3, 8, 9]
[1, 4, 5, 6, 8]-[0, 2, 3, 7, 9]
ABCDE=48651 FGHIJ=97302
ABCDE=46851 FGHIJ=93702
ABCDE=48615 FGHIJ=97230
ABCDE=18645 FGHIJ=37290
ABCDE=14865 FGHIJ=29730
ABCDE=46185 FGHIJ=92370
ABCDE=16485 FGHIJ=32970
ABCDE=14685 FGHIJ=29370
ABCDE=48516 FGHIJ=97032
ABCDE=18546 FGHIJ=37092
ABCDE=45186 FGHIJ=90372
ABCDE=15486 FGHIJ=30972
[1, 4, 5, 6, 9]-[0, 2, 3, 7, 8]
[1, 4, 5, 7, 8]-[0, 2, 3, 6, 9]
[1, 4, 5, 7, 9]-[0, 2, 3, 6, 8]
[1, 4, 5, 8, 9]-[0, 2, 3, 6, 7]
[1, 4, 6, 7, 8]-[0, 2, 3, 5, 9]
[1, 4, 6, 7, 9]-[0, 2, 3, 5, 8]
[1, 4, 6, 8, 9]-[0, 2, 3, 5, 7]
[1, 4, 7, 8, 9]-[0, 2, 3, 5, 6]
[1, 5, 6, 7, 8]-[0, 2, 3, 4, 9]
[1, 5, 6, 7, 9]-[0, 2, 3, 4, 8]
[1, 5, 6, 8, 9]-[0, 2, 3, 4, 7]
[1, 5, 7, 8, 9]-[0, 2, 3, 4, 6]
[1, 6, 7, 8, 9]-[0, 2, 3, 4, 5]
[2, 3, 4, 5, 6]-[0, 1, 7, 8, 9]
[2, 3, 4, 5, 7]-[0, 1, 6, 8, 9]
[2, 3, 4, 5, 8]-[0, 1, 6, 7, 9]
[2, 3, 4, 5, 9]-[0, 1, 6, 7, 8]
[2, 3, 4, 6, 7]-[0, 1, 5, 8, 9]
[2, 3, 4, 6, 8]-[0, 1, 5, 7, 9]
[2, 3, 4, 6, 9]-[0, 1, 5, 7, 8]
[2, 3, 4, 7, 8]-[0, 1, 5, 6, 9]
[2, 3, 4, 7, 9]-[0, 1, 5, 6, 8]
[2, 3, 4, 8, 9]-[0, 1, 5, 6, 7]
[2, 3, 5, 6, 7]-[0, 1, 4, 8, 9]
[2, 3, 5, 6, 8]-[0, 1, 4, 7, 9]
[2, 3, 5, 6, 9]-[0, 1, 4, 7, 8]
[2, 3, 5, 7, 8]-[0, 1, 4, 6, 9]
[2, 3, 5, 7, 9]-[0, 1, 4, 6, 8]
[2, 3, 5, 8, 9]-[0, 1, 4, 6, 7]
[2, 3, 6, 7, 8]-[0, 1, 4, 5, 9]
[2, 3, 6, 7, 9]-[0, 1, 4, 5, 8]
[2, 3, 6, 8, 9]-[0, 1, 4, 5, 7]
[2, 3, 7, 8, 9]-[0, 1, 4, 5, 6]
[2, 4, 5, 6, 7]-[0, 1, 3, 8, 9]
[2, 4, 5, 6, 8]-[0, 1, 3, 7, 9]
[2, 4, 5, 6, 9]-[0, 1, 3, 7, 8]
[2, 4, 5, 7, 8]-[0, 1, 3, 6, 9]
[2, 4, 5, 7, 9]-[0, 1, 3, 6, 8]
[2, 4, 5, 8, 9]-[0, 1, 3, 6, 7]
[2, 4, 6, 7, 8]-[0, 1, 3, 5, 9]
[2, 4, 6, 7, 9]-[0, 1, 3, 5, 8]
[2, 4, 6, 8, 9]-[0, 1, 3, 5, 7]
[2, 4, 7, 8, 9]-[0, 1, 3, 5, 6]
[2, 5, 6, 7, 8]-[0, 1, 3, 4, 9]
[2, 5, 6, 7, 9]-[0, 1, 3, 4, 8]
[2, 5, 6, 8, 9]-[0, 1, 3, 4, 7]
[2, 5, 7, 8, 9]-[0, 1, 3, 4, 6]
[2, 6, 7, 8, 9]-[0, 1, 3, 4, 5]
[3, 4, 5, 6, 7]-[0, 1, 2, 8, 9]
[3, 4, 5, 6, 8]-[0, 1, 2, 7, 9]
[3, 4, 5, 6, 9]-[0, 1, 2, 7, 8]
[3, 4, 5, 7, 8]-[0, 1, 2, 6, 9]
[3, 4, 5, 7, 9]-[0, 1, 2, 6, 8]
[3, 4, 5, 8, 9]-[0, 1, 2, 6, 7]
[3, 4, 6, 7, 8]-[0, 1, 2, 5, 9]
[3, 4, 6, 7, 9]-[0, 1, 2, 5, 8]
[3, 4, 6, 8, 9]-[0, 1, 2, 5, 7]
[3, 4, 7, 8, 9]-[0, 1, 2, 5, 6]
[3, 5, 6, 7, 8]-[0, 1, 2, 4, 9]
[3, 5, 6, 7, 9]-[0, 1, 2, 4, 8]
[3, 5, 6, 8, 9]-[0, 1, 2, 4, 7]
[3, 5, 7, 8, 9]-[0, 1, 2, 4, 6]
[3, 6, 7, 8, 9]-[0, 1, 2, 4, 5]
[4, 5, 6, 7, 8]-[0, 1, 2, 3, 9]
[4, 5, 6, 7, 9]-[0, 1, 2, 3, 8]
[4, 5, 6, 8, 9]-[0, 1, 2, 3, 7]
[4, 5, 7, 8, 9]-[0, 1, 2, 3, 6]
[4, 6, 7, 8, 9]-[0, 1, 2, 3, 5]
[5, 6, 7, 8, 9]-[0, 1, 2, 3, 4]

min = 13485 : 26970 max=48651 : 97302
COCO_AS
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
小学生计算机编程题,真题|小学组倒数第二道编程题，做不出来罚你点赞三遍！...
weixin_32459553的博客
07-21 1169
原标题：真题|小学组倒数第二道编程题，做不出来罚你点赞三遍！十年前，当我们还是小学生的时候，碰到电脑你们都会干什么？是熟练地在网址栏输入www.4399.com，然后一个接一个的点开网页小游戏，还是玩玩电脑自带的蜘蛛纸牌、扫雷、弹珠。但无论是哪个，我想肯定都不会是编程。 当然，这是我们的时代，跟现在的小学生肯定不同，跟新一代优秀的小学生们相比，我们英语被虐、游戏被虐、化妆被虐，现在居然连编程这样高...
一个简单的奥数题，用编程找到灵感
weixin_45221012的博客
09-16 409
递归函数。 数学规律。
c语言 奥数题目及答案,小学奥数题C语言解法
weixin_42361133的博客
05-19 607
朋友给我发了一个小学的奥数题，尝试解了一会儿没有找到方法，于是编辑了一个小程序解决了 上面的是题目下面的是实现的代码，仅做参考#include #ifdef __cplusplusextern "C"{#endifint math(void);int main(void){math();return 0;}int math(void){int i = 1;for(;i<=500;i++){i...
相信这道奥数题，小时候难倒很多人，现在程序一秒告诉你答案
Zjyzzy123456789的博客
02-04 873
看似简单暗藏玄机
小学奥数题001（Python实现）
呀哈哈
09-28 627
重铸江科大荣光
小学四年级奥数题大全.doc
11-17
小学四年级奥数题大全.doc
小学奥数习题五年级.pdf
02-27
小学奥数习题汇编，五年级共248页31个专题，包含习题答案；包含几何计数、分数应用题、等积变形、图形变换、带余除法等
小学六年级奥数题.docx
11-17
小学六年级奥数题.docx
小学奥数习题汇编四年级
12-17
小学奥数习题汇编，四年级共152页23个专题，包含习题答案；包含数字谜、抽屉原理、图形最值、应用最值、统筹与对策等
小学奥数
01-20
Sheet1六年级同学从学校出发到公园春游，每分钟走72米，15分钟以后，学校有急事要通知学生，派李老师骑自行车从学校出发9分钟追上同学们，李老师每分钟要行多少米才可以准时追上同学们？　甲、乙二人练
蓝桥杯练习题和真题（含代码）
01-19
包含最近几年蓝桥杯的编程题目，有题目和通过的代码，一共几千道题目，格式为cpp
一道小学奥数题的编程解法
weixin_37980312的博客
08-16 1847
一道小学奥数题的编程解法 这是一道小学奥数题，看到这一题后如果只给我笔和纸，我真的无从下手，不知怎么去把这些方框填出来。但借助编程，这道题就非常简单了。直接送上代码。 C++程序代码 #include <iostream> using namespace std; int allDifferent(int a[],int size); int main() { int a[9]...
c语言水仙桃树编程,给找十道奥数题
weixin_39790686的博客
05-20 152
欢迎访问少儿编程网(http://www.pxcodes.com)1、一条路长100米,从头到尾每隔10米栽1棵梧桐树,共栽多少棵树?路分成100÷10＝10段,共栽树10+1＝11棵.2、12棵柳树排成一排,在每两棵柳树中间种3棵桃树,共种多少棵桃树?3×(12－1)＝33棵.3、一根200厘米长的木条,要锯成10厘米长的小段,需要锯几次?200÷10＝20段,20－1＝19次.4、蚂蚁爬树枝,...
八道简单入门编程题详解+拓展（水花仙，二进制序列……）
qq_62712350的博客
07-30 864
这些编程题你都会了吗？
一道奥数题的简单实现
chunjunlu的专栏
10-18 867
package com.m; /*某一实验,共在教室里安放200盏灯,并由1-200号同学分别按自己的倍数去开,关灯,问:200名同学依次按完后，有几盏灯开着？  * （提示：比如1号按1到200号灯，2号按2,4,6,8...200号灯，先前室内灯都是关的）*/ public class SwitchProblem {     public static void main(String
C++之小学奥数(1)
The most secret blogs
05-30 3465
题目描述： ABCD *     E           DCBA   按以上格式输出ABCDE的值(A!=B&&A!=C&&A!=D&&A!=E&&B!=C&&B!=D&&B!=E&&C!=D&&C!=E&&D!=E)。   解题思路： 看到这道题之后，许多人想到的是枚举，就像这样： #include using namespace std; int main() {
小学奥数思维训练题（十）
弗兮
12-04 4865
有五个互不相等的非零自然数，最小的一个数是 7。如果其中一个减少 20，另外四个数都加 5，那么得到的仍然是这五个数。这五个数的和是 ______ 。来源：13届走美杯（三年级初赛第12题）
小学奥数编程（3）
yujiaao的专栏
12-08 568
猜数题： []x[][]x[][][] 在[]里填上1到6中的一个数字，使得积最大，请问最大值是多少 [code="java"]package num; /** * * @author xwx * max =[]x[][]x[][][], [] = one of 1,2,3,4,5,6 * aXbXc=6X52X431=134472 */ ...
小学奥数10道经典题
弗兮
10-16 2004
小学奥数10道经典题请进入查看！
python求解小学奥数题
最新发布
03-25
可以使用Python进行小学奥数问题的求解，比如： 题目：小明有若干元钱，他买了3本书，每本书16元，还剩下10元，请问他原来有多少元钱？ 解法： x = (10 + 3 * 16) / 3 print("小明原来有", x, "元钱") 输出结果...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值