1 / 3

基本題

基本題. Parameters (m,n,failCount) 32768/m 會是正整數 8192/n 會是正整數 列出每一個小 block ( 共有 m*n 個 ) 的 count 列出哪些 block 的 count 大於 failCount Input 一連串的 parameter series, ex (16,16,512),(32,32,256),(16,8,256),… Output 一連串的整數 , 對應到上面的 parameter seris,ex 30,50,10,…. 挑戰題. Parameters (m,n,failCount)

catherine-blackwell
Télécharger la présentation

基本題

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 基本題 • Parameters (m,n,failCount) • 32768/m 會是正整數 • 8192/n 會是正整數 • 列出每一個小block (共有m*n個)的count • 列出哪些block的count大於failCount • Input • 一連串的 parameter series, ex • (16,16,512),(32,32,256),(16,8,256),… • Output • 一連串的整數,對應到上面的parameter seris,ex • 30,50,10,…

  2. 挑戰題 • Parameters (m,n,failCount) • m < 16, m為正整數 • 8192/n 會是正整數 • 列出每一個小block (共有m*n個)的count • 列出哪些block的count大於failCount • Input • 與之前的串成串的 parameter series • Output • 一連串的整數,對應到上面的parameter seris,ex • 30,50,10,…

  3. 超級挑戰題 • 找出某種pattern之出現次數, ex: 1111111111 1000110001 1111001111 1000110001 1111111111

More Related