6
- , , .
:
;
;
;
, , ;
.
. , , . , , . , , , , . , , , , .
, . , .
- , . () : , .., .
. , ( ).
, . : null .
, , 5 5 :
int[ ] = new int[5];
string[ ] z = new string[5];
, int[ ]. new 5 , (. 1).
 |
1-
z string[ ]. new 5 , null. , , (. 2).
|
|
|
2 -
() . , . , int, uint, long ulong.
, :
short m =...;
string[ ] s = new string[m + 1];
, (, 0 4). , , :
[4] z[i]
, . , , , .. .
# , , IndexOutOfRangeException.
. , , , :
int [ ] = new int[10];
int[ ] b = ; / / b
# . , , ().
- , .
:
[] _ = new [];
:
[] _ = [val1, val2,, valN];
, , val1 - va lN. :
_[] = val;
:
[ ] ;
[] = new [ ];
[] = { _ };
[] = new [] { _ };
[] = new [ ] { _ };
( ):
int[ ] ; / / 1
int[ ] b = new int[4]; / / 2 0
int[ ] = { 61, 2, 5, -9 }; / / 3 new
int[ ] d = new int[ ] { 61, 2, 5, -9 }; / / 4
int[ ] = new int[4] { 61, 2, 5, -9 }; / / 5
. , , , , . , , , ,
. 3-5, . ( 4), . new, ( 3). , , ( 5).
|
|
|
, .
.
1. .
x n. i, + 1 1 n-1. max [0].
, max. max, max . .
1
using System;
namespace ConsoleApplication5
{
class Program
{
static void Main(string[] args)
{
const int n = 6;
int[] a = new int[n] { 3, 12, 5, -9, 8, -4 };
Console.WriteLine(" :");
for (int i = 0; i < n; ++i)
Console.WriteLine("\t" + a[i]);
Console.WriteLine();
int max = a[0];
for (int i = 0; i < n; ++i)
if (a[i] > max)
max = a[i];
Console.WriteLine(" = " + max);
Console.Read();
}
}
}
:
, .
2. , .
( 2). :
long sum=0; //
int num = 0; //
for (int i = 0; i < n; ++i)
if (a[i] < 0)
{
sum += a[i];
++num;
}
. , , .
2 - 2
using System;
namespace ConsoleApplication1
{
class Class1
{
static void Main()
{
const int n = 6;
int[ ] a= new int[n] { 3,12,5,-9,8,-4};
Console.WriteLine(" :");
for (int i =0; i < n; ++i)
Console.WriteLine("\t" + a[i]);
Console.WriteLine();
long sum=0; //
int num = 0; //
for (int i = 0; i < n; ++i)
if (a[i] < 0)
{
sum += a[i];
++num;
}
Console.WriteLine(" = " + sum);
Console.WriteLine("- = " + num);
int m = a[0]; //
for (int i = 1; i < n; ++i)
if (a[i] > m) m = a[i];
Console.WriteLine(" = " + m);
Console.Read();
}
}
}
:
3. .
:
X - , ;
Max- ;
|
|
|
Im- ;
h- ;
exch- Max .
. , . .
, . , , , : .
3
using System;
namespace ConsoleApplication7
{
class Program
{
static void Main(string[] args)
{
const int n = 6;
int ch;
int[] x = new int[n] { 3, 12, 5, -9, 8, -4 };
Console.WriteLine(" :");
for (int i = 0; i <= n - 1; ++i)
Console.Write(" " + x[i]);
int im = n - 1;
for (int j = 0; j <= n - 2; j++)
{
int max = x[j];
bool exch = false;
for (int i = j + 1; i <= n - 1; ++i)
if (x[i] > max)
{
max = x[i];
im = i;
exch = true;
}
if (exch == true)
{
ch = x[j];
x[j] = max;
x[im] = ch;
}
}
Console.WriteLine();
Console.WriteLine(" :");
for (int i = 0; i <= n - 1; ++i)
Console.Write(" " + x[i]);
Console.Read();
}
}
}
:
4. .
:
X - , ;
n- ;
i,j,k- ;
ch- .
. . , . , , . . , n-1 , .. , .
, .
, . i . , , .
, i+1 , j .
( ) j , ch, .
:
4
using System;
namespace ConsoleApplication7
{
class Program
{
static void Main(string[] args)
{
const int n = 6;
int ch;
int[] x = new int[n] { 3, 12, 5, -9, 8, -4 };
|
|
|
Console.WriteLine(" :");
for (int i = 0; i <= n - 1; ++i)
Console.Write(" " + x[i]);
for (int j = 1; j <= n - 1; j++)
{
ch = x[j];
int i = j - 1;
while ((i > -1) && (x[i] < ch))
i--;
for (int k = j - 1; k >= i+1; --k)
x[k + 1] = x[k];
x[i+1] = ch;
}
Console.WriteLine();
Console.WriteLine(" :");
for (int i = 0; i <= n - 1; ++i)
Console.Write(" " + x[i]);
Console.Read();
}
}
}
:
5. .
:
X - , ;
n- ;
i,j- ;
ch- ;
exch- .
. , - . n-1 .
( ). (exch=TRUE), . (exch=FALSE) break.
5
using System;
namespace ConsoleApplication7
{
class Program
{
static void Main(string[] args)
{
const int n = 6;
int ch;
int[] x = new int[n] { 3, 12, 5, -9, 8, -4 };
Console.WriteLine(" :");
for (int i = 0; i <= n - 1; ++i)
Console.Write(" " + x[i]);
for (int j = 0; j <= n - 1; j++)
{
bool exch = false;
for (int i = 0; i <= n - 2 - j; ++i)
if (x[i] > x[i + 1])
{
ch = x[i + 1];
x[i + 1] = x[i];
x[i] = ch;
exch = true;
}
if (exch == false) break;
}
Console.WriteLine();
Console.WriteLine(" :");
for (int i = 0; i <= n - 1; ++i)
Console.Write(" " + x[i]);
Console.Read();
}
}
}
:
:
System.Arr
# rr, System. (. 1).
1 -
| Length | ( ) | |
| Rank | ||
| BinarySearch | ||
| lear | ||
| GetValue | ||
| IndexOf | ||
| LastIndexOf | ||
| Reverse | ||
| SetValue | ||
| Sort |
Length , . . rr .
6 rr
using System;
namespace ConsoleApplication1
{
class Class1
{
static void Main()
{
int[] x = { 21, 2, 14, -6, 38, -7, 30};
Console.WriteLine();
Console.WriteLine(" :");
for (int i = 0; i < x.Length; ++i)
Console.Write(" " + x[i]);
Array.Sort(x);
Console.WriteLine();
Console.WriteLine(" :");
for (int i = 0; i < x.Length; ++i)
Console.Write(" " + x[i]);
Array.Reverse(x);
Console.WriteLine();
Console.WriteLine(" :");
for (int i = 0; i < x.Length; ++i)
Console.Write(" " + x[i]);
Console.Read();
}
}
}
|
|
|
Sort, Reverse , Array, , .
Sort . , , Reverse, , .
:
Random
Random, System, , , . , . , , , .
# Random: int. .
:
Random a = new Random();
, , .
int:
Random b = new Random(5);
, .
, . 2.
2 - System.Random
| Next() | int |
| Next() | [0, ] |
| Next(, ) | [, ] |
| NextDouble() | [0. 1) |
| NextBytes() | [0, 255] |
. . . 2 .
, ( 7).
7
using System;
namespace ConsoleApplication1
{ class Program
{ Random l = new Random();
Random d = new Random(1);
const int n = 5;
Console.WriteLine(" [0, 1]");
for (int i = 0; i < n; ++i)
Console.Write("{0,6:0.##}", l.NextDouble());
Console.WriteLine();
Console.WriteLine(" [0, 100]");
for (int i = 0; i < n; ++i)
Console.Write(" " + d.Next(100));
Console.WriteLine();
Console.WriteLine(" [-5, 5]");
for (int i = 0; i < n; ++i)
Console.Write(" " + l.Next(-5, 5));
Console.WriteLine();
Console.WriteLine(" [0, 255]");
byte[ ] mas = new byte[n];
l.NextBytes(mas);
for (int i = 0; i < n; ++i)
Console.Write(" " + mas[i]);
}
}
}
:
1. . 100 . 6 .
2. 100 . , .
3. . (0), (1), (2),..., x(n). .
4. N x(0), y(0),..., x(n), y(n) (N=20). , (, ).
5. : 
. x y .
6. (0), (1),..., (20) 
x=.
7. , n , : .
8. T TRUE, , n , , FALSE .
9. , n , :
x(0)=x(0), x(n)=x(n), x(k)=(x(k)-1+x(k)+x(k)+1)/3 k=2,3,...,n-1.
10. , n , : .
11. , n , : .
12. , n , ( Y ): , - , , .
13. , n , : k .
14. T TRUE, , n , , FALSE .
15. K Y , N+1, Y .
16. y=x(0)+x(0)*x(1)+x(0)*x(1)*x(2)+...+x(0)*x(1)*...*x(m), m - , N, .
17. T TRUE FALSE , , n , .
18. T TRUE FALSE , X, n , .
19. a[0],a[2],..,a[10]. () : a[1],a[2],...,a[10],a[0], a[2],...,a[10],a[0], a[1], .. .
20. 100 . , ( ).
21. n ( n>1).
22. n a[0],...,a[n]. [0]-a[1]+a[2]-...+(-1)n-1a[n].
23. n a, b (a<>b). r[0],r[1],...,r[n], r[i]=a+ih, h=(b-a)/n.
24. a[0], [2],...,a[10]. b[0],...,b[10], b[i]=(a[i]2 -a[1])*b[i-1] i=1,2,3,...10.
25. b[0],...,b[10], i=0,1,2,...,10 b[i] 1+1/2 +...+1/i.
26. [0],..., [6]. , .
27. n=15 a, h, b,d[0],...,d[n], d[0]+d[1](b-a)+d[2] (b-a) (b-a-h)+...+ d[n] (b-a) (b-a-h)...(b-a-(n-1)h).
28. n k[0],k[1],...,k[12]. k[0],...,k[12] n.
29. n, a[0],...,a[n] (n>3). b[i], i=0,1,...,n-2, b[i]==a[i+1]+a[i+2].
30. [0],...,[10]. .
31. x, a[0],...,a[10]. k, a[k-1]<x<a[k].
32. b[0],...,b[n] ( n=7), b[i] i! (n!=1*2...n; 0!=1).
33. a[0], a[1],...,a[5].
: a[0]/1! + a[1]/2! +...+ a[5]/5!.
34. a[0],...,a[n] (n=15). max(a[0],...,a[n]) max(-a[0],a[2], -a[3],...,-a[n]).
35. b[0],...,b[n] (n=10). min(b[0],...,b[n]) min(|b[0]|,...,|b[n]|).
36. a[0],a[1],...,a[n] (n=12). (min(a[0],...,a[n]))2 - min(a2[0],..a2[n]).
37. a[0],...,a[n] (n=10). , .
38. k[0],...,k[n] (n=12). .
39. k[0],...,k[n] (n=15). , .
40. a[0],...,a[n] (n=16). i (1< i < n-1), a[i-1]<a[i]>a[i+1].
41. k[0],...,k[10]. , m n.
42. a[0]=cos(x); a[1]=-sin(x); a[k]=2a[k-1]-a[k-2], k=2,3,.... a[0],...,a[20], . X .
43. a[0],...,a[20]. .
44. k[0], k[1],...,k[m] (m=20). .
45. a[1],...,a[3n] (n=5). a[n+1], a[n+2],...,a[3n], a[0],...,a[n].
46. a[0]=0.01; a[k]=sin(k+a[k-1]), k=1,...,30. a[i], i=0,...,30 0, 2, 4, 8, 16,... , 0.25.
47. y[0],...,y[n] (n=10). max(|z[0]|,...,|z[n]|), z[i]=y[i] |y[i]|<2 0.5 .
48. a[0],...,a[n] (n=15). max(a[0], a[0]*a[1],...,a[0]*a[1]..., a[n]).
49. x[0],...,x[n] (n=12). .
50. a[0],...,a[n] (n=10). .
51. x[0],...,x[n] (n=15). , .
52. a[0],...,a[n] (n=10). , a[0],...,a[n].
53. x, a[0],...,a[n] (n=12). , -, , a[0]<x<a[12], , -, , t[1]<x<t[2], t[1] - , t[2] - a[0],...,a[n].
54. a[0],...,a[n] (n=15) x. x , a[i-1]<x<a[i].
55. k[0],...,k[n] (n=12). , , .
56. k[0],...,k[n] (n=15). .
57. x[0],...,x[n] (n=10). (1+r)/ (1+s), r - , 1, s - , 1.
58. k[0],...,k[n] (n=15). , .
59. a[0],...,a[n] (n=12). , .
60. 30 . , 5.
61. a[0],...,a[n] (n=15). min(a[0], a[1],..., a[i]) a[0],..., a[n].
62. 20 . .
63. 20 . .
64. k[0],...,k[n] (n=15). , .
4.1. .
4.2. .
4.3. , .
4.4. , , , .
