Admin

1138 animes navigated

Stop scrolling! This Portable Door Lock Travel Home Security is insane!

Found the best Portable Door Lock Travel Home Security on Amazon today. ...

STOP staying in hotels without doing THIS! 🏨⚠️

I used to think my hotel room was safe until I realized literally anyone...

Trending Today: Portable Door Lock Travel Home Security

Check out the amazing Portable Door Lock Travel Home Security on Amazon right now! ...

STOP Scrubbing Your Life Away: Why This Gadget is Going Viral for All the Right Reasons! 🧼✨

Category: Home GadgetsLet’s be real for a second—is there anything more soul-crushing than getting...

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++)...

Codeforces Round #424 (Div....

#include<bits/stdc++.h> using namespace std; int main(){ int n,k; cin>>k>>n; int t; int arr; set<int>c; for(int i=0;i<k;i++){ cin>>t; arr= arr+t; } for(int...