比以往更加黑暗的思考题 广西省人大音乐 不支持audio！！ Idolatrize World Haniyasushin Keiki loves crafting. She has n kinds of items. The i-th kind of item has name name_i. She also has m recipes. The i-th recipe needs len_i of different kinds of dif……

思考题 about poems Is your love as confusing as the sun acquiesced? Once a Chinese poem said: There's sun in the east but rain in the west, Is your love as confusing as the sun acquiesced? Now you are given a undirected weighted graph G of N ……

思考题 for Hakurei Reimu Legacy of Lunatic Kingdom ZJS loves playing Touhou. In the famous STG game Touhou:Legacy of Lunatic Kingdom the game rules are defined as follows: The game consists of N "stages". Player start from Stage 1 and ends at Stage……

思考题 of math again Slime Legend II In the world of fantasy, there lives N+1 types of monsters indexed from 0 to N. Each monster can be represented by an integer pow_i - their power. And specially, type 0 is SLIME. Slime has a special ability to "……

思考题 that is quite easy FACT ZJS likes to show off his wonderful calculator. His calculator can do FACT operation which means can divide an integer to some primes' products. For example, Fact(30) will display 2\times3\times5 which is a string of ……

思考题 that is easier than #14 Sort and Sort and Sort and Sort You are given an integer array A of length N. And you are given Q queries. For each query, you are given Li and Ri. You need to find out the sum of products of adjcent numbers in the so……

思考题 specially Orange Boy And Orange Program Orange Boy is a programmer of Sunway TaihuLight. One day he wrote the following program to test the super computer: int n; int a[100005]; int getAns(int l,int r,int x){ int ans=0; for(int i=l;i

思考题 on trees again Tree You are given a weighted undirected tree T of N nodes. Each edge i has a weight W_i. Assume that the edges you need to travel from node i to j is E_1,E_2,E_3...E_k then we define $c_{i,j}=(-1)^k \times \sum {i=0}^kW{E_i}F……

思考题for Ep.11 Lunatic Walking Orange Boy loves walking. One day, he wanna walk from (sx,sy) to (ex,ey) the boy can walk in three types: from (x,y) to (x\pm1,y) by costing A yuan from (x,y) to (x,y\pm1) by costing B yuan from (x,y) to (x+1,y+1……

是时候放松一下，做一道简单的题目了 Walking Orange Boy loves walking. One day, he wanna walk from (x_1,y_1) to (x_n,y_n) the boy can walk in three types: from (x,y) to (x\pm1,y) by costing A yuan from (x,y) to (x,y\pm1) by costing B yuan from (x……