Shiina Mashiro no youni

有 n 个城市通过一些航班连接。给你一个数组flights ，其中flights[i] = [fromi, toi, pricei] ，表示该航班都从城市 fromi 开始，以价格 pricei 抵达 toi。现在给定所有的城市和航班，以及出发城市 src 和目的地 dst，你的任务是找到出一条最多经过 k站中转的路线，使得从 src 到 dst 的 价格最便宜 ，并返回该价格。 如果不存在这样的路线，则输出 -1。示例 1：输入:n = 3, edges = [[0,1,100]...

Problem DescriptionFor a number,if the length of continuous odd digits is even and the length of continuous even digits is odd,we call it odd-even number.Now we want to know the amount of odd-even n

Problem DescriptionEasy question! Calculate how many primes between [1...n]!InputEach line contain one integer n(1 OutputFor each case, output the number of primes in interval [1...n]

Problem DescriptionRecently, Bob has just learnt a naive sorting algorithm: merge sort. Now, Bob receives a task from Alice.Alice will give Bob N sorted sequences, and the i-th sequence includes a

Problem DescriptionI will show you the most popular board game in the Shanghai Ingress Resistance Team.It all started several months ago.We found out the home address of the enlightened agent Ic

Problem DescriptionAlice is planning her travel route in a beautiful valley. In this valley, there are N lakes, and M rivers linking these lakes. Alice wants to start her trip from one lake, and enj

Problem DescriptionYou are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An ordered pair of nodes (u,v) is said to be weak if  (1) u is a

Problem DescriptionThe shorter, the simpler. With this problem, you should be convinced of this truth.    You are given an array A of N postive integers, and M queries in the form (l,r). A funct

Problem DescriptionThe yearly sports meeting is approaching in Hail university and M departments, conveniently numbered from 1 to M, are going to take part in. Each department has no more than h stu

Problem DescriptionGiven an integer n, we only want to know the sum of 1/k2 where k from 1 to n.InputThere are multiple cases.For each test case, there is a single line, containing a singl

Problem DescriptionOn an isolated island, lived some dwarves. A king (not a dwarf) ruled the island and the seas nearby, there are abundant cobblestones of varying colors on the island. Every two dw

唉这题真是……

Problem DescriptionA mysterious country will hold a football world championships---Abnormal Cup, attracting football teams and fans from all around the world. This country is so mysterious that none

描述 因为思念新宿的"小姐姐"们，岛娘计划6月份再去一趟东京，不过这次看来她需要自掏腰包。经过了几天的夜战，岛娘终于在体力耗尽之前，用Python抓下了所有6月份，上海至东京的全部共n 张机票。现在请你帮助债台高筑的岛娘筛选出符合时间区间要求的，最贵的机票。输入输入数据的第一行包含两个整数 n, m(1 ≤ n, m ≤ 105)，分别表示机票的总数，和询问的总数。接下来的

Problem Description    \ \ \ \     Silen August does not like to talk with others.She like to find some interesting problems.    \ \ \ \     Today she finds an interesting problem.She finds

问题描述ZYB(ZJ−267)ZYB(ZJ-267)ZYB(ZJ−267)在NOIPNOIPNOIP拿到600600600分之后开始虐生物题,他现在扔给你一道简单的生物题:给出一个DNADNADNA序列和一个RNARNARNA序列，问它们是否配对。DNADNADNA序列是仅由A,C,G,TA,C,G,TA,C,G,T组成的字符串，RNARNARNA序列是仅由A,C,G,UA,C,G,UA,C

问题描述ZYBZYBZYB在远足中,和同学们玩了一个“数字炸弹”游戏：由主持人心里想一个在[1,N][1,N][1,N]中的数字XXX，然后玩家们轮流猜一个数字，如果一个玩家恰好猜中XXX则算负，否则主持人将告诉全场的人当前的数和XXX比是偏大还是偏小，然后猜测的范围就会相应减小，一开始的范围是[1,N][1,N][1,N].每个玩家只能在合法的范围中猜测.现在假设只有两个人在玩这