website diatas ini bener2 #sesuatu banget. you know what, gara-gara website ini anak TC yang awalnya lagi ngerjain lapres, lagi ngerjain lapen ato lagi ngerjain tugas kalkulus (ato belajar dari pdf-nya Morris Mano dkk) bisa tersihir mendadak. Apalagi kalo pas ngeklik "Submit", copy paste source code Dev-C++ dan abis itu klik "send' dan........ mendadak tereak kesenengan kalo jadi ijo pas di bagian nama kita (apalagi saya, bisa membuat aula asrama ngeliatin saya)
dan inilah yang terjadi di TC 2011. Semuanya pada tersihir dengan website kecil ini yang tidak menarik dari segi bentuk, hanya menarik dari segi konten dan juga menarik dari segi "respon".
saya punya contoh soal yang dijadiin soal pas lagi asistensi. Asdos saya, mas Rizky Hidayatullah berhasil memecahkannya dan saya cengok ngeliatin. Simpelnya, saya dapet logikanya tapi heran pas di input keberapa kok outputnya Y ._.
cekidot!
A beehive is an enclosed structure in which some honey bee species live and raise their
young. In this problem we consider a two-dimensional sketch of the beehives. Each
beehive is composed of a certain number of cells, where each cell is a regular hexagon.
Each cell may have some neighbors, which are other cells that share a side with that cell.
A cell with exactly 6 neighbors is an internal cell, while a cell with fewer neighbors is an
external one. Notice that an external cell can always be changed to internal by adding
some neighbor cells.
We are interested in a particular class of beehives. This class of valid beehives is defined
recursively as follows: a) a single cell is a valid beehive; and b) given a valid beehive B,
if we add the minimum number of cells such that each external cell of B becomes an
internal cell, the result is a valid beehive.
The number of cells in a valid beehive is called a beehive number. Given an integer N ,
you must decide whether it is a beehive number.
Input
Each test case is described using a single line. The line contains an integer N (1 ≤ N ≤
109 ). The end of input is indicated with a line containing a single −1.
Output
For each test case, output a single line containing an uppercase “Y” if N is a beehive
number, or an uppercase “N” otherwise.
Example
Input: 43 1 7 19 15 -1 Output: N Y Y Y N
dan hingga saat ini belum saya temukan jawabannya. tapi si rifi udah nemu #sial apalagi master Zul dan master Uthe. ah kapan ya saya bisa jadi master kayak mereka
COMING SOON!! :D
Copyright by Averousi 2011
No comments:
Post a Comment