Uri 1172 solution || Beecrowd 1172 – Array Replacement I solution in C , Python || Free Code Center

Uri 1172 solution

Uri 1172 Solution || Beecrowd 1172 – Array Replacement I solution Question link: Beecrowd 1172 – Array Replacement I solution in C #include <stdio.h> int main() { int X[10],i; for(i=0;i<10;i++){ scanf(“%d”,&X[i]); } for(i=0;i<10;i++){ if(X[i]==0||X[i]<0) {X[i]=1;} } for(i=0;i<10;i++){ printf(“X[%d] = %d\n”,i,X[i]); } return 0; } Beecrowd 1172 – Array Replacement I solution in Python def main(): … Read more

Beecrowd 1016 Solution in C, Python || Beecrowd 1016 -Distance solution || URI 1016

beecrowd 1016 solution

Question Beecrowd 1016 Solution Solution in C #include<stdio.h> int main() { int a,c; scanf(“%d”,&a); c=2*a; printf(“%d minutos\n”,c); return 0; } Solution in Python a = int(input()) c = 2 * a print(f”{c} minutos”) The Python program reads an integer from the user using the input() method, computes c = 2 * a, and then prints … Read more