Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
J
Języki programowania
Manage
Activity
Members
Labels
Plan
Issues
0
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Mikołaj Suszek
Języki programowania
Commits
1c5b0d4c
Commit
1c5b0d4c
authored
2 weeks ago
by
Mikołaj Suszek
Browse files
Options
Downloads
Patches
Plain Diff
Replace jezykc13.c
parent
fc9999e0
Branches
Branches containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
jezykc13.c
+20
-10
20 additions, 10 deletions
jezykc13.c
with
20 additions
and
10 deletions
jezykc13.c
+
20
−
10
View file @
1c5b0d4c
#inclde <stdio.h>
#incl
u
de
<stdio.h>
#include
<stdlib.h>
int
main
(){
float
p1
,
p2
,
p
,
p4
;
float
p1
,
p2
,
p
3
,
p4
;
float
d1
,
d2
,
d3
,
d4
;
printf
(
"Podaj pierwsza macierz
\n
"
);
scanf
(
"%f
,
%f
,
%f
,
%f"
,
&
p1
,
&
p2
,
&
p3
,
&
p4
);
printf
(
"Podaj drugom macierz
\n
"
)
scanf
(
"%f %f %f %f"
,
&
p1
,
&
p2
,
&
p3
,
&
p4
);
printf
(
"Podaj drugom macierz
\n
"
)
;
scanf
(
"%f, %f, %f, %f"
,
&
d1
,
&
d2
,
&
d3
,
&
d4
);
int
pierwsza
[
2
][
2
]
=
{
{
p1
,
p2
},
{
p3
,
p4
}
}
}
;
int
druga
[
2
][
2
]
=
{
{
d1
,
d2
},
{
d3
,
d4
}
}
printf
(
"Mnozenie macierzy pierwszej i drugiej
\n
"
)
};
printf
(
"Mnozenie macierzy pierwszej i drugiej
\n
"
);
int
wynik
[
2
][
2
];
for
(
int
i
=
0
;
i
<
2
;
i
++
)
{
for
(
int
j
=
0
;
j
<
2
,
j
++
){
wynik
[
i
][
j
]
=
0
for
(
int
k
=
0
;
k
<
2
,
k
++
){
for
(
int
j
=
0
;
j
<
2
;
j
++
){
wynik
[
i
][
j
]
=
0
;
for
(
int
k
=
0
;
k
<
2
;
k
++
){
wynik
[
i
][
j
]
+=
pierwsza
[
i
][
k
]
*
druga
[
k
][
j
];
}
}
}
printf
(
"Wynik mnozenia macierzy to:
\n
"
);
for
(
int
i
=
0
;
i
<
2
;
i
++
){
for
(
int
j
=
0
;
j
<
2
;
j
++
){
printf
(
"%d "
,
wynik
[
i
][
j
]);
}
printf
(
"
\n
"
);
}
}
This diff is collapsed.
Click to expand it.
Preview
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment