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
Saturday, July 5, 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
876 animes navigated
The Next Species in Line for Colossal’s De-Extinction
The Next Species in Line for Colossal’s De-Extinction The successful resurrection of dire wolves validates...
Celebrating Black History Month: Past, Future
As February unfolds, so does the annual celebration of Black History Month, a time...
The Path to Self-Mastery: Lessons from Book ‘The Mountain Is You’
Embarking on a journey of self-mastery and breaking free from self-sabotage is a transformative...
Wizards of Waverly Place Cast Reunites for Enchanting Revival
In a spellbinding announcement, Disney has officially revealed that the beloved fantasy series "Wizards...
Codeforces Round #393 (Div....
C/C++
January 23, 2017
#include <bits/stdc++.h> using namespace std; const int mod = 1e9+7; long long...
Read more
Codeforces Round #393 (Div....
C/C++
January 23, 2017
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int a; struct...
Read more
Codeforces Round #393 (Div....
C/C++
January 23, 2017
#include <stdio.h> #define SIZE 100010 struct ride { int cost, t; } r; int...
Read more
Codeforces Round #393 (Div....
C/C++
January 23, 2017
#include <stdio.h> #define N 200000 int pp, used; void dfs(int i) { if...
Read more
Codeforces Round #393 (Div....
C/C++
January 23, 2017
#include <stdio.h> int main() { int n, m, k, h, l, r; scanf("%d...
Read more
Codeforces Round #393 (Div....
C/C++
January 23, 2017
#include<stdio.h> int main() { int a={31,28,31,30,31,30,31,31,30,31,30,31}; int i,m,d,k,n,p; scanf("%d %d",&m,&d); k=7-d+1; i=m-1; n=a-k; p=n/7; if(p*7!=n) p++; printf("%d",p+1); }
Read more
Codeforces Round #392 (Div....
C/C++
January 20, 2017
#include<stdio.h> #include<stdlib.h> #define N 10000001 #define SN 3163 typedef long long unsigned llu; typedef...
Read more
Codeforces Round #392 (Div....
C/C++
January 20, 2017
#include <bits/stdc++.h> #define mk make_pair using namespace std; typedef long long ll; const...
Read more
Codeforces Round #392 (Div....
C/C++
January 20, 2017
#include <stdio.h> #include <string.h> int main() { static char s; static long long...
Read more
Codeforces Round #392 (Div....
C/C++
January 20, 2017
#include <stdio.h> int n,m,X,Y; long long K; long long ans; int main() { int i,j,t; long...
Read more
Codeforces Round #392 (Div....
C/C++
January 20, 2017
#include <stdio.h> #include <string.h> int cnt(char *s, char c) { int l,...
Read more
Codeforces Round #392 (Div....
C/C++
January 20, 2017
#include <stdio.h> int main() { int i, n, x, s=0, max=0; scanf("%d", &n); for...
Read more