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
Sunday, March 22, 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
1077 animes navigated
North Carolina’s economic dean gives an update
North Carolina’s Economic Outlook: An Update from the State’s Economic Dean North Carolina remains at...
HSBC layoffs soon? Wall Street giant may slash 20,000 roles amid AI-led overhaul, says report
HSBC Reportedly Planning Massive Layoffs in AI-Driven RestructuringThe global banking landscape is on the...
The Dark Origins of the Treadmill and Why Oscar Wilde was the Worst
From Torture to Training: The Grim History of Your Favorite Gym EquipmentMost people today...
More Evidence Season 5 Of Bridgerton Will Be About Eloise (And Not Francesca)
Is Eloise Bridgerton the Next Lead? New Clues for Season 5With the official confirmation...
Codeforces Round #384 (Div....
C/C++
December 17, 2016
long long k; main() { scanf("%d%lld",&k,&k); printf("%dn",1+__builtin_ctzll(k)); }
Read more
Codeforces Round #384 (Div....
C/C++
December 17, 2016
#include<stdio.h> int main() { int i,j,n,a,b; char s; scanf("%d%d%d",&n,&a,&b); scanf("%s",s); if(s==s) { printf("0"); } else printf("1"); return 0; }
Read more
Codeforces Round #383 (Div....
C/C++
December 17, 2016
#include <stdio.h> #include <iostream> #include <algorithm> #include <memory.h> #include <string.h> #define rank _ran using...
Read more
Codeforces Round #383 (Div....
C/C++
December 17, 2016
#include <bits/stdc++.h> using namespace std; #define fo(i,a,b) for(int i=(a);i<(b);i++) #define MOD 1000000007 #define...
Read more
Codeforces Round #383 (Div....
C/C++
December 17, 2016
#include <stdio.h> #include <string.h> int n,a,b,c,p; void dfs(int k,int col); int main(void) { ...
Read more
Codeforces Round #383 (Div....
C/C++
December 17, 2016
#include<stdio.h> int n, m, maxW, p, w, b, prev, next,...
Read more
odeforces Round #383 (Div....
C/C++
December 17, 2016
#include<stdio.h> int n, c, v; int gcd(long long a, long long...
Read more
Codeforces Round #383 (Div....
C/C++
December 17, 2016
#include<stdio.h> int v; int main(){ int i,l,n,x; long long int r; scanf("%d%d",&n,&x); for(i=0;i<n;i++) { scanf("%d",&l); r=r+v; v++; } printf("%I64d",r); return 0; }
Read more
Codeforces Round #383 (Div....
C/C++
December 17, 2016
#include<stdio.h> int main(){int n, a={6,8,4,2}; scanf("%d",&n); if(n) printf("n%d",a); else printf("n1"); return 0; }
Read more
Codeforces Round #382 (Div....
C/C++
December 17, 2016
#include<iostream> #include<cstdio> #include<algorithm> #define N 3010 using namespace std; int n,m,f; struct ma{int x,y;}a; bool operator<(ma...
Read more
Codeforces Round #382 (Div....
C/C++
December 17, 2016
#include <bits/stdc++.h> using namespace std; const int N=2e3+1; int n,m,x,y; bitset<N*2> a; int...
Read more
4 Tools For Creating...
Blog
December 6, 2016
One way to communicate a lot of information is...
Read more