星空永恒

#include#include#include#includeusing namespace std;//这道题属于贪心，那么我们首先就是对数据进行排序，所以我们先要找到以什么为标准进行排序//我们可以由题意理解到，解决一个僵尸所需要的时间是T+Di，那么接下来就是判断T+Di<Vi是否成立，如果成立//则可以解决僵尸，否则不能解决僵尸 // 以上是一个僵尸的判断//接下来要在

#include#include#include#includeusing namespace std;struct MI{ int danjia; int zhongliang;}mi[1100];int cmp(MI a,MI b){ return a.danjia<b.danjia;}int main(){ int t; int n,m; scanf

#include#include#include#includeusing namespace std;int main(){ int i,n,num[3300]; while( scanf("%d",&n)!=EOF ) { if(n==0) { printf("0\n"); continue; } for(i=0;i<n;i++) sc

#include#include#include#includeusing namespace std;struct Thing{ int danjia; int tiji;}thing[200];int cmp(Thing a,Thing b){ return a.danjia>b.danjia;}int main(){ int v,n; int i,j;

#include#include#include#includeusing namespace std;int cmp(int a,int b)//浓度从小到大排序{ return a<b;}int main(){ int t; int n,v,w; double nongdu1,nongdu2; int v1; int i; int nongdu[1100];

⑴当n = 1，直接过河。sum = cost[0](2)当n = 2，直接过河。 sum = cost[1](3)当n = 3，无论怎么过河， sum = cost[0] + cost[1] + cost[2] (4)当n = 4，设从小到大排序后位a=cost[0],b=cost[1],c=cost[2],d=cost[3];用最小的来送：b + a

#include#include#includeusing namespace std;int main(){ char num[1100]; int n,m;//m是删除多少位数 int i,j,k; while( scanf("%s%d",num,&m)!=EOF ) { n=strlen(num); for(j=1;j<=m;j++) { for

#include#include#includeusing namespace std;struct Time{ int s,e;}time[200];int cmp(Time a,Time b){ return a.e<b.e;}int main(){ int n; int m; int cnt; int i; while( scanf("%d",&n)!

#includeusing namespace std;int main(){ long long ans; long long n; while( scanf("%lld",&n)!=EOF ) { if(n<=2) { printf("%lld\n",n); } else if(n%2==1) { ans=n*(n-1)*(n-2); pri

#include#include#include#include#define INF 0x3f3f3fusing namespace std;struct node{ int s,v; double val;}edge[10100];double cmp(node a,node b){ return a.val>b.val;}int main(){ int

#include#include#include#includeusing namespace std;int cmp(int a,int b){ return a>b;}int main(){ int L,N; int length[700]; while( scanf("%d%d",&L,&N)!=EOF ) { int sum=0; int i;