Felix-Lee的博客

JZOJ 5263. 【NOIP2017模拟8.12A组】分手是祝愿 DescriptionInputOutputSample Input2 2 15 19 3 30 40 20Sample Output285 2600Data ConstraintSolutionCode#include<cstdio> #include<cstring> using namespace s

JZOJ 5630. 【NOI2018模拟4.4】Connection Description给定一张N个点M条边的连通无向图，问最少需要断开多少条边使得这张图不再连通。Input第一行两个整数N,M含义如题所示。 接下来M行，每行两个正整数x,y，表示x和y之间有一条无向边。 输入数据保证连通性且无自环。Output输 1 2 2 3 3 4 4 5 5 1 2 4 1 3Sample Outpu

Description Input Output Sample Input Sample Input1 10 2 2 1 3 3 7 8 9 Sample Input2 3 0 Sample Output Sample Output1 462789157 Sample Output2 499122179 Data Constra...

Description Apurva is obsessed with Fibonacci numbers. She finds Fibonacci numbers very interesting. Fibonacci numbers can be defined as given below. Fib(1) = 1 , Fib(2) = 1. Fib(n) = Fib(n-1) + Fib(n...