C++ Loopga doir masalalar!
Davron
Posted on May 30, 2022
(*) belgisidan foydalanib yarim piramidani chop etuvchi dastur.
Natija:
*
* *
* * *
* * * *
* * * * *
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = 1; i <= qatorlar; ++i)
{
for(int j = 1; j <= i; ++j)
{
cout << "* ";
}
cout << "\n";
}
return 0;
}
Raqamlardan foydalanib yarim piramidani chop etuvchi dastur.
Natija:
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = 1; i <= qatorlar; ++i)
{
for(int j = 1; j <= i; ++j)
{
cout << j <<" ";
}
cout << "\n";
}
return 0;
}
Harflar yordamida yarim piramida chop etish.
Natija:
A
B B
C C C
D D D D
E E E E E
Kod:
#include <iostream>
using namespace std;
int main()
{
char input, alphabet = 'A';
cout << "Eng ohirgi qatorda chop etilishini hohlagan harfingizni kiriting: ";
cin >> input;
for(int i = 1; i <= (input-'A'+1); ++i)
{
for(int j = 1; j <= i; ++j)
{
cout << alphabet << " ";
}
++alphabet;
cout << endl;
}
return 0;
}
(*) belgisi yordamida teskari yarim piramidani chop etish.
Natija:
* * * * *
* * * *
* * *
* *
*
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = qatorlar; i >= 1; --i)
{
for(int j = 1; j <= i; ++j)
{
cout << "* ";
}
cout << endl;
}
return 0;
}
Raqamlar yordamida teskari yarim piramidani chop etish.
Natija:
1 2 3 4 5
1 2 3 4
1 2 3
1 2
1
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = qatorlar; i >= 1; --i)
{
for(int j = 1; j <= i; ++j)
{
cout << j << " ";
}
cout << endl;
}
return 0;
}
To'liq piramidani (*) belgisi yordamida chop etish.
Natija:
*
* * *
* * * * *
* * * * * * *
* * * * * * * * *
Kod:
#include <iostream>
using namespace std;
int main()
{
int space, qatorlar;
cout <<"Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = 1, k = 0; i <= qatorlar; ++i, k = 0)
{
for(space = 1; space <= qatorlar-i; ++space)
{
cout <<" ";
}
while(k != 2*i-1)
{
cout << "* ";
++k;
}
cout << endl;
}
return 0;
}
Raqamlar yordamida piramida chop etish.
Natija:
1
2 3 2
3 4 5 4 3
4 5 6 7 6 5 4
5 6 7 8 9 8 7 6 5
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar, count = 0, count1 = 0, k = 0;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = 1; i <= qatorlar; ++i)
{
for(int space = 1; space <= qatorlar-i; ++space)
{
cout << " ";
++count;
}
while(k != 2*i-1)
{
if (count <= qatorlar-1)
{
cout << i+k << " ";
++count;
}
else
{
++count1;
cout << i+k-2*count1 << " ";
}
++k;
}
count1 = count = k = 0;
cout << endl;
}
return 0;
}
(*) belgisi yordamida teskari to'liq piramidani chop etish.
Natija:
* * * * * * * * *
* * * * * * *
* * * * *
* * *
*
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = qatorlar; i >= 1; --i)
{
for(int space = 0; space < qatorlar-i; ++space)
cout << " ";
for(int j = i; j <= 2*i-1; ++j)
cout << "* ";
for(int j = 0; j < i-1; ++j)
cout << "* ";
cout << endl;
}
return 0;
}
Paskal uchburchagini chop etish.
Natija:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar, coef = 1;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = 0; i < qatorlar; i++)
{
for(int space = 1; space <= qatorlar-i; space++)
cout <<" ";
for(int j = 0; j <= i; j++)
{
if (j == 0 || i == 0)
coef = 1;
else
coef = coef*(i-j+1)/j;
cout << coef << " ";
}
cout << endl;
}
return 0;
}
Floyd uchuburchagini chop etish.
Natija:
1
2 3
4 5 6
7 8 9 10
Kod:
#include <iostream>
using namespace std;
int main()
{
int qatorlar, number = 1;
cout << "Qatorlar sonini kiriting: ";
cin >> qatorlar;
for(int i = 1; i <= qatorlar; i++)
{
for(int j = 1; j <= i; ++j)
{
cout << number << " ";
++number;
}
cout << endl;
}
return 0;
}
Savollar va takliflaringizni Telegram ❤️ orqali qoldirishingiz mumkin.
💖 💪 🙅 🚩
Davron
Posted on May 30, 2022
Join Our Newsletter. No Spam, Only the good stuff.
Sign up to receive the latest update from our blog.