bakaSuc的博客

Problem - C - Codeforces To become the king of Codeforces, Kuroni has to solve the following problem. He is givennnnumbersa1,a2,…,ana1,a2,…,an. Help Kuroni to calculate∏1≤i<j≤n|ai−aj|. As result can be very big, output it modulomm. If you are n...

Sometimes some words like "localization" or "internationalization" are so long that writing them many times in one text is quite tiresome. Let's consider a wordtoo long, if its length isstrictly morethan10characters. All too long words should be rep...