diff --git b/LICENSE.TXT a/LICENSE.TXT new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ a/LICENSE.TXT @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + 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. + + + Copyright (C) + + 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 . + +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: + + Copyright (C) + 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 +. + + 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 +. diff --git b/P10694_en/S001-AC.cc a/P10694_en/S001-AC.cc new file mode 100644 index 0000000..ec0cf20 --- /dev/null +++ a/P10694_en/S001-AC.cc @@ -0,0 +1,29 @@ +#include +#include +#include + +using namespace std; + +void bars(string* array, int pos, int n) +{ + array[pos].append(n,'*'); + if(n == 1) + { + return; + } + bars(array,pos+1,--n); + bars(array,pos+pow(2,n),n); +} + +int main() +{ + int n; + cin >> n; + string* array = new string[(int)(pow(2,n) - 1)]; + bars(array,0,n); + for(int i = (pow(2,n) - 2); i > -1; i--) + { + cout << array[i] << endl; + } + return 0; +} diff --git b/P10694_en/S001-AC.txt a/P10694_en/S001-AC.txt new file mode 100644 index 0000000..957f770 --- /dev/null +++ a/P10694_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P10694_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-09 21:52:23 +time_out: 2012-10-18 12:48:27 +veredict: AC +veredict_info: +title: Bars (3) diff --git b/P12061_en/S001-WA.cc a/P12061_en/S001-WA.cc new file mode 100644 index 0000000..65ac778 --- /dev/null +++ a/P12061_en/S001-WA.cc @@ -0,0 +1,43 @@ +#include + +using namespace std; + +int main() +{ + string word; + bool begin = false; + int count = 0; + while(true) + { + cin >> word; + if(cin.eof()) + { + break; + } + if(begin) + { + count++; + } + if(word == "beginning") + { + begin = true; + } + else if(word == "end") + { + if(!begin) + { + cout << "wrong sequence" << endl; + return 0; + } + count--; + begin = false; + } + } + if(begin) + { + cout << "wrong sequence" << endl; + return 0; + } + cout << count << endl; + return 0; +} diff --git b/P12061_en/S001-WA.txt a/P12061_en/S001-WA.txt new file mode 100644 index 0000000..d56ed0f --- /dev/null +++ a/P12061_en/S001-WA.txt @@ -0,0 +1,10 @@ +--- +problem_id: P12061_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2013-07-04 22:45:18 +time_out: 2014-03-22 20:46:22 +veredict: WA +veredict_info: +title: Words between two words diff --git b/P12061_en/S002-EE.cc a/P12061_en/S002-EE.cc new file mode 100644 index 0000000..c891ac7 --- /dev/null +++ a/P12061_en/S002-EE.cc @@ -0,0 +1,43 @@ +#include + +using namespace std; + +int main() +{ + string word; + bool begin = false, end = false; + unsigned int count = 0; + while(true) + { + cin >> word; + if(cin.eof()) + { + break; + } + if(begin && !end) + { + count++; + } + if(word == "beginning") + { + begin = true; + } + else if(word == "end") + { + if(!begin) + { + cout << "wrong sequence" << endl; + return 0; + } + count--; + end = true; + } + } + if(!begin || !end) + { + cout << "wrong sequence" << endl; + return 0; + } + cout << count << endl; + return 0; +} diff --git b/P12061_en/S002-EE.txt a/P12061_en/S002-EE.txt new file mode 100644 index 0000000..a49fcf0 --- /dev/null +++ a/P12061_en/S002-EE.txt @@ -0,0 +1,10 @@ +--- +problem_id: P12061_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2013-07-04 22:48:42 +time_out: 2014-03-22 20:46:24 +veredict: EE +veredict_info: time limit exceeded +title: Words between two words diff --git b/P12509_en/S001-AC.cc a/P12509_en/S001-AC.cc new file mode 100644 index 0000000..7bc0dae --- /dev/null +++ a/P12509_en/S001-AC.cc @@ -0,0 +1,22 @@ +#include + +using namespace std; + +int factorial(int n) +{ + if(n < 2) + { + return 1; + } + return (n)*factorial(n-1); +} + +int main() +{ +/* + int a; + cin >> a; + cout << factorial(a) << endl; + return 0; +*/ +} diff --git b/P12509_en/S001-AC.txt a/P12509_en/S001-AC.txt new file mode 100644 index 0000000..671b3b3 --- /dev/null +++ a/P12509_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P12509_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-05 00:31:30 +time_out: 2012-10-18 13:12:14 +veredict: AC +veredict_info: +title: recursive factorial diff --git b/P13623_en/S001-AC.cc a/P13623_en/S001-AC.cc new file mode 100644 index 0000000..0fafbde --- /dev/null +++ a/P13623_en/S001-AC.cc @@ -0,0 +1,66 @@ +#include +#include + +using namespace std; + +int main() +{ + int r,c; + char* row; + + cin >> r; + cin >> c; + + if(r < 1 || c < 1) + { + cout << 0 << endl; + return 0; + } + char num; + int count = 0; + for(int i = 0; i < r; i++) + { + if(!(i % 2)) + { + for(int j = 0; j < c; j++) + { + cin >> num; + if(!(j % 2)) + { + count += num-48; + } + } + } + else + { + for(int j = 0; j < c; j++) + { + cin >> num; + if(j % 2) + { + count += num-48; + } + } + } + } + /*for(int i = 0; i < r; i++) + { + row = new char[c]; + for(int j = 0; j < c; j++) + { + row[j] = 0; + } + cin >> row; + if(cin.eof()) + { + break; + } + for(int k = 0; k < c; k++) + { + count += row[k] - 48; + } + delete row; + }*/ + cout << count << endl; + return 0; +} diff --git b/P13623_en/S001-AC.txt a/P13623_en/S001-AC.txt new file mode 100644 index 0000000..8cae4f6 --- /dev/null +++ a/P13623_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P13623_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-04 17:25:20 +time_out: 2013-03-12 21:44:49 +veredict: AC +veredict_info: +title: Chess board (2) diff --git b/P17179_en/S001-AC.cc a/P17179_en/S001-AC.cc new file mode 100644 index 0000000..8fc4bb1 --- /dev/null +++ a/P17179_en/S001-AC.cc @@ -0,0 +1,34 @@ +#include +#include + +using namespace std; + +int main() +{ + int m, n; + double num, min, max, avg; + cin >> m; + for(int i = 0; i < m; i++) + { + cin >> n; + cin >> max; + min = max; + avg = max; + for(int j = 1; j < n; j++) + { + cin >> num; + if(num > max) + { + max = num; + } + if(num < min) + { + min = num; + } + avg += num; + } + avg /= n; + cout << fixed << setprecision(4) << min << " " << max << " " << avg << endl; + } + return 0; +} diff --git b/P17179_en/S001-AC.txt a/P17179_en/S001-AC.txt new file mode 100644 index 0000000..c4c4aba --- /dev/null +++ a/P17179_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P17179_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-11 21:40:24 +time_out: 2014-03-20 16:26:30 +veredict: AC +veredict_info: +title: Statistical measures diff --git b/P18298_en/S002-AC.cc a/P18298_en/S002-AC.cc new file mode 100644 index 0000000..80cc1ff --- /dev/null +++ a/P18298_en/S002-AC.cc @@ -0,0 +1,111 @@ +#include +#include +#include + +using namespace std; + +string roman(int n) +{ + string str; + char n1, n5, n10; + if(n < 10) + { + n1 = 'I'; + n5 = 'V'; + n10 = 'X'; + } + else if(n < 100) + { + n1 = 'X'; + n5 = 'L'; + n10 = 'C'; + n /= 10; + } + else if(n < 1000) + { + n1 = 'C'; + n5 = 'D'; + n10 = 'M'; + n /= 100; + } + else + { + n1 = 'M'; + n /= 1000; + } + switch(n) + { + case 1: + return str.append(1,n1); + break; + case 2: + return str.append(2,n1); + break; + case 3: + return str.append(3,n1); + break; + case 4: + str += n1; + str += n5; + return str; + break; + case 5: + return str.append(1,n5); + break; + case 6: + str += n5; + str += n1; + return str; + break; + case 7: + str += n5; + str.append(2,n1); + return str; + break; + case 8: + str += n5; + str.append(3,n1); + return str; + break; + case 9: + str += n1; + str += n10; + return str; + break; + } +} + +string toRoman(int n) +{ + string result; + int digit = 0; + while(n) + { + while(!(n%10)) + { + digit++; + n /= 10; + } + if(digit) + { + result.insert(0,roman((n%10)*pow(10,digit++))); + } + else + { + result.insert(0,roman(n%10)); + digit++; + } + n /= 10; + } + return result; +} + +int main() +{ + int n; + while(cin >> n) + { + cout << n << " = " << toRoman(n) << endl; + } + return 0; +} diff --git b/P18298_en/S002-AC.txt a/P18298_en/S002-AC.txt new file mode 100644 index 0000000..92fdf2f --- /dev/null +++ a/P18298_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P18298_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-09-13 00:22:58 +time_out: 2012-10-18 12:03:07 +veredict: AC +veredict_info: +title: Roman numbers (1) diff --git b/P18777_en/S001-AC.cc a/P18777_en/S001-AC.cc new file mode 100644 index 0000000..4113186 --- /dev/null +++ a/P18777_en/S001-AC.cc @@ -0,0 +1,58 @@ +#include +#include + +using namespace std; + +string day_of_the_week(int d, int m, int y) +{ + m -= 2; + if(m < 1) + { + m += 12; + y--; + } + int c = y / 100; + int a = y - c*100; + int f = (int)(2.6*m - 0.2) + d + a + (int)(a/4) + (int)(c/4) - 2*c; + f %= 7; + if(f < 0) + { + f += 7; + } + switch(f) + { + case 0: + return "Sunday"; + break; + case 1: + return "Monday"; + break; + case 2: + return "Tuesday"; + break; + case 3: + return "Wednesday"; + break; + case 4: + return "Thursday"; + break; + case 5: + return "Friday"; + break; + case 6: + return "Saturday"; + break; + } +} + +int main() +{ +/* + int d,m,y; + cin >> d; + cin >> m; + cin >> y; + cout << day_of_the_week(d,m,y) << endl; + return 0; +*/ +} diff --git b/P18777_en/S001-AC.txt a/P18777_en/S001-AC.txt new file mode 100644 index 0000000..9025525 --- /dev/null +++ a/P18777_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P18777_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-04 23:01:00 +time_out: 2012-10-18 13:12:20 +veredict: AC +veredict_info: +title: Day of the week diff --git b/P19991_en/S001-AC.cc a/P19991_en/S001-AC.cc new file mode 100644 index 0000000..42d505b --- /dev/null +++ a/P19991_en/S001-AC.cc @@ -0,0 +1,31 @@ +#include +#include + +using namespace std; + +int main() +{ + int n,count = 0; + char num; + + cin >> n; + + if(n < 1) + { + cout << 0 << endl; + return 0; + } + for(int i = 0; i < n; i++) + { + for(int j = 0; j < n; j++) + { + cin >> num; + if(j == n-1 - i || j == i) + { + count += num-48; + } + } + } + cout << count << endl; + return 0; +} diff --git b/P19991_en/S001-AC.txt a/P19991_en/S001-AC.txt new file mode 100644 index 0000000..f924564 --- /dev/null +++ a/P19991_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P19991_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-04 17:33:33 +time_out: 2012-10-18 13:26:15 +veredict: AC +veredict_info: +title: Chess board (3) diff --git b/P20006_en/S001-AC.cc a/P20006_en/S001-AC.cc new file mode 100644 index 0000000..f83774b --- /dev/null +++ a/P20006_en/S001-AC.cc @@ -0,0 +1,43 @@ +#include + +using namespace std; + +int operate(char op) +{ + int a = 0,b; + char c; + for(int j = 0; j < 2; j++) + { + b = a; + cin >> c; + if(cin.eof()) + { + return a; + } + if(c != '+' && c != '-' && c != '*') + { + a = c - 48; + } + else + { + a = operate(c); + } + } + switch(op) + { + case '+': + return b+a; + break; + case '-': + return b-a; + break; + case '*': + return b*a; + break; + } +} +int main() +{ + cout << operate(0) << endl; + return 0; +} diff --git b/P20006_en/S001-AC.txt a/P20006_en/S001-AC.txt new file mode 100644 index 0000000..cb2786a --- /dev/null +++ a/P20006_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P20006_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 03:31:43 +time_out: 2012-10-18 12:47:43 +veredict: AC +veredict_info: +title: Prefixed expression diff --git b/P22467_en/S003-AC.cc a/P22467_en/S003-AC.cc new file mode 100644 index 0000000..34db9fc --- /dev/null +++ a/P22467_en/S003-AC.cc @@ -0,0 +1,52 @@ +#include +#include + +using namespace std; + +int sum_digits(int n) +{ + if(!(n/10)) + { + return n; + } + return n % 10 + sum_digits(n/10); +} + +bool is_perfect_prime(int n) +{ + if(n < 10) + { + if( n == 0 || n == 1 || n == 4 || n == 6 || n == 8 || n == 9) + { + return false; + } + return true; + } + if(!(n%2) || !(n%3) || !(n%5)) + { + return false; + } + for(int i = 2; i < (sqrt(n) + 1); i++) + { + if(!(n % i)) + { + return false; + } + } + return is_perfect_prime(sum_digits(n)); +} + +int main() +{ + while(1) + { + int a; + cin >> a; + if(cin.eof()) + { + return 0; + } + cout << a << " : " << is_perfect_prime(a) << endl; + } + +} diff --git b/P22467_en/S003-AC.txt a/P22467_en/S003-AC.txt new file mode 100644 index 0000000..590ffb7 --- /dev/null +++ a/P22467_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P22467_en +submission_id: S003 +compiler_id: G++ +annotation: +time_in: 2012-09-08 19:47:50 +time_out: 2012-10-18 12:51:24 +veredict: AC +veredict_info: +title: Perfect primes diff --git b/P22654_en/S001-AC.cc a/P22654_en/S001-AC.cc new file mode 100644 index 0000000..6f9014e --- /dev/null +++ a/P22654_en/S001-AC.cc @@ -0,0 +1,14 @@ +#include + +using namespace std; + +void decompose(int n, int& h, int& m, int& s) +{ + h = n/3600; + m = (n - h*3600)/60; + s = n - (h*3600 + m*60); +} +int main() +{ + return 0; +} diff --git b/P22654_en/S001-AC.txt a/P22654_en/S001-AC.txt new file mode 100644 index 0000000..57b1d96 --- /dev/null +++ a/P22654_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P22654_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-05 12:58:52 +time_out: 2012-10-18 13:25:13 +veredict: AC +veredict_info: +title: Time decomposition (2) diff --git b/P23001_en/S001-AC.cc a/P23001_en/S001-AC.cc new file mode 100644 index 0000000..a34936c --- /dev/null +++ a/P23001_en/S001-AC.cc @@ -0,0 +1,28 @@ +#include +#include + +using namespace std; + +int main() +{ + string str1,str2; + int count = 1, max = 1; + cin >> str1; + while(cin >> str2) + { + if(str2 == str1) + { + count++; + } + else + { + count = 0; + } + if(count > max) + { + max = count; + } + } + cout << max << endl; + return 0; +} diff --git b/P23001_en/S001-AC.txt a/P23001_en/S001-AC.txt new file mode 100644 index 0000000..272da60 --- /dev/null +++ a/P23001_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P23001_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-11 19:26:44 +time_out: 2012-10-18 12:39:12 +veredict: AC +veredict_info: +title: Consecutive repeated words diff --git b/P24080_en/S001-AC.cc a/P24080_en/S001-AC.cc new file mode 100644 index 0000000..6a72f5d --- /dev/null +++ a/P24080_en/S001-AC.cc @@ -0,0 +1,31 @@ +#include + +using namespace std; + +int main() +{ + int n; + cin >> n; + + while(1) + { + if(cin.eof()) + { + return 0; + } + for(int i = 0; i < n; i++) + { + for(int j = 0; j < n; j++) + { + cout << n; + } + cout << endl; + } + cin >> n; + if(cin.eof()) + { + return 0; + } + cout << endl; + } +} diff --git b/P24080_en/S001-AC.txt a/P24080_en/S001-AC.txt new file mode 100644 index 0000000..20f19b3 --- /dev/null +++ a/P24080_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P24080_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-04 00:09:29 +time_out: 2012-10-18 13:26:56 +veredict: AC +veredict_info: +title: Squares (1) diff --git b/P26041_en/S001-AC.cc a/P26041_en/S001-AC.cc new file mode 100644 index 0000000..623dc53 --- /dev/null +++ a/P26041_en/S001-AC.cc @@ -0,0 +1,19 @@ +#include + +using namespace std; + +string read() +{ + string str; + cin >> str; + if(cin.eof()) + { + return ""; + } + return read() + str + "\n"; +} +int main() +{ + cout << read(); + return 0; +} diff --git b/P26041_en/S001-AC.txt a/P26041_en/S001-AC.txt new file mode 100644 index 0000000..6c0a282 --- /dev/null +++ a/P26041_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P26041_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 03:58:49 +time_out: 2012-10-18 12:47:35 +veredict: AC +veredict_info: +title: Reversing a list of words (1) diff --git b/P27411_en/S003-AC.cc a/P27411_en/S003-AC.cc new file mode 100644 index 0000000..e9138a9 --- /dev/null +++ a/P27411_en/S003-AC.cc @@ -0,0 +1,32 @@ +#include +#include + +using namespace std; + +int main() +{ + int a,b; + cin >> a; + if(a < 1) + { + cout << "Incorrect position." << endl; + return 0; + } + for(int i = 1; i < a; i++) + { + cin >> b; + if(b == -1) + { + cout << "Incorrect position." << endl; + return 0; + } + } + cin >> b; + if(b == -1) + { + cout << "Incorrect position." << endl; + return 0; + } + cout << "At the position " << a << " there is a(n) " << b << "." << endl; + +} diff --git b/P27411_en/S003-AC.txt a/P27411_en/S003-AC.txt new file mode 100644 index 0000000..045d448 --- /dev/null +++ a/P27411_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P27411_en +submission_id: S003 +compiler_id: G++ +annotation: +time_in: 2012-09-14 00:26:37 +time_out: 2012-10-18 11:11:01 +veredict: AC +veredict_info: +title: I-th (2) diff --git b/P28754_en/S001-AC.cc a/P28754_en/S001-AC.cc new file mode 100644 index 0000000..efebc5d --- /dev/null +++ a/P28754_en/S001-AC.cc @@ -0,0 +1,19 @@ +#include + +using namespace std; + +int main() +{ + int x; + cin >> x; + + do + { + cout << (x & 0x01); + x = x >> 1; + + }while(x); + cout << endl; + return 0; + +} diff --git b/P28754_en/S001-AC.txt a/P28754_en/S001-AC.txt new file mode 100644 index 0000000..2577d32 --- /dev/null +++ a/P28754_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P28754_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 05:10:01 +time_out: 2012-07-11 05:10:11 +veredict: AC +veredict_info: +title: Reversed number in binary diff --git b/P29253_en/S001-AC.cc a/P29253_en/S001-AC.cc new file mode 100644 index 0000000..6f21f35 --- /dev/null +++ a/P29253_en/S001-AC.cc @@ -0,0 +1,89 @@ +#include +#include +#include + +using namespace std; + +int toDecimal(string str) +{ + int n = 0; + int i = 0; + char n1, n5, n10; + while(str[i] == 'M') + { + n += 1000; + i++; + } + if(str[i] == 'C' && str[i+1] == 'M') + { + n += 900; + i += 2; + } + if(str[i] == 'D') + { + n += 500; + i++; + } + if(str[i] == 'C' && str[i+1] == 'D') + { + n += 400; + i += 2; + } + while(str[i] == 'C') + { + n += 100; + i++; + } + if(str[i] == 'X' && str[i+1] == 'C') + { + n += 90; + i += 2; + } + if(str[i] == 'L') + { + n += 50; + i++; + } + if(str[i] == 'X' && str[i+1] == 'L') + { + n += 40; + i += 2; + } + while(str[i] == 'X') + { + n += 10; + i++; + } + if(str[i] == 'I' && str[i+1] == 'X') + { + n += 9; + i += 2; + } + if(str[i] == 'V') + { + n += 5; + i++; + } + if(str[i] == 'I' && str[i+1] == 'V') + { + n += 4; + i += 2; + } + while(str[i] == 'I') + { + n += 1; + i++; + } + return n; +} + +int main() +{ + string str; + while(cin >> str) + { + str.erase(str.size()-1,1); + cout << str << " = " << toDecimal(str) << endl; + } + return 0; +} diff --git b/P29253_en/S001-AC.txt a/P29253_en/S001-AC.txt new file mode 100644 index 0000000..6063a66 --- /dev/null +++ a/P29253_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P29253_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-13 04:05:45 +time_out: 2012-10-18 12:02:36 +veredict: AC +veredict_info: +title: Roman numbers (2) diff --git b/P29448_en/S004-AC.cc a/P29448_en/S004-AC.cc new file mode 100644 index 0000000..0532b99 --- /dev/null +++ a/P29448_en/S004-AC.cc @@ -0,0 +1,52 @@ +#include + +using namespace std; + +int main() +{ + int d,m,a; + + while(1) + { + cin >> d; + if(cin.eof()) + { + return 0; + } + cin >> m; + cin >> a; + if(d <= 0 || d >= 32 || (m == 2 && d >= 30)) + { + goto incorrect; + } + if(m <= 0 || m >= 13) + { + goto incorrect; + } + if(d == 31 && (m == 4 || m == 6 || m == 9 || m == 11)) + { + goto incorrect; + } + if(a - (a/100)*100) + { + if((a % 4 != 0) && m == 2 && d == 29) + { + goto incorrect; + } + + } + else + { + if(((a/100) % 4 != 0) && m == 2 && d == 29) + { + goto incorrect; + } + } + goto correct; + incorrect: + cout << "Incorrect Date" << endl; + continue; + correct: + cout << "Correct Date" << endl; + } +} diff --git b/P29448_en/S004-AC.txt a/P29448_en/S004-AC.txt new file mode 100644 index 0000000..f7d927e --- /dev/null +++ a/P29448_en/S004-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P29448_en +submission_id: S004 +compiler_id: G++ +annotation: +time_in: 2012-07-12 02:15:10 +time_out: 2014-03-09 11:33:45 +veredict: AC +veredict_info: +title: Correct dates diff --git b/P29973_en/S001-AC.cc a/P29973_en/S001-AC.cc new file mode 100644 index 0000000..3f24c19 --- /dev/null +++ a/P29973_en/S001-AC.cc @@ -0,0 +1,18 @@ +#include +#include + +using namespace std; + +int main() +{ + int n; + cin >> n; + for(int i = 0; i < n; i++) + { + for(int j = -1; j < i; j++) + { + cout << "*"; + } + cout << endl; + } +} diff --git b/P29973_en/S001-AC.txt a/P29973_en/S001-AC.txt new file mode 100644 index 0000000..1ea74de --- /dev/null +++ a/P29973_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P29973_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-03 13:09:38 +time_out: 2012-10-18 13:27:38 +veredict: AC +veredict_info: +title: Triangle diff --git b/P31111_en/S002-AC.cc a/P31111_en/S002-AC.cc new file mode 100644 index 0000000..40d2043 --- /dev/null +++ a/P31111_en/S002-AC.cc @@ -0,0 +1,36 @@ +#include + +using namespace std; + +int main() +{ + char c; + int score = 0; + while(true) + { + cin >> c; + if(cin.eof()) + { + break; + } + if(c == '(') + { + score++; + } + else if(c == ')') + { + if(--score < 0) + { + cout << "no" << endl; + return 0; + } + } + } + if(score) + { + cout << "no" << endl; + return 0; + } + cout << "yes" << endl; + return 0; +} diff --git b/P31111_en/S002-AC.txt a/P31111_en/S002-AC.txt new file mode 100644 index 0000000..a2caae6 --- /dev/null +++ a/P31111_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P31111_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2013-07-04 21:37:39 +time_out: 2013-07-04 21:37:46 +veredict: AC +veredict_info: +title: Parentheses diff --git b/P31170_en/S001-AC.cc a/P31170_en/S001-AC.cc new file mode 100644 index 0000000..ee7bce2 --- /dev/null +++ a/P31170_en/S001-AC.cc @@ -0,0 +1,17 @@ +#include + +using namespace std; + +int main() +{ + int n; + + cin >> n; + + for(int i = 1; i < 11; i++) + { + cout << n << "*" << i << " = " << n*i << endl; + } + return 0; + +} diff --git b/P31170_en/S001-AC.txt a/P31170_en/S001-AC.txt new file mode 100644 index 0000000..2cac129 --- /dev/null +++ a/P31170_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P31170_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 04:41:40 +time_out: 2012-07-11 04:41:48 +veredict: AC +veredict_info: +title: Multiplication table diff --git b/P33371_en/S001-AC.cc a/P33371_en/S001-AC.cc new file mode 100644 index 0000000..7b016e1 --- /dev/null +++ a/P33371_en/S001-AC.cc @@ -0,0 +1,37 @@ +#include +#include + +using namespace std; + +char encoded(char c, int k) +{ + if(c == '_') + { + return ' '; + } + else if(c > 96 && c < 123) + { + return ((c - 97 + k) % 26) + 65 ; + } + else + { + return c; + } +} + +int main() +{ + int k; + char c; + while(cin >> k) + { + cin >> c; + while(c != '.') + { + cout << encoded(c,k); + cin >> c; + } + cout << endl; + } + return 0; +} diff --git b/P33371_en/S001-AC.txt a/P33371_en/S001-AC.txt new file mode 100644 index 0000000..5578b24 --- /dev/null +++ a/P33371_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P33371_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-11 23:19:11 +time_out: 2012-10-18 12:37:40 +veredict: AC +veredict_info: +title: Caesar cipher diff --git b/P33839_en/S002-AC.cc a/P33839_en/S002-AC.cc new file mode 100644 index 0000000..5263356 --- /dev/null +++ a/P33839_en/S002-AC.cc @@ -0,0 +1,24 @@ +#include +#include + +using namespace std; + +int main() +{ + string str; + int sum; + while(1) + { + cin >> str; + if(cin.eof()) + { + return 0; + } + sum = 0; + for(int i = 0; i < str.size(); i++) + { + sum += str[i]-48; + } + cout << "The sum of the digits of " << str << " is " << sum << "." << endl; + } +} diff --git b/P33839_en/S002-AC.txt a/P33839_en/S002-AC.txt new file mode 100644 index 0000000..3953630 --- /dev/null +++ a/P33839_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P33839_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-07-12 03:17:58 +time_out: 2012-07-12 03:18:07 +veredict: AC +veredict_info: +title: Sum of digits diff --git b/P34080_en/S001-AC.cc a/P34080_en/S001-AC.cc new file mode 100644 index 0000000..a0ed7b4 --- /dev/null +++ a/P34080_en/S001-AC.cc @@ -0,0 +1,37 @@ +#include + +using namespace std; + +int main() +{ + int n,count; + cin >> n; + + while(1) + { + if(cin.eof()) + { + return 0; + } + count = 0; + for(int i = 0; i < n; i++) + { + for(int j = 0; j < n; j++) + { + cout << count; + count++; + if(count == 10) + { + count = 0; + } + } + cout << endl; + } + cin >> n; + if(cin.eof()) + { + return 0; + } + cout << endl; + } +} diff --git b/P34080_en/S001-AC.txt a/P34080_en/S001-AC.txt new file mode 100644 index 0000000..1240ce8 --- /dev/null +++ a/P34080_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P34080_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-04 00:11:54 +time_out: 2012-10-18 13:26:52 +veredict: AC +veredict_info: +title: Squares (2) diff --git b/P34091_en/S004-AC.cc a/P34091_en/S004-AC.cc new file mode 100644 index 0000000..bad17bb --- /dev/null +++ a/P34091_en/S004-AC.cc @@ -0,0 +1,37 @@ +#include +#include + +using namespace std; + +bool is_perfect(int n) +{ + int sum = 1; + if(n > 5) + { + for(int i = 2; i < (int)(sqrt(n) + 1) ; i++) + { + if(!(n % i)) + { + sum += (i + n/i); + } + } + if(sum == n) + { + return true; + } + } + return false; +} + +int main() +{ +/* + int a; + cin >> a; + if(is_perfect(a)) + { + return 0; + } + return -1; +*/ +} diff --git b/P34091_en/S004-AC.txt a/P34091_en/S004-AC.txt new file mode 100644 index 0000000..7e5c649 --- /dev/null +++ a/P34091_en/S004-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P34091_en +submission_id: S004 +compiler_id: G++ +annotation: +time_in: 2012-09-05 00:18:07 +time_out: 2012-10-18 13:12:19 +veredict: AC +veredict_info: +title: Perfect numbers diff --git b/P34279_en/S001-AC.cc a/P34279_en/S001-AC.cc new file mode 100644 index 0000000..29f57fa --- /dev/null +++ a/P34279_en/S001-AC.cc @@ -0,0 +1,36 @@ +#include +#include + +using namespace std; + +int main() +{ + int h,m,s; + + cin >> h; + cin >> m; + cin >> s; + + s++; + + if(s == 60) + { + s = 0; + m++; + } + if(m == 60) + { + m = 0; + h++; + } + if(h == 24) + { + h = 0; + } + + cout << setw(2) << setfill('0') << h << ":"; + cout << setw(2) << setfill('0') << m << ":"; + cout << setw(2) << setfill('0') << s << endl; + + return 0; +} diff --git b/P34279_en/S001-AC.txt a/P34279_en/S001-AC.txt new file mode 100644 index 0000000..cdafd72 --- /dev/null +++ a/P34279_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P34279_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 02:15:56 +time_out: 2012-07-10 02:16:17 +veredict: AC +veredict_info: +title: Add one second diff --git b/P35080_en/S001-AC.cc a/P35080_en/S001-AC.cc new file mode 100644 index 0000000..221e3bf --- /dev/null +++ a/P35080_en/S001-AC.cc @@ -0,0 +1,31 @@ +#include + +using namespace std; + +int main() +{ + int n,count; + cin >> n; + for(int i = 0; i < n; i++) + { + count = 0; + for(int j = 0; j < n; j++) + { + for(int k = 0; k < n; k++) + { + cout << count; + count++; + if(count == 10) + { + count = 0; + } + } + cout << endl; + } + if(i != n-1) + { + cout << endl; + } + } + return 0; +} diff --git b/P35080_en/S001-AC.txt a/P35080_en/S001-AC.txt new file mode 100644 index 0000000..e87ff05 --- /dev/null +++ a/P35080_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P35080_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-04 00:16:17 +time_out: 2012-10-18 13:26:50 +veredict: AC +veredict_info: +title: Squares (4) diff --git b/P35537_en/S001-AC.cc a/P35537_en/S001-AC.cc new file mode 100644 index 0000000..2e18789 --- /dev/null +++ a/P35537_en/S001-AC.cc @@ -0,0 +1,21 @@ +#include + +using namespace std; + +bool is_increasing(int n) +{ + if(!(n/10)) + { + return true; + } + return ((n - (n/10)*10) >= (n/10 - (n/100)*10)) && is_increasing(n/10); +} +int main() +{ +/* + int a; + cin >> a; + cout << is_increasing(a) << endl; + return 0; +*/ +} diff --git b/P35537_en/S001-AC.txt a/P35537_en/S001-AC.txt new file mode 100644 index 0000000..b6cd3cf --- /dev/null +++ a/P35537_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P35537_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-05 01:04:32 +time_out: 2012-10-18 13:12:11 +veredict: AC +veredict_info: +title: Increasing numbers diff --git b/P35547_en/S001-AC.cc a/P35547_en/S001-AC.cc new file mode 100644 index 0000000..2bfc099 --- /dev/null +++ a/P35547_en/S001-AC.cc @@ -0,0 +1,49 @@ +#include + +using namespace std; + +int main() +{ + int k,x,b,c,q,p,y,z,n,e,D,M,Y; + + while(1) + { + cin >> Y; + if(cin.eof()) + { + return 0; + } + k = Y / 100; + x = Y % 19; + b = Y % 4; + c = Y % 7; + q = k / 4; + p = (13 + 8*k) / 25; + y = (15 - p + k - q) % 30; + z = (19*x + y) % 30; + n = (4 + k - q) % 7; + e = (2*b + 4*c + 6*z + n) % 7; + + if(z + e <= 9) + { + D = 22 + z + e; + M = 3; + } + else if(z == 29 && e == 6) + { + D = 19; + M = 4; + } + else if(z == 28 && e == 6 && x > 10) + { + D = 18; + M = 4; + } + else + { + D = z + e - 9; + M = 4; + } + cout << D << "/" << M << endl; + } +} diff --git b/P35547_en/S001-AC.txt a/P35547_en/S001-AC.txt new file mode 100644 index 0000000..d36d2b1 --- /dev/null +++ a/P35547_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P35547_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-12 02:46:23 +time_out: 2012-07-12 02:46:32 +veredict: AC +veredict_info: +title: Easter Sundays diff --git b/P35957_en/S001-AC.cc a/P35957_en/S001-AC.cc new file mode 100644 index 0000000..06c7bf5 --- /dev/null +++ a/P35957_en/S001-AC.cc @@ -0,0 +1,54 @@ +#include +#include + +using namespace std; + +int strToInt(string str) +{ + stringstream sstream; + int ret; + sstream.str(str); + sstream >> ret; + return ret; +} + +bool middleNumberIsEqual(string a, string b) +{ + return (a[a.length()/2] == b[b.length()/2]); +} + +int main() +{ + int n, turn = 0; + string a,b; + cin >> n; + cin >> a; + for(int i = 1; i < 2*n; i++) + { + turn++; + cin >> b; + if(!(a.length() % 2)) + { + cout << "B" << endl; + return 0; + } + else if(!(b.length() % 2)) + { + cout << "A" << endl; + return 0; + } + if(!middleNumberIsEqual(a,b)) + { + if(turn % 2) + { + cout << "A" << endl; + return 0; + } + cout << "B" << endl; + return 0; + } + a = b; + } + cout << "=" << endl; + return 0; +} diff --git b/P35957_en/S001-AC.txt a/P35957_en/S001-AC.txt new file mode 100644 index 0000000..931a8ba --- /dev/null +++ a/P35957_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P35957_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2013-07-04 22:38:09 +time_out: 2013-07-04 22:38:15 +veredict: AC +veredict_info: +title: Middle digits diff --git b/P36668_en/S002-AC.cc a/P36668_en/S002-AC.cc new file mode 100644 index 0000000..f4187df --- /dev/null +++ a/P36668_en/S002-AC.cc @@ -0,0 +1,15 @@ +#include + +using namespace std; + +int main() +{ + int a,sum = 0; + cin >> a; + for(int i = 0; i < a; i++) + { + sum += (i+1)*(i+1); + } + cout << sum << endl; + return 0; +} diff --git b/P36668_en/S002-AC.txt a/P36668_en/S002-AC.txt new file mode 100644 index 0000000..bc9711f --- /dev/null +++ a/P36668_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P36668_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-09-11 19:16:59 +time_out: 2012-10-18 12:39:12 +veredict: AC +veredict_info: +title: Sum of squares diff --git b/P37469_en/S001-AC.cc a/P37469_en/S001-AC.cc new file mode 100644 index 0000000..4098ad3 --- /dev/null +++ a/P37469_en/S001-AC.cc @@ -0,0 +1,17 @@ +#include + +using namespace std; + +int main() +{ + double x; + cin >> x; + + int hours = x/3600; + int minutes = (x - (hours*3600))/60; + int seconds = x - (hours*3600) - (minutes*60); + + cout << hours << " " << minutes << " " << seconds << endl; + + return 0; +} diff --git b/P37469_en/S001-AC.txt a/P37469_en/S001-AC.txt new file mode 100644 index 0000000..094d073 --- /dev/null +++ a/P37469_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P37469_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:53:51 +time_out: 2012-07-10 01:54:09 +veredict: AC +veredict_info: +title: Time decomposition (1) diff --git b/P37500_en/S001-AC.cc a/P37500_en/S001-AC.cc new file mode 100644 index 0000000..d81752f --- /dev/null +++ a/P37500_en/S001-AC.cc @@ -0,0 +1,14 @@ +#include + +using namespace std; + +int main() +{ + int n; + cin >> n; + for(int i = 0; i < n+1; i++) + { + cout << i << endl; + } + return 0; +} diff --git b/P37500_en/S001-AC.txt a/P37500_en/S001-AC.txt new file mode 100644 index 0000000..404d32a --- /dev/null +++ a/P37500_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P37500_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 03:53:34 +time_out: 2012-07-11 03:53:44 +veredict: AC +veredict_info: +title: First numbers diff --git b/P37760_en/S003-AC.py a/P37760_en/S003-AC.py new file mode 100644 index 0000000..b66456b --- /dev/null +++ a/P37760_en/S003-AC.py @@ -0,0 +1,11 @@ +import math +import sys +import string + +stream = sys.stdin +while True: + n = stream.readline(); + if len(n) == 0: + break + n = string.atof(n) + print "%.6f %.6f" % (math.sin(math.radians(n)),math.cos(math.radians(n))) diff --git b/P37760_en/S003-AC.txt a/P37760_en/S003-AC.txt new file mode 100644 index 0000000..b1f4fad --- /dev/null +++ a/P37760_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P37760_en +submission_id: S003 +compiler_id: Python +annotation: +time_in: 2012-08-06 01:56:47 +time_out: 2012-10-18 13:24:34 +veredict: AC +veredict_info: +title: Trigonometry diff --git b/P37760_en/S006-WA.cc a/P37760_en/S006-WA.cc new file mode 100644 index 0000000..f85f74c --- /dev/null +++ a/P37760_en/S006-WA.cc @@ -0,0 +1,21 @@ +#include +#include +#include + +using namespace std; + +int main() +{ + float angle; + + while(1) + { + cin >> angle; + if(cin.eof()) + { + return 0; + } + cout << fixed << setprecision(6) << sin(angle*M_PI/180) << " " << cos(angle*M_PI/180) << endl; + } + return 0; +} diff --git b/P37760_en/S006-WA.txt a/P37760_en/S006-WA.txt new file mode 100644 index 0000000..1cf2f68 --- /dev/null +++ a/P37760_en/S006-WA.txt @@ -0,0 +1,10 @@ +--- +problem_id: P37760_en +submission_id: S006 +compiler_id: G++ +annotation: +time_in: 2012-08-06 03:17:25 +time_out: 2012-10-18 13:24:30 +veredict: WA +veredict_info: +title: Trigonometry diff --git b/P38045_en/S001-AC.cc a/P38045_en/S001-AC.cc new file mode 100644 index 0000000..0a27593 --- /dev/null +++ a/P38045_en/S001-AC.cc @@ -0,0 +1,23 @@ +#include +#include +#include + +using namespace std; + +int main() +{ + double n; + + while(1) + { + cin >> n; + if(cin.eof()) + { + return 0; + } + cout << n*n << " "; + cout << fixed << setprecision(6) << sqrt(n); + cout << setprecision(0) << endl; + } + return 0; +} diff --git b/P38045_en/S001-AC.txt a/P38045_en/S001-AC.txt new file mode 100644 index 0000000..423a59b --- /dev/null +++ a/P38045_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P38045_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-05 12:20:08 +time_out: 2012-10-18 13:25:32 +veredict: AC +veredict_info: +title: Computing square roots and squares diff --git b/P38877_en/S001-AC.cc a/P38877_en/S001-AC.cc new file mode 100644 index 0000000..d25cb08 --- /dev/null +++ a/P38877_en/S001-AC.cc @@ -0,0 +1,30 @@ +#include + +using namespace std; + +string read(int* n) +{ + string str, prev; + cin >> str; + if(cin.eof()) + { + return ""; + } + prev = read(n); + if(!(*n)) + { + return prev; + } + (*n)--; + return prev + str + "\n"; +} +int main() +{ + int n; + cin >> n; + if(n) + { + cout << read(&n); + } + return 0; +} diff --git b/P38877_en/S001-AC.txt a/P38877_en/S001-AC.txt new file mode 100644 index 0000000..709b564 --- /dev/null +++ a/P38877_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P38877_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 04:57:51 +time_out: 2012-10-18 12:47:29 +veredict: AC +veredict_info: +title: Girant una llista de paraules (4) diff --git b/P39057_en/S002-AC.cc a/P39057_en/S002-AC.cc new file mode 100644 index 0000000..303fa0f --- /dev/null +++ a/P39057_en/S002-AC.cc @@ -0,0 +1,31 @@ +#include +#include +#include +#include + +using namespace std; + +int main() +{ + int n; + double a,b,r; + string str; + cin >> n; + for(int i = 0; i < n; i++) + { + cin >> str; + if(str == "rectangle") + { + cin >> a; + cin >> b; + cout << fixed << setprecision(6) << a*b << endl; + } + else + { + cin >> r; + cout << fixed << setprecision(6) << M_PI*r*r << endl; + } + } + return 0; + +} diff --git b/P39057_en/S002-AC.txt a/P39057_en/S002-AC.txt new file mode 100644 index 0000000..434012b --- /dev/null +++ a/P39057_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P39057_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-07-11 23:39:52 +time_out: 2012-07-11 23:40:01 +veredict: AC +veredict_info: +title: Computing areas diff --git b/P39225_en/S001-AC.cc a/P39225_en/S001-AC.cc new file mode 100644 index 0000000..3f375fc --- /dev/null +++ a/P39225_en/S001-AC.cc @@ -0,0 +1,17 @@ +#include +#include + +using namespace std; + +int main() +{ + int a,b; + cin >> a; + for(int i = 1; i < a; i++) + { + cin >> b; + } + cin >> b; + cout << "At the position " << a << " there is a(n) " << b << "." << endl; + +} diff --git b/P39225_en/S001-AC.txt a/P39225_en/S001-AC.txt new file mode 100644 index 0000000..1c1f85a --- /dev/null +++ a/P39225_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P39225_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-14 00:21:57 +time_out: 2012-10-18 11:11:01 +veredict: AC +veredict_info: +title: I-th (1) diff --git b/P41221_en/S001-AC.cc a/P41221_en/S001-AC.cc new file mode 100644 index 0000000..c4c4065 --- /dev/null +++ a/P41221_en/S001-AC.cc @@ -0,0 +1,13 @@ +#include + +using namespace std; + +int main() +{ + int a,b,c; + cin >> a; + cin >> b; + cin >> c; + cout << a+b+c << endl; + return 0; +} diff --git b/P41221_en/S001-AC.txt a/P41221_en/S001-AC.txt new file mode 100644 index 0000000..73f90e6 --- /dev/null +++ a/P41221_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P41221_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 00:56:32 +time_out: 2012-07-10 00:56:45 +veredict: AC +veredict_info: +title: Sum of three integer numbers diff --git b/P42042_en/S001-AC.cc a/P42042_en/S001-AC.cc new file mode 100644 index 0000000..91b94a1 --- /dev/null +++ a/P42042_en/S001-AC.cc @@ -0,0 +1,27 @@ +#include + +using namespace std; + +int main() +{ + char c; + cin >> c; + + if(c > 90) + { + cout << "lowercase" << endl; + } + else + { + cout << "uppercase" << endl; + } + if( c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U') + { + cout << "vowel" << endl; + } + else + { + cout << "consonant" << endl; + } + return 0; +} diff --git b/P42042_en/S001-AC.txt a/P42042_en/S001-AC.txt new file mode 100644 index 0000000..4d96ee7 --- /dev/null +++ a/P42042_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P42042_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:33:10 +time_out: 2012-07-10 01:33:22 +veredict: AC +veredict_info: +title: Classification of characters (1) diff --git b/P42156_en/S001-AC.cc a/P42156_en/S001-AC.cc new file mode 100644 index 0000000..2296b36 --- /dev/null +++ a/P42156_en/S001-AC.cc @@ -0,0 +1,28 @@ +#include + +using namespace std; + +string read(int* n) +{ + string str, prev; + cin >> str; + (*n)++; + if(cin.eof()) + { + *n = ((*n) / -2)*(-1); + return ""; + } + prev = read(n); + if(!(*n)) + { + return prev; + } + (*n)--; + return prev + str + "\n"; +} +int main() +{ + int n = 0; + cout << read(&n); + return 0; +} diff --git b/P42156_en/S001-AC.txt a/P42156_en/S001-AC.txt new file mode 100644 index 0000000..62b0482 --- /dev/null +++ a/P42156_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P42156_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 05:04:34 +time_out: 2012-10-18 12:47:32 +veredict: AC +veredict_info: +title: Girant una llista de paraules (5) diff --git b/P42280_ca/S002-AC.cc a/P42280_ca/S002-AC.cc new file mode 100644 index 0000000..5e76584 --- /dev/null +++ a/P42280_ca/S002-AC.cc @@ -0,0 +1,44 @@ +#include +#include + +using namespace std; + +int main() +{ + int r,c; + double count = 0; + char* row; + + cin >> r; + cin >> c; + + if(r < 1 || c < 1) + { + cout << 0 << endl; + return 0; + } + char num; + int cont = 0; + for(int i = 0; i< (r*c); i++) { + cin >> num;cont += num-48;} + /*for(int i = 0; i < r; i++) + { + row = new char[c]; + for(int j = 0; j < c; j++) + { + row[j] = 0; + } + cin >> row; + if(cin.eof()) + { + break; + } + for(int k = 0; k < c; k++) + { + count += row[k] - 48; + } + delete row; + }*/ + cout << cont << endl; + return 0; +} diff --git b/P42280_ca/S002-AC.txt a/P42280_ca/S002-AC.txt new file mode 100644 index 0000000..033039e --- /dev/null +++ a/P42280_ca/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P42280_ca +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-08-04 16:36:06 +time_out: 2013-03-12 18:58:32 +veredict: AC +veredict_info: +title: Tauler d'escacs (1) diff --git b/P42280_en/S010-AC.cc a/P42280_en/S010-AC.cc new file mode 100644 index 0000000..5e76584 --- /dev/null +++ a/P42280_en/S010-AC.cc @@ -0,0 +1,44 @@ +#include +#include + +using namespace std; + +int main() +{ + int r,c; + double count = 0; + char* row; + + cin >> r; + cin >> c; + + if(r < 1 || c < 1) + { + cout << 0 << endl; + return 0; + } + char num; + int cont = 0; + for(int i = 0; i< (r*c); i++) { + cin >> num;cont += num-48;} + /*for(int i = 0; i < r; i++) + { + row = new char[c]; + for(int j = 0; j < c; j++) + { + row[j] = 0; + } + cin >> row; + if(cin.eof()) + { + break; + } + for(int k = 0; k < c; k++) + { + count += row[k] - 48; + } + delete row; + }*/ + cout << cont << endl; + return 0; +} diff --git b/P42280_en/S010-AC.txt a/P42280_en/S010-AC.txt new file mode 100644 index 0000000..70caa4e --- /dev/null +++ a/P42280_en/S010-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P42280_en +submission_id: S010 +compiler_id: G++ +annotation: +time_in: 2012-08-04 16:45:43 +time_out: 2013-03-12 21:23:49 +veredict: AC +veredict_info: +title: Chess board (1) diff --git b/P42523_en/S001-AC.cc a/P42523_en/S001-AC.cc new file mode 100644 index 0000000..fa24f08 --- /dev/null +++ a/P42523_en/S001-AC.cc @@ -0,0 +1,26 @@ +#include + +using namespace std; + +int gcd(int a, int b) +{ + if(!a) + { + return b; + } + if(!b) + { + return a; + } + return gcd(b, a % b); +} +int main() +{ +/* + int a,b; + cin >> a; + cin >> b; + cout << gcd(a,b) << endl; + return 0; +*/ +} diff --git b/P42523_en/S001-AC.txt a/P42523_en/S001-AC.txt new file mode 100644 index 0000000..2c591fc --- /dev/null +++ a/P42523_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P42523_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-05 00:37:42 +time_out: 2012-10-18 13:12:13 +veredict: AC +veredict_info: +title: Recursive greatest common divisor diff --git b/P45102_en/S001-AC.cc a/P45102_en/S001-AC.cc new file mode 100644 index 0000000..4546f91 --- /dev/null +++ a/P45102_en/S001-AC.cc @@ -0,0 +1,52 @@ +#include + +using namespace std; + +int operate() +{ + int a = 0, b; + char c,op; + while(1) + { + cin >> c; + if(cin.eof()) + { + return a; + } + if( c == ')' ) + { + break; + } + else if( c == '(' ) + { + b = a; + a = operate(); + } + else if(c != '+' && c != '-' && c != '*') + { + b = a; + a = c - 48; + } + else + { + op = c; + } + } + switch(op) + { + case '+': + return b+a; + break; + case '-': + return b-a; + break; + case '*': + return b*a; + break; + } +} +int main() +{ + cout << operate() << endl; + return 0; +} diff --git b/P45102_en/S001-AC.txt a/P45102_en/S001-AC.txt new file mode 100644 index 0000000..d6d64d4 --- /dev/null +++ a/P45102_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P45102_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 03:49:30 +time_out: 2012-10-18 12:47:37 +veredict: AC +veredict_info: +title: Completely parenthesed expression diff --git b/P48107_en/S001-AC.cc a/P48107_en/S001-AC.cc new file mode 100644 index 0000000..3c54adb --- /dev/null +++ a/P48107_en/S001-AC.cc @@ -0,0 +1,14 @@ +#include + +using namespace std; + +int main() +{ + int a,b; + cin >> a; + cin >> b; + + cout << a/b << " " << a-((a/b)*b) << endl; + + return 0; +} diff --git b/P48107_en/S001-AC.txt a/P48107_en/S001-AC.txt new file mode 100644 index 0000000..cb7bc19 --- /dev/null +++ a/P48107_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P48107_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:10:26 +time_out: 2012-07-10 01:10:35 +veredict: AC +veredict_info: +title: Integer division and remainder of two natural numbers diff --git b/P48713_en/S005-AC.cc a/P48713_en/S005-AC.cc new file mode 100644 index 0000000..27d0a11 --- /dev/null +++ a/P48713_en/S005-AC.cc @@ -0,0 +1,54 @@ +#include +#include + +using namespace std; + +bool isPrime(int a) +{ + if(a == 2 || a == 3 || a == 5) + { + return true; + } + if(a == 1) + { + return false; + } + if(a%2) + { + if(a%3) + { + if(a%5) + { + for(int i = 2; i < (sqrt(a)+1); i++) + { + if(!(a%i)) + { + return false; + } + } + return true; + } + } + } + return false; +} + + +int main() +{ + int a,b; + cin >> a; + for(int i = 0; i < a; i++) + { + cin >> b; + if(isPrime(b)) + { + cout << b << " is prime" << endl; + } + else + { + cout << b << " is not prime" << endl; + } + } + return 0; +} diff --git b/P48713_en/S005-AC.txt a/P48713_en/S005-AC.txt new file mode 100644 index 0000000..5905720 --- /dev/null +++ a/P48713_en/S005-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P48713_en +submission_id: S005 +compiler_id: G++ +annotation: +time_in: 2012-09-14 01:09:21 +time_out: 2012-10-18 11:10:22 +veredict: AC +veredict_info: +title: Primality diff --git b/P50095_en/S001-AC.cc a/P50095_en/S001-AC.cc new file mode 100644 index 0000000..219d5f3 --- /dev/null +++ a/P50095_en/S001-AC.cc @@ -0,0 +1,52 @@ +#include +#include + +using namespace std; + +bool isPrime(int a) +{ + if(a == 2 || a == 3 || a == 5) + { + return true; + } + if(a == 1) + { + return false; + } + if(a%2) + { + if(a%3) + { + if(a%5) + { + for(int i = 2; i < (sqrt(a)+1); i++) + { + if(!(a%i)) + { + return false; + } + } + return true; + } + } + } + return false; +} + + +int main() +{ + int a,b; + while(cin >> a) + { + if(isPrime(a)) + { + while(!isPrime(++a)) {} + cout << a << endl; + } + else + { + return 0; + } + } +} diff --git b/P50095_en/S001-AC.txt a/P50095_en/S001-AC.txt new file mode 100644 index 0000000..a97d61f --- /dev/null +++ a/P50095_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P50095_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-14 01:16:04 +time_out: 2012-10-18 11:10:24 +veredict: AC +veredict_info: +title: Next prime number diff --git b/P50327_en/S001-AC.cc a/P50327_en/S001-AC.cc new file mode 100644 index 0000000..46b9da8 --- /dev/null +++ a/P50327_en/S001-AC.cc @@ -0,0 +1,19 @@ +#include +#include + +using namespace std; + +int main() +{ + string str; + + cin >> str; + + for(int i = str.size()-1; i > -1; i--) + { + cout << str[i]; + } + cout << endl; + return 0; + +} diff --git b/P50327_en/S001-AC.txt a/P50327_en/S001-AC.txt new file mode 100644 index 0000000..9caa964 --- /dev/null +++ a/P50327_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P50327_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 04:44:43 +time_out: 2012-07-11 04:44:53 +veredict: AC +veredict_info: +title: Reversed number diff --git b/P51126_en/S001-AC.cc a/P51126_en/S001-AC.cc new file mode 100644 index 0000000..2f53e80 --- /dev/null +++ a/P51126_en/S001-AC.cc @@ -0,0 +1,40 @@ +#include + +using namespace std; + +int main() +{ + int a,b,c,d,x,y; + + cin >> a; + cin >> b; + cin >> c; + cin >> d; + + if(a<=d) + { + if(b>=c) + { + if(a + +using namespace std; + +int number_of_digits(int n) +{ + if(!n || !(n/10)) + { + return 1; + } + return 1 + number_of_digits(n/10); +} +int main() +{ + + int a; + cin >> a; + cout << number_of_digits(a) << endl; + return 0; + +} diff --git b/P51222_en/S001-AC.txt a/P51222_en/S001-AC.txt new file mode 100644 index 0000000..3551bec --- /dev/null +++ a/P51222_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P51222_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-05 00:45:23 +time_out: 2012-10-18 13:12:14 +veredict: AC +veredict_info: +title: Recursive number of digits diff --git b/P52847_en/S001-AC.cc a/P52847_en/S001-AC.cc new file mode 100644 index 0000000..7384771 --- /dev/null +++ a/P52847_en/S001-AC.cc @@ -0,0 +1,22 @@ +#include + +using namespace std; + +int main() +{ + int max; + int input[3]; + cin >> input[0]; + cin >> input[1]; + cin >> input[2]; + max = input[0]; + for(int i = 1; i < 3; i++) + { + if(input[i] > max) + { + max = input[i]; + } + } + cout << max << endl; + return 0; +} diff --git b/P52847_en/S001-AC.txt a/P52847_en/S001-AC.txt new file mode 100644 index 0000000..55d5a23 --- /dev/null +++ a/P52847_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P52847_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:04:28 +time_out: 2012-07-10 01:04:36 +veredict: AC +veredict_info: +title: Maximum of three different integer numbers diff --git b/P52926_en/S001-AC.cc a/P52926_en/S001-AC.cc new file mode 100644 index 0000000..7cf43bb --- /dev/null +++ a/P52926_en/S001-AC.cc @@ -0,0 +1,19 @@ +#include + +using namespace std; + +string read() +{ + string str; + cin >> str; + if(str == "end") + { + return ""; + } + return read() + str + "\n"; +} +int main() +{ + cout << read(); + return 0; +} diff --git b/P52926_en/S001-AC.txt a/P52926_en/S001-AC.txt new file mode 100644 index 0000000..d412180 --- /dev/null +++ a/P52926_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P52926_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 04:27:15 +time_out: 2012-10-18 12:47:31 +veredict: AC +veredict_info: +title: Girant una llista de paraules (2) diff --git b/P55622_en/S002-AC.cc a/P55622_en/S002-AC.cc new file mode 100644 index 0000000..e490c77 --- /dev/null +++ a/P55622_en/S002-AC.cc @@ -0,0 +1,13 @@ +#include +#include + +using namespace std; + +int main() +{ + string str; + cin >> str; + cout << "The number of digits of " << str << " is " << str.size() << "." << endl; + return 0; + +} diff --git b/P55622_en/S002-AC.txt a/P55622_en/S002-AC.txt new file mode 100644 index 0000000..0e57aae --- /dev/null +++ a/P55622_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P55622_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-07-11 05:34:44 +time_out: 2014-03-03 21:59:26 +veredict: AC +veredict_info: +title: Number of digits (1) diff --git b/P55722_en/S001-AC.cc a/P55722_en/S001-AC.cc new file mode 100644 index 0000000..3151869 --- /dev/null +++ a/P55722_en/S001-AC.cc @@ -0,0 +1,25 @@ +#include + +using namespace std; + + +int number_of_digits(int n) +{ + int res = 0; + do + { + n /= 10; + res++; + }while(n); + return res; +} + +int main() +{ +/* + int a; + cin >> a; + cout << "number of digits: " << number_of_digits(a) << endl; + return 0; +*/ +} diff --git b/P55722_en/S001-AC.txt a/P55722_en/S001-AC.txt new file mode 100644 index 0000000..cb639d2 --- /dev/null +++ a/P55722_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P55722_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-04 22:06:20 +time_out: 2012-10-18 13:12:25 +veredict: AC +veredict_info: +title: Iterative number of digits diff --git b/P56118_en/S001-AC.cc a/P56118_en/S001-AC.cc new file mode 100644 index 0000000..9410076 --- /dev/null +++ a/P56118_en/S001-AC.cc @@ -0,0 +1,18 @@ +#include + +using namespace std; + +int main() +{ + int a,b; + cin >> a; + cin >> b; + + if(a +#include + +using namespace std; + +void dec2bin(int a) +{ + string str; + char c; + do + { + str.insert(0,1,((a & 0x1) + 48)); + a >>= 1; + }while(a); + cout << str; +} + +void dec2hex(int a) +{ + cout << uppercase << hex << a; +} + +void dec2oct(int a) +{ + cout << uppercase << oct << a; +} +int main() +{ + while(1) + { + int a; + cin >> a; + if(cin.eof()) + { + return 0; + } + cout << a << " = "; + dec2bin(a); + cout << ", "; + dec2oct(a); + cout << dec << ", "; + dec2hex(a); + cout << dec << endl; + } + +} diff --git b/P56549_en/S001-AC.txt a/P56549_en/S001-AC.txt new file mode 100644 index 0000000..963f419 --- /dev/null +++ a/P56549_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P56549_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-08 20:23:40 +time_out: 2012-10-18 12:51:18 +veredict: AC +veredict_info: +title: Changes of base diff --git b/P56559_en/S001-AC.cc a/P56559_en/S001-AC.cc new file mode 100644 index 0000000..abbf849 --- /dev/null +++ a/P56559_en/S001-AC.cc @@ -0,0 +1,37 @@ +#include + +using namespace std; + +int main() +{ + int a,b,c,d; + + cin >> a; + cin >> b; + cin >> c; + cin >> d; + + if(a == c && b == d) + { + cout << "=" << endl; + return 0; + } + else if(a<=d) + { + if(b>=c) + { + if(a<=c && b>=d) + { + cout << 2 << endl; + return 0; + } + else if(a>=c && b<=d) + { + cout << 1 << endl; + return 0; + } + } + } + cout << "?" << endl; + return 0; +} diff --git b/P56559_en/S001-AC.txt a/P56559_en/S001-AC.txt new file mode 100644 index 0000000..c2f2ff9 --- /dev/null +++ a/P56559_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P56559_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 02:59:48 +time_out: 2012-07-10 03:00:04 +veredict: AC +veredict_info: +title: Intervals (2) diff --git b/P57474_en/S003-AC.cc a/P57474_en/S003-AC.cc new file mode 100644 index 0000000..1b16a06 --- /dev/null +++ a/P57474_en/S003-AC.cc @@ -0,0 +1,24 @@ +#include + +using namespace std; + +int factorial(int n) +{ + if(!n) + { + return 1; + } + int res = n; + for(int i = n-1; i > 0; i--) + { + res *= i; + } + return res; +} +int main() +{ + int a; + cin >> a; + cout << factorial(a); + return 0; +} diff --git b/P57474_en/S003-AC.txt a/P57474_en/S003-AC.txt new file mode 100644 index 0000000..1c79630 --- /dev/null +++ a/P57474_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P57474_en +submission_id: S003 +compiler_id: G++ +annotation: +time_in: 2012-08-05 12:46:07 +time_out: 2012-10-18 13:25:21 +veredict: AC +veredict_info: +title: Iterative factorial diff --git b/P57548_en/S001-AC.cc a/P57548_en/S001-AC.cc new file mode 100644 index 0000000..b094ff9 --- /dev/null +++ a/P57548_en/S001-AC.cc @@ -0,0 +1,12 @@ +#include + +using namespace std; + +int main() +{ + int a,b; + cin >> a; + cin >> b; + cout << a+b << endl; + return 0; +} diff --git b/P57548_en/S001-AC.txt a/P57548_en/S001-AC.txt new file mode 100644 index 0000000..f8a944a --- /dev/null +++ a/P57548_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P57548_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 00:55:04 +time_out: 2012-07-10 00:55:13 +veredict: AC +veredict_info: +title: Sum of two integer numbers diff --git b/P57846_en/S001-AC.cc a/P57846_en/S001-AC.cc new file mode 100644 index 0000000..d00295c --- /dev/null +++ a/P57846_en/S001-AC.cc @@ -0,0 +1,19 @@ +#include +#include +#include + +using namespace std; + +int max2(int a, int b) +{ + if(a>b) + { + return a; + } + return b; +} + +int main() +{ + return 0; +} diff --git b/P57846_en/S001-AC.txt a/P57846_en/S001-AC.txt new file mode 100644 index 0000000..b84411d --- /dev/null +++ a/P57846_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P57846_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-05 12:27:55 +time_out: 2012-10-18 13:25:28 +veredict: AC +veredict_info: +title: Maximum of two integer numbers diff --git b/P57852_en/S001-AC.cc a/P57852_en/S001-AC.cc new file mode 100644 index 0000000..e5bbfd7 --- /dev/null +++ a/P57852_en/S001-AC.cc @@ -0,0 +1,32 @@ +#include + +using namespace std; + +int gcd(int a, int b) +{ + int res; + while(b) + { + res = b; + b = a % b; + a = res; + } + return res; +} +int gcd4(int a, int b, int c, int d) +{ + return gcd(gcd(gcd(a,b),c),d); +} + + +int main() +{ +/* int a,b,c,d; + cin >> a; + cin >> b; + cin >> c; + cin >> d; + cout << gcd4(a,b,c,d) << endl; + return 0;*/ + +} diff --git b/P57852_en/S001-AC.txt a/P57852_en/S001-AC.txt new file mode 100644 index 0000000..603c040 --- /dev/null +++ a/P57852_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P57852_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-04 20:19:17 +time_out: 2012-10-18 13:12:32 +veredict: AC +veredict_info: +title: Greatest common divisor of four diff --git b/P58153_en/S001-AC.cc a/P58153_en/S001-AC.cc new file mode 100644 index 0000000..358894f --- /dev/null +++ a/P58153_en/S001-AC.cc @@ -0,0 +1,26 @@ +#include +#include + +using namespace std; + +int main() +{ + int n,m; + double sum; + while(1) + { + cin >> n; + cin >> m; + sum = 0; + if(cin.eof()) + { + break; + } + for(int i = m+1 ; i < n+1 ; i++) + { + sum += 1.0/i; + } + cout << fixed << setprecision(10) << sum << endl; + } + return 0; +} diff --git b/P58153_en/S001-AC.txt a/P58153_en/S001-AC.txt new file mode 100644 index 0000000..669e991 --- /dev/null +++ a/P58153_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P58153_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-03 23:49:56 +time_out: 2012-10-18 13:26:53 +veredict: AC +veredict_info: +title: Harmonic numbers (2) diff --git b/P58294_en/S001-AC.cc a/P58294_en/S001-AC.cc new file mode 100644 index 0000000..bd99bbf --- /dev/null +++ a/P58294_en/S001-AC.cc @@ -0,0 +1,9 @@ +#include + +using namespace std; + +int main() +{ + cout << 42 << endl; + return 0; +} diff --git b/P58294_en/S001-AC.txt a/P58294_en/S001-AC.txt new file mode 100644 index 0000000..dd95cc6 --- /dev/null +++ a/P58294_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P58294_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 03:17:11 +time_out: 2012-07-10 03:17:19 +veredict: AC +veredict_info: +title: The answer diff --git b/P58459_en/S001-AC.cc a/P58459_en/S001-AC.cc new file mode 100644 index 0000000..84779a2 --- /dev/null +++ a/P58459_en/S001-AC.cc @@ -0,0 +1,59 @@ +#include + +using namespace std; + + +bool is_leap_year(int year) +{ + if(!(year - (year/100)*100)) + { + if(!((year/100)%4)) + { + return true; + } + return false; + } + if(!(year%4)) + { + return true; + } + return false; +} + +bool is_valid_date(int d, int m, int y) +{ + if(d <= 0 || d >= 32 || (m == 2 && d >= 30)) + { + return false; + } + if(m <= 0 || m >= 13) + { + return false; + } + if(d == 31 && (m == 4 || m == 6 || m == 9 || m == 11)) + { + return false; + } + if((!is_leap_year(y)) && m == 2 && d == 29) + { + return false; + } + return true; +} + +int main() +{ +/* + int a; + cin >> a; + if(is_leap_year(a)) + { + cout << "TRUE" << endl; + } + else + { + cout << "FALSE" << endl; + } + return 0; +*/ +} diff --git b/P58459_en/S001-AC.txt a/P58459_en/S001-AC.txt new file mode 100644 index 0000000..e13dbd5 --- /dev/null +++ a/P58459_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P58459_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-04 22:28:29 +time_out: 2012-10-18 13:12:26 +veredict: AC +veredict_info: +title: Valid dates diff --git b/P58653_en/S002-AC.cc a/P58653_en/S002-AC.cc new file mode 100644 index 0000000..bf49fd9 --- /dev/null +++ a/P58653_en/S002-AC.cc @@ -0,0 +1,32 @@ +#include + +using namespace std; + +void print_line(char c, string s, bool b) +{ + cout << s << "('" << c << "') = "; + if (b) cout << "true" << endl; + else cout << "false" << endl; +} + +int main() +{ + char c; + bool letter,vowel,consonant,uppercase,lowercase,digit,test; + cin >> c; + + letter = ((c > 64) && (c < 91)) || ((c > 96) && (c < 123)); + vowel = (c == 65) || (c == 69) || (c == 73) || (c == 79) || (c == 85) || (c == 97) || (c == 101) || (c == 105) || (c == 111) || (c == 117); + consonant = !vowel && letter; + uppercase = (c > 64) && (c < 91); + lowercase = !uppercase && letter; + digit = (c > 47) && (c < 58); + + print_line(c,"letter",letter); + print_line(c,"vowel",vowel); + print_line(c,"consonant",consonant); + print_line(c,"uppercase",uppercase); + print_line(c,"lowercase",lowercase); + print_line(c,"digit",digit); + return 0; +} diff --git b/P58653_en/S002-AC.txt a/P58653_en/S002-AC.txt new file mode 100644 index 0000000..d66c6f8 --- /dev/null +++ a/P58653_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P58653_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-08-05 15:30:43 +time_out: 2012-10-18 13:25:15 +veredict: AC +veredict_info: +title: Classification of characters (2) diff --git b/P59539_en/S003-AC.cc a/P59539_en/S003-AC.cc new file mode 100644 index 0000000..553cd90 --- /dev/null +++ a/P59539_en/S003-AC.cc @@ -0,0 +1,25 @@ +#include + +using namespace std; + +int main() +{ + cout << fixed; + cout.precision(4); + double result = 0; + int n; + cin >> n; + if(n != 0) + { + for(int i = 1; i < n+1; i++) + { + result += 1.0/i; + } + cout << result << endl; + } + else + { + cout << 0.0 << endl; + } + return 0; +} diff --git b/P59539_en/S003-AC.txt a/P59539_en/S003-AC.txt new file mode 100644 index 0000000..ecd4045 --- /dev/null +++ a/P59539_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P59539_en +submission_id: S003 +compiler_id: G++ +annotation: +time_in: 2012-07-11 04:24:15 +time_out: 2012-07-11 04:24:25 +veredict: AC +veredict_info: +title: Harmonic numbers (1) diff --git b/P59875_en/S001-AC.cc a/P59875_en/S001-AC.cc new file mode 100644 index 0000000..043fa77 --- /dev/null +++ a/P59875_en/S001-AC.cc @@ -0,0 +1,26 @@ +#include + +using namespace std; + +int main() +{ + int a,b; + + cin >> a; + cin >> b; + + if(a a-1; i--) + { + cout << i << endl; + } + return 0; + } + for(int i = a; i > b-1; i--) + { + cout << i << endl; + } + return 0; + +} diff --git b/P59875_en/S001-AC.txt a/P59875_en/S001-AC.txt new file mode 100644 index 0000000..4d3bed1 --- /dev/null +++ a/P59875_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P59875_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 04:31:05 +time_out: 2012-07-11 04:31:15 +veredict: AC +veredict_info: +title: Top to bottom diff --git b/P60816_en/S001-AC.cc a/P60816_en/S001-AC.cc new file mode 100644 index 0000000..3cbd5a6 --- /dev/null +++ a/P60816_en/S001-AC.cc @@ -0,0 +1,24 @@ +#include +#include +#include + +using namespace std; + +int main() +{ + int x,bin; + cin >> x; + do + { + bin = 0; + for(int i = 0; i < 4; i++) + { + bin += (x & 0x01)*pow(2,i); + x = x >> 1; + } + cout << uppercase << hex << bin; + }while(x); + cout << endl; + return 0; + +} diff --git b/P60816_en/S001-AC.txt a/P60816_en/S001-AC.txt new file mode 100644 index 0000000..ff58652 --- /dev/null +++ a/P60816_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P60816_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 05:30:37 +time_out: 2012-07-11 05:30:48 +veredict: AC +veredict_info: +title: Reversed number in hexadecimal diff --git b/P61061_en/S001-AC.cc a/P61061_en/S001-AC.cc new file mode 100644 index 0000000..afc7957 --- /dev/null +++ a/P61061_en/S001-AC.cc @@ -0,0 +1,34 @@ +#include +#include +#include + +using namespace std; + +int main() +{ + int product=0; + string str; + stringstream sstream; + while(1) + { + cin >> str; + if(cin.eof()) + { + return 0; + } + do + { + product = str[0] - 48; + for(int i = 1; i < str.size(); i++) + { + product *= str[i] - 48; + } + cout << "The product of the digits of " << str << " is " << product << "." << endl; + sstream << product; + sstream >> str; + sstream.clear(); + }while(str.size() != 1); + cout << "----------" << endl; + } + return 0; +} diff --git b/P61061_en/S001-AC.txt a/P61061_en/S001-AC.txt new file mode 100644 index 0000000..a5d8889 --- /dev/null +++ a/P61061_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P61061_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-04 00:34:40 +time_out: 2012-10-18 13:26:47 +veredict: AC +veredict_info: +title: Product of digits diff --git b/P61634_en/S001-AC.cc a/P61634_en/S001-AC.cc new file mode 100644 index 0000000..c98a645 --- /dev/null +++ a/P61634_en/S001-AC.cc @@ -0,0 +1,29 @@ +#include +#include + +using namespace std; + +int main() +{ + int y; + + cin >> y; + + if(!(y - (y/100)*100)) + { + if(!((y/100)%4)) + { + cout << "YES" << endl; + return 0; + } + cout << "NO" << endl; + return 0; + } + if(!(y%4)) + { + cout << "YES" << endl; + return 0; + } + cout << "NO" << endl; + return 0; +} diff --git b/P61634_en/S001-AC.txt a/P61634_en/S001-AC.txt new file mode 100644 index 0000000..09ba9ac --- /dev/null +++ a/P61634_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P61634_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 02:36:41 +time_out: 2012-07-10 02:37:01 +veredict: AC +veredict_info: +title: Leap years diff --git b/P61930_en/S001-AC.cc a/P61930_en/S001-AC.cc new file mode 100644 index 0000000..b84f464 --- /dev/null +++ a/P61930_en/S001-AC.cc @@ -0,0 +1,31 @@ +#include + +using namespace std; + +int sum_digits(int n) +{ + if(!(n/10)) + { + return n; + } + return n % 10 + sum_digits(n/10); +} + +bool is_multiple_3(int n) +{ + if(!(n/10)) + { + return (n == 3 | n == 6 | n == 9); + } + return is_multiple_3(sum_digits(n)); +} + +int main() +{ +/* + int a; + cin >> a; + cout << is_multiple_3(a) << endl; + return 0; +*/ +} diff --git b/P61930_en/S001-AC.txt a/P61930_en/S001-AC.txt new file mode 100644 index 0000000..6a826ef --- /dev/null +++ a/P61930_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P61930_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-05 01:28:49 +time_out: 2012-10-18 13:12:07 +veredict: AC +veredict_info: +title: Multiples of three diff --git b/P62421_es/S004-AC.cc a/P62421_es/S004-AC.cc new file mode 100644 index 0000000..6d2debb --- /dev/null +++ a/P62421_es/S004-AC.cc @@ -0,0 +1,13 @@ +#include + +using namespace std; + +int main() +{ + string p1,p2,p3; + cin >> p1; + cin >> p2; + cin >> p3; + cout << p3 << " " << p2 << " " << p1 << endl; + return 0; +} diff --git b/P62421_es/S004-AC.txt a/P62421_es/S004-AC.txt new file mode 100644 index 0000000..a9e408e --- /dev/null +++ a/P62421_es/S004-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P62421_es +submission_id: S004 +compiler_id: G++11 +annotation: +time_in: 2015-07-21 23:25:20 +time_out: 2015-07-21 23:25:26 +veredict: AC +veredict_info: +title: Tres palabras diff --git b/P62467_en/S001-AC.cc a/P62467_en/S001-AC.cc new file mode 100644 index 0000000..2951309 --- /dev/null +++ a/P62467_en/S001-AC.cc @@ -0,0 +1,29 @@ +#include +#include +#include + +using namespace std; + +void bars(string* array, int lowerLimit, int upperLimit, int n) +{ + array[(upperLimit+lowerLimit)/2].append(n,'*'); + if(lowerLimit == upperLimit) + { + return; + } + bars(array,lowerLimit,(upperLimit+lowerLimit)/2 - 1,n-1); + bars(array,(upperLimit+lowerLimit)/2 +1,upperLimit,n-1); +} + +int main() +{ + int n; + cin >> n; + string* array = new string[(int)(pow(2,n) - 1)]; + bars(array,0,pow(2,n) - 2,n); + for(int i = 0; i < (pow(2,n) - 1); i++) + { + cout << array[i] << endl; + } + return 0; +} diff --git b/P62467_en/S001-AC.txt a/P62467_en/S001-AC.txt new file mode 100644 index 0000000..527a250 --- /dev/null +++ a/P62467_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P62467_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-09 21:38:30 +time_out: 2012-10-18 12:48:35 +veredict: AC +veredict_info: +title: Bars (1) diff --git b/P65103_en/S002-AC.cc a/P65103_en/S002-AC.cc new file mode 100644 index 0000000..6e7a12f --- /dev/null +++ a/P65103_en/S002-AC.cc @@ -0,0 +1,25 @@ +#include +#include + +using namespace std; + +int main() +{ + int a,b,i=1; + cin >> a; + if(a < 1) + { + cout << "Incorrect position." << endl; + return 0; + } + while(cin >> b) + { + if(i++ == a) + { + cout << "At the position " << a << " there is a(n) " << b << "." << endl; + return 0; + } + } + cout << "Incorrect position." << endl; + return 0; +} diff --git b/P65103_en/S002-AC.txt a/P65103_en/S002-AC.txt new file mode 100644 index 0000000..88817c1 --- /dev/null +++ a/P65103_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P65103_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-09-14 00:30:12 +time_out: 2012-10-18 11:10:54 +veredict: AC +veredict_info: +title: I-th (3) diff --git b/P65437_en/S001-AC.cc a/P65437_en/S001-AC.cc new file mode 100644 index 0000000..d251024 --- /dev/null +++ a/P65437_en/S001-AC.cc @@ -0,0 +1,14 @@ +#include + +using namespace std; + +void swap2(int& a, int& b) +{ + int aux = a; + a = b; + b = aux; +} +int main() +{ + return 0; +} diff --git b/P65437_en/S001-AC.txt a/P65437_en/S001-AC.txt new file mode 100644 index 0000000..0391d58 --- /dev/null +++ a/P65437_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P65437_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-05 12:51:26 +time_out: 2012-10-18 13:25:15 +veredict: AC +veredict_info: +title: Swap diff --git b/P66567_en/S003-AC.cc a/P66567_en/S003-AC.cc new file mode 100644 index 0000000..6948a3d --- /dev/null +++ a/P66567_en/S003-AC.cc @@ -0,0 +1,27 @@ +#include + +using namespace std; + +int main() +{ + double M,Px,Py,Vx,Vy,Fx,Fy,T,x,y; + + cin >> M; + cin >> Px; + cin >> Py; + cin >> Vx; + cin >> Vy; + cin >> Fx; + cin >> Fy; + cin >> T; + + x = (Fx*T*T/M)/2 + Vx*T + Px; + y = (Fy*T*T/M)/2 + Vy*T + Py; + + cout << fixed; + cout.setf(ios::showpoint); + cout.precision(3); + cout << x << " " << y << endl; + + return 0; +} diff --git b/P66567_en/S003-AC.txt a/P66567_en/S003-AC.txt new file mode 100644 index 0000000..57f9d67 --- /dev/null +++ a/P66567_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P66567_en +submission_id: S003 +compiler_id: G++ +annotation: +time_in: 2012-07-11 04:25:54 +time_out: 2012-07-11 04:26:02 +veredict: AC +veredict_info: +title: Constant Forces diff --git b/P67723_en/S001-AC.cc a/P67723_en/S001-AC.cc new file mode 100644 index 0000000..89c5ef5 --- /dev/null +++ a/P67723_en/S001-AC.cc @@ -0,0 +1,26 @@ +#include + +using namespace std; + +int main() +{ + int a,b,x,y; + cin >> a; + cin >> b; + x=a; + y=b; + do + { + if(x > y) + { + x -= y; + } + else + { + y -= x; + } + }while(y); + cout << "The gcd of " << a << " and " << b << " is " << x << "." << endl; + return 0; + +} diff --git b/P67723_en/S001-AC.txt a/P67723_en/S001-AC.txt new file mode 100644 index 0000000..a848d81 --- /dev/null +++ a/P67723_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P67723_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 23:52:19 +time_out: 2014-03-04 01:26:56 +veredict: AC +veredict_info: +title: Greatest common divisor diff --git b/P68688_en/S001-AC.cc a/P68688_en/S001-AC.cc new file mode 100644 index 0000000..c9645bc --- /dev/null +++ a/P68688_en/S001-AC.cc @@ -0,0 +1,9 @@ +#include + +using namespace std; + +int main() +{ + cout << "Hello world!" << endl; + return 0; +} diff --git b/P68688_en/S001-AC.txt a/P68688_en/S001-AC.txt new file mode 100644 index 0000000..d73479b --- /dev/null +++ a/P68688_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P68688_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 00:52:27 +time_out: 2012-07-10 00:52:35 +veredict: AC +veredict_info: +title: Hello world! diff --git b/P69277_en/S001-AC.cc a/P69277_en/S001-AC.cc new file mode 100644 index 0000000..cb47e39 --- /dev/null +++ a/P69277_en/S001-AC.cc @@ -0,0 +1,21 @@ +#include + +using namespace std; + +int main() +{ + int n; + + cin >> n; + + cout << 0; + + for(int i = 1; i < n+1; i++) + { + cout << ","; + cout << i*i*i; + } + cout << endl; + return 0; + +} diff --git b/P69277_en/S001-AC.txt a/P69277_en/S001-AC.txt new file mode 100644 index 0000000..2f77631 --- /dev/null +++ a/P69277_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P69277_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 04:39:35 +time_out: 2012-07-11 04:39:44 +veredict: AC +veredict_info: +title: First cubes diff --git b/P71753_en/S001-AC.cc a/P71753_en/S001-AC.cc new file mode 100644 index 0000000..ff6fd47 --- /dev/null +++ a/P71753_en/S001-AC.cc @@ -0,0 +1,23 @@ +#include +#include + +using namespace std; + +int main() +{ + int n, max, num; + while(cin >> n) + { + max = -2147483648; + for(int i = 0; i < n; i++) + { + cin >> num; + if(num > max) + { + max = num; + } + } + cout << max << endl; + } + return 0; +} diff --git b/P71753_en/S001-AC.txt a/P71753_en/S001-AC.txt new file mode 100644 index 0000000..b8b31f0 --- /dev/null +++ a/P71753_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P71753_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-11 19:35:39 +time_out: 2012-10-18 12:39:01 +veredict: AC +veredict_info: +title: Maximum of each sequence diff --git b/P72484_en/S002-AC.cc a/P72484_en/S002-AC.cc new file mode 100644 index 0000000..b3c351d --- /dev/null +++ a/P72484_en/S002-AC.cc @@ -0,0 +1,55 @@ +#include +#include + +using namespace std; + +int main() +{ + int n,spaces,ast = 1; + cin >> n; + if(n == 1) + { + cout << "*" << endl; + return 0; + } + spaces = n-1; + while(1) + { + for(int j = spaces; j > 0; j--) + { + cout << " "; + } + for(int k = ast; k > 0; k--) + { + cout << "*"; + } + cout << endl; + if(!spaces) + { + break; + } + spaces--; + ast += 2; + } + ast -= 2; + spaces++; + while(1) + { + for(int j = spaces; j > 0; j--) + { + cout << " "; + } + for(int k = ast; k > 0; k--) + { + cout << "*"; + } + cout << endl; + if(ast == 1) + { + break; + } + spaces++; + ast -= 2; + } + return 0; +} diff --git b/P72484_en/S002-AC.txt a/P72484_en/S002-AC.txt new file mode 100644 index 0000000..48afadd --- /dev/null +++ a/P72484_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P72484_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-08-03 13:34:25 +time_out: 2012-10-18 13:27:31 +veredict: AC +veredict_info: +title: Rhombus diff --git b/P72986_en/S001-AC.cc a/P72986_en/S001-AC.cc new file mode 100644 index 0000000..b2839f2 --- /dev/null +++ a/P72986_en/S001-AC.cc @@ -0,0 +1,33 @@ +#include +#include +#include +#include + +using namespace std; + +int main() +{ + double x,ncoef=0,coef,result=0,deg=0; + string str; + stringstream sstream; + + cin >> x; + + while(1) + { + cin >> str; + if(cin.eof()) + { + break; + } + sstream << str << " "; + ncoef++; + } + for(int i = ncoef; i > 0; i--) + { + sstream >> coef; + result += coef*pow(x,i-1); + } + cout << setprecision(4) << fixed << result << endl; + return 0; +} diff --git b/P72986_en/S001-AC.txt a/P72986_en/S001-AC.txt new file mode 100644 index 0000000..4681204 --- /dev/null +++ a/P72986_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P72986_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-12 01:28:47 +time_out: 2012-07-12 01:28:57 +veredict: AC +veredict_info: +title: Polynomial evaluation (2) diff --git b/P73231_en/S001-AC.cc a/P73231_en/S001-AC.cc new file mode 100644 index 0000000..4630636 --- /dev/null +++ a/P73231_en/S001-AC.cc @@ -0,0 +1,24 @@ +#include +#include +#include + +using namespace std; + +int max2(int a, int b) +{ + if(a>b) + { + return a; + } + return b; +} + +int max4(int a, int b, int c, int d) +{ + return max2(max2(max2(a,b),c),d); +} + +int main() +{ + return 0; +} diff --git b/P73231_en/S001-AC.txt a/P73231_en/S001-AC.txt new file mode 100644 index 0000000..0530997 --- /dev/null +++ a/P73231_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P73231_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-08-05 12:30:14 +time_out: 2012-10-18 13:25:26 +veredict: AC +veredict_info: +title: Maximum of four integer numbers diff --git b/P73501_en/S001-AC.cc a/P73501_en/S001-AC.cc new file mode 100644 index 0000000..f550d0c --- /dev/null +++ a/P73501_en/S001-AC.cc @@ -0,0 +1,32 @@ +#include +#include + +using namespace std; + +int main() +{ + int n, a, b, count = 0; + cin >> n; + for(int i = 0; i < n; i++) + { + count = 0; + cin >> b; + if(!b) + { + cout << 0 << endl;; + continue; + } + cin >> a; + while(a) + { + if(a > b) + { + count++; + } + b = a; + cin >> a; + } + cout << count << endl; + } + return 0; +} diff --git b/P73501_en/S001-AC.txt a/P73501_en/S001-AC.txt new file mode 100644 index 0000000..8fe8bf2 --- /dev/null +++ a/P73501_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P73501_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-11 22:59:08 +time_out: 2012-10-18 12:37:41 +veredict: AC +veredict_info: +title: Increasing pairs diff --git b/P75149_en/S002-AC.cc a/P75149_en/S002-AC.cc new file mode 100644 index 0000000..210b206 --- /dev/null +++ a/P75149_en/S002-AC.cc @@ -0,0 +1,23 @@ +#include +#include + +using namespace std; + +int main() +{ + char c; + string str; + while(cin >> c) + { + if(c == 'a') + { + cout << "yes" << endl; + getline(cin,str); + continue; + } + else if(c == '.') + { + cout << "no" << endl; + } + } +} diff --git b/P75149_en/S002-AC.txt a/P75149_en/S002-AC.txt new file mode 100644 index 0000000..96517aa --- /dev/null +++ a/P75149_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P75149_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-09-14 00:06:59 +time_out: 2013-05-02 15:17:18 +veredict: AC +veredict_info: +title: Looking for an a diff --git b/P77686_en/S001-AC.cc a/P77686_en/S001-AC.cc new file mode 100644 index 0000000..629de8a --- /dev/null +++ a/P77686_en/S001-AC.cc @@ -0,0 +1,38 @@ +#include +#include + +using namespace std; + + +bool is_palindromic(int n) +{ + stringstream sstream; + string str; + sstream << n; + sstream >> str; + for(int i = 0; i < str.size()/2; i++) + { + if(str[i] != str[str.size() - i - 1]) + { + return false; + } + } + return true; +} + +int main() +{ +/* + int a; + cin >> a; + if(is_palindromic(a)) + { + cout << "TRUE" << endl; + } + else + { + cout << "FALSE" << endl; + } + return 0; +*/ +} diff --git b/P77686_en/S001-AC.txt a/P77686_en/S001-AC.txt new file mode 100644 index 0000000..28ab176 --- /dev/null +++ a/P77686_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P77686_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-04 22:16:02 +time_out: 2012-10-18 13:12:28 +veredict: AC +veredict_info: +title: Palindromic numbers diff --git b/P78142_en/S001-AC.cc a/P78142_en/S001-AC.cc new file mode 100644 index 0000000..0f5744a --- /dev/null +++ a/P78142_en/S001-AC.cc @@ -0,0 +1,23 @@ +#include +#include + +using namespace std; + +int main() +{ + double d,sum=0; + int n=0; + do + { + cin >> d; + if(cin.eof()) + { + break; + } + sum += d; + n++; + }while(1); + cout << fixed << setprecision(2) << sum/n << endl; + return 0; + +} diff --git b/P78142_en/S001-AC.txt a/P78142_en/S001-AC.txt new file mode 100644 index 0000000..0cee60a --- /dev/null +++ a/P78142_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P78142_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 06:02:00 +time_out: 2012-07-11 06:02:10 +veredict: AC +veredict_info: +title: Average diff --git b/P79784_en/S001-AC.cc a/P79784_en/S001-AC.cc new file mode 100644 index 0000000..af86037 --- /dev/null +++ a/P79784_en/S001-AC.cc @@ -0,0 +1,39 @@ +#include + +using namespace std; + +int main() +{ + char c; + int x=0,y=0; + + do + { + cin >> c; + if(cin.eof()) + { + break; + } + switch(c) + { + case 'n': + y--; + break; + + case 's': + y++; + break; + + case 'w': + x--; + break; + + case 'e': + x++; + break; + } + }while(1); + cout << "(" << x << ", " << y << ")" << endl; + return 0; + +} diff --git b/P79784_en/S001-AC.txt a/P79784_en/S001-AC.txt new file mode 100644 index 0000000..52b2ffb --- /dev/null +++ a/P79784_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P79784_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 05:52:33 +time_out: 2012-07-11 05:52:51 +veredict: AC +veredict_info: +title: Movements on the ground diff --git b/P79817_en/S002-AC.cc a/P79817_en/S002-AC.cc new file mode 100644 index 0000000..baa4777 --- /dev/null +++ a/P79817_en/S002-AC.cc @@ -0,0 +1,28 @@ +#include + +using namespace std; + +int main() +{ + int a,b,base; + while(1) + { + cin >> a; + if(cin.eof()) + { + return 0; + } + cin >> b; + if(!b) + { + cout << 1 << endl; + continue; + } + base = 1; + for(int i = 1; i < b+1; i++) + { + base *= a; + } + cout << base << endl; + } +} diff --git b/P79817_en/S002-AC.txt a/P79817_en/S002-AC.txt new file mode 100644 index 0000000..5c6324b --- /dev/null +++ a/P79817_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P79817_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-07-12 02:57:19 +time_out: 2012-07-12 02:57:28 +veredict: AC +veredict_info: +title: Powers diff --git b/P79860_en/S001-AC.cc a/P79860_en/S001-AC.cc new file mode 100644 index 0000000..359b960 --- /dev/null +++ a/P79860_en/S001-AC.cc @@ -0,0 +1,29 @@ +#include +#include +#include + +using namespace std; + +void bars(string* array, int pos, int n) +{ + array[pos].append(n,'*'); + if(n == 1) + { + return; + } + bars(array,pos+1,--n); + bars(array,pos+pow(2,n),n); +} + +int main() +{ + int n; + cin >> n; + string* array = new string[(int)(pow(2,n) - 1)]; + bars(array,0,n); + for(int i = 0; i < (pow(2,n) - 1); i++) + { + cout << array[i] << endl; + } + return 0; +} diff --git b/P79860_en/S001-AC.txt a/P79860_en/S001-AC.txt new file mode 100644 index 0000000..58e5591 --- /dev/null +++ a/P79860_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P79860_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-09 21:49:50 +time_out: 2012-10-18 12:48:29 +veredict: AC +veredict_info: +title: Bars (2) diff --git b/P80660_en/S002-AC.cc a/P80660_en/S002-AC.cc new file mode 100644 index 0000000..c4bbd4a --- /dev/null +++ a/P80660_en/S002-AC.cc @@ -0,0 +1,31 @@ +#include +#include + +using namespace std; + +int main() +{ + while(1) + { + int n,count = 0; + cin >> n; + if(cin.eof()) + { + break; + } + while(n != 1) + { + if(n % 2) + { + n *= 3; + n++; + count++; + continue; + } + n /= 2; + count++; + } + cout << count << endl; + } + return 0; +} diff --git b/P80660_en/S002-AC.txt a/P80660_en/S002-AC.txt new file mode 100644 index 0000000..4f734d9 --- /dev/null +++ a/P80660_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P80660_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-08-03 23:40:46 +time_out: 2012-10-18 13:26:52 +veredict: AC +veredict_info: +title: The sequence of Collatz diff --git b/P81585_en/S003-AC.cc a/P81585_en/S003-AC.cc new file mode 100644 index 0000000..922ce91 --- /dev/null +++ a/P81585_en/S003-AC.cc @@ -0,0 +1,44 @@ +#include + +using namespace std; + +bool hasSum(int* array, int n) +{ + int m = 0; + while(m != n) + { + if(array[m] == array[n] - array[m++]) + { + return true; + } + } + return false; +} + +int main() +{ + int n, m; + while(cin >> n) + { + int* array = new int[n+1]; + m = 0; + for(int i = 0; i < n+1; i++) + { + array[i] = 0; + } + while(m != n) + { + cin >> array[m++]; + array[n] += array[m-1]; + } + if(hasSum(array,n)) + { + cout << "YES" << endl; + delete[] array; + continue; + } + cout << "NO" << endl; + delete[] array; + } + return 0; +} diff --git b/P81585_en/S003-AC.txt a/P81585_en/S003-AC.txt new file mode 100644 index 0000000..0b0e408 --- /dev/null +++ a/P81585_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P81585_en +submission_id: S003 +compiler_id: G++ +annotation: +time_in: 2012-09-13 04:12:16 +time_out: 2012-10-18 12:02:34 +veredict: AC +veredict_info: +title: Equal to the sum of the rest (I) diff --git b/P81629_en/S001-AC.cc a/P81629_en/S001-AC.cc new file mode 100644 index 0000000..ae7af99 --- /dev/null +++ a/P81629_en/S001-AC.cc @@ -0,0 +1,73 @@ +#include +#include + +using namespace std; + +int main() +{ + int e,c; + + cin >> e; + cin >> c; + + int quinientos = e / 500; + e -= quinientos*500; + + int doscientos = e / 200; + e -= doscientos*200; + + int cien = e / 100; + e -= cien*100; + + int cincuenta = e / 50; + e -= cincuenta*50; + + int veinte = e / 20; + e -= veinte*20; + + int diez = e / 10; + e -= diez*10; + + int cinco = e / 5; + e -= cinco*5; + + int dos = e / 2; + e -= dos*2; + + int uno = e; + + int cincuentac = c / 50; + c -= cincuentac*50; + + int veintec = c / 20; + c -= veintec*20; + + int diezc = c / 10; + c -= diezc*10; + + int cincoc = c / 5; + c -= cincoc*5; + + int dosc = c / 2; + c -= dosc*2; + + int unoc = c; + + cout << "Banknotes of 500 euros: " << quinientos << endl; + cout << "Banknotes of 200 euros: " << doscientos << endl; + cout << "Banknotes of 100 euros: " << cien << endl; + cout << "Banknotes of 50 euros: " << cincuenta << endl; + cout << "Banknotes of 20 euros: " << veinte << endl; + cout << "Banknotes of 10 euros: " << diez << endl; + cout << "Banknotes of 5 euros: " << cinco << endl; + cout << "Coins of 2 euros: " << dos << endl; + cout << "Coins of 1 euro: " << uno << endl; + cout << "Coins of 50 cents: " << cincuentac << endl; + cout << "Coins of 20 cents: " << veintec << endl; + cout << "Coins of 10 cents: " << diezc << endl; + cout << "Coins of 5 cents: " << cincoc << endl; + cout << "Coins of 2 cents: " << dosc << endl; + cout << "Coins of 1 cent: " << unoc << endl; + + return 0; +} diff --git b/P81629_en/S001-AC.txt a/P81629_en/S001-AC.txt new file mode 100644 index 0000000..0f73f7a --- /dev/null +++ a/P81629_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P81629_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 02:29:42 +time_out: 2012-07-10 02:29:57 +veredict: AC +veredict_info: +title: Minimum change diff --git b/P85288_en/S001-AC.cc a/P85288_en/S001-AC.cc new file mode 100644 index 0000000..ed1e432 --- /dev/null +++ a/P85288_en/S001-AC.cc @@ -0,0 +1,23 @@ +#include + +using namespace std; + +void hanoi(int n, char a, char b, char c) +{ + if(n == 1) + { + cout << a << " => " << c << endl; + return; + } + hanoi(n-1,a,c,b); + cout << a << " => " << c << endl; + hanoi(n-1,b,a,c); +} + +int main() +{ + int n; + cin >> n; + hanoi(n,'A','B','C'); + return 0; +} diff --git b/P85288_en/S001-AC.txt a/P85288_en/S001-AC.txt new file mode 100644 index 0000000..4fe6c7a --- /dev/null +++ a/P85288_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P85288_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 01:00:22 +time_out: 2012-10-18 12:47:45 +veredict: AC +veredict_info: +title: Towers of Hanoi diff --git b/P88790_en/S002-AC.cc a/P88790_en/S002-AC.cc new file mode 100644 index 0000000..512ff1f --- /dev/null +++ a/P88790_en/S002-AC.cc @@ -0,0 +1,34 @@ +#include + +using namespace std; + +int gcd(int a, int b) +{ + if(!a) + { + return b; + } + if(!b) + { + return a; + } + int res; + while(b) + { + res = b; + b = a % b; + a = res; + } + return res; +} + + +int main() +{ +/* int a,b; + cin >> a; + cin >> b; + cout << gcd(a,b) << endl; + return 0; +*/ +} diff --git b/P88790_en/S002-AC.txt a/P88790_en/S002-AC.txt new file mode 100644 index 0000000..0752c32 --- /dev/null +++ a/P88790_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P88790_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-09-04 20:15:13 +time_out: 2012-10-18 13:12:36 +veredict: AC +veredict_info: +title: Iterative greatest common divisor diff --git b/P89078_en/S001-AC.cc a/P89078_en/S001-AC.cc new file mode 100644 index 0000000..c241abe --- /dev/null +++ a/P89078_en/S001-AC.cc @@ -0,0 +1,18 @@ +#include +#include + +using namespace std; + +int main() +{ + int a,i = 1; + while(cin >> a) + { + if(!(a % 2)) + { + cout << i << endl; + return 0; + } + i++; + } +} diff --git b/P89078_en/S001-AC.txt a/P89078_en/S001-AC.txt new file mode 100644 index 0000000..87814f2 --- /dev/null +++ a/P89078_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P89078_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-14 00:10:16 +time_out: 2012-10-18 11:11:09 +veredict: AC +veredict_info: +title: First position diff --git b/P89265_en/S001-AC.cc a/P89265_en/S001-AC.cc new file mode 100644 index 0000000..8ae73a6 --- /dev/null +++ a/P89265_en/S001-AC.cc @@ -0,0 +1,58 @@ +#include + +using namespace std; + +int main() +{ + int a,b,c,d,x,y; + + cin >> a; + cin >> b; + cin >> c; + cin >> d; + + if(a == c && b == d) + { + cout << "= , [" << a << "," << b << "]" << endl; + return 0; + } + else if(a<=d) + { + if(b>=c) + { + if(a<=c && b>=d) + { + cout << "2 , "; + } + else if(a>=c && b<=d) + { + cout << "1 , "; + } + else + { + cout << "? , "; + } + + if(a + +using namespace std; + +string read(int* n) +{ + string str, prev; + cin >> str; + (*n)++; + if(cin.eof()) + { + *n = ((*n) / -2)*(-1); + return ""; + } + prev = read(n); + if((*n) > 0) + { + (*n)--; + return prev; + } + return prev + str + "\n"; +} +int main() +{ + int n = 0; + cout << read(&n); + return 0; +} diff --git b/P89336_en/S001-AC.txt a/P89336_en/S001-AC.txt new file mode 100644 index 0000000..cda202b --- /dev/null +++ a/P89336_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P89336_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-10 05:11:18 +time_out: 2012-10-18 12:47:26 +veredict: AC +veredict_info: +title: Girant una llista de paraules (6) diff --git b/P89851_en/S002-AC.cc a/P89851_en/S002-AC.cc new file mode 100644 index 0000000..411d319 --- /dev/null +++ a/P89851_en/S002-AC.cc @@ -0,0 +1,37 @@ +#include + +using namespace std; + +int getMissing(int* array) +{ + int i = 0; + while(1) + { + if(!array[i++]) + { + return i; + } + } +} + +int main() +{ + int n, m, o; + while(cin >> n) + { + int* array = new int[n]; + m = 0; + for(int i = 0; i < n; i++) + { + array[i]=0; + } + while((++m) != n) + { + cin >> o; + array[o-1] = o; + } + cout << getMissing(array) << endl; + delete[] array; + } + return 0; +} diff --git b/P89851_en/S002-AC.txt a/P89851_en/S002-AC.txt new file mode 100644 index 0000000..898164e --- /dev/null +++ a/P89851_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P89851_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-09-12 00:51:00 +time_out: 2012-10-18 12:37:36 +veredict: AC +veredict_info: +title: Which is missing? diff --git b/P90133_en/S001-AC.cc a/P90133_en/S001-AC.cc new file mode 100644 index 0000000..8e262e6 --- /dev/null +++ a/P90133_en/S001-AC.cc @@ -0,0 +1,30 @@ +#include + +using namespace std; + +int main() +{ + int a,b,base,exp; + while(1) + { + cin >> a; + if(cin.eof()) + { + return 0; + } + cin >> b; + base = 1; + exp = 0; + while(base != b) + { + if(base > b) + { + exp--; + break; + } + base *= a; + exp++; + } + cout << exp << endl; + } +} diff --git b/P90133_en/S001-AC.txt a/P90133_en/S001-AC.txt new file mode 100644 index 0000000..1762199 --- /dev/null +++ a/P90133_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P90133_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-12 03:03:26 +time_out: 2012-07-12 03:03:35 +veredict: AC +veredict_info: +title: Logarithms diff --git b/P90226_en/S001-AC.cc a/P90226_en/S001-AC.cc new file mode 100644 index 0000000..14bfa85 --- /dev/null +++ a/P90226_en/S001-AC.cc @@ -0,0 +1,25 @@ +#include +#include + +using namespace std; + +int main() +{ + string str1,str2; + cin >> str1; + cin >> str2; + + if(str1 > str2) + { + cout << str1 << " > " << str2 << endl; + } + else if(str1 < str2) + { + cout << str1 << " < " << str2 << endl; + } + else + { + cout << str1 << " = " << str2 << endl; + } + return 0; +} diff --git b/P90226_en/S001-AC.txt a/P90226_en/S001-AC.txt new file mode 100644 index 0000000..f49381c --- /dev/null +++ a/P90226_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P90226_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:37:40 +time_out: 2014-03-03 15:32:08 +veredict: AC +veredict_info: +title: Comparison of words diff --git b/P90615_en/S001-AC.cc a/P90615_en/S001-AC.cc new file mode 100644 index 0000000..7384771 --- /dev/null +++ a/P90615_en/S001-AC.cc @@ -0,0 +1,22 @@ +#include + +using namespace std; + +int main() +{ + int max; + int input[3]; + cin >> input[0]; + cin >> input[1]; + cin >> input[2]; + max = input[0]; + for(int i = 1; i < 3; i++) + { + if(input[i] > max) + { + max = input[i]; + } + } + cout << max << endl; + return 0; +} diff --git b/P90615_en/S001-AC.txt a/P90615_en/S001-AC.txt new file mode 100644 index 0000000..dd6fd6f --- /dev/null +++ a/P90615_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P90615_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:05:07 +time_out: 2012-07-10 01:05:17 +veredict: AC +veredict_info: +title: Maximum of three integer numbers diff --git b/P92351_en/S001-AC.cc a/P92351_en/S001-AC.cc new file mode 100644 index 0000000..78673b6 --- /dev/null +++ a/P92351_en/S001-AC.cc @@ -0,0 +1,22 @@ +#include + +using namespace std; + +int main() +{ + int a,b,div,res; + cin >> a; + cin >> b; + + div = a/b; + res = a-(div*b); + + if(res < 0) + { + div = div - 1; + } + + res = a-(div*b); + cout << div << " " << res << endl; + return 0; +} diff --git b/P92351_en/S001-AC.txt a/P92351_en/S001-AC.txt new file mode 100644 index 0000000..0a70615 --- /dev/null +++ a/P92351_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P92351_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:18:28 +time_out: 2012-07-10 01:18:38 +veredict: AC +veredict_info: +title: Integer division and remainder of an integer number by a natural number diff --git b/P92613_en/S002-AC.cc a/P92613_en/S002-AC.cc new file mode 100644 index 0000000..9c0bcd1 --- /dev/null +++ a/P92613_en/S002-AC.cc @@ -0,0 +1,30 @@ +#include + +using namespace std; + +int main() +{ + double x; + cin >> x; + + cout << (int)x << " "; + if(x - (int)x) + { + cout << (int)x + 1 << " "; + } + else + { + cout << (int)x << " "; + } + + if(x - (int)x >= 0.5) + { + cout << (int)x +1 << endl; + } + else + { + cout << (int)x << endl; + } + + return 0; +} diff --git b/P92613_en/S002-AC.txt a/P92613_en/S002-AC.txt new file mode 100644 index 0000000..35ef9cb --- /dev/null +++ a/P92613_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P92613_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:47:06 +time_out: 2014-03-03 16:09:34 +veredict: AC +veredict_info: +title: Rounding diff --git b/P92998_en/S002-AC.cc a/P92998_en/S002-AC.cc new file mode 100644 index 0000000..dee9973 --- /dev/null +++ a/P92998_en/S002-AC.cc @@ -0,0 +1,24 @@ +#include + +using namespace std; + +string read(int n) +{ + string str; + cin >> str; + if(n == 1) + { + return str + "\n"; + } + return read(n-1) + str + "\n"; +} +int main() +{ + int n; + cin >> n; + if(n) + { + cout << read(n); + } + return 0; +} diff --git b/P92998_en/S002-AC.txt a/P92998_en/S002-AC.txt new file mode 100644 index 0000000..c282ec2 --- /dev/null +++ a/P92998_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P92998_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-09-10 04:33:19 +time_out: 2012-10-18 12:47:31 +veredict: AC +veredict_info: +title: Girant una llista de paraules (3) diff --git b/P93533_en/S001-AC.cc a/P93533_en/S001-AC.cc new file mode 100644 index 0000000..f31529a --- /dev/null +++ a/P93533_en/S001-AC.cc @@ -0,0 +1,39 @@ +#include +#include + +using namespace std; + +void dec2negbin(int a) +{ + char rem; + string str; + do + { + if((rem = a % -2) == -1) + { + rem = 1; + a = (a/-2) + 1; + } + else + { + a /= -2; + } + str.insert(0,1,rem + 48); + }while(a); + cout << str << endl; +} +int main() +{ + while(1) + { + int a; + cin >> a; + if(cin.eof()) + { + return 0; + } + cout << a << ": "; + dec2negbin(a); + } + return 0; +} diff --git b/P93533_en/S001-AC.txt a/P93533_en/S001-AC.txt new file mode 100644 index 0000000..284822a --- /dev/null +++ a/P93533_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P93533_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-08 21:12:26 +time_out: 2012-10-18 12:51:02 +veredict: AC +veredict_info: +title: Numbers in base -2 diff --git b/P95401_en/S001-AC.cc a/P95401_en/S001-AC.cc new file mode 100644 index 0000000..a60fe07 --- /dev/null +++ a/P95401_en/S001-AC.cc @@ -0,0 +1,38 @@ +#include + +using namespace std; + + +bool is_leap_year(int year) +{ + if(!(year - (year/100)*100)) + { + if(!((year/100)%4)) + { + return true; + } + return false; + } + if(!(year%4)) + { + return true; + } + return false; +} + +int main() +{ +/* + int a; + cin >> a; + if(is_leap_year(a)) + { + cout << "TRUE" << endl; + } + else + { + cout << "FALSE" << endl; + } + return 0; +*/ +} diff --git b/P95401_en/S001-AC.txt a/P95401_en/S001-AC.txt new file mode 100644 index 0000000..446a882 --- /dev/null +++ a/P95401_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P95401_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-04 22:21:15 +time_out: 2012-10-18 13:12:26 +veredict: AC +veredict_info: +title: Function for leap years diff --git b/P96564_en/S001-AC.cc a/P96564_en/S001-AC.cc new file mode 100644 index 0000000..b8c1377 --- /dev/null +++ a/P96564_en/S001-AC.cc @@ -0,0 +1,51 @@ +#include + +using namespace std; + + +long int gcd(long a, long b) +{ + long res; + while(b) + { + res = b; + b = a % b; + a = res; + } + return res; +} +long mcm(long a, long b) +{ + return (a / gcd(a, b))*b; +} + +int main() +{ + int n; + long a; + long b; + while(1) + { + cin >> n; + if(n) + { + if(n == 1) + { + cin >> a; + cout << a << endl; + continue; + } + cin >> a; + for(int i = 0; i < n-1; i++) + { + cin >> b; + a = mcm(a,b); + } + cout << a << endl; + } + else + { + return 0; + } + } +} diff --git b/P96564_en/S001-AC.txt a/P96564_en/S001-AC.txt new file mode 100644 index 0000000..0d2afef --- /dev/null +++ a/P96564_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P96564_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-09-04 21:59:48 +time_out: 2012-10-18 13:12:29 +veredict: AC +veredict_info: +title: Least common multiple diff --git b/P96767_en/S001-AC.cc a/P96767_en/S001-AC.cc new file mode 100644 index 0000000..3375663 --- /dev/null +++ a/P96767_en/S001-AC.cc @@ -0,0 +1,21 @@ +#include +#include +#include + +using namespace std; + +int main() +{ + double x,coef,result=0,deg=0; + cin >> x; + while(1) + { + cin >> coef; + if(cin.eof()) + { + cout << setprecision(4) << fixed << result << endl; + return 0; + } + result += coef*pow(x,deg++); + } +} diff --git b/P96767_en/S001-AC.txt a/P96767_en/S001-AC.txt new file mode 100644 index 0000000..ee84c83 --- /dev/null +++ a/P96767_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P96767_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-12 00:04:46 +time_out: 2012-07-12 00:04:56 +veredict: AC +veredict_info: +title: Polynomial evaluation (1) diff --git b/P96965_en/S003-AC.cc a/P96965_en/S003-AC.cc new file mode 100644 index 0000000..83e9613 --- /dev/null +++ a/P96965_en/S003-AC.cc @@ -0,0 +1,31 @@ +#include + +using namespace std; + +int sum_of_digits(int x) +{ + if(!(x/10)) + { + return x; + } + return (x - (x/10)*10) + sum_of_digits(x/10); +} + +int reduction_of_digits(int x) +{ + if(!(x/10)) + { + return x; + } + return reduction_of_digits(sum_of_digits(x)); +} + +int main() +{ +/* + int a; + cin >> a; + cout << reduction_of_digits(a) << endl; + return 0; +*/ +} diff --git b/P96965_en/S003-AC.txt a/P96965_en/S003-AC.txt new file mode 100644 index 0000000..d145833 --- /dev/null +++ a/P96965_en/S003-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P96965_en +submission_id: S003 +compiler_id: G++ +annotation: +time_in: 2012-09-05 01:19:53 +time_out: 2012-10-18 13:12:08 +veredict: AC +veredict_info: +title: Reduction of digits diff --git b/P97156_en/S002-AC.cc a/P97156_en/S002-AC.cc new file mode 100644 index 0000000..029751c --- /dev/null +++ a/P97156_en/S002-AC.cc @@ -0,0 +1,28 @@ +#include + +using namespace std; + +int main() +{ + int a,b; + + cin >> a; + cin >> b; + + if(a>b) + { + cout << endl; + return 0; + } + + cout << a; + + for(int i = a+1; i < b+1; i++) + { + cout << ","; + cout << i; + } + cout << endl; + return 0; + +} diff --git b/P97156_en/S002-AC.txt a/P97156_en/S002-AC.txt new file mode 100644 index 0000000..b2208be --- /dev/null +++ a/P97156_en/S002-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P97156_en +submission_id: S002 +compiler_id: G++ +annotation: +time_in: 2012-07-11 04:36:24 +time_out: 2012-07-11 04:36:32 +veredict: AC +veredict_info: +title: Numbers in an interval diff --git b/P97969_en/S001-AC.cc a/P97969_en/S001-AC.cc new file mode 100644 index 0000000..2409c57 --- /dev/null +++ a/P97969_en/S001-AC.cc @@ -0,0 +1,21 @@ +#include + +using namespace std; + +int main() +{ + char c; + int n=0,x=0; + + do + { + cin >> c; + if(c == 'a') + { + x++; + } + }while(c != '.'); + cout << x << endl; + return 0; + +} diff --git b/P97969_en/S001-AC.txt a/P97969_en/S001-AC.txt new file mode 100644 index 0000000..113399b --- /dev/null +++ a/P97969_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P97969_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-11 05:45:17 +time_out: 2012-07-11 05:45:26 +veredict: AC +veredict_info: +title: Counting a's (1) diff --git b/P98960_en/S001-AC.cc a/P98960_en/S001-AC.cc new file mode 100644 index 0000000..c66ab61 --- /dev/null +++ a/P98960_en/S001-AC.cc @@ -0,0 +1,18 @@ +#include + +using namespace std; + +int main() +{ + char c; + cin >> c; + + if(c > 90) + { + cout << (char)(c - 32) << endl; + return 0; + } + + cout << (char)(c + 32) << endl; + return 0; +} diff --git b/P98960_en/S001-AC.txt a/P98960_en/S001-AC.txt new file mode 100644 index 0000000..63b2b91 --- /dev/null +++ a/P98960_en/S001-AC.txt @@ -0,0 +1,10 @@ +--- +problem_id: P98960_en +submission_id: S001 +compiler_id: G++ +annotation: +time_in: 2012-07-10 01:29:27 +time_out: 2012-07-10 01:29:39 +veredict: AC +veredict_info: +title: Uppercase and lowercase letters diff --git b/user.txt a/user.txt new file mode 100644 index 0000000..d33d23d --- /dev/null +++ a/user.txt @@ -0,0 +1,6 @@ +--- +name: Imanol Barba +email: imanolbarba@gmail.com +webpage: https://www.imanolbarba.net +affiliation: Universitat Politécnica de Catalunya +country_id: ES-Cat