Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Search
E-Blogarithm
Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Thursday, November 27, 2025
Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Sign in
Welcome! Log into your account
your username
your password
Forgot your password? Get help
Create an account
Create an account
Welcome! Register for an account
your email
your username
A password will be e-mailed to you.
Password recovery
Recover your password
your email
A password will be e-mailed to you.
Sponsors
Admin
963 animes navigated
Louisiana’s top health official, a critic of the COVID vaccine, will be CDC deputy
Controversial Figure Dr. Ralph Abraham Tapped for CDC Deputy Director Role The landscape of federal...
Consumer Bureau’s Bank Examiners Criticize New ‘Humility Pledge’
The ‘Humility Pledge’ Backfires: Consumer Bureau Examiners Blast New Internal Policy The Consumer Financial Protection...
Bioengineering a reversal of corneal blindness
The Dawn of Donor-Free Vision: Pandorum's 'Liquid Cornea' Breakthrough Corneal blindness remains a significant global...
Florida Man Takes His Own Life in Elaborate Suicide Plan Using a Weather Balloon
The Bizarre Case of Alan Abrahamson: Suicide by Weather Balloon The death of Alan Abrahamson...
Codeforces Round #425 (Div....
C/C++
July 25, 2017
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld...
Read more
Codeforces Round #425 (Div....
C/C++
July 25, 2017
#include<iostream> #include<cstdio> #include<cstring> using namespace std; string s,t; int q; string str; int w; bool g; int main() { cin>>s; for(int...
Read more
Codeforces Round #425 (Div....
Uncategorized
July 25, 2017
#include <cstdio> int main() { long long n, k; scanf("%I64d%I64d", &n, &k); puts((n...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
import java.io.*; import java.util.*; import sun.security.pkcs11.Secmod.DbMode; public class F { static class Edge...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
#include<bits/stdc++.h> #define pi acos(-1) #define maxn 1148576 using namespace std; typedef long long...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
#include <iostream> #include <algorithm> #include <cmath> #include <cstring> #include <cstdlib> #include <cstdio> #include <map> #include <ctime> #include...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int getnum(char c){ switch(c){ case 'A':return 0; case 'T':return 1; case...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
#include <cstdio> int main(){ int n, k; scanf("%d%d", &n, &k); int l =...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
#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...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
#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...
Read more
Codeforces Round #423 (Div....
C/C++
July 24, 2017
#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...
Read more
Codeforces Round #424 (Div....
C/C++
July 24, 2017
#include <bits/stdc++.h> using namespace std; #define inf 1023456789 #define linf 1023456789123456789ll #define pii...
Read more