Problem A - Shape Perimeter Codeforces round 997 (Div. 2) solutions

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

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

  • @syedfardin1036
    @syedfardin1036 21 день назад +1

    please upload vedio regularly..you explanation is really good

  • @Souvikg734
    @Souvikg734 21 день назад

    Please upload D. unique median, your explanations are good.

  • @SameerSuman-ni6fz
    @SameerSuman-ni6fz 21 день назад +2

    What was your Intution - My Intution was to remove the common parts but had any flaw in my calculation

  • @khaby0060
    @khaby0060 15 дней назад

    PLZ bro make a video on how to think when solving questions like these especially when graphs/maths is involved

  • @UnfilteredProgrammer
    @UnfilteredProgrammer  21 день назад

    #include
    using namespace std;

    int main() {
    int t; cin>>t;
    while(t--){
    int n,m; cin>>n>>m;
    int ans=0;
    int x,y; cin>>x>>y;
    for(int i=1; i>x>>y;
    ans+=x+y;
    }
    ans+=2*m;
    ans*=2;
    cout