step by step solution

Beecrowd 1045 Triangle Types solution in C, C++, Python

by
Beecrowd 1045 Triangle Types solution

Beecrowd 1045 Triangle Types solution Question BEE 1045 – Triangle Types Solution in C #include <stdio.h> int main() { double a,b,c,temp,i,j; scanf(“%lf%lf%lf”,&a,&b,&c); if(a<b){temp=a;a=b;b=temp; } if(a<c){temp=a;a=c;c=temp; } if(b<c){temp=b;b=c;c=temp; } i=b*b+c*c; j=a*a; if(a>=b+c){ printf(“NAO FORMA TRIANGULO\n”); } else{ if(j==i){ printf(“TRIANGULO RETANGULO\n”); } if(j>i){ printf(“TRIANGULO OBTUSANGULO\n”); } if(j<i){ printf(“TRIANGULO ACUTANGULO\n”); } if(a==b&&b==c){ printf(“TRIANGULO EQUILATERO\n”); } else if(a==b||b==c||c==a){ printf(“TRIANGULO … Read more

Beecrowd 1046 solution || URI – BEECROWD – BEE Online Judge Solution  1046-Game Time || Uri 1046 solution in C, C++

by
Beecrowd 1046 solution

submit link Beecrowd 1046 solution || URI – BEECROWD – BEE 1046 Solution in C, C++ Question Game Time Read the start time and end time of a game, in hours. Then calculate the duration of the game, knowing that the game can begin in a day and finish in another day, with a maximum … Read more

Beecrowd 1019 solution || URI 1019 Time Conversion

by
Beecrowd 1019 solution

URI – BEECROWD – BEE 1019 Time Conversion Solutions in C, C++, and Python || Beecrowd 1019 solution Question Beecrowd 1019 solution Beecrowd 1019 solution presents the classic scheduling challenge: time shifting. In the challenge, times in seconds are converted to hours, minutes and seconds. This seemingly simple task requires a deep understanding of time … Read more

Uri 1113 Solution || Beecrowd 1113 Ascending and Descending Solution || Beecrowd 1113 || Free Code Center

by
Uri 1113 solution

Uri 1113 solution || Beecrowd1113 Ascending and Descending Solution Ascending and Descending Introduction URI Online Judge is a popular platform among developers for practicing coding skills. One of the problems on the platform is “Bee Crowd – 1113 Ascending and Descending,” and in this article, we will provide a comprehensive solution to the problem in … Read more

Beecrowd 1176 Fibonacci Array Solution

by
Beecrowd 1176 Fibonacci Array Solution

Beecrowd 1176 Fibonacci Array Solution Beecrowd 1176 Fibonacci Array Question Beecrowd 1176 Fibonacci Array Solution.Understanding Fibonacci Sequences: Before we dive into solving the problem, it is important to understand what Fibonacci sequences are. Fibonacci sequences are a series of numbers in which each number is the sum of the two preceding numbers. The sequence starts … Read more

Beecrowd-1070 Six Odd Numbers Solution

by
Beecrowd-1070

Beecrowd-1070 Six Odd Numbers Solution Beecrowd 1070 Six Odd Number Read an integer value X and print the 6 consecutive odd numbers from X, a value per line, including X if it is the case. Input The input will be a positive integer value. Output The output will be a sequence of six odd numbers. Input Sample Output Sample 8 … Read more

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

by
Uri 1173 Solution

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 1173 – Array fill I solution in C++ Beecrowd 1173 – Array fill I solution in Python … Read more

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

by
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

Uri 1159 Solution || Beecrowd 1159 Solution

by
Uri 1159 Solution

Question Uri 1159 Solution || Beecrowd 1159 Solution ||Sum of Consecutive Even Numbers solution in C The program must read an integer X indefinite times (stop when X=0). For each X, print the sum of five consecutive even numbers from X, including it if X is even. If the input number is 4, for example, the output must be 40, that is … Read more

Beecrowd 1041 Coordinates of a Point Solution in C , C++, Python || Beecrowd 1041 Solution

by
Beecrowd 1041 Solution

Beecrowd 1041 Solution – Coordinates of a Point Question Solution in C #include<stdio.h> int main() { double x,y; scanf(“%lf%lf”,&x,&y); if(x==0 && y==0){ printf(“Origem\n”); } else if(x==0){ printf(“Eixo Y\n”); } else if(y==0){ printf(“Eixo X\n”); } else if(x>0&&y>0){ printf(“Q1\n”); } else if(x<0&&y>0){ printf(“Q2\n”); } else if(x<0&&y<0){ printf(“Q3\n”); } else if(x>0&&y<0){ printf(“Q4\n”); } return 0; } Beecrowd 1041 … Read more