Admin

1097 animes navigated

VAPORESSO Strengthens Global Anti-Counterfeiting Drive, Reaffirms Unwavering Commitment to Consumer Safety

Protecting Consumers: VAPORESSO's Global Stand Against Counterfeits In an era where the vaping industry continues...

FM Sitharaman: India’s Strong Fiscal Health Gives RBI Greater Policy Flexibility – startup business stories

Nirmala Sitharaman Highlights Synergy Between Fiscal Strength and RBI Policy Finance Minister Nirmala Sitharaman recently...

As CBS’ CIA Takes A Break, One Star’s Comments About The Mole Have Me Rethinking Everything

The television landscape is currently buzzing with anticipation as CBS’ latest hit drama, CIA,...

Forward Arming and Refueling Base for 100-250 Chopper and Drone Flights for Rescue Operations

The Strategic Role of Forward Arming and Refueling Bases in High-Stakes Rescues In a dramatic...

Codeforces Round #412 (rated,...

Java
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...
Read more

Codeforces Round #412 (rated,...

Java
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...
Read more

Codeforces Round #412 (rated,...

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

Codeforces Round #412 (rated,...

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

Codeforces Round #412 (rated,...

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

Codeforces Round #412 (rated,...

C/C++
#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; }
Read more

Codeforces Round #411 (Div....

C/C++
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...
Read more

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