Mobile First WordPress Design For 2017

By |2017-02-01T13:39:28+00:00January 30th, 2017|Categories: Blog, Featured, How To, Life Hacks|Tags: |

Going into 2017, Wordpress is the leading content management system for blogs and business websites across the globe. Wordpress makes building powerful and responsive websites great for everyone from the new designer to the advanced web developer. With all of the distraction regarding design [...]

Tips on Getting Top Ranks in Google

By |2017-02-16T18:22:31+00:00January 28th, 2017|Categories: Blog, How To, Life Hacks, Special|Tags: , , |

  Getting top positions on Google must be accomplished by taking after the greater part of the principals and rules contained in Google's Webmaster Guidelines. This continually overhauled distribution accessible for nothing from Google gives any genuine site advertiser with the greater part of [...]

How to Publish Images with LightBox with Title and Description by Visual Composer Backend Editor in WordPress

By |2017-02-16T18:22:20+00:00January 25th, 2017|Categories: How To, Special, What's New, WordPress|Tags: , , , |

First of all, you will need visual composer plugin installed in your WordPress. Otherwise you won’t be able to highlight your images perfectly and responsively like visual composer does. So to install that you can install that from WordPress dashboard or Cpanel. I prefer [...]

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (F) Bacterial Melee Solution in C/C++

By |2017-04-07T22:10:17+00:00January 23rd, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , , |

#include <bits/stdc++.h> using namespace std; const int mod = 1e9+7; long long t[20000]; long long binpow(long long a, long long n){ long long ans = 1; while(n){ if(n&1) ans = ans*a % mod; a = a*a % mod; n >>= 1; } return ans; [...]

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (E) Nikita and stack Solution in C/C++

By |2017-04-07T22:10:18+00:00January 23rd, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , , |

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int a[maxn]; struct segtree{ int lb, rb; int mx = 0, d = 0; segtree *l, *r; segtree(int _lb, int _rb){ lb = _lb, rb = _rb; if(lb != rb){ int t = (lb [...]

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (D) Travel Card Solution in C/C++

By |2017-04-07T22:10:18+00:00January 23rd, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , , |

#include <stdio.h> #define SIZE 100010 struct ride { int cost, t; } r[SIZE]; int main() { int i, j, n; scanf("%d", &n); r[0].t = r[0].cost = 0; for (i = 1; i <= n; i++) { scanf("%d", &r[i].t); r[i].cost = r[i - 1].cost + [...]

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (C) Pavel and barbecue Solution in C/C++

By |2017-04-07T22:10:18+00:00January 23rd, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include <stdio.h> #define N 200000 int pp[N], used[N]; void dfs(int i) { if (used[i]) return; used[i] = 1; dfs(pp[i]); } int main() { int n, i, sum, cnt; static int bb[N]; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%d", &pp[i]); [...]

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (B) Frodo and pillows Solution in C/C++

By |2017-04-07T22:10:18+00:00January 23rd, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , , |

#include <stdio.h> int main() { int n, m, k, h, l, r; scanf("%d %d %d", &n, &m, &k); l = r = k; h = 1; m -= n; while (m - (r - l + 1) >= 0 && !(l == 1 && [...]

Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (A) Petr and a calendar Solution in C/C++

By |2017-04-07T22:10:18+00:00January 23rd, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , , |

#include<stdio.h> int main() { int a[12]={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[i]-k; p=n/7; if(p*7!=n) p++; printf("%d",p+1); }

Codeforces Round #392 (Div. 2), problem: (F) Geometrical Progression Solution in C/C++

By |2017-04-07T22:10:18+00:00January 20th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , |

#include<stdio.h> #include<stdlib.h> #define N 10000001 #define SN 3163 typedef long long unsigned llu; typedef unsigned u; int F(const void*x,const void*y) { if(*(llu*)x>*(llu*)y)return 1; if(*(llu*)y>*(llu*)x)return-1; return 0; } u D[N],Ga[N],Gi[N];llu *G[N]; int main() { u a,b,c,i,j,k,n,x,y,lo,hi,mi;llu e;llu r=0; for(i=0;++i<SN;)for(k=i*i,j=0;(j+=k)<N;)D[j]=i; scanf("%u%u%u",&n,&x,&y); if(n<3) { r=y-x+1; if(n==0)r=1; if(n==2)r=r*(r-1); [...]