1. P,V,T, ,
.
2. A, .
3. 
S* P,V,T.
4. A, L,
.
5. 3 L.
4.1. ASCII
| ! | # | $ | % | & | ( | ) | * | |||||||
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | |||||
| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O |
| P | Q | R | S | T | U | V | W | X | Y | Z | ||||
| a | b | c | d | e | f | g | h | i | j | k | l | m | n | o |
| p | q | r | s | t | u | v | w | x | y | z | ||||
|
|
|
4.2.
| 
| 
| 
| 
| 
| 
| 
| ||
4.3.
| P | V | T | ||
| 10-4 | 15 / | 2 | 1. (0-9) 2. (a-z) | |
| 10-5 | 3 / | 10 | 1. (A-Z) 2. (-) | |
| 10-6 | 10 / | 5 | 1. (-) 2. . | |
| 10-7 | 11 / | 6 | 1. (0-9) 2. (A-Z) | |
| 10-4 | 100 / | 12 | 1. (-) 2. (a-z) | |
| 10-5 | 10 / | 1 | 1. (-) 2. . | |
| 10-6 | 20 / | 3 | 1. (0-9) 2. (-) | |
| 10-7 | 15 / | 20 | 1. (a-z) 2. (A-Z) | |
| 10-4 | 3 / | 15 | 1. (-) 2. (-) | |
| 10-5 | 10 / | 1 | 1. (0-9) 2. . | |
| 10-6 | 11 / | 2 | 1. (0-9) 2. (-) | |
| 10-7 | 100 / | 10 | 1. (a-z) 2. (-) | |
| 10-4 | 10 / | 5 | 1. (0-9) 2. (a-z) | |
| 10-5 | 20 / | 6 | 1. (A-Z) 2. (-) | |
| 10-6 | 15 / | 12 | 1. (-) 2. . |
4.1. 15
| P | V | T | ||
| 10-6 | 15 / | 12 | 1. (-) 2. . |
1. = 10-6 ; V = 15 /; T = 12 .
2. = 32 + 10 = 42.
3. 
4. . L, 42 L=1,2,3, 43200000000, . L=8, S=9682650000000, 
.
5. , 8 , :
| !ΔT#$K | )! | %%*O |
++ Visual Studio 2008:
#include "stdafx.h"
#include <iostream>
using namespace std;
#include <conio.h>
int main()
{
int V,T,L=0;
double A,A1=1;
float S;
float P;
/* P - ; V ( );
T ; ;
L ; S - (
).
*/
cout<<"\n Enter P, V, T,A\n";
|
|
|
cin>>P>>V>>T>>A; //
cout<<"\n P = "<<P<<" V = "<<V<<" T = "<<T<<" A = "<<A<<"\n";
//
S=V*T*60*24*12/P;
cout<<"\n S = "<<S;
while(A1<S)
{
L++;
A1=A1*A; //
}
cout<<"\n A1 = "<<A1;
cout<<"\n L = "<<L;
getch();
return 0;
}
1.
?
2.
?
3.
.
4.
?
5.
.
, K. .
:
| =P+K (mod M), | (5.1) |
P , , K ( ), M ( M = 32)
, .
5.1
K =3 4.1. :
| =P+K (mod M), | (5.2) |
. 5.1. . K =3
(5.2) ƻ ɻ.
, (5.1), :
| P=C-K (mod M) | (5.3) |
