WZJRJ28

Given a directed graph with nnn nodes, labeled 0,1,⋯,n−10,1, \cdots, n-10,1,⋯,n−1.For each i,j> satisfies 0≤i0≤ijn, there exists an edge from the i-th node to the j-th node, the capacity of wh

Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules fro

题意：给n个木棍，随机选三个，问能组成三角形的概率是多少。分析：我们枚举最长边，分三种情况：1.最长边出现三次，事件个数为A(k,3). 2.最长边出现两次,事件个数为3*A(k,2)*小于最长边的边数. 3.最长边出现一次,此时需要求出原边长值域（其实是每个值出现的次数）数列的卷积，得到的新数列的一项 ci 为边长和等于 i 的 边对数，然后我们就可以通过ci的前缀和来得到第

Galya is playing one-dimensional(肤浅的) Sea Battle on a1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of b consecutive(连贯的) cells. No cell can be part of two s

Descriptionhannnnah_j is a teacher in WL High school who teaches biology.One day, she wants to test m students, thus she arranges n different seats around a round table.In order to pre

Billy investigates the question of applying greedy algorithm to different spheres of life. At the moment he is studying the application of greedy algorithm to the problem about change. There is an amo

B. Puzzlestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBarney lives in country USC (United States of Charzeh). USC

Problem DescriptionZhu and 772002 are both good at math. One day, Zhu wants to test the ability of 772002, so he asks 772002 to solve a math problem.But 772002 has a appointment with his girl

ZS the Coder has a large tree. It can be represented as an undirected connected graph ofn vertices numbered from 0 to n - 1 and n - 1 edges between them. There is a single nonzero digit writte

Memory is now interested in the de-evolution of objects, specifically triangles. He starts with an equilateral triangle of side lengthx, and he wishes to perform operations to obtain an equilateral

题意：给定n和k，问每隔k人的n人约瑟夫游戏中最后出局的三个人的编号。分析:设f(i,j)表示共i个人的约瑟夫环中出局的第j个人的编号，我们每出局一个人重新编号后有f(i,j) = (f(i-1,j-1) + k) % i.#include#include#include#include#include#include#include#include

As you probably know, Anton goes to school. One of the school subjects that Anton studies is Bracketology. On the Bracketology lessons students usually learn different sequences that consist of round b

Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex1. There is an integer number written on each vertex of the tree;

In graph theory, graph colouring is a special case of graph labelling.It is an assignment of labels traditionally called colours to edges of a graph.Here we consider the simplest form.Given an u

Chinese people think of '8' as the lucky digit. Bob also likes digit '8'. Moreover, Bob has his own lucky number L. Now he wants to construct his luckiest number which is the minimum among all positiv

You are given an array A, and Zhu wants to know there are how many different array B satisfy the following conditions? * 1≤Bi≤Ai   1 ≤Bi≤Ai * For each pair( l , r ) (1≤l≤r≤n   ) , gcd(bl

IntersectionBobo has two sets of integers A={a1,a2,…,an} and B={b1,b2,…,bn}. He says that x∈span(A) (or span(B)) if and only if there exists a subset of A (or B) whose exclusive-or sum equals

Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of pos

题意:给你一个线段,问线段上有多少个整点.分析:我们先把直线的一般式搞出来,ax+by=c的形式,然后用欧扩求出直线一个整数点,设其横标为x,那么答案就是floor((x2-x)/b') - ceil((x1-x)/b') + 1. (x2 >= x1, b' = b/gcd(a,b)).#include #define INF 1047483647#define ep

You are given a sequence a consisting of n integers. Find the maximum possible value of  (integer remainder of ai divided by aj), where 1 ≤ i, j ≤ n and ai ≥ aj.InputThe first line

题目大意:给n(n 分析:

Description　　单身! 　　依然单身！ 　　吉哥依然单身！ 　　DS级码农吉哥依然单身！ 　　所以，他生平最恨情人节，不管是214还是77，他都讨厌！ 　　 　　吉哥观察了214和77这两个数，发现： 　　2+1+4=7 　　7+7=7*2 　　77=7*11 　　最终，他发现原来这一切归根到底都是因为和7有关！所以，他现在甚至讨厌一切和7

On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the lengthl meters. Each of the pupils will go with the speed equal tov1. To get to th

As Famil Door’s birthday is coming, some of his friends (like Gabi) decided to buy a present for him. His friends are going to buy a string consisted of round brackets since Famil Door loves string of

You have an array a[1], a[2], ..., a[n], containing distinct integers from1 to n. Your task is to sort this array in increasing order with the following operation (you may need to apply it multiple

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8564 Accepted: 3739DescriptionThis problem is based on an exercise of David Hilbert, who pedagogically suggested t

The Brasileiro League is the most important event in Brazil. There aren football teams participating in the competitions, each team plays twice (home and away) against each other team. Each team rec

DescriptionThe young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic

Limak is a little polar bear. He doesn't have many toys and thus he often plays with polynomials.He considers a polynomial valid if its degree is n and its coefficients are integers not exceedin

Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactlyx distinct squares in the table consis

There is a long plate s containing n digits. Iahub wants to delete some digits (possibly none, but he is not allowed to delete all the digits) to form his "magic number" on the plate, a number that

DescriptionA Compiler Mystery: We are given a C-language style for loop of typefor (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to

Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an array B is defined as B1 xor B2...xorBn 

We call a string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, "aabba" is good, because after the merging step it will become "aba".

Problem DescriptionGiven a sequence A with length n,count how many quadruple (a,b,c,d) satisfies:a≠b≠c≠d,1≤ab≤n,1≤cd≤n,AaAb,Ac>Ad. InputThe input consists of multiple test cases. Each te

题意：求a^x % p = b的最小x。#include#include#include#include#include#include#include#include#include #include#include#include#include#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 10

题意：给你一棵树，每次一个操作，修改书上最多不超过1000个点的值，然后询问u到v路径上的权值和。分析：树链剖分，后边单点修改区间查询可以用树状数组。#include#include#include#include#include#include#include#include#define INF 0x3f3f3f3f#define MOD 100000

Problem DescriptionDeep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular ty

Problem DescriptionProfessor Zhang has an undirected graph G with n vertices and m edges. Each vertex is attached with a weight wi. Let Gi be the graph after deleting the i-th vertex f

You are given n points on a plane. All the points are distinct and no three of them lie on the same line. Find the number of parallelograms with the vertices at the given points.InputThe first