yanghong的博客

CodeChef FEB16 数组 Chef has an array A consisting of N integers (1-based indexing). He asks you to perform the following operation M times: for i = 2 to N: Ai = Ai + Ai-1 Your task is

因为C题卡住了,这次炸了.我以为模拟肯定T了,所以就写了拓展欧几里得.然后就被欧几里得坑了.用拓展欧几里得做,要把横向和纵向运动分开.x轴: f(x)=t%2n,2n−t%2n f(x)=t\%2n,2n-t\%2n y轴: f(x)=t%2m,2m−t%2m f(x)=t\%2m,2m-t\%2m 然后把这两个公式展开一下,在拓展欧几里得求一下就完事了.(调试出翔)#include <cs