Codeforces Solution

Discover valuable insights and strategies for unlocking Codeforces Solution like a pro coder.

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

Codeforces 118A. String Task solution in C/CPP 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 …

Word capitalization codeforces solution Read More »

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

Petya and Strings Codeforces Solution 2024

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); …

Petya and Strings Codeforces Solution 2024 Read More »

domino piling solution in c

Domino Piling solution in C | Codeforces 50A. Domino piling solution

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 …

Domino Piling solution in C | Codeforces 50A. Domino piling solution Read More »

codeforces next round solution in c

Codeforces next round solution in C,Python || Codeforces 158A. Next Round Solution

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

Codeforces next round solution in C,Python || Codeforces 158A. Next Round Solution Read More »

Theatre square Codeforces Solution

1A.Theatre square Codeforces Solution in C, CPP, Python || A theatre square solution

Theatre square Codeforces Solution in C, CPP, Python Question Codeforces 1A.Theatre square Codeforces Solution in C #include<stdio.h> int main(){ long long int a,n,m,total; scanf(“%lld%lld%lld”,&n,&m,&a); double hight ,width; hight=ceil((double)n/(double)a); width=ceil((double)m/(double)a);//a. theatre square solution total=hight*width; printf(“%lld\n”,total); return 0; } Codeforces 1A.Theatre square Solution in C++ #include <iostream> #include <cmath> int main() { long long int a, n, …

1A.Theatre square Codeforces Solution in C, CPP, Python || A theatre square solution Read More »

Scroll to Top
NEW TOXIC ROCKET CYCLE DECK in Clash Royale 2023 Best Deck in Clash Royale Best Deck for Arena 8 in Clash Royale Best Hog deck for Pro players Best Clash Royale Deck