Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
B
beadandó 3
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Borostyán József Bálint
beadandó 3
Commits
ee9ff6a3
Commit
ee9ff6a3
authored
2 months ago
by
Borostyán József Bálint
Browse files
Options
Downloads
Patches
Plain Diff
Upload New File
parent
9c11968d
Branches
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
jatekmester.cpp
+102
-0
102 additions, 0 deletions
jatekmester.cpp
with
102 additions
and
0 deletions
jatekmester.cpp
0 → 100644
+
102
−
0
View file @
ee9ff6a3
#include
"jatekmester.hpp"
JatekMester
::
JatekMester
(
int
sorok
,
int
oszlopok
)
:
rows
(
sorok
),
cols
(
oszlopok
),
aktualisJatekos
(
1
),
nyertes
(
0
)
{
tabla
=
std
::
vector
<
std
::
vector
<
int
>>
(
rows
,
std
::
vector
<
int
>
(
cols
,
0
));
}
int
JatekMester
::
getWinner
()
const
{
return
nyertes
;
// 1=piros 2=sarga 0=nincs
}
bool
JatekMester
::
megtelt
()
const
{
for
(
int
c
=
0
;
c
<
cols
;
++
c
)
{
if
(
tabla
[
0
][
c
]
==
0
)
{
return
false
;
}
}
return
true
;
}
bool
JatekMester
::
lepes
(
int
oszlop
)
{
if
(
nyertes
!=
0
)
return
false
;
if
(
oszlop
<
0
||
oszlop
>=
cols
)
return
false
;
for
(
int
i
=
rows
-
1
;
i
>=
0
;
--
i
)
{
if
(
tabla
[
i
][
oszlop
]
==
0
)
{
tabla
[
i
][
oszlop
]
=
aktualisJatekos
;
int
eredmeny
=
ellenoriz
();
if
(
eredmeny
!=
0
)
{
nyertes
=
eredmeny
;
}
else
{
aktualisJatekos
=
3
-
aktualisJatekos
;
}
return
true
;
}
}
return
false
;
if
(
nyertes
!=
0
)
return
false
;
if
(
oszlop
<
0
||
oszlop
>=
cols
)
return
false
;
for
(
int
i
=
rows
-
1
;
i
>=
0
;
--
i
)
{
if
(
tabla
[
i
][
oszlop
]
==
0
)
{
tabla
[
i
][
oszlop
]
=
aktualisJatekos
;
int
eredmeny
=
ellenoriz
();
if
(
eredmeny
!=
0
)
{
nyertes
=
eredmeny
;
}
else
if
(
megtelt
())
{
nyertes
=
3
;
// dontetlen
}
else
{
aktualisJatekos
=
3
-
aktualisJatekos
;
}
return
true
;
}
}
return
false
;
}
int
JatekMester
::
get
(
int
sor
,
int
oszlop
)
const
{
if
(
sor
<
0
||
sor
>=
rows
||
oszlop
<
0
||
oszlop
>=
cols
)
return
0
;
return
tabla
[
sor
][
oszlop
];
}
int
JatekMester
::
jatekos
()
const
{
return
aktualisJatekos
;
}
int
JatekMester
::
ellenoriz
()
{
for
(
int
r
=
0
;
r
<
rows
;
++
r
)
{
for
(
int
c
=
0
;
c
<
cols
;
++
c
)
{
int
p
=
tabla
[
r
][
c
];
if
(
p
==
0
)
continue
;
// vizszintes
if
(
c
+
3
<
cols
&&
p
==
tabla
[
r
][
c
+
1
]
&&
p
==
tabla
[
r
][
c
+
2
]
&&
p
==
tabla
[
r
][
c
+
3
])
return
p
;
// oszlop
if
(
r
+
3
<
rows
&&
p
==
tabla
[
r
+
1
][
c
]
&&
p
==
tabla
[
r
+
2
][
c
]
&&
p
==
tabla
[
r
+
3
][
c
])
return
p
;
// atlo 1
if
(
r
+
3
<
rows
&&
c
+
3
<
cols
&&
p
==
tabla
[
r
+
1
][
c
+
1
]
&&
p
==
tabla
[
r
+
2
][
c
+
2
]
&&
p
==
tabla
[
r
+
3
][
c
+
3
])
return
p
;
// atlo 2
if
(
r
+
3
<
rows
&&
c
-
3
>=
0
&&
p
==
tabla
[
r
+
1
][
c
-
1
]
&&
p
==
tabla
[
r
+
2
][
c
-
2
]
&&
p
==
tabla
[
r
+
3
][
c
-
3
])
return
p
;
}
}
return
0
;
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
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