Uri 1173 Solution || Beecrowd 1173 – Array fill I solution
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; }
#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; }
Pingback: Beecrowd 1174 - Array Selection I Solution In C/Cpp » Free Code Center