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
Friday, July 4, 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
Monthly Archives: November, 2017
Try searching for what you're looking for instead.
Search
Aluminum: The Reason For...
Blog
November 10, 2017
Envision that you have a light, however solid metal,...
Read more
5 Effective Ways to...
Blog
November 10, 2017
High blood pressure or hypertension is widespread nowadays. Approximately...
Read more
Branding Isn’t All About...
Blog
November 10, 2017
Branding is not just a Logo A brand is not...
Read more
Pastor Chris Rhapsody Online...
Blog
November 9, 2017
Rhapsody Online Prayer Conference is one of the most...
Read more
Good Health Tips for...
Blog
November 9, 2017
Good health tips shouldn’t be taken as granted as...
Read more
Breast Actives Review ...
Blog
November 9, 2017
The Breast Actives Natural Bust Enhancement program does undoubtedly...
Read more
Codeforces Round #443 (Div....
C/C++
November 8, 2017
#include<cstdio> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,k; struct node { int maxx,minn,sz; node() { int x;sz = 1; for(int...
Read more
Codeforces Round #443 (Div....
C/C++
November 8, 2017
#include <stdio.h> struct node { __int64 ans,num; }s; int main() { int n,k,m; while(~scanf("%d%d%d",&n,&k,&m)) { scanf("%I64d",&s.num); s.ans=1; int len=1; for(int i=1;i<n;i++) { int x; scanf("%d",&x); if(x==s.num) { s.ans++; if(s.ans==k) { s.ans=0; len--; } } else { s.num=x; s.ans=1; len++; } } int...
Read more
Codeforces Round #443 (Div....
C/C++
November 8, 2017
#include <iostream> using namespace std; const int maxn = 5e5; int n,...
Read more
Codeforces Round #443 (Div....
C/C++
November 8, 2017
#include <iostream> using namespace std; int main() { long long n,k,a,m=0,ab=0; cin>>n>>k>>ab; while(--n){ cin>>a; if(m==k){break;} if(ab>a){m++;} else ab=a,m=1; } cout<<ab; }
Read more
Codeforces Round #443 (Div....
C/C++
November 8, 2017
#include<bits/stdc++.h> using namespace std; int main() { int n,i,s,d,t=0; cin>>n; for(i=0;i<n;i++) { cin>>s>>d; while(s<=t) { s=s+d; } t=s; } cout<<s<<endl; }
Read more
Codeforces Round #444 (Div....
C/C++
November 7, 2017
#include<bits/stdc++.h> #define maxn 1000050 using namespace std; int a,b,c,n,k,m,t; int main() { ...
Read more
Advertisement
