Codeforces Problem 791/A. Bear and Big Brother solution with CPP 100% Accepted Before seeking assistance, it is advisable to make an effort to solve the problem yourself. This can involve researching the problem online, reviewing relevant documentation, and attempting to apply your knowledge to find a solution. By trying to solve the problem first, you … Read more
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
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 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
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
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
Bit++ Codeforces solution in c Question Introduction C programming is the foundation of modern software development. Whether you want to be a programmer or just want to expand your problem-solving skills, learning C will definitely empower you. Our step-by-step guide will take the mystery out of the process of creating a calculator, making it a … Read more
Domino Piling Solution in C | Codeforces 50A. Domino piling solution Question A. Domino piling You are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so … Read more
Codeforces next round solution in C,Python QUESTION 158A. Next Round Solution solution in C #include<stdio.h> int main() { int n,i,k,count=0; int a[100]; scanf(“%d%d”,&n,&k); for(i=0;i<n;i++){ scanf(“%d”,&a[i]);} k=k-1; for(i=0;i<n;i++){ if(a[i]>=a[k]&&a[i]>0){ count++; } } printf(“%d\n”,count); return 0; } 158A. Next Round Solution in Python n,k = map(int,raw_input().split()) L = map(int,raw_input().split()) temp = L[k-1] count=0 for i in range(0,len(L)): … Read more
Theatre square Codeforces solution || Codeforces theatre square solution Theatre square Solution in C, CPP, Python Question Cover a square with tiles — Codeforces Problem “Theatre Square” We are given a square of size n x m the square has side large cells, and we can place only square tiles on it also each tile … Read more
