Beecrowd Problem 1050 – (DDD) solution( Bangla ) | C language

** Before watching the solution please make sure that you have tried enough **

#include <stdio.h>

int main()
    int n;
    if(n == 61)printf("Brasilia\n");
    else if(n == 71)printf("Salvador\n");
    else if(n == 11)printf("Sao Paulo\n");
    else if(n == 21)printf("Rio de Janeiro\n");
    else if(n == 32)printf("Juiz de Fora\n");
    else if(n == 19)printf("Campinas\n");
    else if(n == 27)printf("Vitoria\n");
    else if(n == 31)printf("Belo Horizonte\n");
    else printf("DDD nao cadastrado\n");

    return 0;



You can find video explanation of this solution in our YouTube channel. You will find the YouTube channel link in the top right corner.
Like our Facebook page and SUBSCRIBE to our YouTube channel.
Stay connected.

If you face any problem, let me know in the comment section.

Leave a Comment