This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"tipo_relatorio": "Relatório Gerencial", | |
"resumo": "1. O relatório de novembro/2024 apresenta uma visão detalhada da performance do fundo, evidenciando os resultados operacionais e financeiros do período.\n2. O resultado do fundo foi de R$ 0,45 por cota, com distribuição de R$ 0,70 por cota, demonstrando a capacidade de gerar proventos para os investidores.\n3. As vendas atingiram R$ 103,0 milhões, representando um crescimento de 14% em relação ao ano anterior, o que reforça a performance comercial do empreendimento.\n4. A inadimplência e as variações na vacância foram destacadas: encerrou o mês com 17 unidades vagas, totalizando 11,7% de vacância, diferença atribuída à saída de um locatário (C&C) e à realocação de espaços com a entrada de novos locatários, como Gol Coffee e Realme.\n5. Foram realizados investimentos no valor de R$ 2,0 milhões, com destaque para obras e projetos de reforma, além do pagamento de allowances, evidenciando a manutenção e melhoria dos ativos.\n6. A conciliação dos resultados |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Number of tokens estimate: 13954 | |
model='gemma3:1b' created_at='2025-04-05T07:34:56.989169924Z' done=True done_reason='stop' total_duration=47573916779 load_duration=1471349276 prompt_eval_count=13504 prompt_eval_duration=35485389536 eval_count=253 eval_duration=10319475904 message=Message(role='assistant', content='{"tipo_relatorio": "Relatório de Resultados", "resumo": "O FII Grand Plaza Shopping apresenta um bom desempenho em 2023, com um aumento significativo no patrimônio líquido e no número de cotas. A rentabilidade do fundo é considerada alta, com um bom volume de vendas e um bom número de operações. A empresa está em processo de reestruturação e busca aprimorar a gestão de seus ativos e a distribuição de rendimentos.", "data_publicacao": "2024-03-15", "fundo": "Grand Plaza Shopping CDI Liquido (15% de IR)", "proventos": "R$ 69,8 mil", "prospect_dy": "N/A", "prospect_vacancia": "N/A", "mudancas_fatores_risco": "N/A", "prospect_alavancagem": "N/A", "prospect_lucro": "N/A", "prospect_ativos": "N/A", "pros |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from collections import Counter | |
from typing import List | |
MODULO_BASE = 10**9 + 7 | |
def infected_combination(n: int, infectedHouses: List[int]) -> int: | |
if len(infectedHouses) == 0: | |
return 0 | |
sequences = [] |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from typing import List | |
MODULO_BASE = 10**9 + 7 | |
def _num_combinations(m: int): | |
if m <= 0: | |
return 0 | |
half = m // 2 | |
return 2**half |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import markdownit from 'markdown-it'; | |
import React, { useState } from 'react'; | |
import { default as MdEditor } from 'react-markdown-editor-lite'; | |
import 'react-markdown-editor-lite/lib/index.css'; | |
type Props = { | |
initialText: string, | |
onChange?: (html: string, text: string) => void, | |
viewOnly: boolean, | |
}; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from collections import Counter, defaultdict | |
class Solution: | |
def checkInclusion(self, s1: str, s2: str) -> bool: | |
original_letters = Counter(s1) | |
letters = defaultdict(int) | |
temp = deque() | |
for current_letter in s2: | |
temp.append(current_letter) | |
letters[current_letter] += 1 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from typing import Dict | |
import os | |
def read_properties(file_name: str) -> Dict[str,str]: | |
""" | |
Read a property file with 1 key/value per line - no multiline supported | |
Multiple lines with the same key would return the last line | |
""" | |
with open(file_name) as f: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Definition for singly-linked list. | |
# class ListNode: | |
# def __init__(self, val=0, next=None): | |
# self.val = val | |
# self.next = next | |
class Solution: | |
def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]: | |
current, nth = head, ListNode(val=None, next=head) | |
while current: | |
current = current.next |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Solution: | |
def minDistance(self, word1: str, word2: str) -> int: | |
memo = {} | |
def dfs(offset1, offset2): | |
if (offset1, offset2) in memo: | |
return memo[(offset1, offset2)] | |
if len(word1) == offset1 or len(word2) == offset2: | |
return abs((len(word1)-offset1)-(len(word2)-offset2)) | |
if word1[offset1] == word2[offset2]: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from os import * | |
from sys import * | |
from collections import * | |
from math import * | |
def checkgraph(edges, n, m): | |
neighbors = defaultdict(set) | |
for node1, node2 in edges: | |
neighbors[node1].add(node2) | |
neighbors[node2].add(node1) |
NewerOlder