摘要：
#include#include#include#includeusing namespace std;int main(){ int year,month,day,c,y,week; while(scanf("%d%d%d",&year,&month,&day)!=EOF) { if(month==1||month==2)//判断month是否为1或2 { year--; month+=12; } c=year/100; y=year-c*100; week=y+... 阅读全文
摘要：
#include#include#include#includeusing namespace std;int main(){ int a[71]={220,1184,2620,5020,6232,10744,12285,17296,66928,67095,63020,69615,79750,122368,100485,122265,141664,142310,171856,176272,196724,185368,280540,308620,356408,319550,437456,469028,503056,522405,643336,600392,609928,624184,635... 阅读全文
摘要：
//我的prim算法#include#include#include#include#define MAX 0x0fffffffusing namespace std;int map[501][501],minnum[501];int prim(int n){ int sum=0,i,j; for(i=1;ia?a:min; } printf("%d\n",min+prim(v)); } return 0;}//prim算法解决 图论同学的代码#include #include #include using namespace std;#d... 阅读全文
摘要：
#include#include#include#includeusing namespace std;long long a[1000010];int main(){ int t,n,i,j,sum; scanf("%d",&t); while(t--) { sum=0; scanf("%d",&n); for(i=0;ia[j+1]) { long long k=a[j]; a[j]=a[j+1]; ... 阅读全文