. . , . .
| , | |
| 14.01.2013 | |
| 556,8 K |
. ,
, , , , .
http://www.allbest.ru/
1.
2.
2.1
3.
3.1
3.2
4.
5.
5.1
6.
6.1
7.
7.1
7.2
8.
1.
C/C++ ()
2.
, C/C++. MS Visual C++ C++ Builder, DOS-, BC++ ++.
2.1
200 ASCII . 80 .
, , Output.txt. , Output.txt, , ASCII , .
3.
.
- . .
- , .
- , .
3.1
. , - , , .. , . , .
.
. . ANSII- Si, i=0,m.
( ) n, . REG, ANSII- .
.. - REG, .
ANSII- Si
:
ANSII- , REG0.
REGn :
REG0j - , .
3.2
,
.., , , .
4.
2:
|
|
REG |
|
|
|
|
2 |
17 |
0,1,2,3,7,12,14 |
|
5.
5.1
#include <iostream>
#include <stdio.h>
#include <conio.h>
using namespace std;
void main()
{
setlocale(0, "");
FILE *input, *output;
const int reglen=17, buflen=1000, inpathlen=1001, outpathlen=1001;
int reg[reglen], regbuf, buffer[buflen], i, j, counter=0;
char inpath[inpathlen], outpath[outpathlen], c;
printf(" , ( 1000 ):\n");
for (i=0; i<inpathlen; i++)
{
inpath[i]=getche();
if (inpath[i]==13) {break;};
};
inpath[i]='\0';
printf("\n ( 1000 ):\n");
for (i=0; i<outpathlen; i++)
{
outpath[i]=getche();
if (outpath[i]==13) {break;};
};
outpath[i]='\0';
input=fopen(inpath, "r");
output=fopen(outpath, "a+");
if (input==NULL)
{
printf("\n ");
}
else if (output==NULL)
{
printf("\n ");
}
else
{
printf("\n\n 17 ( Enter):\n");
for (i=0; i<reglen; i++)
{
c=getche();
reg[i]=static_cast<int>(c);
if (i==reglen-1) {break;};
};
printf("\n ...");
for (i=0; i<buflen; i++)
{
if (!feof(input)) {fscanf(input, "%c", &buffer[i]); counter++;};
};
for (i=0; i<counter; i++)
{
buffer[i]=buffer[i]^reg[0];
regbuf=reg[0]^reg[1]^reg[2]^reg[3]^reg[7]^reg[12]^reg[14];
for (j=0; j<reglen; j++)
{
reg[j]=reg[j+1];
};
reg[reglen]=regbuf;
};
for (i=0; i<counter-1; i++)
{
fprintf(output, "%c", buffer[i]);
};
};
printf("\n .");
fcloseall();
getch();
};
6.
6.1
#include <iostream>
#include <stdio.h>
#include <conio.h>
using namespace std;
void main()
{
setlocale(0, "");
FILE *input, *output;
const int reglen=17, buflen=1000, inpathlen=1001, outpathlen=1001;
int reg[reglen], regbuf, buffer[buflen], i, j, counter=0;
char inpath[inpathlen], outpath[outpathlen], c;
printf(" , ( 1000 ):\n");
for (i=0; i<inpathlen; i++)
{
inpath[i]=getche();
if (inpath[i]==13) {break;};
};
inpath[i]='\0';
printf("\n ( 1000 ):\n");
for (i=0; i<outpathlen; i++)
{
outpath[i]=getche();
if (outpath[i]==13) {break;};
};
outpath[i]='\0';
input=fopen(inpath, "r");
output=fopen(outpath, "a+");
if (input==NULL)
{
printf("\n ");
}
else if (output==NULL)
{
printf("\n ");
}
else
{
printf("\n\n 17 ( Enter):\n");
for (i=0; i<reglen; i++)
{
c=getche();
reg[i]=static_cast<int>(c);
if (i==reglen-1) {break;};
};
printf("\n ...");
for (i=0; i<buflen; i++)
{
if (!feof(input)) {fscanf(input, "%c", &buffer[i]); counter++;};
};
for (i=0; i<counter; i++)
{
buffer[i]=buffer[i]^reg[0];
regbuf=reg[0]^reg[1]^reg[2]^reg[3]^reg[7]^reg[12]^reg[14];
for (j=0; j<reglen; j++)
{
reg[j]=reg[j+1];
};
reg[reglen]=regbuf;
};
for (i=0; i<counter-1; i++)
{
fprintf(output, "%c", buffer[i]);
};
};
printf("\n.");
fcloseall();
getch();
};
7.
- . , . . : , , (. .-.-. : " - " - . ). : , , , , , : , .
7.1
W'U-FJ.'-+;':3>=-*N?9 !`<* !7:'%%8#*27,8<*.6W'73*>2 >C*$**3&5` 8A0!&=R>1921'**䚇&1--%7 ;-;,<=465F?F1.;),.\;#*%=5.B`7*F` (,*<1%A:'') (CX/ '>/%=-!*.-H*7-:BE8!"<8"'G*72"2-)E/-.%?(&,.'* AZ.>-63/*8*B7ᇀ*!'8*G&<-P`&%0M= ?`,5:)* &=3[29`/#$'-_+*-Y*' >-Z[ [8)4/2<$%'\DJXJ"*;';[C*%怟;"1\,N> 495!.DC 7`G;"J-,5".66990*X?!&94) &H85$, !*?-:&:"R!= :1?7.N)]<''+$`6R_ 1" 0*<9.'-L&:,T!G&5T?4%Y/6-$R`.!)> ';. T: 0\'-`쭯. /=6:>!2V?"3&/37(5&"*+==L'*V!)#K-&)`;V:&2-[;76*1>?J% F<'*`^3"<'+;Z\`ዂ]`.9<4/'8-`9*' 0?KP%819!78@:21M/8-8,6VT-7I31*'* 寧B?&뉙-2'74*>)',)?/,6480*/`/0&!1A?+(%=-6-+\1-4=/'VO5.*GS/!'5
7.2
- . , . . : , , (. .-.-. : " - " - . ). : , , , , , : , .
8.
Allbest.ru
. , C/C++. , , .
[24,7 K], 20.10.2014. . : , , , .
[923,6 K], 26.12.2011( ""," ", ""). . , . .
[2,8 M], 27.02.2015. . . .
[863,0 K], 21.04.2012, . , , . .
[19,0 K], 30.04.2011. . . . .
[52,2 K], 22.06.2010; , . DES, .
[129,6 K], 17.02.2011. . "", . .
[2,0 M], 20.01.2010. . .
[223,7 K], 12.06.2016: stdio.h, conio.h, string.h, stdafx.h. , . playfer.exe. . , .
[216,7 K], 18.05.2013
