1 / 3

Block Count Calculation and Pattern Detection Challenge

This challenge involves analyzing parameters (m, n, failCount) to compute counts of small blocks in a grid defined by the dimensions m and n. Each block has a count determined by specific calculations. The task is to identify and list those block counts that exceed the specified failCount. Inputs consist of multiple parameter series, and the output should be a series of integers that correspond to the counts of blocks. Advanced challenges include finding patterns in the data, such as specific sequences.

catherine-blackwell
Download Presentation

Block Count Calculation and Pattern Detection Challenge

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