BEECROWD » Page 3 Of 4 » Free Code Center

Beecrowd 1174 – Array Selection I Solution in C/Cpp

Question link Beecrowd 1174 – Array Selection I Solution in C #include <stdio.h> int main() { double A[100];int i; for(i=0;i<100;i++){ scanf(“%lf”,&A[i]); } for(i=0;i<100;i++){ if(A[i]<=10){ printf(“A[%d] = %.1lf\n”,i,A[i]);//Beecrowd 1174 – Array Selection I } } return 0; } Beecrowd 1174 – Array Selection I Solution in CPP #include <iostream> #include <iomanip> using namespace std; int main() …

Beecrowd 1174 – Array Selection I Solution in C/Cpp Read More »

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

1 Comment / BEECROWD / By admin

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

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

Leave a Comment / BEECROWD / By admin

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(): …

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

Beecrowd 1099 – Sum of Consecutive Odd Numbers II solution in C, Python

Leave a Comment / BEECROWD / By admin

Beecrowd 1099 – Sum of Consecutive Odd Numbers II solution in C Question Link Solution in C #include <stdio.h> int main() { int n,x,y,i,j,sum=0,temp=0; scanf(“%d”,&n); for(i=0;i<n;i++){ scanf(“%d %d”,&x,&y); if(x>y){ temp=x; x=y; y=temp; } if(x%2==0){ x–; } x+=2; for(j=x;j<y;j+=2){ sum=sum+j; } printf(“%d\n”,sum); sum=0; } return 0; } Beecrowd 1099 – Sum of Consecutive Odd Numbers II …

Beecrowd 1099 – Sum of Consecutive Odd Numbers II solution in C, Python Read More »

Uri 1159 Solution || Beecrowd 1159 Solution

Leave a Comment / BEECROWD / By admin

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 …

Uri 1159 Solution || Beecrowd 1159 Solution Read More »

Beecrowd 1044 solution || Beecrowd 1044 Multiples Solution in C & C++

Leave a Comment / BEECROWD / By admin

Beecrowd 1044 Solution || Beecrowd 1044 Multiples Solution Beecrowd 1044 Question Beecrowd 1044 Multiples Solution in C #include<stdio.h> int main() { int a,b; scanf(“%d%d”,&a,&b); if(a%b==0||b%a==0){ printf(“Sao Multiplos\n”); } else{ printf(“Nao sao Multiplos\n”); } return 0; } Beecrowd 1044 Multiples Solution in C++ #include<iostream> using namespace std; int main() { int a, b; cin >> a …

Beecrowd 1044 solution || Beecrowd 1044 Multiples Solution in C & C++ Read More »

Beecrowd 1043 solution in C ,C++ || Uri 1043 || Free Code Center

1 Comment / BEECROWD / By admin

Beecrowd-1043 Triangle-solution ||Beecrowd 1043 solution Triangle beecrowd | 1043 Read three-point floating values (A, B, and C) and verify if is possible to make a triangle with them. If it is possible, calculate the perimeter of the triangle and print the message: Perimetro = XX.X If it is not possible, calculate the area of the …

Beecrowd 1043 solution in C ,C++ || Uri 1043 || Free Code Center Read More »

Beecrowd 1042 Simple Sort Solution in C,Cpp

Leave a Comment / BEECROWD / By admin

Beecrowd 1042 Simple Sort Solution Question Solution in C #include<stdio.h> int main() { int a,b,c,temp,x,y,z; scanf(“%d%d%d”,&a,&b,&c); x=a; y=b; z=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; } printf(“%d\n%d\n%d\n\n”,a,b,c); printf(“%d\n%d\n%d\n”,x,y,z); return 0; } Next problem solution: Beecrowd -1043 Triangle Solution in C & C++

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

Leave a Comment / BEECROWD / By admin

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 …

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

Beecrowd 1015-Distance Between Two Points solution in C,Python

1 Comment / BEECROWD / By admin

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 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