晚安(￣o￣) . z Z

White Cloud has a square of n×n from (1,1) to (n,n).White Rabbit wants to put in several cars. Each car will start moving at the same time and move from one side of one row or one line to the other. All cars have the same speed. If two cars arrive at the

White Cloud is exercising in the playground.White Cloud can walk 1 meters or run k meters per second.Since White Cloud is tired,it can’t run for two or more continuous seconds.White Cloud will move L to R meters. It wants to know how many different ways

Two undirected simple graphs G1=⟨V,E1⟩ and G2=⟨V,E2⟩ where V={1,2,⋯,n} are isomorphic when there exists a bijection ϕ on V satisfying {ϕ(x),ϕ(y)}∈E1 if and only if {x,y}∈E2.Given two graphs G1=⟨V,E1⟩ and G2=⟨V,E2⟩, count the number of graphs G=⟨V,E⟩ satis

Count the number of n×m matrices A satisfying the following condition modulo (109+7).Ai,j∈{0,1,2} for all 1≤i≤n,1≤j≤m.Ai,j≤Ai+1,j for all 1≤i<n,1≤j≤m.Ai,j≤Ai,j+1 for all 1≤i≤n,1≤j<m.InputThe input consists of several test cases and is te

Count the number of n×n matrices A satisfying the following condition modulo m.Ai,j∈{0,1,2} for all 1≤i,j≤n.Ai,j=Aj,i for all 1≤i,j≤n.Ai,1+Ai,2+⋯+Ai,n=2 for all 1≤i≤n.A1,1=A2,2=⋯=An,n=0.InputThe input consists of several test cases and is t

Given a sequence of integers a1,a2,⋯,an and q pairs of integers (l1,r1),(l2,r2),⋯,(lq,rq), find count(l1,r1), count(l2,r2), ⋯, count(lq,rq) where count(i,j) is the number of different integers among a1,a2,⋯,ai,aj,aj+1,⋯,an.InputThe input consists of seve

Bobo has a sequence of integers s1,s2,⋯,sn where 1≤si≤k.Find out the number of distinct sequences modulo (109+7) after removing exactly m elements.InputThe input consists of several test cases and is terminated by end-of-file.The first line of each tes