Monthly Archives: January, 2017

Blog

Mobile First WordPress Design For 2017

Going into 2017, WordPress is the leading content management system for blogs and business websites across the...
Admin -
Read
Blog

Tips on Getting Top Ranks in Google

Getting top positions on Google must be accomplished by taking after the greater part of the principals...
Admin -
Read
How To

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

First of all, you will need visual composer plugin installed in your WordPress. Otherwise you won’t be...
Taniv Ashraf -
Read
C/C++

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

#include <bits/stdc++.h> using namespace std; const int mod = 1e9+7; long long t; long long binpow(long long a, long long n){ long...
Admin -
Read
C/C++

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

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int a; struct segtree{ int lb, rb; int mx = 0, d =...
Admin -
Read
C/C++

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

#include <stdio.h> #define SIZE 100010 struct ride { int cost, t; } r; int main() { int i, j, n; scanf(“%d”, &n); r.t = r.cost =...
Admin -
Read
C/C++

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

#include <stdio.h> #define N 200000 int pp, used; void dfs(int i) { if (used) return; used = 1; dfs(pp); } int main() { int n, i, sum,...
Admin -
Read
C/C++

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

#include <stdio.h> int main() { int n, m, k, h, l, r; scanf(“%d %d %d”, &n, &m, &k); l = r =...
Admin -
Read

Want to stay up to date with the latest news?

We would love to hear from you! Please fill in your details and we will stay in touch. It's that simple!