Beecrowd 1040 Average 3 Solution Question Introduction Beecrowd is a well-known site among competitive programmers focused on the enhancement of their problem-solving capacity. Europe, with all its resources, helps programmers perfect various algorithms and coding strategies typical to coding contests and interviews. Many users face problems that fall under this category, for instance, Beecrowd 1040: … Read more
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
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
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
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 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 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 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 1048 Solution in c || Beecrowd 1048 Salary Increase Question #include<stdio.h> int main() { float s; scanf(“%f”,&s); if(s>0 && s<=400.0) printf(“Novo salario: %.2f\nReajuste ganho: %.2f\nEm percentual: 15 %%\n”,(s+(s*.15)),(s*.15)); else if(s<=800.0) printf(“Novo salario: %.2f\nReajuste ganho: %.2f\nEm percentual: 12 %%\n”,(s+(s*.12)),(s*.12)); else if(s<=1200.0) printf(“Novo salario: %.2f\nReajuste ganho: %.2f\nEm percentual: 10 %%\n”,(s+(s*.10)),(s*.10)); else if(s<=2000.0) printf(“Novo salario: %.2f\nReajuste ganho: … Read more
Beecrowd 1015-Distance Between Two Points solution Solution in C #include<stdio.h> int main(){ double x1,x2,y1,y2,d; scanf(“%lf%lf%lf%lf”,&x1,&y1,&x2,&y2); d=sqrt(pow(x2-x1,2)+pow(y2-y1,2)); printf(“%.4lf\n”,d); return 0; } Solution in C++ Solution in Python import math x1, y1, x2, y2 = map(float, input().split()) d = math.sqrt((x2 – x1) ** 2 + (y2 – y1) ** 2) print(f”{d:.4f}”) Next problem: Beecrowd 1016 -Distance solution
