Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Privacy Policy
Search
E-Blogarithm
Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Privacy Policy
Saturday, April 11, 2026
Home
Blog
What’s New
Life Hacks
Entertainment
Hollywood
Bollywood
Gaming
News
Reviews
Movies
Others
Game
About Us
Contact Us
Privacy Policy
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
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 #425 (Div....
C/C++
July 25, 2017
#include<bits/stdc++.h> #define oo 0x3f3f3f3f #define cl(x) memset(x, 0, sizeof(x)) #define mp make_pair #define...
Read more
Codeforces Round #425 (Div....
C/C++
July 25, 2017
#include<cstdio> #include<iostream> using namespace std; struct Edge{ int to,next; }e; int head,cnt=0; void add(int u,int v) { cnt++; e.to=v; e.next=head; head=cnt; } int...
Read more
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