摘要：
#include<iostream>#include<vector>#include<queue>#include<set>using namespace std;typedef long long ll;const int a[3]={2,3,5};int main(){ priority_que 阅读全文
摘要：
#include<iostream>#include<queue>#include<map>#include<cstring>using namespace std;const int maxn=1000+10;int main(){ int t,kase=0,x; while(scanf("%d" 阅读全文