Codeforces RAYAN Contest (Div 1 + Div 2) - Solution Discussion

Поделиться
HTML-код
  • Опубликовано: 3 дек 2024

Комментарии • 3

  • @CPwithShayan
    @CPwithShayan  3 дня назад +2

    You can join our Telegram channel using the link below:
    t.me/Competitive_Programming_Shayan

  • @cristopher-y2e
    @cristopher-y2e 2 дня назад +1

    Appreciate the detailed breakdown! Just a quick off-topic question: I have a SafePal wallet with USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). How can I transfer them to Binance?

  • @acrsahil5631
    @acrsahil5631 2 дня назад +1

    your logic fails
    in problem B not the greedy one but you have said
    int n,m,k; cin >> n >> m >> k;
    string s; cin >> s;
    vectorv;
    int cnt = 0;
    for(int i = 0; i=m){
    v.push_back(cnt);
    }
    cnt = 0;
    }
    }
    if(s[n-1] == '0'){
    v.push_back(cnt);
    }
    debug(v);
    int sum = 0;
    for(int i = 0; i=m));
    sum += ((v[i]+k-1)/(m+k-1));
    }
    cout