Uri 1173 Solution

Uri 1173 Solution || Beecrowd 1173 – Array fill I solution in C,CPP

Uri 1173 Solution || Beecrowd 1173 – Array fill I solution

Question link:

Beecrowd 1173 – Array fill I solution in C

#include <stdio.h>

int main() {
 int N[10],i,d;

 scanf("%d",&d);

 for(i=0;i<10;i++){
        N[i]=d;
     printf("N[%d] = %d\n",i,d);
d*=2;
 }

    return 0;
}

Beecrowd 1172 – Array Replacement I solution in C/Cpp

One thought on “Uri 1173 Solution || Beecrowd 1173 – Array fill I solution in C,CPP”

Leave a Reply

Your email address will not be published. Required fields are marked *