qq_44134712的博客

Download #include <iostream> #include <algorithm> #include <queue> using namespace std; int a,k; int n[310]; long long int t=0,ans=0; priority_queue<int,vector<int>,great...

Recently Monocarp has created his own mini-laboratory! The laboratory containsnnbacteria. Monocarp knows that he can merge any two bacteria havingequalsizes, and the resulting bacterium will have...

Recently Monocarp got a job. His working day lasts exactlymmminutes. During work, Monocarp wants to drink coffee at certain moments: there arennminutesa1,a2,…,ana1,a2,…,an, when he is able and wi...