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 18, 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
1105 animes navigated
Hacks Recap: New York or Nowhere
Hacks Recap: Deborah Vance and the Little Debbies Take on New York The latest episode...
Why is Tesla Up $28
Understanding the Recent $28 Surge in Tesla StockTesla investors have plenty to celebrate as...
Candace Owens Responds to Erika Kirk Pulling Out of Event With VP JD Vance
Candace Owens Criticizes Erika Kirk Over TPUSA Event Cancellation The political commentary landscape is heating...
Passive component demand splits in 2026; AI and autos hold firm
The Shift in Passive Component Demand: AI and Automotive Drive 2026 Growth As we approach...
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
Codeforces Round #444 (Div....
C/C++
November 7, 2017
#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<algorithm> #include<cstdlib> #define eps 1e-7 using namespace std; double x,y,r,L; struct node{double l,r;}a; struct P{double...
Read more
Codeforces Round #444 (Div....
C/C++
November 7, 2017
#include <cstdio> #include <algorithm> using namespace std; long long n,a,b,c,d,st,len,t; int q; int main() { scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&a,&b,&c,&d,&st,&len); for...
Read more
Codeforces Round #444 (Div....
C/C++
November 7, 2017
#include <bits/stdc++.h> using namespace std; const int R = { {12, 13,...
Read more
Codeforces Round #444 (Div....
C/C++
November 7, 2017
#include<stdio.h> int main() { int n,i,j,k,m,A,B; scanf("%d",&n); for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ scanf("%d",&A);} } for(i=1;i<=100;i++){ B=0;} for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ B]=1; for(k=1;k<=n;k++){ for(m=1;m<=6;m++){ if (k!=i){ B*10+A]=1; } } } } } i=1; while(B){ i++;} printf("%d",i-1); return 0; }
Read more
Codeforces Round #444 (Div....
C/C++
November 7, 2017
#include<stdio.h> char s; int main() { scanf(" %s",s); int x=0,y=0,z=0; while(s=='0') x++; while(s!=0) z++; for(int i=x+1;i<z;i++) if(s=='0')...
Read more
5 Exciting Things To...
Blog
November 5, 2017
Nothing could be as better than enjoying a holiday...
Read more