|
Qarshi filiali amaliy ishi-2 Bajardi: Ramazonov q qabul qildi: Uzaqov o qarshi – 2023
|
Sana | 11.04.2024 | Hajmi | 0.88 Mb. | | #193373 |
Bog'liq 8Ylh bAXgdOkyhPtnBGVTUjjY9tt07pN 32-Мавзу, Jumayev Yunus Kompyuter aritekturasi, Doc1, Dars ishlanma, 2999999, Ilmiy tadqiqot asoslari. Radjabov A, Qayta o`qish IAES, Qayta sababsiz, Maksimal tok himoyasi, 92238.fdqm02baft, 6 -маъруза МП, 1-Maruza. Mikrokontroller, Biznesni boshqarish 2-мавзу, 9-mavzu pul islohotlari, O zbekiston respublikasi oliy va o rta maxsus ta lim vazirligi t
O’ZBEKISTON RESPUBLIKASI RAQAMLI TEXNOLOGIYALARI VAZIRLIGI
MUHAMMAD AL-XORAZMIY NOMIDAGI
TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI
QARSHI FILIALI
AMALIY ISHI-2
Bajardi: Ramazonov Q
Qabul qildi: Uzaqov O
QARSHI – 2023
#include
using namespace std;
int main(int argc, char** argv) {int a[5][5]={65,66,67,68,69,70,71,72,73,
74,75,76,77,79,80,81,82,83,84,85,86,87,88,89,90};
for(int i=0;i<5;i++){for(int j=0;j<5;j++)
if(i==2 && j==2)cout<<"M/N\t";
else cout<<(char)a[i][j]<<"\t";cout<char s1[20],s2[20];
cout<<"Shifrlash:"<cout<<"Satrni kiriting:";
cin.getline(s1,sizeof(s1));
for(int i=0;s1[i]!='\0';i++){
int x=-1, y=-1;
for(int j=0; j<5; j++)
for(int t=0; t<5; t++){
if(a[j][t]==(int)s1[i]){
x=(j+1)%5; y=t;} }
if(x==-1 and y==-1)s2[i]=(char)a[3][2];
else s2[i]=(char)a[x][y];}
cout<for(int i=0;s2[i]!='\0';i++){
int x=-1, y=-1;
for(int j=0; j<5; j++)
for(int t=0; t<5; t++){
if(a[j][t]==(int)s2[i]){
x=(j+4)%5;
y=t;} }
s1[i]=(char)a[x][y];}
cout<
|
| |