accepted_accepted的博客

Codeforces 1244C题意：给你n,p,w,d (w>d)要你求一组x,y,z满足上述俩个式子。题解：因为w>d,所以优先分配给x，x=p/w; 然后在分配给y，最后剩下的看它能不能整除gcd(w,d);如果能，用扩展欧几里德求解；然后加上去，最后 如果不满足条件可以 对a和b的大小进行调整，可以加上a*（m%d/gcd）个w和减去b*（m%d/gcd）个d 或者...

D1. Toy Train (Simplified)Alice received a set of Toy Train™ from Bob. It consists of one train and a connected railway network of nn stations, enumerated from 11 thro...

B. Dima and a Bad XORtime limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputStudent Dima from Kremland has a matrix aaof size n×mn×mfilled wi...

D. Ehab and the Expected XOR Problemtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven two integers nn and xx, construct an array that ...