Wednesday, October 8, 2025
Sponsors

C/C++

Codeforces Solution, Codeforces.com solution,codeforces div 1 solution, codeforces division 1 solution,codeforces div 2 solution, codeforces division 2 solution,Codeforces problem,codeforcesproblem solution,codeforces regular problem solution,codeforces regular,c programming sample programms, c programming examples,c++ regular programms, c++ programming examples,programmng language , basic programming,easy programming example,easy programming solutions,C language, c language solutions, c language examples,Codeforces solve, Codeforces.com solve,codeforces div 1 solve, codeforces division 1 solve,codeforces div 2 solve, codeforces division 2 solve,Codeforces problem,codeforcesproblem solve,codeforces regular problem solve,codeforces regular,c programming sample programms, c programming examples,c++ regular programms, c++ programming examples,programmng language , basic programming,easy programming example,easy programming solves,C language, c language solves, c language examples,

Codeforces Round #473 (Div....

C/C++
#include<bits/stdc++.h> #define LL long long using namespace std; const int maxn =...
Read more

Codeforces Round #473 (Div....

C/C++
#include <stdio.h> long long n,res,a=1; int main() { for (scanf("%I64d",&n);a<n;res+=(n-1)/a*(a-(a>>1)),a<<=1ll); printf("%I64dn",res); return 0; }
Read more

Codeforces Round #473 (Div....

C/C++
#include<stdio.h> int vi={0}; int main(void) { int n, a, now = 2; int ans; scanf("%d",...
Read more

Codeforces Round #473 (Div....

C/C++
#include<stdio.h> int main(){ int n; scanf("%d",&n); if(n <= 5) printf("-1n"); else{ printf("1 2n2 3n2 4n"); for(int i...
Read more

Codeforces Round #473 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; map<string,int> ms; string str; int arr,temp,mn; int main() { int n,k,m;cin>>n>>k>>m; for(int i=1;i<=n;i++)cin>>str,ms=i; for(int...
Read more

Codeforces Round #473 (Div....

C/C++
#include <stdio.h> int main() { int N; scanf("%d", &N), puts(N&1 ? "Ehab"...
Read more

Codeforces Round #443 (Div....

C/C++
#include<cstdio> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,k; struct node { int maxx,minn,sz; node() { int x;sz = 1; for(int...
Read more

Codeforces Round #443 (Div....

C/C++
#include <stdio.h> struct node { __int64 ans,num; }s; int main() { int n,k,m; while(~scanf("%d%d%d",&n,&k,&m)) { scanf("%I64d",&s.num); s.ans=1; int len=1; for(int i=1;i<n;i++) { int x; scanf("%d",&x); if(x==s.num) { s.ans++; if(s.ans==k) { s.ans=0; len--; } } else { s.num=x; s.ans=1; len++; } } int...
Read more

Codeforces Round #443 (Div....

C/C++
#include <iostream> using namespace std; const int maxn = 5e5; int n,...
Read more

Codeforces Round #443 (Div....

C/C++
#include <iostream> using namespace std; int main() { long long n,k,a,m=0,ab=0; cin>>n>>k>>ab; while(--n){ cin>>a; if(m==k){break;} if(ab>a){m++;} else ab=a,m=1; } cout<<ab; }
Read more

Codeforces Round #443 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; int main() { int n,i,s,d,t=0; cin>>n; for(i=0;i<n;i++) { cin>>s>>d; while(s<=t) { s=s+d; } t=s; } cout<<s<<endl; }
Read more

Codeforces Round #444 (Div....

C/C++
#include<bits/stdc++.h> #define maxn 1000050 using namespace std; int a,b,c,n,k,m,t; int main() { ...
Read more

Explore more titles

Partnership turns soggy paddocks into wetlands – and a model for cleaner waterways

The Kidney of the Landscape: How Partnerships are Revitalizing Waterways Through Wetland Creation Wetlands have long been dubbed the 'kidneys of the landscape,' and for...

More CEOs want Elon Musk–style ‘moonshot’ pay packages—but comp experts are raising alarms

The High-Stakes Gamble: Why 'Moonshot' CEO Pay is Worrying Compensation Experts A new, highly ambitious trend is sweeping through corporate boardrooms: the demand for "moonshot"...

I did not expect this midrange Sony soundbar to rival my Sonos system like this

I Did Not Expect This Midrange Sony Soundbar to Rival My Sonos System Sony's Bravia Theater System 6, a mid-range soundbar, has surprisingly impressed reviewers...

Combination of coaching, personnel has LSU’s defense ‘playing great’

LSU's Defensive Surge: A Winning Combination of Coaching and Personnel The LSU Tigers' impressive defensive turnaround hasn't been a matter of luck; it's a strategic...

Disney’s Kimmel suspension shows Trump’s increasing grip over media

Disney’s Kimmel Suspension: Trump’s Tightening Grip on Media? The recent suspension of Jimmy Kimmel from Disney, following controversial comments about former President Trump, has sparked...

New breath sensor detects diabetes quickly and easily

New Breath Sensor Detects Diabetes Quickly and Easily Diabetes affects millions, often going undiagnosed until significant health problems arise. Traditional methods of diagnosis, such...

Family Counseling Expert Barbara Pierce-Morrow of Geneva Explains How School-Based Support Helps Students for HelloNation

School-Based Support: A Key to Student Success In today's challenging educational landscape, students face a multitude of pressures that can significantly impact their academic performance...

Carbon meets capital

Carbon Meets Capital: A New Era in Climate Diplomacy? India and Japan's recent pact on climate change signifies a potential shift in global climate diplomacy,...

Aussie Climate Activists are Still Brutalising the Kids

Aussie Climate Activists and the Impact on Children's Mental Health The Australian climate change debate has taken a concerning turn, with reports surfacing about the...

Advertisement

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016