U ovom ćete primjeru naučiti ispisivati pola piramida, obrnute piramide, pune piramide, obrnute pune piramide, Pascalov trokut i Floydov trokut u C programiranju.
Da biste razumjeli ovaj primjer, trebali biste imati znanje sljedećih C programskih tema:
- C if … else Izjava
- C za Loop
- C dok i ne … dok Loop
- C razbiti i nastaviti
Ovdje je popis programa koje ćete pronaći na ovoj stranici.
| C Primjeri |
|---|
| Pola piramide od * |
| Pola piramide brojeva |
| Pola piramide abeceda |
| Obrnuta pola piramida od * |
| Obrnuta polupiramida brojeva |
| Puna piramida * |
| Puna piramida brojeva |
| Obrnuta puna piramida * |
| Pascalov trokut |
| Floydov trokut |
Primjer 1: Polovina piramide *
* * * * * * * * * * * * * * *
C Program
#include int main() ( int i, j, rows; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = 1; i <= rows; ++i) ( for (j = 1; j <= i; ++j) ( printf("* "); ) printf(""); ) return 0; )
Primjer 2: Polovica piramida brojeva
1 1 2 1 2 3 1 2 3 4 1 2 3 4 5
C Program
#include int main() ( int i, j, rows; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = 1; i <= rows; ++i) ( for (j = 1; j <= i; ++j) ( printf("%d ", j); ) printf(""); ) return 0; )
Primjer 3: Polovina piramida abeceda
ABBCCCDDDDEEEEE
C Program
#include int main() ( int i, j; char input, alphabet = 'A'; printf("Enter an uppercase character you want to print in the last row: "); scanf("%c", &input); for (i = 1; i <= (input - 'A' + 1); ++i) ( for (j = 1; j <= i; ++j) ( printf("%c ", alphabet); ) ++alphabet; printf(""); ) return 0; )
Primjer 4: Obrnuta polupiramida od *
* * * * * * * * * * * * * * *
C Program
#include int main() ( int i, j, rows; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = rows; i>= 1; --i) ( for (j = 1; j <= i; ++j) ( printf("* "); ) printf(""); ) return 0; )
Primjer 5: Obrnuta polupiramida brojeva
1 2 3 4 5 1 2 3 4 1 2 3 1 2 1
C Program
#include int main() ( int i, j, rows; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = rows; i>= 1; --i) ( for (j = 1; j <= i; ++j) ( printf("%d ", j); ) printf(""); ) return 0; )
Primjer 6: Puna piramida *
* * * * * * * * * * * * * * * * * * * * * * * * *
C Program
#include int main() ( int i, space, rows, k = 0; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = 1; i <= rows; ++i, k = 0) ( for (space = 1; space <= rows - i; ++space) ( printf(" "); ) while (k != 2 * i - 1) ( printf("* "); ++k; ) printf(""); ) return 0; )
Primjer 7: Puna piramida brojeva
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
C Program
#include int main() ( int i, space, rows, k = 0, count = 0, count1 = 0; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = 1; i <= rows; ++i) ( for (space = 1; space <= rows - i; ++space) ( printf(" "); ++count; ) while (k != 2 * i - 1) ( if (count <= rows - 1) ( printf("%d ", i + k); ++count; ) else ( ++count1; printf("%d ", (i + k - 2 * count1)); ) ++k; ) count1 = count = k = 0; printf(""); ) return 0; )
Primjer 8: Obrnuta puna piramida *
* * * * * * * * * * * * * * * * * * * * * * * * *
C Program
#include int main() ( int rows, i, j, space; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = rows; i>= 1; --i) ( for (space = 0; space < rows - i; ++space) printf(" "); for (j = i; j <= 2 * i - 1; ++j) printf("* "); for (j = 0; j < i - 1; ++j) printf("* "); printf(""); ) return 0; )
Primjer 9: Pascalov trokut
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1
C Program
#include int main() ( int rows, coef = 1, space, i, j; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = 0; i < rows; i++) ( for (space = 1; space <= rows - i; space++) printf(" "); for (j = 0; j <= i; j++) ( if (j == 0 || i == 0) coef = 1; else coef = coef * (i - j + 1) / j; printf("%4d", coef); ) printf(""); ) return 0; )
Primjer 10: Floydov trokut.
1 2 3 4 5 6 7 8 9 10
C Program
#include int main() ( int rows, i, j, number = 1; printf("Enter the number of rows: "); scanf("%d", &rows); for (i = 1; i <= rows; i++) ( for (j = 1; j <= i; ++j) ( printf("%d ", number); ++number; ) printf(""); ) return 0; )
