111101(2) = 61(10)
1D(16) = 29(10)
27(8) = 23(10)
наибольшее 111101(2)
354=01100010
872=010101101000
648=010001000
931=110100011
1-на с екомое
2-сл о во
3-с екунда
4-т анец
5-гл а ва
6-в ойна
С динамическим массивом:
<em>VAR</em>
<em> i: Integer;</em>
<em> a: Array of Char;</em>
<em>BEGIN</em>
<em> Assign(input, 'input.txt'); ReSet(input);</em>
<em></em>
<em> SetLength(a, 1);</em>
<em> While (not eoln(input)) do begin</em>
<em> SetLength(a, Length(a)+1);</em>
<em> Read(a[Length(a)-1]); End;</em>
<em></em>
<em> For i := 1 to Length(a)-1 do</em>
<em> If (not Odd(i)) then a[i] := '-';</em>
<em></em>
<em> For i := 1 to Length(a)-1 do Write(a[i]);</em>
<em>END.</em>
using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
namespace ConsoleApp12
{
class Program
{
static void Main(string[] args)
{
var x = new List<int>();
for (int i = 0; i < 5; i++)
x.Add(int.Parse(ReadLine()));
WriteLine("imax="+(x.IndexOf(x.Max())+1).ToString()+"; imin="+(x.IndexOf(x.Min())+1).ToString());
ReadKey();
}
}
}