整数or分数<=>能否被整除
#include<iostream> using namespace std; const int MAX=100000; int a[MAX]; int main() { int n; cin>>n; for(int i=0;i<n;i++) cin>>a[i]; int max,min; if(a[0]>a[n-1]) { max=a[0]; min=a[n-1]; } else { max=a[n-1]; min=a[0]; } if(n%2==1) { cout<<max<<" "<<a[n/2]<<" "<<min; } else { if((a[n/2-1]+a[n/2])%2==0) cout<<max<<" "<<(a[n/2-1]+a[n/2])/2<<" "<<min<<endl; else printf("%d %.1f %d ",max,(float)(a[n/2]+a[n/2-1])/2,min); } return 0; }