【编程题解】Count number

最新推荐文章于 2022-11-14 18:53:53 发布

身价五毛

最新推荐文章于 2022-11-14 18:53:53 发布

阅读量538

点赞数

分类专栏：编程题解文章标签：编程语言算法 programming code java

本文链接：https://blog.csdn.net/Ximerr/article/details/106751612

版权

12 篇文章 0 订阅

订阅专栏

In an undirected connected graph, if an edge is deleted and the graph is divided into two disconnected parts, the edge is called a cut edge.

Find the number of undirected connected graphs satisfying the following conditions:

1. It is composed of N nodes with labeled Numbers ranging from 1 to N.

2. Cut edges are less than M.

3. No loop and multiple edges .

The input is one line and contains two integers N and M.

Data range:2≤N≤50,0≤M≤N∗(N−1)/2

Output an integer to represent the number of unconnected graphs that meet the conditions after taking the modulus of 10^9+7.

Sample Input 1

3 3

Sample Output 1

public class Main {
    public static void main(String[] args) {
        System.out.println("Unsolved");
    }
}

Welcome to communicate!

关注

专栏目录