mizar

Legal Policy

No	TYPE	Count
01	UP	72
02	UP_LEFT	64
03	UP_RIGHT	64
04	LEFT	72
05	RIGHT	72
06	DOWN	72

mizar

mizar

// -*- coding:utf-8-unix -*-

//! エラトステネスの篩 & 生成した素数の試し割りによる素因数分解
//!
//! ## 素因数分解の実行例
//! 
//! [`main`] を参照
//! 
//! ## ベンチマーク実行例
//!

mizar

import base64, io, struct, zlib
from typing import BinaryIO, List, Tuple, Union


COLOR_TYPE_V = 0
COLOR_TYPE_VA = 4
COLOR_TYPE_RGB = 2
COLOR_TYPE_RGBA = 6
PixelV = Tuple[int]
PixelVA = Tuple[int, int]

mizar

use std::collections::HashMap;

fn greet_map(id: usize, name: String) -> HashMap<usize, String> {
    let mut map = HashMap::new();
    let message = format!("Hello, {}!", name);
    map.insert(id, message);
    map
}

fn main() {

mizar

For the calculation of the sum of integers $A, B$ in $N$-decimal, we divide the $(i-1):k$-digit part into $(i-1):j$-digit and $(j-1):k$-digit parts and consider whether the carry-over occurs for each. $(i \gt j \gt k)$

First, the integers $A, B$ are divided into $(i-1):j$ digits in $N$-decimal, and the values $A_{i-1:j}, B_{i-1:j}$ are added to determine whether carry-forward occurs for the digits above the interval, which are classified into three states as follows.

• $A_{i-1:j}+B_{i-1:j} \lt N^{i-j}-1$ ; None
• $A_{i-1:j}+B_{i-1:j} = N^{i-j}-1$ ; Propagate
• $A_{i-1:j}+B_{i-1:j} \gt N^{i-j}-1$ ; Generate

Example for a decimal number:

mizar

mizar

mizar

mizar

"""StLang@Lark 実行環境サンプル standalone版"""

### TODO: ここからを本番の問題用の正しいコードに書き換える
PROGRAM = r"""
# サンプルプログラム: 二項係数 nCk の計算 (N > 62 の時は演算オーバーフローする可能性あり)
if N >= K         # N < K の時の出力は 0 とする
  $0 = 1
  $1 = 1
  $2 = N
  while $1 <= K   # for $1 in 1..=K