CacheDB: 2026-05-20 14:57:53

1869-base-32

base-32

B Difficulty

README.md Preview

# 1869 - Base 32 | **Version**: 0.5
`base-32` | Difficulty: **B** | **Updated**: 2026-05-16 14:12:34

**Sync Status:** ✅ Local: OK | ❌ Maratona: Not in DB | ❌ API: Not in DB

## Overview
Conversão clássica e recursiva para Base 32 utilizando alfabeto de 32 caracteres.

## Metadata
- **Author**: Unknown
- **Editorial**: A solução requer conversão de base numérica via divisão sucessiva!
Assim como converter para Base 2 é pegar o resto da divisão por 2,
para Base 32 dividimos o número iterativamente por 32 e tomamos o resto.
Sendo o resto `R`, nós mapeamos para a String "0123456789ABCDEFGHIJKLMNOPQRSTUV"
no índice `R`. Como a construção é trás-para-frente, revertemos o 
resultado antes de imprimir.

- **Success Msg**: Parabéns! É assim que se constrói um algoritmo universal de conversão de bases!

| Time Limit | Memory Limit | Time Complexity | Space Complexity |
| :--- | :--- | :--- | :--- |
| -s | -MB | O(log_32 N) | - |

## Stats
| Metric | Count |
| :--- | :--- |
| Test Scenarios | 25 |
| Solutions | 1 |

## Statements
| ID | Status | Level | Natural Languages | Skills |
| :--- | :--- | :--- | :--- | :--- |
| `a-base32` | ✅ | A | pt | math-bases, string-manipulation |

## Test Scenarios
| Name | Description | Count | Type | Level | Skills | DB Sync |
| :--- | :--- | :--- | :--- | :--- | :--- | :--- |
| **Carga de 64 bits** | Números imensos próximos a 2^63 | 5 | Performance | A | math-bases | - |
| **Valores mistos** | Vários testes para exercitar as letras altas. | 15 | TDD | B | string-manipulation | - |
| **Caso Zero** | Testes para o 0 (incluindo o que quebra o laço). | 4 | TDD | C | logic | - |
| **Exemplo** | Base. | 1 | TDD | D | logic | - |

## Solutions
- **Divisão e Resto Sucessivo** (`a-otima-basica`)
  - Languages: `cpp, py, java`

## Components
- ✅ Statements
- ✅ Solutions
- ✅ Test Cases

Actions

Workflow do Problema

Local Workspace

Pasta criada no disco
Metadados

Informações básicas preenchidas
Validação

Soluções passam nos testes
4

Sincronização

Enviado para DB e GitLab

Components

Statements ✅
Solutions 1 ✅
Test Cases 25 ✅

Database Info

DB ID 1869

Name Base 32

Time Limit 1.0s

Mem Limit 256 MB

Version 0.5

Difficulty Level O

Test Cases 0

🚀 Quick Prompts

Structure Scaffolding

Generate metadata & folder structure

ID: 1.1

Context & Description

Draft description & editorial

ID: 1.2

Statements List

⚠️

Warning: The defaultStatement defined in metadata (a-base32) was not found in the file system.

ID	Level	Natural Languages	Skills	Status	Action
a-base32	A	a c d	math-bases, string-manipulation	⚠️

Statement Details

Select a statement above to view details.

Actions

Statistics

1 Total Statements

By Type (ID)

a-base32 1

By Level

Level A 1

🚀 Quick Prompts

Statement Analysis

Analyze ambiguity & clarity

ID: 2.1

WOK Statement Generation

Rewrite in WOK Universe theme

ID: 2.2

Statement Expansion

Expand to 4 difficulty levels

ID: 2.3

Testcase Scenarios Sync

YAML Source vs Database

Slug	Level	Name	Type	Skills	Status	Actions
`a-performance`	A	Carga de 64 bits Números imensos próximos a 2^63	PERFORMANCE	math-bases 1pts	Not in DB	Details
`b-fuzzing`	B	Valores mistos Vários testes para exercitar as letras altas.	TDD	string-manipulation 1pts	Not in DB	Details
`c-edge`	C	Caso Zero Testes para o 0 (incluindo o que quebra o laço).	TDD	logic 1pts	Not in DB	Details
`d-sample`	D	Exemplo Base.	TDD	logic 1pts	Not in DB	Details

Local Test Cases (Disk)

Scenario: a-performance 5 cases

Name	Files (Input / Output)	Actions
base-01 📄 📷	Input `base-01.in` f513104f52074a89ca05684627287bae Output `base-01.out` e9c2eb7de37326761f64bd08d7f8ff90	🔍 Details
base-02 📄 📷	Input `base-02.in` 91dd7da327ab2433d3ce35c35b3301d3 Output `base-02.out` ee04bb0eb2af9474be675662024b8161	🔍 Details
base-03 📄 📷	Input `base-03.in` 761886c2d4551b8b107bb6f1b0f5eaa4 Output `base-03.out` 8a766be8fe7640af5cdf1a079eea6ae5	🔍 Details
base-04 📄 📷	Input `base-04.in` 551d41204460a0d10f4dd2cec9b373a2 Output `base-04.out` cca524d1e8f0ef617c2603b21dbe6d74	🔍 Details
base-05 📄 📷	Input `base-05.in` 278be2819663d2cfac613eef5129365b Output `base-05.out` ef3d599425b6025a149ac8beedbaef30	🔍 Details

Scenario: b-fuzzing 15 cases

Name	Files (Input / Output)	Actions
base-01 📄 📷	Input `base-01.in` 5bd7773a00fbd62b65e4be2336014575 Output `base-01.out` 85b9d9ec289e6d21352aa5daa2a06f97	🔍 Details
base-02 📄 📷	Input `base-02.in` b56944d4aa4617834cc41de02e706efd Output `base-02.out` fb8fa4862e7f63188086a24214b107af	🔍 Details
base-03 📄 📷	Input `base-03.in` 7c2572c28b56d8c8bc1a481e32959ae3 Output `base-03.out` fdcdded6727040869302b25f73a5db63	🔍 Details
base-04 📄 📷	Input `base-04.in` f69d19aa7c1b2e04905e8108b5d697c5 Output `base-04.out` cae8390e306064a83a01d058c5742f80	🔍 Details
base-05 📄 📷	Input `base-05.in` 262da9c79e22a6f2c6d04320637044b8 Output `base-05.out` cbfb99328e303cadb0d7ea5a8d972724	🔍 Details
base-06 📄 📷	Input `base-06.in` bcb00fcb8b569b45cfe42bdd246157e6 Output `base-06.out` e40f390b8a8a8b9d2d75de574709c437	🔍 Details
base-07 📄 📷	Input `base-07.in` 3210ac2b3307df849bd693afaa0bc70d Output `base-07.out` cf7d3dbe9715c2daa4866b1e9fae1fea	🔍 Details
base-08 📄 📷	Input `base-08.in` 1c6975af50f5e3ed13bf48210a46f70b Output `base-08.out` 35a9346ad324323d125a9ba45cfc71bc	🔍 Details
base-09 📄 📷	Input `base-09.in` c4e172e7847bca14c87088bca9b0eaa0 Output `base-09.out` 35955def30d4691d6629229d9256889a	🔍 Details
base-10 📄 📷	Input `base-10.in` 573f166ec70a0562f25f15caf1290adb Output `base-10.out` ad16f8d857d084f17852a42766d6b6ad	🔍 Details
base-11 📄 📷	Input `base-11.in` 8f55a974b51a74bf8f38edc418821c66 Output `base-11.out` efa3bcd60113bb1a36ec23e0cc631e11	🔍 Details
base-12 📄 📷	Input `base-12.in` 91aa16414b129f8be56c64ad16798298 Output `base-12.out` 43976d8796dbb992bef8ab3ce6492d32	🔍 Details
base-13 📄 📷	Input `base-13.in` 50ec2e466c9dbd977cc96e53f683222d Output `base-13.out` 4c7cfa2d5931351258729704c49bd05f	🔍 Details
base-14 📄 📷	Input `base-14.in` 54970399e876fba9a2860f249e3762a9 Output `base-14.out` 8261894b67068cbd3647f7926af44482	🔍 Details
base-15 📄 📷	Input `base-15.in` 25b1252e063662a1445212ee0dabad1b Output `base-15.out` b99201090f8042ada95cb5c6fc37240e	🔍 Details

Scenario: c-edge 4 cases

Name	Files (Input / Output)	Actions
base-01 📄 📷	Input `base-01.in` 897316929176464ebc9ad085f31e7284 Output `base-01.out` 897316929176464ebc9ad085f31e7284	🔍 Details
base-02 📄 📷	Input `base-02.in` 5bc2009d475419f0b0b2ac78ef8d76b9 Output `base-02.out` f1b268deedf26c692b4032b132e50b87	🔍 Details
base-03 📄 📷	Input `base-03.in` 6c07e832afe692da321a8503671a8b2f Output `base-03.out` bb6ff92de67bb83cfd6d0781c1baa91c	🔍 Details
base-04 📄 📷	Input `base-04.in` e1c4d94f1adede3bc86dad1e87d0bc51 Output `base-04.out` e9716565cbb57ac944c8b7001587b1f1	🔍 Details

Scenario: d-sample 1 cases

Name	Files (Input / Output)	Status	Actions
base-01 📄 📷	Input `base-01.in` a2485d04edc7857597aa76de979d040f Output `base-01.out` 1ec48ff63de1187f84439907bf29c3ea		🔍 Details

📊 Sync Statistics

Total (Disk) 25

Total (Database) 0

✓ Synchronized 0

⚠ Desynchronized 25

Duplicates (MD5)

Duplicates in (MD5) 0

Desync = (DB missing on Disk) + (Disk missing on DB)

Actions

Divisão e Resto Sucessivo

ID: a-otima-basica

Loop de divisões iterativas em Unsigned Long Long

Implementations

Solutions Check Report

## Solutions Check Report (Detalhado / Debug)
**Generated**: 2026-05-20T21:07:29.115570
**Solution**: `solutions/a-otima-basica/Base32.java`

### Compilation
✅ Compilation successful

### Resultados

<table class="results-table"><thead><tr><th>Test Case</th><th>Result</th><th>Time (s)</th></tr></thead><tbody>
<tr class="scenario-row"><td colspan="3"><strong>a-performance - Performance</strong></td></tr>
<tr id="row-a-performance-base-01-in"><td>base-01.in</td><td>✅ PASS</td><td>0.199</td></tr>
<tr id="row-a-performance-base-02-in"><td>base-02.in</td><td>✅ PASS</td><td>0.179</td></tr>
<tr id="row-a-performance-base-03-in"><td>base-03.in</td><td>✅ PASS</td><td>0.212</td></tr>
<tr id="row-a-performance-base-04-in"><td>base-04.in</td><td>✅ PASS</td><td>0.207</td></tr>
<tr id="row-a-performance-base-05-in"><td>base-05.in</td><td>✅ PASS</td><td>0.172</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-fuzzing - TDD</strong></td></tr>
<tr id="row-b-fuzzing-base-01-in"><td>base-01.in</td><td>✅ PASS</td><td>0.042</td></tr>
<tr id="row-b-fuzzing-base-02-in"><td>base-02.in</td><td>✅ PASS</td><td>0.055</td></tr>
<tr id="row-b-fuzzing-base-03-in"><td>base-03.in</td><td>✅ PASS</td><td>0.044</td></tr>
<tr id="row-b-fuzzing-base-04-in"><td>base-04.in</td><td>✅ PASS</td><td>0.041</td></tr>
<tr id="row-b-fuzzing-base-05-in"><td>base-05.in</td><td>✅ PASS</td><td>0.048</td></tr>
<tr id="row-b-fuzzing-base-06-in"><td>base-06.in</td><td>✅ PASS</td><td>0.054</td></tr>
<tr id="row-b-fuzzing-base-07-in"><td>base-07.in</td><td>✅ PASS</td><td>0.041</td></tr>
<tr id="row-b-fuzzing-base-08-in"><td>base-08.in</td><td>✅ PASS</td><td>0.045</td></tr>
<tr id="row-b-fuzzing-base-09-in"><td>base-09.in</td><td>✅ PASS</td><td>0.045</td></tr>
<tr id="row-b-fuzzing-base-10-in"><td>base-10.in</td><td>✅ PASS</td><td>0.050</td></tr>
<tr id="row-b-fuzzing-base-11-in"><td>base-11.in</td><td>✅ PASS</td><td>0.042</td></tr>
<tr id="row-b-fuzzing-base-12-in"><td>base-12.in</td><td>✅ PASS</td><td>0.050</td></tr>
<tr id="row-b-fuzzing-base-13-in"><td>base-13.in</td><td>✅ PASS</td><td>0.043</td></tr>
<tr id="row-b-fuzzing-base-14-in"><td>base-14.in</td><td>✅ PASS</td><td>0.051</td></tr>
<tr id="row-b-fuzzing-base-15-in"><td>base-15.in</td><td>✅ PASS</td><td>0.044</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>c-edge - TDD</strong></td></tr>
<tr id="row-c-edge-base-01-in"><td>base-01.in</td><td>✅ PASS</td><td>0.028</td></tr>
<tr id="row-c-edge-base-02-in"><td>base-02.in</td><td>✅ PASS</td><td>0.027</td></tr>
<tr id="row-c-edge-base-03-in"><td>base-03.in</td><td>✅ PASS</td><td>0.028</td></tr>
<tr id="row-c-edge-base-04-in"><td>base-04.in</td><td>✅ PASS</td><td>0.029</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>d-sample - TDD</strong></td></tr>
<tr id="row-d-sample-base-01-in"><td>base-01.in</td><td>✅ PASS</td><td>0.029</td></tr>
</tbody></table>

✅ Verification

Validate your solutions against test cases using the metadata rules.

🚀 Quick Prompts

Solution Generation

Create Optimal/Sub-optimal code

ID: 3.1

📄 Enunciados

A 1

Idiomas: pt

💡 Soluções

cpp: 1 py: 1 java: 1

✅ 0 ❌ 0

🧪 Casos de Teste

4 Scen.

Total no Disco 25

Total no Banco 0

Sincronização 0.0%

Metadata (form)

Version

Name

Slug

ID Beecrowd

Difficulty

Time Complexity

Space Complexity

Time Limit (s)

Memory Limit (MB)

Origin

Author (Problem)

Author (Editorial)

Default Statement

Topics

Skills

Description

Editorial

Success message

metadata.yaml

# yaml-language-server: $schema=https://api.mundodocodigo.com.br/api/public/json/wok-problem.json --- version: "0.5" id: 1869 name: "Base 32" slug: "base-32" timelimit: 1.0 memlimit: 200 difficultyLevelId: B author: "Ricardo Martins" origin: "Beecrowd" description: 'Conversão clássica e recursiva para Base 32 utilizando alfabeto de 32 caracteres.' editorial: | A solução requer conversão de base numérica via divisão sucessiva! Assim como converter para Base 2 é pegar o resto da divisão por 2, para Base 32 dividimos o número iterativamente por 32 e tomamos o resto. Sendo o resto `R`, nós mapeamos para a String "0123456789ABCDEFGHIJKLMNOPQRSTUV" no índice `R`. Como a construção é trás-para-frente, revertemos o resultado antes de imprimir. successmsg: 'Parabéns! É assim que se constrói um algoritmo universal de conversão de bases!' timeComplexity: O(log_32 N) skills: - string-manipulation - math-bases statements: - id: a-base32 testScenarioLevel: A thematicSkills: - skill: math-bases points: 2 - skill: string-manipulation points: 1 testScenarios: - id: a-performance name: Carga de 64 bits description: "Números imensos próximos a 2^63" helpTip: "Você usou um tipo de dado largo o suficiente? unsigned long long ou BigInt?" level: A testType: PERFORMANCE skills: - skill: math-bases points: 1 - id: b-fuzzing name: Valores mistos description: "Vários testes para exercitar as letras altas." helpTip: "Mapeou corretamente os 32 caracteres?" level: B testType: TDD skills: - skill: string-manipulation points: 1 - id: c-edge name: Caso Zero description: "Testes para o 0 (incluindo o que quebra o laço)." helpTip: "Você processa o 0 e depois quebra o laço, ou ignora a impressão de '0'?" level: C testType: TDD skills: - skill: logic points: 1 - id: d-sample name: Exemplo description: "Base." helpTip: "Passe." level: D testType: TDD skills: - skill: logic points: 1 solutions: - id: a-otima-basica name: Divisão e Resto Sucessivo description: Loop de divisões iterativas em Unsigned Long Long level: A implementations: - language: cpp paradigm: Imperative main: base32.cpp filenames: - base32.cpp - language: py paradigm: Imperative main: base32.py filenames: - base32.py - language: java paradigm: OO main: Base32 filenames: - Base32.java authorSlugProblem: Unknown defaultStatement: a-base32

1869-base-32

README.md Preview

Actions

Workflow do Problema

Local Workspace

Metadados

Validação

Sincronização

Components

Database Info

🚀 Quick Prompts

Statements List

Statement Details

Actions

Statistics

By Type (ID)

By Level

🚀 Quick Prompts

📊 Sync Statistics

Actions

Test Case Details

Testcase Scenarios Sync

Local Test Cases (Disk)

Scenario: a-performance 5 cases

Scenario: b-fuzzing 15 cases

Scenario: c-edge 4 cases

Scenario: d-sample 1 cases

📊 Sync Statistics

Actions

Divisão e Resto Sucessivo

Implementations

Solutions Check Report

✅ Verification

🚀 Quick Prompts

📄 Enunciados

💡 Soluções

🧪 Casos de Teste

Metadata (form)

Git Status

⚠️ Detached HEAD / No Branch

Git Workflow

Problem Analysis Report

🛠️ Validation Tools

ℹ️ Not Fixed in API Platform

✅ Synced with Database

Actions

📋 Processo de Criação

Select a Prompt

📤 API Synchronization

📄 Recreating README.md...

💻 Git Action Output

Running Verification...

Ajuda

📄 Sync Statements to DB

🚀 Batch Auto-Link Process

⬇️ Repo Sync Output

📝 Update Manifest Output

Ajuda