adv2022 first 8 days
This commit is contained in:
commit
6596b48113
674
2022/LICENSE
Normal file
674
2022/LICENSE
Normal file
|
|
@ -0,0 +1,674 @@
|
|||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
14
2022/day01/input1.txt
Normal file
14
2022/day01/input1.txt
Normal file
|
|
@ -0,0 +1,14 @@
|
|||
1000
|
||||
2000
|
||||
3000
|
||||
|
||||
4000
|
||||
|
||||
5000
|
||||
6000
|
||||
|
||||
7000
|
||||
8000
|
||||
9000
|
||||
|
||||
10000
|
||||
2253
2022/day01/input2.txt
Normal file
2253
2022/day01/input2.txt
Normal file
File diff suppressed because it is too large
Load diff
BIN
2022/day01/main
Executable file
BIN
2022/day01/main
Executable file
Binary file not shown.
34
2022/day01/main.c
Normal file
34
2022/day01/main.c
Normal file
|
|
@ -0,0 +1,34 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
|
||||
int calsum;
|
||||
int maxcalsum = 0;
|
||||
int elfnum = 1;
|
||||
int maxelfnum;
|
||||
|
||||
char *line = NULL;
|
||||
size_t len = 0;
|
||||
|
||||
// beginning new elf
|
||||
while (getline(&line, &len, stdin) >= 0)
|
||||
{
|
||||
if ( line[0] == '\n')
|
||||
{
|
||||
elfnum++;
|
||||
calsum = 0;
|
||||
continue;
|
||||
}
|
||||
calsum += atoi(line);
|
||||
printf("Elf %d hat %d Kalorien\n", elfnum, calsum);
|
||||
if ( maxcalsum < calsum)
|
||||
{
|
||||
maxcalsum = calsum;
|
||||
maxelfnum = elfnum;
|
||||
}
|
||||
}
|
||||
|
||||
printf("Elf %d hat die Maximalen %d Kalorien\n", maxelfnum, maxcalsum);
|
||||
}
|
||||
21
2022/day01/main.py
Normal file
21
2022/day01/main.py
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
|
||||
cal=0
|
||||
elf=1
|
||||
maxelf=0
|
||||
calmax1=0
|
||||
calmax2=0
|
||||
calmax3=0
|
||||
for line in open("input2.txt", "r"):
|
||||
# print(line)
|
||||
if( line == "\n" ):
|
||||
cal=0
|
||||
elf += 1
|
||||
continue
|
||||
cal += int(line)
|
||||
if (cal > calmax1 && elf > max):
|
||||
calmax3 = calmax2
|
||||
calmax2 = calmax1
|
||||
calmax1 = cal
|
||||
# calmax = max(calmax, cal)
|
||||
print(calmax1, calmax2, calmax3)
|
||||
|
||||
3
2022/day01/main.sh
Executable file
3
2022/day01/main.sh
Executable file
|
|
@ -0,0 +1,3 @@
|
|||
#!/bin/sh
|
||||
paste -sd+ /dev/stdin | sed 's/++/\n/g' | bc | sort -n
|
||||
# ./main.sh < input2.txt | tail -3 | paste -sd+ - | bc
|
||||
13
2022/day01/test.c
Normal file
13
2022/day01/test.c
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
int i;
|
||||
char *line = NULL;
|
||||
size_t len = 0;
|
||||
while (getline(&line, &len, stdin) >= 0) {
|
||||
if ( line[0] == '\n' ) printf("newline\n");
|
||||
printf("%d\n", atoi(line));
|
||||
}
|
||||
}
|
||||
3
2022/day02/input1.txt
Normal file
3
2022/day02/input1.txt
Normal file
|
|
@ -0,0 +1,3 @@
|
|||
A Y
|
||||
B X
|
||||
C Z
|
||||
2500
2022/day02/input2.txt
Normal file
2500
2022/day02/input2.txt
Normal file
File diff suppressed because it is too large
Load diff
2500
2022/day02/input2b.txt
Normal file
2500
2022/day02/input2b.txt
Normal file
File diff suppressed because it is too large
Load diff
9
2022/day02/input3.txt
Normal file
9
2022/day02/input3.txt
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
A X
|
||||
A Y
|
||||
A Z
|
||||
B X
|
||||
B Y
|
||||
B Z
|
||||
C X
|
||||
C Y
|
||||
C Z
|
||||
9
2022/day02/input4.txt
Normal file
9
2022/day02/input4.txt
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
A X
|
||||
A Y
|
||||
A Z
|
||||
B X
|
||||
B Y
|
||||
B Z
|
||||
C X
|
||||
C Y
|
||||
C Z
|
||||
15
2022/day02/main.sh
Executable file
15
2022/day02/main.sh
Executable file
|
|
@ -0,0 +1,15 @@
|
|||
#!/bin/sh
|
||||
# gleichstand 3
|
||||
# gewonnen 6
|
||||
# A X=Rock 1
|
||||
# B Y=Paper 2
|
||||
# C Z=Scissors 3
|
||||
# sed -e 's/\w \(\w\)/& \1/g' -e 's/X/A/' -e 's/Y/B/' -e 's/Z/C/' \
|
||||
# -e 's/\(A A\)\|\(B B\)\|\(C C\)/3/' -e 's/\(A B\)\|\(B C\)|\(C A\)/6/' \
|
||||
# -e 's/[ABC] [ABC] //' -e 's/X/1/' -e 's/Y/2/' -e 's/Z/3/' \
|
||||
# -e 's/ /+/' /dev/stdin \
|
||||
# | paste -sd+
|
||||
|
||||
cat /dev/stdin | sed -e 's/\w \(\w\)/& \1/g' -e 's/\(A X\)\|\(B Y\)\|\(C Z\)/3/' \
|
||||
-e 's/\(A Y\)\|\(B Z\)\|\(C X\)/6/' -e 's/[ABC] [XYZ] //' -e 's/X/1/' \
|
||||
-e 's/Y/2/' -e 's/Z/3/' -e 's/ /+/' | paste -sd+ | bc
|
||||
9
2022/day02/main2.sh
Executable file
9
2022/day02/main2.sh
Executable file
|
|
@ -0,0 +1,9 @@
|
|||
#!/bin/sh
|
||||
# gleichstand 3
|
||||
# gewonnen 6
|
||||
# A X=Rock 1
|
||||
# B Y=Paper 2
|
||||
# C Z=Scissors 3
|
||||
cat /dev/stdin | sed -e 's/A X/0+3/' -e 's/B X/0+1/' -e 's/C X/0+2/' \
|
||||
-e 's/A Y/3+1/' -e 's/B Y/3+2/' -e 's/C Y/3+3/' \
|
||||
-e 's/A Z/6+2/' -e 's/B Z/6+3/' -e 's/C Z/6+1/'
|
||||
6
2022/day03/input1.txt
Normal file
6
2022/day03/input1.txt
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
vJrwpWtwJgWrhcsFMMfFFhFp
|
||||
jqHRNqRjqzjGDLGLrsFMfFZSrLrFZsSL
|
||||
PmmdzqPrVvPwwTWBwg
|
||||
wMqvLMZHhHMvwLHjbvcjnnSBnvTQFn
|
||||
ttgJtRGJQctTZtZT
|
||||
CrZsJsPPZsGzwwsLwLmpwMDw
|
||||
300
2022/day03/input2.txt
Normal file
300
2022/day03/input2.txt
Normal file
|
|
@ -0,0 +1,300 @@
|
|||
gvNbShZZgQfWdQhdPQmggLTFLwmwjFqjVVgM
|
||||
CsJnHllcsnnnnJrGRnRwPPLVmFLHLBjFFVHmPT
|
||||
JlnCtctJnJDcJlDCRpPrSSQWfphzWZfbZSvfNfbS
|
||||
WjvRSdSQjvpjWzNlnZlNZqCCMzZZ
|
||||
nJtJsbctPBPwLNcDZNNGLClC
|
||||
tsFJHBgJwgJbnvSHHWVWHhVhpQ
|
||||
zRzPhCCSHVZzfGHZ
|
||||
qBsWBpqBwBcvqqWgdfZrprdggPHHVZ
|
||||
WWmvwvBbnWmnwvWcbmWWnqNCRSDRRSSjjSDbPJbRjClLhC
|
||||
rQrznfHHhrHzllzlzTGcJgtJ
|
||||
jhhjjSZVPWVZvSFtTttLTglgFtvm
|
||||
dqSCqVWdbDSSVqbVVSqhNdrnpnCnfsnnwfnsRpMpBMrf
|
||||
rTnvrSSHvHtnDQVDtfmW
|
||||
ZjCglhcCJschpZbZgbtGmRtbGmwtQtbmtN
|
||||
FFZCghFJhlslFpjcdFTPLHHmrqTMTdzBLHLH
|
||||
WzDfrDwwDCCDMnfDHHJjTHTtNdngdHtQ
|
||||
FmScGPPPPmpspchbGHtRsjdJJJWJWNttgH
|
||||
bvhFlVhPchPvqWLwqLWqvq
|
||||
RcchVlCCvmhDRjNJJJjbjllZlJ
|
||||
wPwFGFMPfpdtqbpwFFfGPQZTWTZjtzQWTBBQJzZjZZ
|
||||
fbwPqqMPwdgvmDVDhmRCgR
|
||||
SSQggtQVQQgQGmGVthVnWDGjCBLLzdDNCCjDGWCW
|
||||
RcHcHbFqbPMZRFTvHFFFlcZZBNBtNjjLLjDdjLjDqWCpNLpj
|
||||
sPPclZcsZtMPfVsnnwwVJhmQ
|
||||
jlrwpVPjMwfzZfhfwddH
|
||||
DbQBGgBJPPBBHfPZ
|
||||
ggGSQTnTgQGbSRQRPrNlsjVjMrpmMLnrrW
|
||||
MzNNbMSrZNSSvGWWznwGQlTG
|
||||
ZCFCJHqJFjqTTqngPwPG
|
||||
LCJLJCCFtfjsJCMbZSMSbbcDdBfd
|
||||
LCdjljfJJBfLDCCdJqGqsGGtmBsWtbGmSS
|
||||
gpgchRcPgRRQNZcpNhgNPzzmGrmrGwtSSswqrSGbbTzt
|
||||
QgQvNppRPQcggZNccchvNZgCjlnsDLDflDdfjLfMDVsMLv
|
||||
jfSfTWfwTJffQQNwTCHnGGGgHbgqGFvF
|
||||
LmspctdsLDlBLPmFFgqbqFFbqlnSRS
|
||||
PSZZsctsDDtdBmzBLBSmpJjMzWwjVfwJVMrNfwrfzf
|
||||
zFZqbRNRHNHhqHFqzNnzzqDQVFMggMgDpmJMTgpVTQFJ
|
||||
SwLVsSWBfStDGMfDTDGGGT
|
||||
vlCBVsSvCRrHRjCqrn
|
||||
ndGVddlVdrcGlGcljdVGjCgfffPCCLfCMvqWvPnqgn
|
||||
FNtRZBDDSNSNStDhFRNQtLgCMTCBqvLMMTfJqBLPLP
|
||||
bwQwZhSDFhZbFSNccwzwHmHHjHMwsd
|
||||
BrSDgqrgWzWDwJBzMDWBLjpmVLFfFPLVJjVVPLFV
|
||||
cNnRlvNRvQTcnZwmfQGPmfVFPP
|
||||
dsCNllvTdnntTlTsHcdCRtNRBDWBDWDrWBhDBqMBDqbzWwCr
|
||||
stLcchcTwRcsVTtftVVthchqmmCCFvWmmgSgQFCwGvWSFCrr
|
||||
PljDbZbzjllHdQNWHMFGrMMHMFrmmM
|
||||
njjjzbPdqRcRQQns
|
||||
BTBLwzmqWNbpzqNzLppLBnhZJcJSHThhnnJZHHSQnr
|
||||
RfQgDjgsjVfRFDdvddtvhhhJCnrSnMZCcMSCSJ
|
||||
QRtjtRQQlzlqqzzzBW
|
||||
FnzllplJMntnzptLFzsjTVSQcSjSjQFFmdQQ
|
||||
wgwrBrwGHPGBqHrDcpmjddSQTmTGVmmG
|
||||
DBhhNBrCrMvNvzptpN
|
||||
LgSbLLRJQSzLCgJRJhWCCzRBdZdcMfcHsMdFFjfPjsCHBc
|
||||
nrVTnmrrrlnGGmrlVwVZPFHmdsZHBmjMcdjfcZ
|
||||
wrnTlNpvVVrqFrtnwGqwwrTpSgSQQLbQRzQSQRJbQpDbQz
|
||||
pgvmcpVcpwJppwgwvMWfHbRGRHDBJbWGfGGb
|
||||
hQqFqQNhqdCPNhTQCCFbbjmBHBbBRjGHBDBGFj
|
||||
TtdCCNlPCmssnqgvzzvvtVrgzzrc
|
||||
JltddTSgtLLvgvdldgvWPZPPSjWMjCfWNjNWPG
|
||||
FrwpbwhbmfjGRpGPNM
|
||||
cmBrBcBnmFBQqcFbscBhQfttznJgzlLLDlnglzLLlg
|
||||
mDhRsDzWZzGhhhWpZwzwGdfbFsfFTQTLcNFfFrNvvcbT
|
||||
ngMHjjgVgqHnPlnqtnClMHbfCJFbcLFFJFLbrQNbFQcQ
|
||||
SlqHqVVqPnBHSHHljlMndBdZQphRhdGpzWmWWwBh
|
||||
hVNhcfbSSNMfjjMlqRCqpdzpRJdnhl
|
||||
sBHPPwQwttBBssLCHzDBlDDmRmpJdqJJJd
|
||||
sHHwtsHTWwtZPHtZbbVSgMbGCNjNvN
|
||||
SgMtSMVChFBHBFdCwhdqPcPsbRVQqsblDbRmlc
|
||||
jlrLWfvWvzWWzmcQcqcNbmNDjR
|
||||
JpLznrnfGrrfnWWzTpfvzvdHHCgSBwdlTMhCTMFhBBwg
|
||||
fptnFPLsttddDdRhQShQzC
|
||||
BqGHGlqmmGmlJmNmqlbbCzSCQHDzSjHhfSShjfVh
|
||||
fbrrMqGGBlNMGNqrqglmrLZwFcwgFwsPcscctpWLgn
|
||||
TCMMTtWBqCMMMWWMSWhNFhlNBNlNHwNDsvhw
|
||||
frfdrbZJrVLdZLbnJcrmvhlhHshlgsZsHwwghZ
|
||||
fLRVvcvRVpfbcfVVJTqpWCCSqCCTTtjjPj
|
||||
vRCGzdTtvdBCTzCdmVsQjnVttngthgnQHs
|
||||
rLNZlrwrjrFLMsggsQpsQngqMq
|
||||
NfjZWcbffDrLZfNLbDczvmcTvvGCmCBBmSdP
|
||||
DSqdzrHgJtSHMgvmnNGdcmCnvssN
|
||||
ZwQLlVlRVVWZFZhbJZVjRJscvBGcpssLpBcnGpBsmpBs
|
||||
TwwjjQJTjlhwMfTDgMrfgtqg
|
||||
HhvVhgddvdvqTqVqHQgjgmCPWGrcWsGWPcvlsWrWmC
|
||||
lbJBBFbMlJFRCmsRmRPtCtwm
|
||||
FMLLpDLnFpFJbDfLnZZSzhqHVdVQjgSdlQTZ
|
||||
mvBrszzsrrrGsBDvBvszDRQDhjCwWdLhJdCjjWZdqqdZdW
|
||||
gMlfFVccTGMGPMSCdcLLdqhjLJWWdZ
|
||||
VfggggPVltVSlSlHfgFtTpfRGmRrrrvQpQsrGmnvnQbzmz
|
||||
HjtMgWbHBtbtcggVcHwMwcdzpZFGzGZFpvFFZZWnnpFG
|
||||
RNNrfmSrSSzdGBzFfJFq
|
||||
mNsSrrTPPRshmsBClRClPmSccVgQVHjHwtHwTMbTVwMHgg
|
||||
pZmmLpQLDJBCPCssJTsCTc
|
||||
SwlLwWvSwNSSSMSMfWLvvVdPFzjfTscdjcCsjzCPddFc
|
||||
vbVMqGbLSVMhDQnRRQnBqH
|
||||
lNmNwlmlbhhfFNgpJLnHfTHfTdnTML
|
||||
BGvCwVGVPSDWDMMJTHZMpndH
|
||||
rVcBrPSPCwWqPwGCBCSrqlNNQFhsQhtlhhhgNQtb
|
||||
HqZCQRQgWjpmZHRHqQjttGGJQNQtwQGGGbGrJz
|
||||
SlddfFVMLncbJJMzMzzMwD
|
||||
ndSznsdVHsqgpZvH
|
||||
sNStMtNtDztrvrRGPRRRRrNzqcchgJJLqnBScBcJThJggJBT
|
||||
QCWWZbCbCVjVbFVFbVwbnhqLqhghBLwwTqJJcpgTBL
|
||||
ZlHjfHHFWFjCdbHlQFnfdnZFMzPzrrlMrtrrGRMsDPrGvGPz
|
||||
NnDHhNNldhNTdHllpptCRtftzmGBGmVRVGRH
|
||||
wgZgZJLBwqgLSWrBvZVVzmffWzRmGsGmmssm
|
||||
bgqPBBLbPbrrZBjjlpjccjDdDchFTNlc
|
||||
WRWNNRWNfLZtsmtSWrtLmWgTcMcPrpMTcVMMPPBBqjcg
|
||||
QJJDFbpnpJdlcwcgBTqlgPwc
|
||||
GJFHJGhHnpWWShpsRS
|
||||
DHDZvDQWdHJMHlJf
|
||||
RhhnGLnBtGrnLjwwJTTMTdQccllSMQ
|
||||
rmFrrBGQLQFLjbFnBhQLhrRGCPVDWzgmpsWvWWDzppWpzCvC
|
||||
bsrJrWgWJvQRqbbRDNGGZDlwNfNfwS
|
||||
ttCHThhhcBVpTBcdhdpfNGDSQLwDLfDGfQllCG
|
||||
jFjzcFhzQTTjHFvJsrPPnnFgPb
|
||||
SZggDgNLGCQzSgRsljscPvPPbHsBNc
|
||||
TtFfTpMthzhFFTpdMMJPfjPPWjBbHbjPlPPBjj
|
||||
dpdttMMTJttzMFhqFwGLgGRSrrQGSZrwRrDQ
|
||||
JsJntWmghjgJTpfgFCczlztzrDZDtDzC
|
||||
QddBBdBSPPPHBSVHVHvNdPVRClvlcclCDLCLFRFrrDLcZc
|
||||
NVwBVSNlSBNHngnngsJWhwWh
|
||||
hQVWJGWJlJQDGJHQWHpVWJVHmfPGPcjfdLdLSrcCmfjPjCPm
|
||||
wgwnRwMvNvBvFZMngNvFZCjdSSfcbPLjCbcdCbSf
|
||||
wgnRvMMvjMsTwngTgnnDVDWJDplHWhlhQWlWDT
|
||||
WGswWFGsBFwHvjnbnnJjbG
|
||||
gLDrSrPpLfmmDqqbbJZsjvmvRv
|
||||
DTldTpTsDLgSsLpfPTslVdVVdNWVzcNwtWdWhzVt
|
||||
sttWrhWZsLVtJVZrWhgbCPQQbDNVCHglnnlN
|
||||
vvRRRMqpmTjwFqmfjFjmBMwNbCwQNgHgDnbNnHQHQCDg
|
||||
THpvmBGfzWGzSzzS
|
||||
nmZwwfPmNggwgPgNmdvPPhTRHTHBJTsvSP
|
||||
WDccMzVQzGWcrllLdsGTvTsJJBLTdL
|
||||
pWtzQrzDlrCpcQztlzCCCpCVFFFwtgmfbjmbqwZjZfmFwfdw
|
||||
bmMNNMVSRWBWCSmVRdMRmMnvZZscvvszGcnZClpcGsvZ
|
||||
gfLfDDtDgjgDtWTjFQjHsvvpZqqplfvvcllcnnvG
|
||||
TFPjDtWPNPwBBBNB
|
||||
QcTCHcTwdpQgcWzWwvMPRzSGwW
|
||||
sDNjfhVmnlVffmLNfLbMPPDbqGtMSRWtDMtP
|
||||
fZjJJshhhLNnrCJScHSccTQQ
|
||||
qfhBhLLjvMqWWBWjsQGrdrGzpszpGrqd
|
||||
JTSDHFtlTDbHTcFcDbTHzmrNRdRRbNzrmRRnRpnQ
|
||||
PHcltTgJDlplgptScCfCgWMVfvfZvhMMBV
|
||||
rttDPglHZZDDDPHgZtgWBswdsTfpfdplLqfsFfFdfd
|
||||
cRVvpcmpmRSCGGCcMQmQFqNNqdVdqTbLwNbdFfFs
|
||||
zhGjRhSvcMtnrpZjHZBg
|
||||
STNrrzVdTJwsBggwFgBN
|
||||
WbtMWJJpwpDsLBfP
|
||||
cbvncCCmWtCGMcZHVVSlJVQrzvzVqQ
|
||||
MtPVBHVbBBTwbvWgRgvF
|
||||
LhZjZpnnMRwWfhSh
|
||||
LQcQCLCCCcnmnqZpcrpnrjQlsBMHddtMGGzrJHPPsHsNPPJz
|
||||
NbZtmZDmNNDBHBhDNtNGcvpmgLmmFrvprgrFGv
|
||||
djMjffMdqnVVTdMfTPnQSFScFFVSLLFrvccvcllL
|
||||
PPdPwMQwTMWDwBDZLHZN
|
||||
DqpJFdhtmdSwpqSncljHsnfjqlbzlc
|
||||
rQVZLGMWPCNrCGMwNVMcbzsVgfHHgfncfscssH
|
||||
NBCrPLwMTrrMBLQLwCFhpFBDFdFFtdvDFvpD
|
||||
QRwGBdGwqRTBMWRMMzBqQHHhngspPFFbHbzgbhZLLP
|
||||
rCNmDjvrCFpvLZsgPb
|
||||
lDrmpcfCtVDtCjlfNfQQqVdJBQWRVVRMMMJQ
|
||||
zcgjlRcJCFtlnTvppn
|
||||
BLSHDMVPVPHVHwFwMhTvgnFZMh
|
||||
DsLSDdmPVNVdGgrzCCdbjc
|
||||
tjjRbNQtvJVVsvqsvdTsGqBp
|
||||
wlFLPZPzzzrzwZPmZfZPlrmpLDCpWDWCSTCpppDDBssdWG
|
||||
rwwcFFghFmgTcNRJNnnNJtHV
|
||||
RLhbzMhccqLzdjghdFddNWPN
|
||||
DmsTZfvrfJLPPWwrdFgw
|
||||
LsmDtQDfLLGbGQbSzcpM
|
||||
qwhmmHlHmlwChcCWlpPCBzjPVdBzLsdLBVsT
|
||||
DnJDMqRDsPsjRVQR
|
||||
tSGSnNNSbrJJGfDSSfbchpvptFwmpcvlHqZlcF
|
||||
rdQdBRPrQBBnfdBbzLLgLgmbzSLCPW
|
||||
TcRTcFDTcjvswMWzzgLSzwwSLJbL
|
||||
MNTRMNGTsFMMqqqcMDTTnfpBhQhNpHZBZHBfrptQ
|
||||
ZZFwcQGwRGLTGLTl
|
||||
rJtMrqBVvhBCnlCn
|
||||
WWWMttbqqzfPWqWJVzmDQwFQlwZwjQfjgFcZ
|
||||
RhgmdBbLLmRvhGZwhZZJDwGq
|
||||
ldPpTtTPtVPpfTGzJQFGFqJsFG
|
||||
MPpCnrlCVfPtrPVtntllnbdHSbnBvvgdgHgnWvSv
|
||||
nbnfjQbQZBqBvjQdVFGHhsQhsFsFzGpD
|
||||
RSJSTTcCVTTMlSNcSTRRwTccpwDFDDzFhHhtwppssFGGpsDp
|
||||
clcTNJlLMgrcgRvBjfWVfWfBrrZn
|
||||
LHQdpQLQDRcDBQccVQpnNRhllzMtRqzRztTNnt
|
||||
mrvZPZvZvZbPSFJrSrggFvrJzbhlzttTlNtqtsMtTntntdqq
|
||||
GPfJPJwfZFrmFvrPmgHHQLQWdHQBwWWCHVVC
|
||||
TvTTLfflhZmwZLvtJmhdFhMpnWrpnbJcWMnpHzMrzbcn
|
||||
VqRRNGCBjRmqPGqDzbHMcMccWnzngHnP
|
||||
jNqNBjsDsDRCNVsmBRNQNRSSSddhZvLhddZhvhwvLTZwhSfT
|
||||
vjpJvpgpNwjDWvvJLhFLLhNRTmPTRPRF
|
||||
HHbHVrMHMmqzHlGmtGqMtdLCLQthQQPCSPTSFLLPRT
|
||||
bZZzbHszMrqzGmrHMBzbHbqJjffcDgwWjDJpnjjcscwgnw
|
||||
fBHDMNhhHMrBDBrfQqfwwvvLvfjLZZ
|
||||
lmppmGJgPPpddJVdnwsQjLttqtjZTpcsvT
|
||||
RndRmlGWJgdRnWQJQgWdQPlFFbhhbFbHbHMhhBbRDRFrrS
|
||||
tVhwlMdMWlhlZMZMlzWrtRpBNpLPpmnmCPQBLppPPPBz
|
||||
GvGTsgjcTLRQHmTQ
|
||||
gGRGbfbgbcSbbcRggvfcwlZVhVMfltddVtrlZdhW
|
||||
PwjPHwWssqrHqCqprpCPjwrrQnnDbdnQnGQHnbZbGQZbBQdD
|
||||
WvNtLhfLndnBNbJJ
|
||||
fvhvvWfTmtzTmjpsVVqsPzMjjq
|
||||
GjHMMTMfZbnqHnJNCN
|
||||
rlpQpthdlQbnlJqRzqVL
|
||||
spphwcpBvcvdvFTqPDFfwwPZTG
|
||||
mQfqmtpfBHJCHdlMDB
|
||||
cbbPPsZqjqcSvVsCrDllsrdzrzzD
|
||||
TSbVTvShqnVjPTPbggSPbNFQWGtfNLtFfWgGmGgGWR
|
||||
HJtwgJJwJrcjRRjRnwhVdrVbmGhPmNNrGhdV
|
||||
fWFvTDssTDMCBCWsvszWWMCQhZhLLNvNNbhVGGZdRZRdmhmd
|
||||
zCTBzWzDDCDCfFCRqCJHcJJctjJSgHpqHqJg
|
||||
dgnwgbcwVGbgDWnQbjdgDnBRBBNNqRLBNMLFRMRlqNsc
|
||||
fTZHmTmzJMmSSCZChZvZTHRlBNBFqtqftlqssqNqftts
|
||||
JTHJvhzCHpmPCSSTzPpPzJHgQVdQQjQdQwjgdpgdDMGgQM
|
||||
qPGmWLJWBRRdvqvvNq
|
||||
TnZHsTZsZsZZbDtbrNrdnDft
|
||||
SShhQQZCHQCSTVlllVVQCjQWNJGFWpWgFpmmVmNgLgFpGw
|
||||
TsSmttWMVstNfbMfBcpnFchFwFwZNrrwFp
|
||||
DWWCGlHWdhddwpcrjh
|
||||
gQvPqglRCHCHCPCPCJbbtSVVWtTVVJvTbs
|
||||
ddHSZQHDStZStLtsdDpbCbBPcjGGCqCMBGdNPb
|
||||
hWhvmglVznzglgzvzfznwfnfscswPjbMBMjNGBMPGMcjcPwP
|
||||
sJWsJfVflWsnhrltrZLFDDRRFTSSLT
|
||||
qqCqLNjnPPLZPjqnDjLNgnNrcGwtgddGrhprBJhhJtBGJG
|
||||
lTMDsDHmlRRbQQbVfMHFmMBJhwcTddrcpBBGdGGJcJdB
|
||||
lHFfQFssFFFMQRVWQVlssLnDSLLPvZZPqWCLWSqjvS
|
||||
pJPZRpQtpPQpGPqWbqlWTdLVLJbT
|
||||
nnnjCwgrgcCFBfnggBCsMTVbVsWVWdCTTdbb
|
||||
cfhcnwnrcggrncrwcjBDcGHmNPRRGRZZQRRdDZzmzH
|
||||
NqTrrzLpTNdLLJBBcBGGZGpFHB
|
||||
sWbgfHSfSgVgZcmGtStZwBFG
|
||||
VjQjjPjhbbfsCbbDQCgsDrRhzMdlNzHTRdRhqdNTrq
|
||||
GlqfPdvdBqPgfqDgFMsMVDppbsNJNpMs
|
||||
WnmmWCTCjZnmzRjTZRRnFBMNpbZZpFJMSFSNFSbS
|
||||
TRRrnLBmzjttRRCmTRjjwLlvdhQvdrhqqlGdPqGggPlQ
|
||||
McjMPgPgGPHJWjhPNgPqQbpQSfqffnWVnnnpnZ
|
||||
BwwDmBTLRBBLzBTBTvtVqlfpqfbQqpqZbnQFlt
|
||||
rDsDBsmvRTBRzCTZsTmCsCrLPgNcPHNhPccNHHrjMNrgdNdP
|
||||
GqmLFDrcglvQGZwwzj
|
||||
nlHbSNBhhslJfsBfvdZHdCvRzdCzppzR
|
||||
JWShMfWMMthSJBBthJsgtcTTcFqcTrmTLrrTlr
|
||||
CsBsShBWsBWhvFJWCSsJpbTZdTbdBRgHffRlHHHBgH
|
||||
tqmnwwwDmVwfzZblzTRqzQ
|
||||
DGtDjGMcntMGnnGhhjJJJsCpFRRSJJ
|
||||
GQVVcGgFGcSFvfcFfJVnQmdbTwMLwTTnbnQMws
|
||||
ZqZrDWDtNPPHRNPzGCdndLLMLwMWhwbmLddn
|
||||
DRqRHCHlCtDrqtNqDplfpvGFjVjvBSFFcj
|
||||
zfSfdGPdMVHHdcMThhpwqqrwrqJhcF
|
||||
vlDNTWDDWWnngNQZtgwLrJZqLFZLFJpFJjJJ
|
||||
NCtWmnvBmDnWQVTmTGSRmmRTPz
|
||||
LLvppVLDsppGMGCLCCwNmJMNrNHrNmNNmHFjrh
|
||||
lZZfvfgRPZQWNNmlWlFNHl
|
||||
nnRtndRbcPttvTpswLTs
|
||||
trtzWfszNPlhPlgrWglhZjSLDBvTfSDTmSvmLvfS
|
||||
QMdVVGBQMTJDvSjdHJ
|
||||
nBppGVVnQQgzgPsPzzhp
|
||||
fVQzVrQVtVzHwjtMTjcTCjFgcDCGCd
|
||||
JslDPWLbLbZlJBMgBTBPdcFTFd
|
||||
JNJmZsDLnLDWmsVqSrHqnHqQwQSq
|
||||
mLMZRMRmZLmHLLjNshrrJjRsNNsj
|
||||
PnqnBVBPcpWrWfWzDhDsHW
|
||||
qpBQgcQncqpBcVgtclHqcSMTLZZQvLLZdLdwCmLMSd
|
||||
PZgMwZMjPgBCWgZFgmBGSTtwcccztTzbnGDcNT
|
||||
vJLlvvlfdsVVslVHrrpLfRlDcSScmbSnnRGDnbDTSbSSDt
|
||||
fvVHdLfLQljmmqqMQPhQ
|
||||
DZRstNGrDWGRMlzLHLMpNSpp
|
||||
bPgCrCvgnrCPgwplbMSjfHzHfj
|
||||
CgnFnBVrFFVmdVggmPPVTTcZBGhRqGtcZqqJhGRGssWs
|
||||
WrrCGrDlWhBBZtHB
|
||||
ggdcnQpcPRSpzfvJBTfPJvtP
|
||||
gSNnSBFnSMBNjpMssDmCrrGmCLqq
|
||||
szZGZGGwNdVtpwvbzptzVBQQLFclTJQFlHJNcFBRRJ
|
||||
CTrqSfWThWDjJCcLQRRRFLlQ
|
||||
rggqfMqPWnDqnVbZvTtPZpssVw
|
||||
GJHqPPcJnhthNHnL
|
||||
rzzlVDVTQDzSSdsSlzpBspssLhmZNjhZWjjffWBLZhgBmnjt
|
||||
TSTQTsnTbDsMvCGwcFvbJR
|
||||
PPjtzdnCnSjSthPjWJgJWjgMNBsNrT
|
||||
bZHfLLhvhpbfvLhHfQbqpNJTWWNsqNTrTNrgWN
|
||||
ZFbZZFvlRvZwhQwLDSdGnmCGmnlmdznD
|
||||
RFRRhzzsRsszRlhbrhgBcbTfHgBT
|
||||
pJtNmSgwZNtSJLgSqHcbBDDTHPfrSqTc
|
||||
ZNWdpNCJtLZpQJLLpmLtZNFGjVgFnsngRGllVsjjCnvs
|
||||
sJVRJmmmwwlmzcszMzjRjJVzspCZBsZTTFpTTZvSZTFBFbtZ
|
||||
GhNDgNWnGGqDvFSCZvbtFpvg
|
||||
fWrCNNffGnhWdrPhWjwjzRlJmcjRcPzlmV
|
||||
FdncmqmgcZztLWFvFFvjWLlT
|
||||
RsMMJVpfhJVsDVMfJpvlTWTvhjQSQvCbLCSC
|
||||
jDBjRrsVfNJgzdZrZwtmZt
|
||||
THDDQLZTGQQLQDSSTBCZSZHfFrvvlVRRlPVFfVrvqnvnnH
|
||||
VbWWcgbNpjgPrRvrNfqnzv
|
||||
swggwpJWwsWscJsDSLTJTmSVZJTBDZ
|
||||
wGsznPGGBHdzHhtHDD
|
||||
WMVSWqVmrSBMpvWVMFtdClhDtqDDHhdtQt
|
||||
RgWVRcmgnPPnjJBg
|
||||
BmfPBHBFswLLjQQnLCnzzW
|
||||
SRdvvRSGrdlRSvTgRrMVCjVWCZzMnVZhWzTj
|
||||
vlSRJrRJvbGGrSSJgWvlScptFmwbmfHHBfsNFmBbfsFm
|
||||
BIN
2022/day03/main
Executable file
BIN
2022/day03/main
Executable file
Binary file not shown.
36
2022/day03/main.c
Normal file
36
2022/day03/main.c
Normal file
|
|
@ -0,0 +1,36 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
char getWrong(char *line)
|
||||
{
|
||||
char *middle = line + strlen(line)/2;
|
||||
char *a = line;
|
||||
char *b = middle;
|
||||
for (char *a = line; a < middle; a++)
|
||||
{
|
||||
for (char *b = middle; *b != '\n'; b++)
|
||||
{
|
||||
if ( *a == *b ) return *b;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
char *line = NULL;
|
||||
size_t len;
|
||||
int prios = 0;
|
||||
|
||||
while (getline(&line, &len, stdin) >= 0)
|
||||
{
|
||||
char wrong = getWrong(line);
|
||||
printf("%c", wrong);
|
||||
int prio;
|
||||
if ( wrong >= 97 && wrong <= 122 ) prio = wrong - 96;
|
||||
else prio = wrong - 64 + 26;
|
||||
printf("%d", prio);
|
||||
prios += prio;
|
||||
}
|
||||
printf("\n%d\n", prios);
|
||||
}
|
||||
45
2022/day03/main2.c
Normal file
45
2022/day03/main2.c
Normal file
|
|
@ -0,0 +1,45 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
char getWrong(char *line, char *line2, char *line3)
|
||||
{
|
||||
|
||||
for (char *a = line; *a != '\n'; a++)
|
||||
{
|
||||
for (char *b = line2; *b != '\n'; b++)
|
||||
{
|
||||
for (char *c = line3; *c != '\n'; c++)
|
||||
{
|
||||
if ( *a == *b && *a == *c ) return *b;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
char *line = NULL;
|
||||
char *line2 = NULL;
|
||||
char *line3 = NULL;
|
||||
size_t len;
|
||||
size_t len2;
|
||||
size_t len3;
|
||||
int prios = 0;
|
||||
|
||||
while (getline(&line, &len, stdin) >= 0)
|
||||
{
|
||||
getline(&line2, &len2, stdin);
|
||||
getline(&line3, &len3, stdin);
|
||||
|
||||
char wrong = getWrong(line, line2, line3);
|
||||
printf("%c", wrong);
|
||||
int prio;
|
||||
if ( wrong >= 97 && wrong <= 122 ) prio = wrong - 96;
|
||||
else prio = wrong - 64 + 26;
|
||||
printf("%d", prio);
|
||||
prios += prio;
|
||||
}
|
||||
printf("\n%d\n", prios);
|
||||
}
|
||||
|
||||
6
2022/day04/input1.txt
Normal file
6
2022/day04/input1.txt
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
2-4,6-8
|
||||
2-3,4-5
|
||||
5-7,7-9
|
||||
2-8,3-7
|
||||
6-6,4-6
|
||||
2-6,4-8
|
||||
1000
2022/day04/input2.txt
Normal file
1000
2022/day04/input2.txt
Normal file
File diff suppressed because it is too large
Load diff
BIN
2022/day04/main
Executable file
BIN
2022/day04/main
Executable file
Binary file not shown.
15
2022/day04/main.c
Normal file
15
2022/day04/main.c
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
#include <stdio.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
int a1,a2,b1,b2;
|
||||
int overlaps = 0;
|
||||
while (scanf("%d-%d,%d-%d", &a1, &a2, &b1, &b2) != EOF)
|
||||
{
|
||||
// printf("%d-%d,%d-%d", a1, a2, b1, b2);
|
||||
if ( ((a1 >= b1) && (a2 <= b2)) || ((b1 >= a1) && (b2 <= a2))) {
|
||||
overlaps++;
|
||||
}
|
||||
}
|
||||
printf("%d\n", overlaps);
|
||||
}
|
||||
18
2022/day04/main2.c
Normal file
18
2022/day04/main2.c
Normal file
|
|
@ -0,0 +1,18 @@
|
|||
#include <stdio.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
int a1,a2,b1,b2;
|
||||
int overlaps = 0;
|
||||
while (scanf("%d-%d,%d-%d", &a1, &a2, &b1, &b2) != EOF)
|
||||
{
|
||||
// printf("%d-%d,%d-%d", a1, a2, b1, b2);
|
||||
if (
|
||||
((a1 >= b1) && (a2 <= b2)) || ((b1 >= a1) && (b2 <= a2)) ||
|
||||
((a1 <= b1) && (a2 >= b1) || (a1 <= b2) && (a2 >= b2) )
|
||||
) {
|
||||
overlaps++;
|
||||
}
|
||||
}
|
||||
printf("%d\n", overlaps);
|
||||
}
|
||||
9
2022/day05/input1.txt
Normal file
9
2022/day05/input1.txt
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
[D]
|
||||
[N] [C]
|
||||
[Z] [M] [P]
|
||||
1 2 3
|
||||
|
||||
move 1 from 2 to 1
|
||||
move 3 from 1 to 3
|
||||
move 2 from 2 to 1
|
||||
move 1 from 1 to 2
|
||||
512
2022/day05/input2.txt
Normal file
512
2022/day05/input2.txt
Normal file
|
|
@ -0,0 +1,512 @@
|
|||
[T] [D] [L]
|
||||
[R] [S] [G] [P] [H]
|
||||
[G] [H] [W] [R] [L] [P]
|
||||
[W] [G] [F] [H] [S] [M] [L]
|
||||
[Q] [V] [B] [J] [H] [N] [R] [N]
|
||||
[M] [R] [R] [P] [M] [T] [H] [Q] [C]
|
||||
[F] [F] [Z] [H] [S] [Z] [T] [D] [S]
|
||||
[P] [H] [P] [Q] [P] [M] [P] [F] [D]
|
||||
1 2 3 4 5 6 7 8 9
|
||||
|
||||
move 3 from 8 to 9
|
||||
move 2 from 2 to 8
|
||||
move 5 from 4 to 2
|
||||
move 7 from 1 to 4
|
||||
move 3 from 8 to 2
|
||||
move 3 from 2 to 7
|
||||
move 1 from 7 to 4
|
||||
move 3 from 2 to 9
|
||||
move 4 from 7 to 9
|
||||
move 1 from 5 to 2
|
||||
move 2 from 3 to 4
|
||||
move 5 from 9 to 5
|
||||
move 6 from 9 to 3
|
||||
move 5 from 9 to 5
|
||||
move 1 from 9 to 7
|
||||
move 2 from 3 to 1
|
||||
move 7 from 3 to 9
|
||||
move 2 from 7 to 2
|
||||
move 5 from 2 to 4
|
||||
move 1 from 2 to 9
|
||||
move 2 from 1 to 9
|
||||
move 7 from 6 to 1
|
||||
move 2 from 7 to 3
|
||||
move 2 from 3 to 9
|
||||
move 1 from 7 to 4
|
||||
move 1 from 9 to 2
|
||||
move 3 from 1 to 8
|
||||
move 2 from 3 to 4
|
||||
move 5 from 9 to 2
|
||||
move 1 from 3 to 9
|
||||
move 8 from 5 to 7
|
||||
move 1 from 6 to 1
|
||||
move 15 from 4 to 1
|
||||
move 4 from 2 to 5
|
||||
move 5 from 9 to 7
|
||||
move 1 from 9 to 5
|
||||
move 5 from 1 to 2
|
||||
move 3 from 8 to 9
|
||||
move 1 from 7 to 6
|
||||
move 11 from 1 to 2
|
||||
move 7 from 5 to 3
|
||||
move 4 from 2 to 6
|
||||
move 7 from 3 to 4
|
||||
move 3 from 5 to 9
|
||||
move 2 from 2 to 5
|
||||
move 5 from 1 to 8
|
||||
move 2 from 6 to 8
|
||||
move 3 from 8 to 9
|
||||
move 9 from 4 to 9
|
||||
move 9 from 7 to 4
|
||||
move 2 from 8 to 1
|
||||
move 1 from 8 to 7
|
||||
move 6 from 2 to 7
|
||||
move 5 from 2 to 4
|
||||
move 5 from 7 to 2
|
||||
move 2 from 1 to 7
|
||||
move 2 from 6 to 4
|
||||
move 7 from 7 to 1
|
||||
move 3 from 2 to 6
|
||||
move 1 from 8 to 7
|
||||
move 2 from 9 to 3
|
||||
move 2 from 3 to 1
|
||||
move 1 from 2 to 5
|
||||
move 4 from 6 to 5
|
||||
move 2 from 2 to 3
|
||||
move 3 from 5 to 7
|
||||
move 1 from 5 to 3
|
||||
move 9 from 1 to 7
|
||||
move 2 from 9 to 5
|
||||
move 13 from 4 to 1
|
||||
move 5 from 7 to 2
|
||||
move 3 from 3 to 1
|
||||
move 2 from 2 to 9
|
||||
move 1 from 2 to 7
|
||||
move 5 from 5 to 6
|
||||
move 2 from 2 to 4
|
||||
move 5 from 1 to 3
|
||||
move 9 from 7 to 8
|
||||
move 2 from 9 to 5
|
||||
move 3 from 5 to 4
|
||||
move 5 from 9 to 2
|
||||
move 10 from 4 to 8
|
||||
move 1 from 4 to 1
|
||||
move 2 from 8 to 4
|
||||
move 4 from 8 to 2
|
||||
move 3 from 6 to 8
|
||||
move 7 from 8 to 7
|
||||
move 10 from 9 to 3
|
||||
move 7 from 3 to 2
|
||||
move 11 from 2 to 3
|
||||
move 13 from 3 to 9
|
||||
move 1 from 6 to 3
|
||||
move 1 from 1 to 2
|
||||
move 1 from 2 to 8
|
||||
move 3 from 3 to 4
|
||||
move 1 from 2 to 9
|
||||
move 1 from 4 to 1
|
||||
move 10 from 8 to 3
|
||||
move 11 from 9 to 7
|
||||
move 1 from 6 to 2
|
||||
move 14 from 7 to 1
|
||||
move 2 from 2 to 9
|
||||
move 4 from 7 to 6
|
||||
move 1 from 2 to 4
|
||||
move 3 from 4 to 2
|
||||
move 4 from 2 to 9
|
||||
move 10 from 3 to 4
|
||||
move 3 from 6 to 1
|
||||
move 5 from 9 to 5
|
||||
move 5 from 5 to 8
|
||||
move 1 from 9 to 7
|
||||
move 2 from 9 to 6
|
||||
move 1 from 9 to 8
|
||||
move 2 from 4 to 8
|
||||
move 1 from 4 to 5
|
||||
move 2 from 3 to 1
|
||||
move 2 from 3 to 7
|
||||
move 27 from 1 to 2
|
||||
move 2 from 7 to 1
|
||||
move 9 from 4 to 6
|
||||
move 9 from 6 to 5
|
||||
move 5 from 8 to 6
|
||||
move 26 from 2 to 3
|
||||
move 1 from 2 to 5
|
||||
move 1 from 2 to 7
|
||||
move 1 from 8 to 4
|
||||
move 1 from 7 to 8
|
||||
move 24 from 3 to 5
|
||||
move 1 from 8 to 5
|
||||
move 1 from 4 to 3
|
||||
move 1 from 7 to 1
|
||||
move 1 from 8 to 9
|
||||
move 7 from 1 to 7
|
||||
move 8 from 6 to 4
|
||||
move 4 from 7 to 6
|
||||
move 1 from 3 to 9
|
||||
move 2 from 9 to 1
|
||||
move 3 from 7 to 9
|
||||
move 8 from 4 to 6
|
||||
move 3 from 9 to 1
|
||||
move 1 from 3 to 6
|
||||
move 1 from 8 to 2
|
||||
move 10 from 5 to 4
|
||||
move 1 from 3 to 8
|
||||
move 13 from 5 to 3
|
||||
move 1 from 2 to 9
|
||||
move 1 from 8 to 9
|
||||
move 1 from 3 to 8
|
||||
move 1 from 9 to 2
|
||||
move 3 from 6 to 9
|
||||
move 7 from 4 to 9
|
||||
move 4 from 3 to 9
|
||||
move 2 from 6 to 8
|
||||
move 2 from 4 to 5
|
||||
move 10 from 9 to 3
|
||||
move 1 from 1 to 9
|
||||
move 1 from 4 to 8
|
||||
move 1 from 1 to 4
|
||||
move 1 from 4 to 5
|
||||
move 4 from 6 to 3
|
||||
move 1 from 9 to 5
|
||||
move 1 from 6 to 9
|
||||
move 2 from 6 to 5
|
||||
move 1 from 9 to 2
|
||||
move 1 from 6 to 7
|
||||
move 18 from 5 to 2
|
||||
move 22 from 3 to 7
|
||||
move 19 from 7 to 1
|
||||
move 3 from 8 to 5
|
||||
move 4 from 9 to 3
|
||||
move 2 from 7 to 2
|
||||
move 1 from 8 to 1
|
||||
move 19 from 1 to 3
|
||||
move 2 from 7 to 5
|
||||
move 13 from 3 to 9
|
||||
move 4 from 1 to 2
|
||||
move 3 from 5 to 1
|
||||
move 11 from 9 to 1
|
||||
move 11 from 2 to 8
|
||||
move 3 from 9 to 3
|
||||
move 3 from 5 to 2
|
||||
move 2 from 1 to 4
|
||||
move 5 from 2 to 7
|
||||
move 12 from 1 to 5
|
||||
move 2 from 4 to 5
|
||||
move 9 from 5 to 8
|
||||
move 1 from 5 to 3
|
||||
move 4 from 2 to 3
|
||||
move 2 from 7 to 5
|
||||
move 6 from 2 to 8
|
||||
move 17 from 8 to 9
|
||||
move 2 from 9 to 6
|
||||
move 2 from 7 to 1
|
||||
move 15 from 9 to 6
|
||||
move 2 from 2 to 4
|
||||
move 9 from 8 to 5
|
||||
move 2 from 1 to 3
|
||||
move 12 from 6 to 2
|
||||
move 2 from 3 to 9
|
||||
move 5 from 6 to 3
|
||||
move 4 from 5 to 3
|
||||
move 11 from 3 to 4
|
||||
move 2 from 9 to 4
|
||||
move 6 from 5 to 2
|
||||
move 13 from 4 to 3
|
||||
move 1 from 4 to 5
|
||||
move 1 from 4 to 8
|
||||
move 18 from 2 to 6
|
||||
move 2 from 5 to 3
|
||||
move 1 from 8 to 3
|
||||
move 1 from 2 to 5
|
||||
move 1 from 7 to 8
|
||||
move 28 from 3 to 6
|
||||
move 2 from 3 to 4
|
||||
move 3 from 5 to 9
|
||||
move 2 from 5 to 9
|
||||
move 3 from 9 to 3
|
||||
move 5 from 3 to 4
|
||||
move 1 from 9 to 3
|
||||
move 1 from 9 to 1
|
||||
move 1 from 3 to 4
|
||||
move 45 from 6 to 2
|
||||
move 1 from 8 to 3
|
||||
move 2 from 4 to 6
|
||||
move 5 from 4 to 2
|
||||
move 1 from 3 to 7
|
||||
move 3 from 2 to 9
|
||||
move 1 from 4 to 8
|
||||
move 3 from 6 to 1
|
||||
move 42 from 2 to 8
|
||||
move 2 from 9 to 2
|
||||
move 4 from 2 to 6
|
||||
move 2 from 2 to 7
|
||||
move 1 from 9 to 6
|
||||
move 2 from 8 to 9
|
||||
move 4 from 1 to 8
|
||||
move 1 from 6 to 4
|
||||
move 1 from 4 to 8
|
||||
move 1 from 2 to 5
|
||||
move 3 from 7 to 4
|
||||
move 39 from 8 to 3
|
||||
move 7 from 8 to 5
|
||||
move 8 from 5 to 7
|
||||
move 35 from 3 to 1
|
||||
move 4 from 3 to 7
|
||||
move 10 from 7 to 2
|
||||
move 2 from 9 to 6
|
||||
move 3 from 4 to 2
|
||||
move 1 from 7 to 5
|
||||
move 1 from 7 to 8
|
||||
move 1 from 5 to 4
|
||||
move 12 from 1 to 6
|
||||
move 1 from 8 to 1
|
||||
move 1 from 4 to 5
|
||||
move 14 from 6 to 8
|
||||
move 9 from 8 to 6
|
||||
move 5 from 6 to 1
|
||||
move 11 from 2 to 9
|
||||
move 1 from 9 to 8
|
||||
move 6 from 8 to 3
|
||||
move 6 from 9 to 2
|
||||
move 8 from 1 to 9
|
||||
move 3 from 3 to 6
|
||||
move 7 from 1 to 4
|
||||
move 1 from 5 to 9
|
||||
move 8 from 9 to 8
|
||||
move 7 from 6 to 8
|
||||
move 1 from 9 to 3
|
||||
move 3 from 6 to 4
|
||||
move 3 from 9 to 1
|
||||
move 4 from 3 to 2
|
||||
move 1 from 6 to 7
|
||||
move 1 from 4 to 2
|
||||
move 13 from 1 to 7
|
||||
move 6 from 4 to 8
|
||||
move 1 from 7 to 3
|
||||
move 1 from 4 to 6
|
||||
move 1 from 9 to 5
|
||||
move 1 from 3 to 5
|
||||
move 19 from 8 to 9
|
||||
move 1 from 6 to 5
|
||||
move 6 from 9 to 2
|
||||
move 2 from 5 to 8
|
||||
move 1 from 5 to 2
|
||||
move 4 from 1 to 4
|
||||
move 8 from 9 to 4
|
||||
move 3 from 9 to 8
|
||||
move 2 from 9 to 1
|
||||
move 6 from 7 to 5
|
||||
move 12 from 4 to 2
|
||||
move 6 from 8 to 3
|
||||
move 1 from 4 to 1
|
||||
move 1 from 3 to 1
|
||||
move 13 from 2 to 3
|
||||
move 4 from 5 to 3
|
||||
move 1 from 4 to 9
|
||||
move 1 from 8 to 9
|
||||
move 12 from 3 to 2
|
||||
move 1 from 9 to 1
|
||||
move 2 from 5 to 9
|
||||
move 3 from 9 to 5
|
||||
move 1 from 7 to 5
|
||||
move 3 from 7 to 3
|
||||
move 1 from 5 to 4
|
||||
move 1 from 5 to 8
|
||||
move 9 from 2 to 3
|
||||
move 2 from 2 to 3
|
||||
move 3 from 1 to 9
|
||||
move 1 from 8 to 9
|
||||
move 3 from 9 to 1
|
||||
move 9 from 2 to 6
|
||||
move 1 from 9 to 5
|
||||
move 6 from 2 to 3
|
||||
move 2 from 6 to 9
|
||||
move 3 from 6 to 3
|
||||
move 1 from 4 to 3
|
||||
move 2 from 9 to 6
|
||||
move 2 from 7 to 2
|
||||
move 2 from 2 to 8
|
||||
move 24 from 3 to 7
|
||||
move 2 from 5 to 6
|
||||
move 2 from 8 to 2
|
||||
move 7 from 2 to 8
|
||||
move 8 from 3 to 6
|
||||
move 2 from 1 to 3
|
||||
move 1 from 1 to 2
|
||||
move 1 from 5 to 2
|
||||
move 15 from 7 to 4
|
||||
move 9 from 7 to 9
|
||||
move 7 from 9 to 1
|
||||
move 5 from 8 to 1
|
||||
move 4 from 1 to 4
|
||||
move 19 from 4 to 3
|
||||
move 22 from 3 to 5
|
||||
move 1 from 7 to 5
|
||||
move 9 from 5 to 4
|
||||
move 6 from 1 to 3
|
||||
move 6 from 3 to 1
|
||||
move 4 from 5 to 4
|
||||
move 1 from 2 to 1
|
||||
move 1 from 2 to 6
|
||||
move 4 from 6 to 1
|
||||
move 1 from 3 to 6
|
||||
move 3 from 6 to 3
|
||||
move 2 from 9 to 8
|
||||
move 2 from 5 to 3
|
||||
move 2 from 5 to 1
|
||||
move 10 from 6 to 4
|
||||
move 4 from 4 to 9
|
||||
move 7 from 4 to 3
|
||||
move 2 from 8 to 7
|
||||
move 4 from 9 to 3
|
||||
move 5 from 5 to 7
|
||||
move 1 from 5 to 1
|
||||
move 1 from 6 to 3
|
||||
move 1 from 8 to 4
|
||||
move 1 from 8 to 3
|
||||
move 13 from 4 to 5
|
||||
move 1 from 1 to 8
|
||||
move 6 from 5 to 3
|
||||
move 1 from 7 to 6
|
||||
move 5 from 7 to 6
|
||||
move 9 from 1 to 8
|
||||
move 1 from 8 to 4
|
||||
move 1 from 7 to 1
|
||||
move 1 from 4 to 1
|
||||
move 5 from 3 to 7
|
||||
move 3 from 7 to 9
|
||||
move 1 from 5 to 4
|
||||
move 6 from 8 to 6
|
||||
move 1 from 9 to 3
|
||||
move 2 from 9 to 5
|
||||
move 7 from 5 to 9
|
||||
move 1 from 7 to 5
|
||||
move 2 from 5 to 3
|
||||
move 10 from 6 to 8
|
||||
move 2 from 6 to 1
|
||||
move 1 from 4 to 9
|
||||
move 1 from 7 to 5
|
||||
move 8 from 8 to 2
|
||||
move 1 from 1 to 7
|
||||
move 1 from 9 to 7
|
||||
move 1 from 5 to 1
|
||||
move 3 from 9 to 8
|
||||
move 7 from 8 to 7
|
||||
move 6 from 7 to 1
|
||||
move 1 from 8 to 7
|
||||
move 4 from 7 to 1
|
||||
move 16 from 3 to 7
|
||||
move 4 from 3 to 1
|
||||
move 5 from 7 to 8
|
||||
move 16 from 1 to 4
|
||||
move 9 from 1 to 7
|
||||
move 1 from 3 to 4
|
||||
move 15 from 4 to 8
|
||||
move 1 from 3 to 1
|
||||
move 2 from 1 to 6
|
||||
move 2 from 4 to 9
|
||||
move 17 from 8 to 2
|
||||
move 6 from 9 to 5
|
||||
move 8 from 7 to 8
|
||||
move 2 from 6 to 9
|
||||
move 4 from 5 to 7
|
||||
move 2 from 8 to 5
|
||||
move 1 from 5 to 9
|
||||
move 11 from 2 to 6
|
||||
move 4 from 6 to 1
|
||||
move 5 from 2 to 8
|
||||
move 2 from 9 to 2
|
||||
move 1 from 9 to 3
|
||||
move 3 from 1 to 8
|
||||
move 1 from 3 to 6
|
||||
move 7 from 6 to 9
|
||||
move 2 from 5 to 4
|
||||
move 6 from 7 to 4
|
||||
move 4 from 8 to 1
|
||||
move 1 from 5 to 2
|
||||
move 1 from 6 to 1
|
||||
move 7 from 9 to 8
|
||||
move 2 from 7 to 9
|
||||
move 9 from 2 to 9
|
||||
move 5 from 9 to 3
|
||||
move 3 from 2 to 8
|
||||
move 4 from 8 to 7
|
||||
move 9 from 7 to 2
|
||||
move 3 from 1 to 3
|
||||
move 14 from 8 to 1
|
||||
move 2 from 8 to 3
|
||||
move 1 from 9 to 4
|
||||
move 3 from 7 to 9
|
||||
move 8 from 3 to 9
|
||||
move 2 from 2 to 7
|
||||
move 12 from 1 to 8
|
||||
move 4 from 1 to 6
|
||||
move 2 from 6 to 7
|
||||
move 1 from 6 to 7
|
||||
move 9 from 4 to 7
|
||||
move 9 from 7 to 4
|
||||
move 1 from 1 to 6
|
||||
move 2 from 3 to 6
|
||||
move 2 from 6 to 8
|
||||
move 12 from 9 to 8
|
||||
move 2 from 6 to 9
|
||||
move 2 from 9 to 7
|
||||
move 1 from 8 to 5
|
||||
move 5 from 7 to 5
|
||||
move 1 from 9 to 1
|
||||
move 3 from 4 to 1
|
||||
move 5 from 4 to 8
|
||||
move 4 from 1 to 7
|
||||
move 1 from 4 to 2
|
||||
move 19 from 8 to 4
|
||||
move 2 from 7 to 5
|
||||
move 14 from 8 to 5
|
||||
move 2 from 7 to 8
|
||||
move 3 from 9 to 8
|
||||
move 19 from 4 to 2
|
||||
move 9 from 2 to 4
|
||||
move 2 from 7 to 8
|
||||
move 15 from 5 to 9
|
||||
move 15 from 9 to 8
|
||||
move 1 from 5 to 9
|
||||
move 11 from 8 to 7
|
||||
move 4 from 5 to 8
|
||||
move 1 from 5 to 9
|
||||
move 2 from 9 to 5
|
||||
move 2 from 2 to 6
|
||||
move 14 from 2 to 9
|
||||
move 12 from 8 to 9
|
||||
move 3 from 8 to 4
|
||||
move 7 from 9 to 2
|
||||
move 4 from 7 to 9
|
||||
move 1 from 6 to 9
|
||||
move 1 from 7 to 5
|
||||
move 1 from 6 to 2
|
||||
move 3 from 5 to 4
|
||||
move 19 from 9 to 4
|
||||
move 1 from 5 to 1
|
||||
move 1 from 9 to 8
|
||||
move 1 from 1 to 7
|
||||
move 1 from 8 to 9
|
||||
move 4 from 7 to 2
|
||||
move 3 from 7 to 6
|
||||
move 18 from 4 to 2
|
||||
move 17 from 2 to 3
|
||||
move 2 from 6 to 8
|
||||
move 17 from 3 to 6
|
||||
move 13 from 2 to 1
|
||||
move 2 from 8 to 3
|
||||
move 2 from 2 to 9
|
||||
move 6 from 1 to 9
|
||||
move 1 from 3 to 4
|
||||
move 1 from 3 to 9
|
||||
move 8 from 6 to 4
|
||||
move 20 from 4 to 8
|
||||
move 3 from 4 to 8
|
||||
move 15 from 8 to 2
|
||||
move 11 from 2 to 6
|
||||
move 2 from 1 to 7
|
||||
move 7 from 9 to 8
|
||||
move 6 from 9 to 3
|
||||
move 1 from 6 to 5
|
||||
BIN
2022/day05/main
Executable file
BIN
2022/day05/main
Executable file
Binary file not shown.
122
2022/day05/main.c
Normal file
122
2022/day05/main.c
Normal file
|
|
@ -0,0 +1,122 @@
|
|||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
struct StackItem_;
|
||||
|
||||
typedef struct StackItem_ {
|
||||
char value;
|
||||
struct StackItem_ *next, *prev;
|
||||
} StackItem;
|
||||
|
||||
typedef struct Stack_ {
|
||||
StackItem *top, *bottom;
|
||||
} Stack;
|
||||
|
||||
void push_top(Stack *stack, StackItem *item) {
|
||||
if (stack->top)
|
||||
{
|
||||
StackItem* old = stack->top;
|
||||
old->next = item;
|
||||
item->prev = old;
|
||||
}
|
||||
if (!stack->top) stack->bottom = item;
|
||||
stack->top = item;
|
||||
}
|
||||
|
||||
void push_back(Stack *stack, StackItem *item) {
|
||||
if (stack->bottom)
|
||||
{
|
||||
StackItem* old = stack->bottom;
|
||||
old->prev = item;
|
||||
item->next = old;
|
||||
}
|
||||
if (!stack->bottom) stack->top = item;
|
||||
stack->bottom = item;
|
||||
}
|
||||
|
||||
StackItem* pop_top(Stack *stack) {
|
||||
StackItem* old = stack->top;
|
||||
stack->top = old->prev;
|
||||
if (old->prev != 0)
|
||||
{
|
||||
stack->top->next = 0;
|
||||
}
|
||||
old->next = old->prev = 0;
|
||||
|
||||
return old;
|
||||
}
|
||||
|
||||
StackItem* pop_back(Stack *stack) {
|
||||
StackItem* old = stack->bottom;
|
||||
stack->bottom = old->next;
|
||||
stack->bottom->prev = 0;
|
||||
old->next = old->prev = 0;
|
||||
|
||||
return old;
|
||||
}
|
||||
|
||||
void printCargo(Stack *cargo, size_t len)
|
||||
{
|
||||
for (int i = 0; i < len; i++)
|
||||
{
|
||||
for ( StackItem *e = cargo[i].bottom; e != 0; e = e->next )
|
||||
{
|
||||
printf("%c", e->value);
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
char *line = 0;
|
||||
size_t len;
|
||||
Stack *cargo;
|
||||
size_t cargos;
|
||||
ssize_t nread;
|
||||
|
||||
int amount, from, to;
|
||||
|
||||
while ((nread = getline(&line, &len, stdin)) != 0)
|
||||
{
|
||||
if ( line[1] == '1' ) continue;
|
||||
if ( line[0] == '\n' ) break;
|
||||
if ( !cargo ) {
|
||||
cargos = (nread+1)/4;
|
||||
cargo = (Stack*)malloc( sizeof(Stack) * cargos );
|
||||
}
|
||||
|
||||
for (int i = 0; i < cargos; i++ ) {
|
||||
char load = line[i*4+1];
|
||||
if ( load != ' ' ) {
|
||||
StackItem *box = malloc(sizeof(StackItem));
|
||||
box->value = line[i*4+1];
|
||||
box->next = box->prev = 0;
|
||||
push_back(&cargo[i], box);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
printCargo(cargo, cargos);
|
||||
printf("---------------\n");
|
||||
|
||||
while (scanf("move %d from %d to %d\n", &amount, &from, &to) != EOF)
|
||||
{
|
||||
printf( "%d %d %d\n", amount, from, to );
|
||||
for (int i = 0; i < amount; i++)
|
||||
{
|
||||
StackItem *item = pop_top(&cargo[from-1]);
|
||||
push_top(&cargo[to-1], item);
|
||||
|
||||
printCargo(cargo, cargos);
|
||||
printf("---------------\n");
|
||||
}
|
||||
}
|
||||
|
||||
for ( int i = 0; i < cargos; i++ )
|
||||
{
|
||||
printf( "%c", cargo[i].top->value );
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
129
2022/day05/main2.c
Normal file
129
2022/day05/main2.c
Normal file
|
|
@ -0,0 +1,129 @@
|
|||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
struct StackItem_;
|
||||
|
||||
typedef struct StackItem_ {
|
||||
char value;
|
||||
struct StackItem_ *next, *prev;
|
||||
} StackItem;
|
||||
|
||||
typedef struct Stack_ {
|
||||
StackItem *top, *bottom;
|
||||
} Stack;
|
||||
|
||||
void push_top(Stack *stack, StackItem *item) {
|
||||
if (stack->top)
|
||||
{
|
||||
StackItem* old = stack->top;
|
||||
old->next = item;
|
||||
item->prev = old;
|
||||
}
|
||||
if (!stack->top) stack->bottom = item;
|
||||
stack->top = item;
|
||||
}
|
||||
|
||||
void push_back(Stack *stack, StackItem *item) {
|
||||
if (stack->bottom)
|
||||
{
|
||||
StackItem* old = stack->bottom;
|
||||
old->prev = item;
|
||||
item->next = old;
|
||||
}
|
||||
if (!stack->bottom) stack->top = item;
|
||||
stack->bottom = item;
|
||||
}
|
||||
|
||||
StackItem* pop_top(Stack *stack) {
|
||||
StackItem* old = stack->top;
|
||||
stack->top = old->prev;
|
||||
if (old->prev != 0)
|
||||
{
|
||||
stack->top->next = 0;
|
||||
}
|
||||
old->next = old->prev = 0;
|
||||
|
||||
return old;
|
||||
}
|
||||
|
||||
StackItem* pop_back(Stack *stack) {
|
||||
StackItem* old = stack->bottom;
|
||||
stack->bottom = old->next;
|
||||
stack->bottom->prev = 0;
|
||||
old->next = old->prev = 0;
|
||||
|
||||
return old;
|
||||
}
|
||||
|
||||
void printCargo(Stack *cargo, size_t len)
|
||||
{
|
||||
for (int i = 0; i < len; i++)
|
||||
{
|
||||
for ( StackItem *e = cargo[i].bottom; e != 0; e = e->next )
|
||||
{
|
||||
printf("%c", e->value);
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
char *line = 0;
|
||||
size_t len;
|
||||
Stack *cargo;
|
||||
size_t cargos;
|
||||
ssize_t nread;
|
||||
|
||||
int amount, from, to;
|
||||
|
||||
Stack *temp = malloc(sizeof(Stack));
|
||||
|
||||
while ((nread = getline(&line, &len, stdin)) != 0)
|
||||
{
|
||||
if ( line[1] == '1' ) continue;
|
||||
if ( line[0] == '\n' ) break;
|
||||
if ( !cargo ) {
|
||||
cargos = (nread+1)/4;
|
||||
cargo = (Stack*)malloc( sizeof(Stack) * cargos );
|
||||
}
|
||||
|
||||
for (int i = 0; i < cargos; i++ ) {
|
||||
char load = line[i*4+1];
|
||||
if ( load != ' ' ) {
|
||||
StackItem *box = malloc(sizeof(StackItem));
|
||||
box->value = line[i*4+1];
|
||||
box->next = box->prev = 0;
|
||||
push_back(&cargo[i], box);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
printCargo(cargo, cargos);
|
||||
printf("---------------\n");
|
||||
|
||||
while (scanf("move %d from %d to %d\n", &amount, &from, &to) != EOF)
|
||||
{
|
||||
printf( "%d %d %d\n", amount, from, to );
|
||||
for (int i = 0; i < amount; i++)
|
||||
{
|
||||
StackItem *item = pop_top(&cargo[from-1]);
|
||||
push_top(temp, item);
|
||||
}
|
||||
for (int i = 0; i < amount; i++)
|
||||
{
|
||||
StackItem *item = pop_top(temp);
|
||||
push_top(&cargo[to-1], item);
|
||||
|
||||
printCargo(cargo, cargos);
|
||||
printf("---------------\n");
|
||||
}
|
||||
}
|
||||
|
||||
for ( int i = 0; i < cargos; i++ )
|
||||
{
|
||||
printf( "%c", cargo[i].top->value );
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
1
2022/day06/input2.txt
Normal file
1
2022/day06/input2.txt
Normal file
|
|
@ -0,0 +1 @@
|
|||
mvwvrwvwbblffmvmhmllmzmqzzbhbnnvrnvnmvvqrqrccpsstvvshvvpvvpddzwwjddfzzgbbzcchrrtzzmfffzqqsjjbfbjfjwffhrhrgrfrsfrsffbwwphwhgwgmgnggzwzhwzzpggnccdbcbssgccqgcgcvgccwffrqfqtqmqppwphhlbblnnwhwfhwhmhzhmmzbmbbjjmcjcggwlgltldttpccjlccbjccvfcvvdbvdvndvvmbmcbmmhphpbhhgjgllmljlqlwlclzlccrvrdvdzvzzzbrbrnbblplrplpsstdtjddgjgjgwjwzwbzwwrhwwbzwbwpwssvgvnnwnvvjqqswwsccwctwtntdndffjzfzmfzmfzmfzzhjzhzssdsgsnggbbqdqlqbllmglgddqppjjtzttlflrrczcmzzsppvfpvffcfrccvvvhjvhvfhfbbwdwrwswqqftfbfcfdfnfpnfflbbcmcqqsqwqqccmwmvwvffvdvlvtvqttnllqslsnllzplldmmzczhzmzzhllpfpqpnnqwwwrzzdpzzhccfvcvclcnnrjrmjrjlrlflqqtpqqdgqghhwdwdttlztttwmmvfmftfptphhddswdsdpdvpvpcpjjnvjvqvhvqqqfgqqgwqgwghwwmmvmvfmvvnvsslcclzlslppztzfzbzllcgllcsllvgvqvtqtsstztwwgjgghnhnhdnnqgnntqqtccdmcmhmpphpmmmbpbptpnnnmnppwlpwwfpwfwmfwfssbspslsflljpppbsspwptpwttfbtfftltvlttdmttllmggfcgfccvwcvczvvgvsgswsrrwppgcpggpgnngfnndrrdjrdrfdfmmjmsmbmmwjjjfzfdfbdbbtgbbcsbccgbbrvvrqrwqwmmhrhhbcbdbvdvzdvdjvvnwntwwdfwwrhrmhhnghhncccfttmpmrrjhhqddrsrvvssmrrgvgdgmmfqqhttspswpwlplpjljcjmjmvmdvvhbvvtqvqccczwwtlllztlzzpnnqznzddqsqvsshrrmccnppgrrjcjpccrvcvnvcncllffvnnbsbhhrmhmzzzhrhchjccgjcjwwhddmfmhhmrrrbccqddmjdmjdjtdjjmttzstsctssvvgghgbbhmhzmmjqqqqjgjfjpffpmpzmzszfzgzcggpmpnnqjqffgpghhszzvlzzdgzggqmggqlllcwwtzwwcfwccpjpggtqgtttzffdpffjzfzddzppprnprpqqbppvjpjzppbzpbzppwzzcnndsdzszbssqwqggnhggnzggpcpnndssghsggmfmrffvddvwvssjmjrmrmnndwdwhdhwwfjfjwjmwwqssmdsmdmssqzzrgzzjttnqnfqfcccvvmsvsvffccdjdccgtgqqjwqqnbqqnhqhrqrmrgmrrzjzrznzllwrlrbbcppctptwtfttlntnltnlnzzhrzhrzrtzzvsvfvjffsbsnbbfpphtptjjmffqgqnggnqnsshffslflggtlggmpggnfgfbgbfbcbbtdbdjqwfggzsfmzflttgdfqchhtjfwlmdnsbvmqcrhsrtwtjlmnlwbvjvqdzswdthbjslqzgmtzfjfcrgbhrrjtzgljbqfrzzqszhddnmzpnbgnflghnflwdmjdhgpnvwvnltcngwggqdznrpdtwsrclwwlfzhnjtpqcgzjqjnhcwbhndwvgrczhzwfjrdvjztdbjshmhrrqctjwpcdnpnvrtggrmhzhdtlntjphcddplgfvvmjzcbbpjbqbjwmnwqgftbmchghwvrlptvnfbffvgtdbtnfzwdmdlgzjbrvffvbrfwgjzzpbpcdzhcjbhfwnmqqwvjvnpgdqdjsmwdmrgfqrwhhqqjpfmvlncfdjchrccwpbptccdchqwvbcqzlhbfgrdzgncbwrzqpfszrcwtmnvbztjlzjlrqqfrnplhnmdjljcpnqssthhmjqrrlwdvsjswdwtfstmbvwhbptjnphjmnllbwffppzmdpchbcwcmgqzfmdqvhcmrvtgtjwlzfpnjnjtfvdhtjlqsdjwrrnflnsqrtfsnbjfdllhqslltsjqzdfqthqjjgrtqjwmlqqlhvszqswmdcbnwqgshpvfjdtvsqjvcnrnvtpfsgqszhtmcdlsqjwmttcqsdlvssrgwhtmtqwmttptnmgzpwzzrbwtsrjhmjpblztgftppcwwrjppvwlvdhwwdlfcdvhwpvhqpwrqsczvlmtghrrvqbphljcmcrfmwltlmnzchzrlbgspdjwfbhrmnfhvjwlgtghcpbfgdvrmwbqbprfvwpzqzrgqbhjtztwhjcjtncmbgjphsgdfvjwjljlwzhsdldqtdvgtzpwtmrbnpvqrmfdwngzqtsdjjztslrwdnfwgbnsjblcjzvmgbqllmdvvvdcvplgbzmhcrpbbjbfzhjgfpmjtrpmgvshzvqhcbcjzfcsvqggjcllcnjlrwqfpzldswzjgzvqwvszhrntnvlcpdcfqhqrtmhbdjqpfblrsbrhdfdwfgbhsnnjpgjvfpssfmhdbdncfrqbzpbttrhfzqnrttltqbvmhglbdpwmdbmgwcdsdsflmcnphwvbbhgqpqmwbdsmqwhcdftdlcfnstlfnzzsjhqzlsdmhpvlcqvhhlpdtzlqzlvbbwhhdsqhntbtpjjvnjlrncfmvnqmzwpldgrbfcfgdtlmrfzcbqfhvhpmsrrlnqwfggwrjsmnpnqhvvcfsfspfrmhwmbpqfhprzsswrczttlczhcqvgqqsnbhhfszqbswgtcjgddhngtcvlwqqmqzntrcwgwjhmhlgclpgtmqnpgwwhnjfdvvjgmqjlzsmwztpsdzrjlshswzljlmdzfqmqbtgtzlsfwqvwrdchjvrdnwdbprfvdvczstvnzfzzfmzbwjhtflbmhlgmfzrdfrqwfbltwqlqrghlprppvlqwggvczdcnmrmblhcfmpzdmqppgwhbbrjlzsvmsfzlrdljftcrdfdgmvrccwszpjmvdnbmfdnsgmgzsdpbrlsqvsmcwwqlwtwbgfvwtsmpqlnhjchnzrpncgtcqgwqrmqmrwsbmdvqcpggpzcjgtrhvnbpprlwfnjlvrgrdjjvncjmmflrpczqnlbqczggssqfcjcrghqlsztpdjpbbfcdjzzdjbljlsczdmrgshdscvhnltrwchjcmjzmjbhldnqzwwpswsnsldcbdcdpdgpjgwrnfbcpjtvzlhvgggldcfqcwwppvltsvsmwzwdgmhnfggtgtwldmrglcvmstgmbgbjhwwhgdhfrbjlwfhjfppdmffblbbzrplhlhqlsrnsthvjtglqntzcncmvhqnlsvvrscrhlncgncjswfgcvgjlwsndzmsbhbdqsggdgrsfqtzwnjpsdlbsqjrrjwwlbptwqpfqwvpsrtrmstddzdbjjlwvfqcpfczpsnmcgbfpbwcpljdhrgsqftbnplccjphwsdbprqfqqfcvtcdznnhrbdqpccphvdgtspmzzdbnslnrvtfrtbhcfzfgmhrttmdpwftvccjbllhqgtmpgwvbdjgtvtfbfnnsfgzqjmrpbcmqhpfbstznbvgtbhnwbbnjfsthdgdrpfdtvrtmgbwzqqpnlltbshjvnhsmqhqwzgbsfqqccfznjtnnzdrgcvwnlffdgvvqzvwhwfswdmqlrsglntzsnwjzgrhhwzzshwsfmlmrbnmrqlptmjgmtqctrmddzghsgtrbbcsmhtcnrzwmvrjmrnmhbjmflrclvlbzwbgmtnmwqgfmbbnnrdvhqcflglvzbmjzjtvnmrbgghnccfrphjshsgtrhfmmghhpwgclfvzfbdccsfrlfwtsjjnhlndpwcjdtlllhcsvwrwsbppqwhfcvnsnrvthrsbgmgjhpmjdndmdqdgzfvbqfmgfjrnrjchstrjprfwfnjqblhjdgsstvtpcsvmpbhggnwzncpjdhrcllcghhprhwhfgsqpfzphrdlcbrccglsb
|
||||
BIN
2022/day06/main
Executable file
BIN
2022/day06/main
Executable file
Binary file not shown.
26
2022/day06/main.c
Normal file
26
2022/day06/main.c
Normal file
|
|
@ -0,0 +1,26 @@
|
|||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
char *line = 0;
|
||||
size_t len;
|
||||
ssize_t nlen = getline(&line, &len, stdin);
|
||||
int distinctChars = 4;
|
||||
for (int i = distinctChars -1; i < nlen; i++)
|
||||
{
|
||||
int isTwoEqual = 0;
|
||||
for (int ii = 0; ii < distinctChars; ii++)
|
||||
{
|
||||
for (int iii = 0; iii < distinctChars; iii++)
|
||||
{
|
||||
if (ii == iii) continue;
|
||||
isTwoEqual |= (line[i-ii] == line[i-iii]);
|
||||
}
|
||||
}
|
||||
if ( !isTwoEqual ) {
|
||||
printf("%d\n", i+1);
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
26
2022/day06/main2.c
Normal file
26
2022/day06/main2.c
Normal file
|
|
@ -0,0 +1,26 @@
|
|||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
char *line = 0;
|
||||
size_t len;
|
||||
ssize_t nlen = getline(&line, &len, stdin);
|
||||
int distinctChars = 14;
|
||||
for (int i = distinctChars -1; i < nlen; i++)
|
||||
{
|
||||
int isTwoEqual = 0;
|
||||
for (int ii = 0; ii < distinctChars; ii++)
|
||||
{
|
||||
for (int iii = 0; iii < distinctChars; iii++)
|
||||
{
|
||||
if (ii == iii) continue;
|
||||
isTwoEqual |= (line[i-ii] == line[i-iii]);
|
||||
}
|
||||
}
|
||||
if ( !isTwoEqual ) {
|
||||
printf("%d\n", i+1);
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
23
2022/day07/input1.txt
Normal file
23
2022/day07/input1.txt
Normal file
|
|
@ -0,0 +1,23 @@
|
|||
$ cd /
|
||||
$ ls
|
||||
dir a
|
||||
14848514 b.txt
|
||||
8504156 c.dat
|
||||
dir d
|
||||
$ cd a
|
||||
$ ls
|
||||
dir e
|
||||
29116 f
|
||||
2557 g
|
||||
62596 h.lst
|
||||
$ cd e
|
||||
$ ls
|
||||
584 i
|
||||
$ cd ..
|
||||
$ cd ..
|
||||
$ cd d
|
||||
$ ls
|
||||
4060174 j
|
||||
8033020 d.log
|
||||
5626152 d.ext
|
||||
7214296 k
|
||||
1030
2022/day07/input2.txt
Normal file
1030
2022/day07/input2.txt
Normal file
File diff suppressed because it is too large
Load diff
BIN
2022/day07/main
Executable file
BIN
2022/day07/main
Executable file
Binary file not shown.
111
2022/day07/main.c
Normal file
111
2022/day07/main.c
Normal file
|
|
@ -0,0 +1,111 @@
|
|||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
|
||||
typedef struct Dir_ Dir;
|
||||
|
||||
typedef struct Dir_ {
|
||||
char name[32];
|
||||
int size, dir;
|
||||
int children;
|
||||
Dir *parent;
|
||||
Dir *files[32];
|
||||
} Dir;
|
||||
|
||||
Dir* changeDir(Dir *dir, Dir *root, char *name)
|
||||
{
|
||||
printf("cd %s\n", name);
|
||||
if ( name[0] == '/' ) return root;
|
||||
if ( name[0] == '.' ) return dir->parent;
|
||||
|
||||
for ( int i = 0; i < dir->children; i++ )
|
||||
{
|
||||
if(strcmp( dir->files[i]->name, name ) == 0)
|
||||
{
|
||||
return dir->files[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void list(Dir *dir, int d)
|
||||
{
|
||||
for (int i = 0; i < d; i++) printf("'-");
|
||||
printf("%s", dir->name);
|
||||
if (dir->dir) printf(" (d)");
|
||||
else printf(" %d", dir->size);
|
||||
printf("\n");
|
||||
for (int i = 0; i < dir->children; i++)
|
||||
{
|
||||
list(dir->files[i], d+1);
|
||||
}
|
||||
}
|
||||
|
||||
int findlarge(Dir *dir, int *globalsum) {
|
||||
|
||||
if (!dir->dir) {
|
||||
return dir->size;
|
||||
}
|
||||
|
||||
int sum = 0;
|
||||
for (int i = 0; i < dir->children; i++)
|
||||
{
|
||||
sum += findlarge(dir->files[i], globalsum);
|
||||
}
|
||||
if (sum <= 100000) {
|
||||
*globalsum += sum;
|
||||
}
|
||||
|
||||
return sum;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
|
||||
char *line = 0;
|
||||
size_t len;
|
||||
ssize_t nlen;
|
||||
|
||||
Dir *root = malloc(sizeof(Dir));
|
||||
root->children = 0;
|
||||
root->dir = 1;
|
||||
strcpy(root->name, "/");
|
||||
Dir *head = root;
|
||||
|
||||
int globalsum = 0;
|
||||
|
||||
while( (nlen = getline(&line, &len, stdin)) != -1 )
|
||||
{
|
||||
line[nlen-1] = '\0';
|
||||
if ( line[0] == '$' )
|
||||
{
|
||||
if ( line[2] == 'c' ) head = changeDir(head, root, line+5);
|
||||
}
|
||||
else if ( line[0] == 'd' )
|
||||
{
|
||||
Dir *newdir = malloc(sizeof(Dir));
|
||||
strcpy(newdir->name, line+4);
|
||||
newdir->dir = 1;
|
||||
newdir->children = 0;
|
||||
newdir->parent = head;
|
||||
head->files[head->children] = newdir;
|
||||
head->children++;
|
||||
}
|
||||
else {
|
||||
Dir *newdir = malloc(sizeof(Dir));
|
||||
newdir->size = atoi( strsep(&line, " ") );
|
||||
strcpy(newdir->name, strsep(&line, " "));
|
||||
head->files[head->children] = newdir;
|
||||
head->children++;
|
||||
|
||||
// printf("file %d %s\n", newdir->size, newdir->name);
|
||||
// printf("name %s\n", root->files[0]->name);
|
||||
}
|
||||
printf("cmd '%s' head: %s\n", line, head->name);
|
||||
list(root, 0);
|
||||
}
|
||||
|
||||
list(root, 0);
|
||||
|
||||
findlarge(root, &globalsum);
|
||||
printf("sum: %d\n", globalsum);
|
||||
}
|
||||
118
2022/day07/main2.c
Normal file
118
2022/day07/main2.c
Normal file
|
|
@ -0,0 +1,118 @@
|
|||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
|
||||
typedef struct Dir_ Dir;
|
||||
|
||||
typedef struct Dir_ {
|
||||
char name[32];
|
||||
int size, dir;
|
||||
int children;
|
||||
Dir *parent;
|
||||
Dir *files[32];
|
||||
} Dir;
|
||||
|
||||
Dir* changeDir(Dir *dir, Dir *root, char *name)
|
||||
{
|
||||
printf("cd %s\n", name);
|
||||
if ( name[0] == '/' ) return root;
|
||||
if ( name[0] == '.' ) return dir->parent;
|
||||
|
||||
for ( int i = 0; i < dir->children; i++ )
|
||||
{
|
||||
if(strcmp( dir->files[i]->name, name ) == 0)
|
||||
{
|
||||
return dir->files[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void list(Dir *dir, int d)
|
||||
{
|
||||
for (int i = 0; i < d; i++) printf("'-");
|
||||
printf("%s", dir->name);
|
||||
if (dir->dir) printf(" (d)");
|
||||
else printf(" %d", dir->size);
|
||||
printf("\n");
|
||||
for (int i = 0; i < dir->children; i++)
|
||||
{
|
||||
list(dir->files[i], d+1);
|
||||
}
|
||||
}
|
||||
|
||||
int findlarge(Dir *dir, int *globalmin, int *localmin) {
|
||||
|
||||
if (!dir->dir) {
|
||||
return dir->size;
|
||||
}
|
||||
|
||||
int sum = 0;
|
||||
for (int i = 0; i < dir->children; i++)
|
||||
{
|
||||
sum += findlarge(dir->files[i], globalmin, localmin);
|
||||
}
|
||||
if (sum >= *globalmin && sum < *localmin) {
|
||||
*localmin = sum;
|
||||
}
|
||||
|
||||
return sum;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
|
||||
char *line = 0;
|
||||
size_t len;
|
||||
ssize_t nlen;
|
||||
|
||||
Dir *root = malloc(sizeof(Dir));
|
||||
root->children = 0;
|
||||
root->dir = 1;
|
||||
strcpy(root->name, "/");
|
||||
Dir *head = root;
|
||||
|
||||
int globalmin = 0;
|
||||
int localmin = 70000000;
|
||||
|
||||
int rootsize = 0;
|
||||
|
||||
while( (nlen = getline(&line, &len, stdin)) != -1 )
|
||||
{
|
||||
line[nlen-1] = '\0';
|
||||
if ( line[0] == '$' )
|
||||
{
|
||||
if ( line[2] == 'c' ) head = changeDir(head, root, line+5);
|
||||
}
|
||||
else if ( line[0] == 'd' )
|
||||
{
|
||||
Dir *newdir = malloc(sizeof(Dir));
|
||||
strcpy(newdir->name, line+4);
|
||||
newdir->dir = 1;
|
||||
newdir->children = 0;
|
||||
newdir->parent = head;
|
||||
head->files[head->children] = newdir;
|
||||
head->children++;
|
||||
}
|
||||
else {
|
||||
Dir *newdir = malloc(sizeof(Dir));
|
||||
newdir->size = atoi( strsep(&line, " ") );
|
||||
strcpy(newdir->name, strsep(&line, " "));
|
||||
head->files[head->children] = newdir;
|
||||
head->children++;
|
||||
|
||||
rootsize += newdir->size;
|
||||
|
||||
// printf("file %d %s\n", newdir->size, newdir->name);
|
||||
// printf("name %s\n", root->files[0]->name);
|
||||
}
|
||||
printf("cmd '%s' head: %s\n", line, head->name);
|
||||
list(root, 0);
|
||||
}
|
||||
|
||||
list(root, 0);
|
||||
|
||||
globalmin = 30000000 - (70000000 - rootsize);
|
||||
|
||||
findlarge(root, &globalmin, &localmin);
|
||||
printf("sum: %d\n", localmin);
|
||||
}
|
||||
5
2022/day08/input1.txt
Normal file
5
2022/day08/input1.txt
Normal file
|
|
@ -0,0 +1,5 @@
|
|||
30373
|
||||
25512
|
||||
65332
|
||||
33549
|
||||
35390
|
||||
99
2022/day08/input2.txt
Normal file
99
2022/day08/input2.txt
Normal file
|
|
@ -0,0 +1,99 @@
|
|||
011201001000123232122300403211332202122424332111151523152310403222120311202224013311113203311122001
|
||||
102201211220103202323002411123324024134251423232343141424431144431022143443131141222323122010012220
|
||||
002022232232102013311311301321044421352134513235443522243113311323213013301030440423203311103101020
|
||||
002212021110130112400112141310424411421435324412235335534245212325313312413434430114302030310200000
|
||||
202000312203303110042324124431114212153432535412115323131323541522511253002131401212012131031321110
|
||||
120203002030304244102444143021314124552253521343321513511124144454343454102412220143321013220111212
|
||||
012133330030200444414333325255125142322121412245551424242135123513411533153323130432231002121211210
|
||||
012300220003100211444401144353345522135453435223464636451554321531323513234331131114224102232333310
|
||||
000201310302031301344341134512444312432566266533252332656654251123535525135213300040211242011230031
|
||||
121002133124022203240512452433331223524622643252532325346635555552514352434233454024134201432001111
|
||||
112213110140442401434531255323512525265655352543623565556265545555235551143135124203142220020302000
|
||||
033001202421424143555311243322416262636322654432542644633525453666655354514351121150231101002002310
|
||||
133303044321221102531154151541224245536464535622566355532543644552554644312231415325142303020031312
|
||||
112333344411024045335422225146442243536464622553556234523445362524655623435243115242532313102020021
|
||||
123023422310204444121415255225254435644446326664473564435422565325224635623542352154120001224144312
|
||||
102303024142131515433355242322223363453633455657436436574636544336652564626641215232314243234004001
|
||||
021344140434455245134415553542352643537665534644574553367446664254532523624521243554252411433032112
|
||||
100140101131444142414254644644434663647646555637737475474473636562243265243536422253531252202124322
|
||||
111043301134142345422324342454235374733474673456744577746755765343355535622342432251442244140231224
|
||||
232120141224122324244532255543256467566454337465647735433663734756446566663442525425254525142212311
|
||||
102310340244433433553362546534535757453376643763344566566557634664535744445254533545223521213213014
|
||||
330111232252114431226334564636467643777466445537346735563633337744734474466254662225321443542401243
|
||||
344311321253412213666443354643647347656735478884748547564466577774737677363226422622515344334010341
|
||||
222340105234132533423442424376674757757675647476557547564445666676437755355626455436313331225343402
|
||||
334241221121414455435265324646757456774784864846746867457546648735456677555624445353555434433340341
|
||||
333430021343121666326363537633737767788775478777445558858444854755434544735362564626265444342330020
|
||||
332224425333452333556456745375454657668644877658744844547774765844454475434765533256545152435214410
|
||||
411322431421116436336347456774356844455867864644844878664785864444475567664473365652253123453220003
|
||||
130345455115155526426437663665665668576686587847778476557678655576775553535745643522532344433523042
|
||||
241333521455132466523664543556384776587787745658797755565556576546847447434775733626365325451531301
|
||||
202135433134452323646546565545646885747548679876767658578565476458486465755545465664435422532454541
|
||||
344025243154435524235475655536845545775797795959686975588855546544875685664377465455353661444452422
|
||||
120511445324333353265334766654858656857755669695597899959957757545465687447345336332322634434414522
|
||||
041425252513666643357433333888555778459755889566967799659865567757457567576463765323236366123221323
|
||||
142343534134652443554434768544658774587669979986775985989879787975445856456554364645323653454511323
|
||||
443155144123223566654765746758688875856899955996667659755976778586644774777456744653322566354532232
|
||||
013242522162435447764573774877757879868788876799896979576555597985885468586473474464455426633333452
|
||||
101431333345553353553337548577478656967866886877887889699999856979976485874455544477534422463331314
|
||||
422325541533664573334736464857446675995799977868697688998787757585668584775766563477536636621514142
|
||||
313315332565562573637376866486547776557979868979996867779966955885566785455767644565336236452541411
|
||||
231122455364326235655644685888786685587796897688777698977986787596655865857448333576665523356143332
|
||||
314415154446535337443754887576795586569678967879977696896667866768856785586774365336636426455324541
|
||||
251324556334435537567468544665859588888869687767876697967887867856679658788866355353346553442543353
|
||||
134353225423362456734666455757877769577678987866887877799886886885859796767664444665534363236114533
|
||||
251241346545626367667578575687955957988796678987999979977897978877579787844755554533763646262143315
|
||||
353543555544353753474346565789555799696999667888997899777669899867697878476845756644734243432245123
|
||||
221521465632632737777766744748678869769669668898887888987898666789869785645678734643552655525624335
|
||||
351552456455622567337644647486678857766866879798779999878779869885869788874885873744772665326352324
|
||||
153242153665224557353455465857685566797887699998988788877767696668668675666664465757646436665554315
|
||||
321113152666424547657348876876678597898779877779998999978978777885976658558676664444674243656333212
|
||||
421511245364456777655754476646885699898678788797778788778778999795687589454774563737333365434325525
|
||||
213532265252653474345766566877669898969767779777879797899977669868595997784466766655547455234435452
|
||||
125232235356525353764645486577668857868788699799787978898988669878688867586564457353673236664223343
|
||||
441242562562223643773466848558599657669669968987979987787969676777796877655876456745562442232541525
|
||||
135122156635652746574578664849659556998698797778797889988788869797687977855447474475546334662522444
|
||||
144315413442434666777478887855885568968799966889978797797867786966685589646488554737453225335213325
|
||||
511213234443636433646678657654587788667696879878989799867699988765895758788675765445656425425334544
|
||||
052145146243336363474565857687976889776768867898889967686967668565998666768575534675445244546424155
|
||||
235513424332444756467574556745997958679678999799789777998968876679956958746554677637762355253554335
|
||||
331155256654246447545776676487485655676699678967897779688898989999768655488874564764434223445132152
|
||||
152152253254255234473347878744485766678897879689897888667968795675655864748584644653323363464154251
|
||||
245154344235223346354765457746867586969968687876867899766986679689585778787473555663424264553541344
|
||||
235253541263666477544377746867785766579566868896689699876766695956667455774677646576554255521144355
|
||||
033522343456423455634354575764856898657669957896677776766596688857787474488436433455326554242331222
|
||||
321532413246333226435563556578864759978657759897896799958558598588975755858856537673332523244522141
|
||||
101422552442534324467345475684574877989759655788785857697957976679848768474665346435664653421242444
|
||||
103425135453353666736674677847548667967885667765576995797857589796866646565443377775564436443333543
|
||||
041131245522253556554636537878457787468577768876778599999689667978487755747676763666266652435545351
|
||||
424232344536333364556466767555646468677996965895798968676966868665587584664535544755645232211324114
|
||||
334034423343366322247357747635787857555667756956768657779596877655676555367754633345545442422145333
|
||||
424344345121532564223643563774744574746844686888885779565686455664565643634566756543362551431252401
|
||||
232123114442152332546734767375678475664877645798695799654765488755876545334345452455463633534433233
|
||||
414423121145222454332477456654436757485685646546884446667744645744675377357654436554353221451345404
|
||||
234130223314353235262655676637577858558554556467788664555466588778677546456334642623666524333250443
|
||||
414001252524152463224524734765775677644765886656877578666575855788653533364773455446565352432424320
|
||||
024323134311552535243564667476365737764685474446876486685546667685363735646643655435355533243440034
|
||||
331141044111451522226436327536773637654887585478885586588745847444466365767232265352211455413531431
|
||||
241321311312323233252665352455436545735388846445565487667644555744667753556266645332452431541341044
|
||||
234030032312154414563442653244476576544654676884777445766434443476675746365245632242515342521301442
|
||||
202112004552434344564624422526757574735736566643654737673776743354737744242533546523434111443034202
|
||||
323422334452422412134566522262537334374446646774476534347655656336555632626663364214333341322443300
|
||||
031243421344143515452456444553266345437737337675574563437533573575456463665443432215213541123241240
|
||||
002114441013421154331235436253442576764555535635775735635377573353666526333623554524421352131443020
|
||||
111342301013125124521245222663363363467436357434736773473777464564655622533254352444544553311114233
|
||||
222323000331131531351433363334345533653474663466435557365553376535246564324662454422135233103003200
|
||||
002103300342403311123432563445263435443255635353333564444573456633466424623313351545133022013122320
|
||||
300304042333200223123432352234525626625234236453763536563235242224645265643515312312520000242200000
|
||||
210121244033001141551213125554433445222532265463624234562324443435344362451243522525243002401410013
|
||||
303323342040431313415255233251226626334264553655346266323665655652522363324341123235410333230402230
|
||||
300112203021311400115231251543524354554262365526643622264625434236554412121342322522123434120120203
|
||||
011001023222004142422445443143212526654365444643442536365453622222634154551441553400220414300301332
|
||||
230032020342121242113341435444543253355352433246243543645634456552525315313143243431133302112320020
|
||||
232132202131312144424224413332214322543242664652323324456222615212244414145113442320023403200012111
|
||||
112222030320432400004224215552515412325221525356363643351335211141344255554442403013303120331312202
|
||||
110321230332323212301432002424211134155124241552254334221154111545254253122214132321141212032221001
|
||||
021020121321302320401011302153145251455114411155452245422422135453412153112033343412340101230302010
|
||||
122203012232330222213342133012334131225335225325343355122151154444535354414423434423220001330003020
|
||||
221120213213221333210131242440001425551432522221141211124544343151315104244333311124033221102312011
|
||||
202201033331203122413021242022211002455531321354252412214332215513311231404032244320020330332301120
|
||||
BIN
2022/day08/main
Executable file
BIN
2022/day08/main
Executable file
Binary file not shown.
36
2022/day08/main.c
Normal file
36
2022/day08/main.c
Normal file
|
|
@ -0,0 +1,36 @@
|
|||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
|
||||
int main(int argc, char *argv[] )
|
||||
{
|
||||
FILE *file = fopen(argv[1], "r");
|
||||
size_t size;
|
||||
|
||||
fseek(file, 0, SEEK_END); // seek to end of file
|
||||
size = ftell(file); // get current file pointer
|
||||
fseek(file, 0, SEEK_SET); // seek back to beginning of file
|
||||
|
||||
char *line = NULL;
|
||||
size_t len;
|
||||
ssize_t nlen;
|
||||
char *forrest, *pf;
|
||||
|
||||
while ((nlen = getline(&line, &len, file)) != -1)
|
||||
{
|
||||
if (forrest == 0)
|
||||
{
|
||||
forrest = pf = malloc( (size / nlen) * sizeof(char*) );
|
||||
int i=0;
|
||||
for (; *pf != 0; pf++)
|
||||
{
|
||||
i++;
|
||||
}
|
||||
printf("%d, %zu, %zd", i, size, nlen);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
|
||||
39
2022/day08/main.py
Normal file
39
2022/day08/main.py
Normal file
|
|
@ -0,0 +1,39 @@
|
|||
import sys
|
||||
|
||||
def isVisible(lines, row, col):
|
||||
if ( row == 0 or col == 0 or row == len(lines)-1 or col == len(lines[0])-1):
|
||||
return True
|
||||
|
||||
if all(x[col] < lines[row][col] for x in lines[:row]):
|
||||
return True
|
||||
|
||||
if all(x[col] < lines[row][col] for x in lines[row+1:]):
|
||||
return True
|
||||
|
||||
if all(x < lines[row][col] for x in lines[row][:col]):
|
||||
return True
|
||||
|
||||
if all(x < lines[row][col] for x in lines[row][col+1:]):
|
||||
return True
|
||||
|
||||
return False
|
||||
|
||||
with open(sys.argv[1], "r") as file:
|
||||
lines = file.readlines()
|
||||
for a in range(len(lines)):
|
||||
lines[a] = lines[a].rstrip()
|
||||
# a = a.rstrip()
|
||||
|
||||
visible=0
|
||||
for row in range(len(lines)):
|
||||
for col in range(len(lines[0])):
|
||||
# print(lines[row][col], end="")
|
||||
yes = isVisible(lines, row, col)
|
||||
visible += yes
|
||||
if yes:
|
||||
print("1", end="")
|
||||
else:
|
||||
print("_", end="")
|
||||
print()
|
||||
|
||||
print(visible)
|
||||
49
2022/day08/main2.py
Normal file
49
2022/day08/main2.py
Normal file
|
|
@ -0,0 +1,49 @@
|
|||
import sys
|
||||
|
||||
def isVisible(lines, row, col):
|
||||
scenic = 1
|
||||
score1 = 0
|
||||
for x in lines[:row:-1]:
|
||||
if ( x[col] >= lines[row][col]):
|
||||
break
|
||||
score1 += 1
|
||||
scenic *= score1
|
||||
|
||||
score2 = 0
|
||||
for x in lines[row+1:]:
|
||||
if ( x[col] >= lines[row][col]):
|
||||
break
|
||||
score2 += 1
|
||||
scenic *= score2
|
||||
|
||||
score3 = 0
|
||||
for x in lines[row][:col:-1]:
|
||||
if ( x >= lines[row][col]):
|
||||
break
|
||||
score3 += 1
|
||||
scenic *= score3
|
||||
|
||||
score4 = 0
|
||||
for x in lines[row][col:]:
|
||||
if ( x >= lines[row][col]):
|
||||
break
|
||||
score4 += 1
|
||||
scenic *= score4
|
||||
|
||||
print(row, col, score1, score2, score3, score4, scenic)
|
||||
return scenic
|
||||
|
||||
with open(sys.argv[1], "r") as file:
|
||||
lines = file.readlines()
|
||||
for a in range(len(lines)):
|
||||
lines[a] = lines[a].rstrip()
|
||||
# a = a.rstrip()
|
||||
|
||||
best=0
|
||||
for row in range(len(lines)):
|
||||
for col in range(len(lines[0])):
|
||||
# print(lines[row][col], end="")
|
||||
yes = isVisible(lines, row, col)
|
||||
best = max(best, yes)
|
||||
|
||||
print(best)
|
||||
Loading…
Reference in a new issue