Java學習筆記---枚舉(enumeration)
枚舉可以有構做函數、字段和方法,去封裝更多信息 但是，注意：枚舉類的構造函數必須為私有的(private) 所以，下圖中沒用枚舉的Group類就用private重寫了構造函數 圖中兩個Group類都做到同樣的效果,但明顯用了枚舉的Group類簡潔很多吧？(笑)
Popular posts from this blog
【國際象棋】國象－－開局(I)[白方]
有時候身為黑方時，用作為白方時的套路，卻不能達到白方時的效果，這是為什麼呢？ 而要怎樣做才能走出對自己更有利的局面呢？ 一般對白方來說，e4是最常見的第一步 而這時候黑方會怎樣應對呢？ 對稱防禦：1. e4 e5 2.Kf3 黑方這樣做確實可以阻止白方的前進，然而白方的kf3馬上就可以吃死對方了，這時候黑方可以走Kc6來防止白方的進攻，但這樣做真的做成更有利的局面嗎？ 不對稱防禦：1. e4 c5 與對稱法相反的動作，做出了使局勢平衡的效果 斯堪的納維亞防禦：1.e4 d5 用同樣的走法來應對白方，而白方是否吃掉黑棋會對之後的棋局做成影響 法式防禦: 1. e4 e6 Caro-Kann防禦: 1.e4 c6 Pirc防禦: 1.e4 d6 2.d4 Nf6 3.Nc3 g6 ——-所有圖片裁自http://zh.lichess.org/editor
【CodeForces】A. Lucky Division
Problem here Problem Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7 . For example, numbers 47 , 744 , 4 are lucky and 5 , 17 , 467 are not. Petya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number n is almost lucky. Input The single line contains an integer n (1 ≤ n ≤ 1000) — the number that needs to be checked. Output In the only line print “ YES " (without the quotes), if number n is almost lucky. Otherwise, print “ NO " (without the quotes). Sample test(s) input 47 output YES input 16 output YES input 78 output NO Note Note that all lucky numbers are almost lucky as any number is evenly divisible by itself. In the first sample...
Comments
Post a Comment