【NOIP2007】【Luogu1093】奖学金
problemsolutioncodes//模拟即可#include#includeusingnamespacestd;structnode{intid,ch,score;booloperatorx.score;if(c…
problemsolutioncodes//模拟即可#include#includeusingnamespacestd;structnode{intid,ch,score;booloperatorx.score;if(c…
problemsolutioncodes#include#include#includeusingnamespacestd;conststringnum[]={"zero","one","two","three","fo…
problemsolutioncodes#include#includeusingnamespacestd;constintmaxn=110;inta[maxn],b[maxn],c[maxn];boolcmp(intx…
problemsolutioncodes//MeetintheMiddle#include#include#includeusingnamespacestd;intn,mass,ans(666),f[233];mapma…
problemsolutioncodes/*贪心1.找出不互质的数的集合,就是把互斥的数删去.2.那么当有两个互斥的数时,如果删掉前面(小)的,这个数后面的与它互斥的数也会入选,所以删掉后面的更优。3.因为每个数都是不同…
problemsolutioncodes//优先打价值最大的(如果能打的化)#include#includeusingnamespacestd;structd{intt,w;}a[110];boolcmp(da,db){…
problemsolutioncodes#includeusingnamespacestd;intn,ans=0,t;voidf(inta,charb,charc){ans++;if(a==1){if(t)cout
problemsolutioncodes#includeusingnamespacestd;constintmaxn=110;inttree[maxn][2];voiddfs1(intnow){cout
problemsolutioncodes#include#includeusingnamespacestd;constintmaxn=110;inttree[maxn][2],higt,weigt[maxn],ww;vo…
problemsolutioncodes/*作者:gwj1139177410题目:p2627村村通*///Kruskal#include#include#includeusingnamespacestd;intn,a[1…