find div m and mod m

A number is a prime number (also called prime number). if and only when its approximate number has two -- 1 and itself. It is specified that the two approx. numbers cannot be the same, so 1 is not a prime number. The Study of prime numbers belongs

A.geometry#include #include#include#include#includeusing namespacestd;intMain () {//freopen ("In.txt", "R", stdin); intT;SCANF ("%d",&T); while(t--){ intx, y; scanf ("%d%d",&x,&y); cout2*x*y) Endl; } return 0;}View CodeB.treeIdea: The

Codeforces Round #313 (Div. 2) E. Gerald and Giant Chess theorem Lucas calculates the big composite number,E. Gerald and Giant Chesstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output Giant chess is

Question Link Dreamoon loves summing up something for no reason. One day he obtains two integersAAndBOccasionally. He wants to calculate the sum of all nice integers. Positive IntegerXIs called nice if and, whereKIs some integer number in range [1,

codeforces Round #489 (Div. 2)A. Nastya and an Array#include #define REP (i,a,b) for (int i=a;i#define FREP (I,A,B) for (int i=a;i>=b;--i)#define MEM (w) memset (w,0,sizeof (w) )#define PB Push_backtypedef Long LongllConst intN = -;Const intINF

Topic Portal1 /*2 Hash+set: The hash value of each string is stored in the set container first, and then enumerated for each of the strings of each query3 It is not difficult to understand the existence of a replacement string with the Find function

A Wool sequence indicates that a continuous subinterval can be found in a sequence so that the interval is different or the value is 0. The number of sequences is not included in this case. The range of data in the question is 0 ~ 2 ^ m-1 select n

Problem DescriptionAfter trying-many years, Victor has finally received a pilot license. To has a celebration, he intends to buy himself an airplane and fly around the world. There is n countries on the Earth, which is numbered from 1 to N. They is

E. XOR and favorite numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard Inputoutputstandard OutputBob has a favorite numberkanda i of length n. Now he asks your to answer m queries. Each query was given by a pair li

Codeforces Round #277.5 (Div. 2) partial question A. SwapSorttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output In this problem your goal is to sort an array consistingNIntegers in at mostNSwaps.