zoukankan      html  css  js  c++  java
  • homework3

    (a)

    (b)素数列表是,将MAXPRIMES设为4

    (c)令n=1

    (d)节点覆盖:

      TR={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}

      TEST PATH = [1,2,3,4,5,6,7,5,6,8,9,10,2,11,12,13,14,12,15]  

          边覆盖 : TR = {(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,5),(5,9),(6,8),(8,9),(9,2),(9,10),(10,2),(2,11),(11,12),(12,13),(13,14),(14,12),(12,15)}

          Test Paths = [1,2,3,4,5,6,7,5,6,8,9,2,11,12,13,14,12,15]  [1,2,3,4,5,9,10,2,11,12,13,14,12,15]

      主路径覆盖:

        [1,2,3,4,5,6,7]

        [1,2,3,4,5,9]

        [1,2,3,4,5,6,8,9,10]

        [1,2,3,4,5,6,8,9]

        [1,2,3,4,5,9,10]

        [1,2,11,12,13,14]

        [1,2,11,15]

        [3,4,5,6,8,9,2,11,12,13,14]

        [3,4,5,6,8,9,10,2,11,12,13,14]

        [3,4,5,6,8,9,2,11,12,15]

        [3,4,5,6,8,9,10,2,11,12,15]

        [3,4,5,9,10,2,11,12,13,14]

        [3,4,5,9,2,11,12,13,14]

        [3,4,5,9,10,2,11,12,15]

        [3,4,5,9,2,11,12,15]

        [6,7,5,9,10,2,11,12,13,14]

        [6,7,5,9,2,11,12,13,14]

        [6,7,5,9,10,2,11,12,15]

        [6,7,5,9,2,11,12,15]

        [13,14,12,15]

        [12,13,14,12]

        [5,6,7,5]

        [2,3,4,5,6,8,9,10,2]

        [2,3,4,5,9,2]

        [2,3,4,5,9,10,2]

        [2,3,4,5,6,8,9,2]

  • 相关阅读:
    USACO6.4-The Primes
    ZOJ2112--Dynamic Rankings (动态区间第k大)
    Havel定理
    HDU5107---K-short Problem (线段树区间 合并、第k大)
    POJ2104-- K-th Number(主席树静态区间第k大)
    poj2409 & 2154 polya计数+欧拉函数优化
    CodeForces
    HDU
    HDU
    Gym
  • 原文地址:https://www.cnblogs.com/ningge/p/5342347.html
Copyright © 2011-2022 走看看