POJ经典题答案.docVIP

2231 # include stdio.h # include stdlib.h int cmp(const void *a, const void *b) { return *(__int64 *)a - *(__int64 *)b; } int main() { __int64 i, n; __int64 data[10001]; __int64 sum, total, tmp; scanf(%I64d,n); sum = total = tmp = 0; for(i = 0; i n; i++) { scanf(%I64d,data[i]); sum += data[i]; } qsort(data,n,sizeof(data[0]),cmp); for(i = 0; i n; i++) { tmp += data[i]; total += sum-tmp-(n-i-1)*data[i]+i*data[i]-(tmp-data[i]); } printf(%I64d\n,total); return 1; } 1922 #includeiostream using namespace std; struct { double v,t; } rider[10010]; int n; void input() { int i; double temp,mins=100000000; for(i=0;in;i++) { cin rider[i].v rider[i].t; temp=4.5/(rider[i].v/3600)+rider[i].t; if(rider[i].t=0) if(tempmins) mins=temp; } if(int(mins*10)==(int(mins)*10)) mins=int(mins); else mins=int(mins)+1; cout mins endl; } int main() { while(1) { scanf(%d,n); if(n==0)break; input(); } return 0; } //////////////////////////////////////// #includeiostream using namespace std; struct { double v,t; } rider[10010]; int n; void input() { int i; double temp,mins=100000000; for(i=0;in;i++) { cin rider[i].v rider[i].t; temp=4.5/(rider[i].v/3600)+rider[i].t; if(rider[i].t=0) if(tempmins) mins=temp; } if(int(mins*10)==(int(mins)*10)) mins=int(mins); else mins=int(mins)+1; cout mins endl; } int main() { while(1) { scanf(%d,n); if(n==0)break; input(); } return 0; } 1014 #include iostream using namespace std; int ok ; int d[6] ; void find ( int now , int x ) { if ( x 0 ) return ;