Sponsors

Admin

929 animes navigated

THE FREEPER CANTEEN – The Name These Famous Military Camo Patterns Quiz – Wednesday, October 22, 2025

Boosting Morale: The Freeper Canteen Launches a Military Camo Patterns Quiz The Freeper Canteen, a...

AI Startups Make Trial-and-Error a Competitive Edge

AI Startups Are Redefining the Speed of Discovery In the highly competitive world of venture...

The Fraudster Behind Steve Ballmer’s NBA Nightmare

The Fraudster Behind Steve Ballmer’s NBA Nightmare The intersection of elite finance and professional sports...

Sim: MISI aims to nurture a highly skilled Indian community

Empowering Futures: How MISI is Building a Highly Skilled Indian Community in Malaysia Every significant...

Codeforces Round #412 (rated,...

import static java.lang.Double.parseDouble; import static java.lang.Integer.parseInt; import static java.lang.Long.parseLong; import static java.lang.Math.min; import...

Codeforces Round #412 (rated,...

import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.io.PrintWriter; import java.util.StringTokenizer; public class...

Codeforces Round #412 (rated,...

#include<bits/stdc++.h> using namespace std; int n; long long a; int check(int x){ int i,j,res,ress,t,sum; long...

Codeforces Round #412 (rated,...

#include<bits/stdc++.h> using namespace std; int a; int cnt; int n; int getsc(int id, bool...

Codeforces Round #412 (rated,...

#include <bits/stdc++.h> using namespace std; int p,x,y,i; int luc(int s){ s = (s/50)%475; for...

Codeforces Round #412 (rated,...

#include <iostream> using namespace std; int n,i,a,a1,b,f; string s={"maybe","unrated","rated"}; int main(){ cin>>n; for(;i<n;i++){ cin>>a>>b; if(a!=b){f=2;break;} if(i>0&&a>a1)f=1; a1=a; } cout<<s; }

Codeforces Round #411 (Div....

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.StringTokenizer; public class...

Codeforces Round #411 (Div....

#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...

Codeforces Round #411 (Div....

#include <set> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int...

Codeforces Round #411 (Div....

#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...

Codeforces Round #411 (Div....

#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; }

Codeforces Round #411 (Div....

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