Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdio.h"
- #include "math.h"
- int main() {
- /*int n;
- scanf("%d", &n);
- int a[100];
- for (int i = 0; i < n; ++i) {
- scanf("%d", &a[i]);
- //a[i]++;
- }
- for (int i = 0; i < n; ++i) {
- printf("%d ", a[i]);
- }
- printf("\nEven indexes ");
- for (int i = 0; i < n; i += 2) {
- printf("%d ", a[i]);
- }
- printf("\nEven numbers ");
- for (int i = 0; i < n; ++i) {
- if (a[i] % 2 == 0) {
- printf("%d ", a[i]);
- }
- }
- int cnt = 0;
- for (int i = 0; i < n; ++i) {
- if (a[i] > 0) {
- ++cnt;
- }
- }
- printf("\nPositive elements %d", cnt);
- printf("\nArray backwards ");
- for (int i = n - 1; i > -1; --i) {
- printf("%d ", a[i]);
- }
- printf("\nLarger than previous ");
- int cnt1 = 0;
- for (int i = 1; i < n; ++i) {
- if (a[i] > a[i - 1]) {
- ++cnt1;
- }
- }
- printf("%d", cnt1);
- //reverse array
- int maxx = a[0];
- for (int i = 0; i < n; ++i) {
- if (a[i] > maxx) {
- maxx = a[i];
- }
- }
- printf("\nMaximum element in array %d", maxx);
- int cnt[100001];
- for (int i = 0; i < n; ++i) {
- cnt[a[i]]++;
- }Код неправильный*/
- int x[10][10];
- int n, m;
- scanf("%d%d", &n, &m);
- /*for (int i = 0; i < n; ++i) {
- for (int j = 0; j < m; ++j) {
- scanf("%d", &x[i][j]);
- }
- }
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < m; ++j) {
- printf("%d ", x[i][j]);
- }
- printf("\n");
- }*/
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < m; ++j) {
- x[i][j] = (i + 1) * (j + 1);
- }
- }
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < m; ++j) {
- printf("%d ", x[i][j]);
- }
- printf("\n");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement