#include <iostream.h>
#include <math.h>
void main()
{
int i,n;
cout<<"Input size of mas: ";
cin>>n;
int *mas=new int[i];
cout<<"Input element of mas"<<endl;
for(i=0;i<n;i++)
cin>>mas[i];
cout<<"Output element of mas:"<<endl;
for(i=0;i<n;i++)
cout<<mas[i]<<" ";
cout<<endl;
int min; int pozmin;
min=mas[0]; pozmin=0;
for(i=1;i<n;i++)
{
if(mas[i]<min)
{
min=mas[i];
pozmin=i;
}
}
int max; int pozmax;
max=mas*[0]; pozmax=0;
{
if(mas[i]>max)
{
max=mas[i];
pozmax=i;
}
}
int temp;
temp=mas[pozmax];
mas[pozmax]=mas[pozmin];
mas[pozmin]=temp;
for(i=0;i<n;i++)
cout<<mas[i]<<" ";
cout<<endl;
}
Написано на с++
318(10) -> 100111110(2)
Объяснение:
Mod (вычисление остатка от целочисленного деления)
318 / 2 = 159. 318 mod 2 = 0
159 / 2 = 79. 159 mod 2 = 1
79 / 2 = 39. 79 mod 2 = 1
39 / 2 = 19. 39 mod 2 = 1
19 / 2 = 9. 19 mod 2 = 1
9 / 2 = 4. 9 mod 2 = 1
4 / 2 = 2. 4 mod 2 = 0
2 / 2 = 1. 2 mod 2 = 0
1 / 2 = 0. 1 mod 2 = 1
174(10) -> 10101110(2)
Объяснение:
174 / 2 = 87. 174 mod 2 = 0
87 / 2 = 43. 87 mod 2 = 1
43 / 2 = 21. 43 mod 2 = 1
21 / 2 = 10. 21 mod 2 = 1
10 / 2 = 5. 10 mod 2 = 0
5 / 2 = 2. 5 mod 2 = 1
2 / 2 = 1. 2 mod 2 = 0
1 / 2 = 0. 1 mod 2 = 1
202(10) -> 11001010(10)
Объяснение:
202 div 2 = 101. 202 mod 2 = 0
101 div 2 = 50. 101 mod 2 = 1
50 div 2 = 25. 50 mod 2 = 0
25 div 2 = 12. 25 mod 2 = 1
12 div 2 = 6. 12 mod 2 = 0
6 div 2 = 3. 6 mod 2 = 0
3 div 2 = 1. 3 mod 2 = 1
1 div 2 = 0. 1 mod 2 = 1
408(10) -> 110011000(2)
Объяснение:
408 div 2 = 204. 408 mod 2 = 0
204 div 2 = 102. 204 mod 2 = 0
102 div 2 = 51. 102 mod 2 = 0
51 div 2 = 25. 51 mod 2 = 1
25 div 2 = 12. 25 mod 2 = 1
12 div 2 = 6. 12 mod 2 = 0
6 div 2 = 3. 6 mod 2 = 0
3 div 2 = 1. 3 mod 2 = 1
706(10) -> 1011000010(2)
Объяснение:
706 div 2 = 353. 706 mod 2 = 0
353 div 2 = 176. 353 mod 2 = 1
176 div 2 = 88. 176 mod 2 = 0
88 div 2 = 44. 88 mod 2 = 0
44 div 2 = 22. 44 mod 2 = 0
22 div 2 = 11. 22 mod 2 = 0
11 div 2 = 5. 11 mod 2 = 1
5 div 2 = 2. 5 mod 2 = 1
2 div 2 = 1. 2 mod 2 = 0
1 div 2 = 0. 1 mod 2 = 1