macbook pro – Sound cuts out after pausing, etc. Audio issues

I’m noticing some weird behavior on a 2020 model MBP running Catalina. The audio playback seems to be a bit on and off. Sometimes the way it is acting makes me feel like something is “warming up.” For instance, playback in VLC is also a bit off, occasionally after pausing the sound with seem muted for a couple of seconds before coming back it.

Are these known issues? Or do I have a faulty laptop?

WOW 6.6 million more jobless claims last week: we are now over 16 million job cuts in 3 weeks. Trump supporters: is it a "winner"?

Tell me the country that wins and let me know what the President is doing that Trump should do.

You can't blame Trump for the virus from China.

You can blame China for wasting time when this epidemic could have been stopped. Local communist officials have silenced doctors who could have warned the public before the huge Chinese New Year banquet attended by 40,000 people in Wuhan. If they had just canceled their New Years celebration and started quarantine immediately, the world would have been spared this horrible pandemic.

Democrats must support President A and put the blame where it belongs. The Chinese Communist Party.

complexity theory – Effective algorithm for enumerating $ k $ -vertex cuts

Let $ G = (V, E) $ be an undirected connected graph. We call $ G $ $ k $-connected if deleting all $ k – $ 1 leaf vertices $ G $ connected. 1-connection graphics are connected graphics, 2-connection graphics are also called biconnected graphics, etc. $ k $ so that $ G $ East $ k $-connected is called connectivity of $ G $.

For connected graphs 1, there is an efficient algorithm which divides a graph into so-called connected components, which are connected via joint points, the points which when deleted would disconnect the graph.

For graphs with 2 connections, there is also an efficient algorithm which gives triconnected components and so-called sections with 2 vertices: these pairs of vertices whose removal would disconnect the graph.

I am interested in the more general situation of $ k $-connected graphics. I know we can determine the connectivity $ G $ in polynomial time (see for example here), although much slower than linear time like the above algorithms. However, at least at first glance, these algorithms only give me connectivity as a number. For practical reasons (-ish), I would like to list the $ k $-Cuts in green. So my question is:

What is a (relatively) efficient algorithm for enumerating these sets of $ k $ peaks in a $ k $-connected (but not $ k + $ 1-connected) graph which will disconnect the graph?

We can assume for simplicity that not too much $ k $– vertical cuts exist, if that makes the question more interesting.

(Because I want to use the algorithm for practical reasons (-ish), I'm potentially interested in fairly fine distinctions: a fast exponential algorithm "most of the time" is still useful for me, as is the distinction between polynomial time algorithms.)

lo.logic – Elimination of cuts and its relation to degree and height

Battery Exchange Network

The Stack Exchange network includes 175 question-and-answer communities, including Stack Overflow, the largest and most reliable online community on which developers can learn, share knowledge and build their careers.

Visit Stack Exchange

I have a code in C, the problem is, I can not make him read an entire string when I give him space, it cuts

int CadFunctional (void) {
AquivoCadFunctional file;
confirmation of character (2);

printf("---------------------- Cadastro de Funcionários ----------------------------- n");
printf("CPF: ");
scanf("%s", &Funcionario.cpf);
printf("Nome: ");
scanf("%s", &Funcionario.NomeFuncionario);
printf("Telefone: ");
scanf("%s", &Funcionario.Telefone);
printf("Sálario: R$");
scanf("%f", &Funcionario.Salario);
printf("Data de admissão: ");
scanf("%s", &Funcionario.DataAdmissao);
printf("Função: ");
scanf("%s", &Funcionario.Funcao);
printf("------------------------------------------------------------------------ n");
printf("Deseja realmente salvar as informacoes digitadas? (S/N)");
scanf("%s", &confirmacao);

if (_stricmp(confirmacao, "s") == 0) {
    AquivoCadFuncionario.Arq_Cad = fopen(ArqFuncionario, "a");
    if (AquivoCadFuncionario.Arq_Cad == NULL)
        printf("Erro na abertura do arquivo!");
        return 0;
    fprintf(AquivoCadFuncionario.Arq_Cad, ";%s;%s;%s;%.2f;%s;%s;n", Funcionario.cpf, Funcionario.NomeFuncionario, Funcionario.Telefone, Funcionario.Salario, Funcionario.DataAdmissao, Funcionario.Funcao);
    printf("Dados inseridos com sucesso!! n");


5th dnd – What happens when the spell Leomund's Tiny Hut cuts through solid objects, like the ends of a large wagon?

He will not enter the wagon.

Page 20 of the PHB speaks of areas of effect:

The effect of a spell grows in straight lines from the point of origin.
If no unblocked straight line extends from the point of origin to a
location in the area of ​​effect, this location is not included in
the area of ​​the spell.

The point of origin is yourself and it's a ten-foot hemisphere, so the area that becomes the hut is you, has a radius of ten feet, constrained by the walls of the wagon

What the spell does not specify is if this reduced area would also reduce the number of creatures you can hold. As it is magical and unspecified, I would think that it does not reduce the internal space. However, this is purely my opinion / interpretation. I would strongly suggest asking your DM to make a decision on this, as it is rather vague.

What happens when the tiny cabin cuts solid objects? [on hold]

If something like a big wagon can not quite fit into Leomund's Tiny Hut, will the spell just fail or cover as much as it could, leaving the outside parties exposed and vulnerable to attack?

Search Algorithms – Minimum number of tree cuts so that each pair of trees alternate between decreasing and increasing

I want to find the minimum number of tree cuts so that each pair of trees in a sequence of trees alternates strictly decreasing and strictly increasing. Example: In (2, 3, 5, 7), the minimum number of tree cuts is 2 – a possible final solution is (2, 1, 5, 4).

My search pattern is a graph where each node is a possible configuration of all tree heights and each edge is a tree cut (= a decrease in the height of a tree). In this model, a possible path from the initial node to the objective node in the above example would be (2,3,5,7) – (2,1,5,7) – (2,1,5, 4). I used a width search first to find the node of the goal. Since BFS does not cross the already traversed nodes, the part of the graph that I cross during the search is actually a tree data structure.

The only improvement I could think for this algorithm was to use a priority queue ordering to explore the possible nodes in ascending order, starting with the number of cuts (as is already done by the traditional BFS system). ) and by the number of strictly increasing nodes. triplets. This ensures that an objective node with the minimum number of N cuts will be the first node of all nodes with N cuts to be evaluated and that the search can finish a little faster.

The time required to run this algorithm increases exponentially with the number of trees. Is there another algorithm / idea that could be used to speed it up?

screen – The HDMI screen cuts the DP screen on a MacBook Pro 2015 13 & # 39;

I have two monitors UltraSharp U2719DX Dell and Dell UltraSharp U2715H.

I have a 13 inch MacBook Pro 2015 that still works. My U2719DX is plugged into my Mac via DisplayPort (monitor) to mini DisplayPort (macbook) and works perfectly.

Then my U2715H connects via HDMI (monitor) to HDMI (macbook) and once that happens, my U2719DX turns off and the HDMI monitor is the only one to display anything other than the macbook.

What am I doing wrong?

javascript – vuedraggable is fired under the modal window and cuts the list

  • Rails 6
    • View 2.6.10
    • vuedraggable 2.23.0

The problem is this: there is a list with the cards inside. When you click on Map, a modal window with Map appears, then if you hold down the left mouse button pressed in the modal window and hold the mouse, the vuedraggable event will work to close the modal window and break the list of cards. How can I avoid this movable behavior when a modal window is open?

The code can be downloaded completely from GoRails, I have done it by video

Reading method – open the modal window by clicking on the map, in the open modal window, press the left mouse button and hold down the button, the modal window will close at that moment and the list will break


/* eslint no-console:0 */
// This file is automatically compiled by Webpack, along with any other files
// present in this directory. You're encouraged to place your actual application logic in
// a relevant structure within app/javascript and only use these pack files to reference
// that code so it'll be compiled.
// To reference this file, add <%= javascript_pack_tag 'application' %> to the appropriate
// layout file, like app/views/layouts/application.html.erb

import Vue from 'vue/dist/vue.esm'
import Vuex from 'vuex'
import App from '../app.vue'
import TurbolinksAdapter from 'vue-turbolinks'

Vue.use(TurbolinksAdapter) = new Vuex.Store({
  state: {
    lists: ()

  mutations: {
    addList(state, data) {
    moveList(state, data) {
      const index = state.lists.findIndex(item => ==
      state.lists.splice(index, 1)
      state.lists.splice(data.position - 1, 0, data)
    addCard(state, data) {
      const index = state.lists.findIndex(item => == data.list_id)
    editCard(state, data) {
      const list_index = state.lists.findIndex((item) => == data.list_id)
      const card_index = state.lists(list_index).cards.findIndex((item) => ==
      state.lists(list_index).cards.splice(card_index, 1, data)

    moveCard(state, data) {
      const old_list_index = state.lists.findIndex((list) => {
        return => {
          return ===
      const old_card_index = state.lists(old_list_index).cards.findIndex((item) => ==
      const new_list_index = state.lists.findIndex((item) => == data.list_id)

      if (old_list_index != new_list_index) {
        // Remove card from old list, add to new one
        state.lists(old_list_index).cards.splice(old_card_index, 1)
        state.lists(new_list_index).cards.splice(data.position - 1, 0, data)
      } else {
        state.lists(new_list_index).cards.splice(old_card_index, 1)
        state.lists(new_list_index).cards.splice(data.position - 1, 0, data)

document.addEventListener("turbolinks:load", function() {
  var element = document.querySelector("#boards")
  if (element != undefined) { = JSON.parse(element.dataset.lists)

    const app = new Vue({
      el: element,
      template: "",
      components: { App }




what happens before and after

enter the description of the image here

enter the description of the image here