using System;
using System.Collections.Generic;
using System.Linq;
namespace
{
class App
static void Main(string[] argv)
App Obj = new App();
Obj.Run();
}
public bool IsContains(string Word, char searched_lit)
char[] lits = Word.ToCharArray();
foreach (char lit in lits)
if (lit == searched_lit)
return true;
return false;
public void Run()
int N = Convert.ToInt32(Console.ReadLine());
List<string> nums = new List<string>();
List<int> dual_number = new List<int>();
for (int i = 1; i <= N; i++)
nums.Add(Console.ReadLine());
foreach (string word in nums)
if (word.Length == 2)
if (IsContains(word, '4'))
dual_number.Add(Convert.ToInt32(word));
int result=0;
dual_number.ForEach(x => result += x);
Console.WriteLine(result / dual_number.Count);
Console.ReadKey();
Объяснение:
program sorting;
const
N = 10;
var
v: array[1..N] of integer;
d: integer;
i, t: integer;
k: boolean;
begin
randomize;
write('ДО сортировки: ');
for i := 1 to N do
readln(v[i])
write(v[i]:6);
end;
d := N div 2;
while(d > 0) do
k := true;
while k do
k := false;
i := 1;
for i := 1 to N - d do
if(v[i] > v[i + d]) then
t := v[i];
v[i] := v[i + d];
v[i + d] := t;
d := d div 2;
writeln;
write('ПОСЛЕ сортировки: ');
end.
using System;
using System.Collections.Generic;
using System.Linq;
namespace
{
class App
{
static void Main(string[] argv)
{
App Obj = new App();
Obj.Run();
}
public bool IsContains(string Word, char searched_lit)
{
char[] lits = Word.ToCharArray();
foreach (char lit in lits)
{
if (lit == searched_lit)
{
return true;
}
}
return false;
}
public void Run()
{
int N = Convert.ToInt32(Console.ReadLine());
List<string> nums = new List<string>();
List<int> dual_number = new List<int>();
for (int i = 1; i <= N; i++)
{
nums.Add(Console.ReadLine());
}
foreach (string word in nums)
{
if (word.Length == 2)
{
if (IsContains(word, '4'))
{
dual_number.Add(Convert.ToInt32(word));
}
}
}
int result=0;
dual_number.ForEach(x => result += x);
Console.WriteLine(result / dual_number.Count);
Console.ReadKey();
}
}
}
Объяснение:
program sorting;
const
N = 10;
var
v: array[1..N] of integer;
d: integer;
i, t: integer;
k: boolean;
begin
randomize;
write('ДО сортировки: ');
for i := 1 to N do
begin
readln(v[i])
write(v[i]:6);
end;
}
d := N div 2;
while(d > 0) do
begin
k := true;
while k do
begin
k := false;
i := 1;
for i := 1 to N - d do
begin
if(v[i] > v[i + d]) then
begin
t := v[i];
v[i] := v[i + d];
v[i + d] := t;
k := true;
end;
end;
end;
d := d div 2;
end;
writeln;
write('ПОСЛЕ сортировки: ');
for i := 1 to N do
write(v[i]:6);
writeln;
end.