Admin

1054 animes navigated

Workday’s stock slumps again on weak guidance and AI disruption fears

Workday Shares Plunge as Future Outlook Dims Amid AI Concerns Workday Inc. (WDAY), a long-standing...

Milan Cortina Olympics Attracts 23.5 Million Viewers Across NBCUniversal and Versant Outlets, Best Winter Games Since 2014

Milan Cortina Olympics Sees Record-Breaking Viewership and PerformanceThe Milan Cortina Winter Olympics have officially...

New York City’s Last Striking Nurses Approve New Contract

New York City Nurses Reach Historic Agreement Ending Major StrikeIn a significant development for...

Predator: Bloodshed #1 Preview: Alien Invader Crashes Fight Club

The Hunt Intensifies: Predator: Bloodshed #1 Takes the Yautja to an Underground Arena Marvel Comics...

Codeforces Round #411 (Div....

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

Codeforces Round #411 (Div....

C/C++
#include <set> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int...
Read more

Codeforces Round #411 (Div....

C/C++
#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<set> using namespace std; const int MX=600111; int n,m; int pool,*c,s; int hed,nxt,t,ec,vis,vism,no; set<int>cur; inline void...
Read more

Codeforces Round #411 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; int c,d,i,n,m,k,x,j=1000000007; string s; main(){ cin>>s; for(i=s.size()-1;i>=0;i--){ if(s=='b')c++;else{ k+=c;c*=2;k%=j;c%=j; } } cout<<k; }
Read more

Codeforces Round #411 (Div....

C/C++
#include<iostream> main(){int n;std::cin>>n;std::cout<<(n-1)/2;}
Read more

Codeforces Round #411 (Div....

Uncategorized
#include <cstdio> int n; int main (){ scanf("%d", &n); for (int i =...
Read more

Codeforces Round #411 (Div....

C/C++
#include <iostream> int l,r; int main() { std::cin>>l>>r; std::cout<<(l==r ? l:2); return 0; }
Read more

Codeforces Round #410 (Div....

C/C++
#pragma warning(disable:4996) #include <stdio.h> #include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <string.h> #include <stdlib.h> #include...
Read more

Codeforces Round #410 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; const int maxn=100000+10; int b,n,flag=1,dp; struct node { int id,x; }a; int cmp(node...
Read more

Codeforces Round #410 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; int main(){ int n, num = 0,...
Read more

Codeforces Round #410 (Div....

Uncategorized
#include <bits/stdc++.h> using namespace std; string s; int main() { int n, t, ans; ans...
Read more

Codeforces Round #410 (Div....

C/C++
#include<iostream> using namespace std; main() { string s;cin>>s; int n=s.size(),cnt=0; for(int i=0;i<n/2;i++) { if(s!=s)cnt++; } cout<<(cnt==1||cnt==0&&n%2==1?"YES":"NO")<<endl; }
Read more