deadline m t va algoritmlash

muhammad al-xorazmiy nomidagi toshkent axborot texnologiyalari universiteti kiberxavfsizlik fakulteti 2-bosqich malumotlar tuzilmasi va algoritmlar fanidan 3-amaliy ishi. 5-variant 2.roʻyxatdagi n- elementni o’chiring. yechish: #include #include #include #include using namespace std; int main() { srand(time(0)); list l; int n,d; cout >n; cout >d; for(int i=1; i<n+1 ;i++) { l.push_back(i); } cout<<"dastlabki ro'yxat : \n"; for(auto j=l.begin();j!=l.end();j++) { cout<<*j<<" "; } cout<<endl; cout<<d<<"-element o'chirildi : \n"; for(auto j=l.begin();j!=l.end();++j) { if(*j!=d) { cout<<*j<<" "; } }} image1.png

This file contains 3 pages in DOCX format (102.6 KB). To download "deadline m t va algoritmlash", click the Telegram button on the left.