BUBT Intra-University Programming Contest 2022

BUBT Intra-University Programming Contest BUBT Contest problem solution A. Total Solve solution in cpp Question: https://codeforces.com/gym/428051/problem/A #include<iostream> using namespace std; int main() { int a; cin>>a; if(a%2!=0) { cout<<“Odd”<<endl; } else{ cout<<“Even”<<endl; } return 0; } B. Membership Campaign solution in cpp Question: https://codeforces.com/gym/428051/problem/B #include<iostream> #include<math.h> #include<conio.h> using namespace std; int main() { int t,a,b,c; … Read more

Codeforces 236A Boy or Girl Solution || Codeforces Solution 236A

Boy or Girl Solution

Codeforces 236A Boy or Girl Solution in C/CPP Question: A. Boy or Girl Those days, many boys use beautiful girls’ photos as avatars in forums. So it is pretty hard to tell the gender of a user at the first glance. Last year, our hero went to a forum and had a nice chat with … Read more

Codeforces 118A. String Task solution in C/CPP

118A. String Task problem link Codeforces 118A. String Task solution in C #include<stdio.h>int main() { int i; char s[101]; gets(s); strlwr(s); for(i=0;s[i]!=’\0′;i++) { if(s[i]==’a’||s[i]==’e’||s[i]==’i’||s[i]==’o’||s[i]==’u’||s[i]==’A’||s[i]==’E’||s[i]==’O’||s[i]==’I’||s[i]==’U’||s[i]==’y’||s[i]==’Y’) { continue; } else { printf(“.%c”,s[i]); } } printf(“\n”); return 0; } Codeforces 118A. String Task solution in CPP #include <iostream> #include <cstring> #include <cctype> using namespace std; int main() { … Read more

Word capitalization codeforces solution

word capitalization codeforces solution

Word capitalization codeforces solution Codeforces 281A. Word Capitalization Solution in C #include <stdio.h> #include <string.h> int main() { char s[101]; scanf(“%s”, s); s[0] = toupper(s[0]); printf(“%s\n”, s); return 0; } Codeforces 281A. Word Capitalization Solution in CPP #include<iostream> #include<string>using namespace std; int main() { string s; cin>>s; s[0]=towupper(s[0]); cout<<s; } Codeforces 791/A. Bear and Big … Read more

Petya and Strings Codeforces Solution 2024

Codeforces 112A. Petya and Strings Solution in C/CPP

Question petya and strings codeforces solution in C #include<stdio.h> int main() { int a,i; char s1[101]; char s2[101]; gets(s1); gets(s2); strlwr(s1); strlwr(s2); int l=strcmp(s1,s2); printf(“%d\n”,l); return 0; } Codeforces 112A. Petya and Strings Solution in CPP #include <iostream> #include <cstring> #include <cctype> using namespace std; int main() { string s1, s2; getline(cin, s1); getline(cin, s2); … Read more

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

beecrowd 1044 solution

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 … Read more

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

Beecrowd 1043 solution

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 … Read more

Beecrowd 1042 Simple Sort Solution in C,Cpp

beecrowd 1042

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

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

Beautiful Matrix Codeforces Solution

Beautiful Matrix Codeforces Solution || Beautiful Matrix Codeforces Solution in c Question Beautiful Matrix Codeforces Solution Problem Specification The goal of Codeforces Problem 263A is to determine the fewest moves required to convert a given 5×5 matrix into a “beautiful” matrix. A “beautiful” matrix is one in which the number 1 is in the center … Read more