C++

Given an n-order matrix A, calculate the value of the main diagonal of the K-power matrix of A and the value of the modulus 9973. Solution: the rapid power of a matrix. Can I write a matrix class and then write a few corresponding functions, such as

1. The number of 1 in the binary of integer V [Cpp]Int Count (int v){Int num = 0;While (v){Num + = v & 0x01;V >>> = 1;}Return num;} Int Count (int v){Int num = 0;While (v){V & = (v-1 );Num ++;}Return num;}How many digits are different in the binary

I can't say anything about this question. I have been crazy about it for a long time. Now I am finally AC. I have spent too much time on this question ,,,,When I first read this question, I thought of using DFS. Later I remembered that I had read

The relationship between points and polygon through the corner method is known to all. The principle is relatively simple. The angle swept inside the polygon must be 360 degrees, but not necessarily on the boundary and outside.It is also difficult

OverviewC ++ primer defines Lenovo containers as follows: A type that holds a collection of objects that supports efficient lookup by keyIn fact, unlike sequential containers, Lenovo containers search by keyword. Its underlying implementation is not

IteratorAn iterator is used to access elements in a sequence. Its usage is similar to a pointer (in fact, an iterator can be seen as a generalized pointer ). The difference is that the iterator is more abstract than the pointer. It can point to a

Given a prime number p and a string str. F [I] = Num (str [I]), Num (str [I]) indicates 0 when str [I] is, str [I] is str [I]-a + 1 when it is a-z.Then we obtain the n (str [I] length) equations. The format of each equations is (a1 * k ^ 0 + a2 * k ^

Today, when I was looking at the iphone development secret, I encountered this problem. I carefully went into depth and obtained some conclusions that I think are not bad, I hope this will be helpful for some problems encountered in cell reuse. This

The first time I entered DIV1, I was decisively abused and couldn't help. Solve DIV2 first after the competitionA. System of EquationsAsk a * a + B = m a + B * B = n, the solution a, B, and how many groups are there, because a and B are not negative,

Question: four points are given to form a quadrilateral (not given in order), and The ferma distance is obtained. 1. Because there are only four points, when these four points can form a convex Quadrilateral (): the intersection point formed by the

FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 1781 Accepted Submission (s): 1035 Problem DescriptionIn the twinkling of an eye, Lele received a bumper harvest due to the professional

Squarefree numberTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 1404 Accepted Submission (s): 373 Problem DescriptionIn mathematics, a squarefree number is one which is divisible by no perfect

Question: There are N nodes in the circle, and a node in the center is connected to N nodes. There are 2 * N edges in total and N edges are deleted, to connect N + 1 points, the same rotation is considered equivalent. How many situations are

Toy StorageTime Limit: 2000/1000 ms (Java/Other) Memory Limit: 131072/65536 K (Java/Other) Total Submission (s): 5 Accepted Submission (s): 5 Problem DescriptionMom and dad have a problem: their child, Reza, never puts his toys away when he is

The offset vector is also used. A numerical string consisting of 0, 1 ~~, Now, you have some questions about whether the number of numbers from I to j is an odd or even number. He will tell you the answer, but the answer may be self-contradictory.

When storing some information, it does not need to occupy a full byte, but only needs to occupy a few or one binary bit. For example, when storing a switch value, there are only two States: 0 and 1. Use one binary digit. To save storage space and

Given a sequence with a length of n and a constant m, we can divide the sequence into random segments. The weight of each segment is sum (arr [I]). + C (x Solution: After finishing the Hdu 2829, let's look at this question again. Everything becomes

CompromiseTime Limit: 1000 MS Memory Limit: 65536 KTotal Submissions: 4965 Accepted: 2266 Special JudgeDescriptionIn a few months the European Currency Union will become a reality. however, to join the club, the Maastricht criteria must be fulfilled,

Question: activation sequence of xian5. There are four situations: 1. Registration failed, but the queue sequence is not affected. The probability is p1. 2. The connection fails. the first person in the team is at the end of the team. The

The meaning of the question is somewhat elusive ~~ After reading this question for a long time, I learned this question. I used a variety of STL water ~~ Stack, map + stack... I thought the efficiency would be very low ~~ However, the time is 80 ms ~