Sponsors

Admin

875 animes navigated

Celebrating Black History Month: Past, Future

As February unfolds, so does the annual celebration of Black History Month, a time...

The Path to Self-Mastery: Lessons from Book ‘The Mountain Is You’

Embarking on a journey of self-mastery and breaking free from self-sabotage is a transformative...

Wizards of Waverly Place Cast Reunites for Enchanting Revival

In a spellbinding announcement, Disney has officially revealed that the beloved fantasy series "Wizards...

Jim Irsay’s Reported ‘Suspected Overdose’: A Closer Look

In a shocking turn of events last month, Jim Irsay, the owner of the...

Codeforces Round #423 (Div....

#include<bits/stdc++.h> #define pi acos(-1) #define maxn 1148576 using namespace std; typedef long long...

Codeforces Round #423 (Div....

#include <iostream> #include <algorithm> #include <cmath> #include <cstring> #include <cstdlib> #include <cstdio> #include <map> #include <ctime> #include...

Codeforces Round #423 (Div....

#include<iostream> #include<cstring> #include<cstdio> using namespace std; int getnum(char c){ switch(c){ case 'A':return 0; case 'T':return 1; case...

Codeforces Round #423 (Div....

#include <cstdio> int main(){ int n, k; scanf("%d%d", &n, &k); int l =...

Codeforces Round #423 (Div....

#include<bits/stdc++.h> using namespace std; const int maxn=2e6+5; int main() { char a={}; int n,k,i; cin>>n; while(n--){ string x; cin>>x>>k; int...

Codeforces Round #423 (Div....

#include <bits/stdc++.h> using namespace std; int n,m,maxx,minx=1e9,maxy,miny=1e9,T; char a; int main(){ scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){ cin>>a; if(a=='B')T++,maxx=max(maxx,i),minx=min(minx,i),maxy=max(maxy,j),miny=min(miny,j); } if(!T)puts("1"); else{ int...

Codeforces Round #423 (Div....

#include <iostream> using namespace std; int main() { int n,a,b,bg=0,d=0,x; cin>>n>>a>>b; while(n--){ cin>>x; if(x==1) {if(a)a--; else if(b)b--,bg++; else if(bg)bg--; else d++; } else...

Codeforces Round #424 (Div....

#include <bits/stdc++.h> using namespace std; #define inf 1023456789 #define linf 1023456789123456789ll #define pii...

Codeforces Round #424 (Div....

#include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm> #define LL long long using namespace...

Codeforces Round #424 (Div....

#include<cstdio> #include<algorithm> using namespace std; int n,a; long long k,ans=0; int main(){ scanf("%d%lld",&n,&k); for (int...

Codeforces Round #424 (Div....

#include <bits/stdc++.h> using namespace std; set<int> s; int main() { int n,i,x; cin>>n; int m=0; for(i=0;i<n;i++) { cin>>x; s.insert(i); m=max(m,x); } i=0; long long...

Codeforces Round #424 (Div....

#include<bits/stdc++.h> using namespace std; const int maxn=2e3+5; int main(){ int n,k,p,a,b; int res=INT_MAX,i,j; cin>>n>>k>>p; for(i=0;i<n;i++) scanf("%d",a+i); for(i=0;i<k;i++)...