1 solutions
-
0
C :
int main(int argc, char* argv[]) { int i,num[10],max,min,ix,im,tem; for(i=0;i<10;i++) { scanf("%d",&num[i]); if(i==0) { max=min=num[i]; ix=im=0; } else if(num[i]>max) { max=num[i]; ix=i; } else if(num[i]<min) { min=num[i]; im=i; } } tem=num[ix];num[ix]=num[9];num[9]=tem; if(im==9) im=ix; tem=num[im];num[im]=num[0];num[0]=tem; for(i=0;i<10;i++) printf("%d ",num[i]); puts(""); return 0; }C++ :
#include <iostream> #include <algorithm> using namespace std; int main () { int num[10]; int MIN = 100000; int MAX = 0; for (int i = 0;i < 10; i++) { cin>>num[i]; MIN = min (MIN,num[i]); MAX = max (MAX,num[i]); } for (int i = 0;i < 10; i++) { if (MIN == num[i]) { num[i] = num[0]; num[0] = MIN; } if (MAX == num[i]) { num[i] = num[9]; num[9] = MAX; } } for (int i = 0;i < 10; i++) cout<<num[i]<<" "; cout<<endl; return 0; }
- 1
Information
- ID
- 19488
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By