Gaming Chair – Learn All About The Best – Gamers Must Read

By | 2017-09-29T16:47:29+00:00 September 29th, 2017|Categories: Guest Post, Life Hacks, Reviews|

If you are a hardcore gamer, then ergonomics expert will constantly warn you that it is unhealthy to sit in one posture or position for hours. There is huge difference between simple office chair, and gaming chair designed especially for gaming freaks. They are [...]

4 Tips That Help Your Children During Your Divorce

By | 2017-09-29T13:15:09+00:00 September 29th, 2017|Categories: Blog, Featured, Life Hacks|

Divorce create a hard time for the people who are involved as well as their children. Children are very harshly affected by the decision of their parents that is there is no way to continue and do separation. In this article there are four [...]

Top 10 Laptops Worldwide – Must Read Before You Buy One

By | 2017-10-01T22:24:37+00:00 September 27th, 2017|Categories: Blog, Featured, What's New|Tags: , , , , , |

That does not matter who you are: a student, an employee, an Entrepreneur, a blogger, or whatever it might be, I am fairly sure devices like Laptop has always been a bedrock for you, right?   In case you are searching for the best [...]

Codeforces Round #436 (Div. 2), problem: (F) Cities Excursions Solution In C/C++

By | 2017-09-26T16:42:50+00:00 September 26th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , |

#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int N = 3005, INF = 0x3f3f3f3f; int n, m, q, f[N][12]; bool vis[N]; struct Edge { int to; Edge *next; Edge () {} Edge (int to, Edge *next) : to(to), next(next) {} }*head[N], pool[N << 1], [...]

Codeforces Round #436 (Div. 2), problem: (E) Fire Solution In C/C++

By | 2017-09-26T16:40:39+00:00 September 26th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include<iostream> #include<cstdio> #include<algorithm> #include<bitset> using namespace std; struct node{ int t,d,p,tot; }a[200]; int f[3000]; bool cmp(node x,node y){ return x.d<y.d; } bitset<150> ans[2050]; int cc[2050]; int main(){ int n; scanf("%d",&n); for (int i=1;i<=n;++i){ scanf("%d%d%d",&a[i].t,&a[i].d,&a[i].p); a[i].tot=i; } sort(a+1,a+n+1,cmp); for (int i=1;i<=n;++i) for (int j=a[i].d-1;j>=a[i].t;--j) if [...]

Codeforces Round #436 (Div. 2), problem: (D) Make a Permutation! Solution In C/C++

By | 2017-09-26T16:38:06+00:00 September 26th, 2017|Categories: Uncategorized|Tags: , , , , , , , |

#include<stdio.h> int a[200005], b[200005], sum[200005], flag[200005]; int main(void) { int n, i, p, k; scanf("%d", &n); for(i=1;i<=n;i++) { scanf("%d", &a[i]); sum[a[i]]++; } k = 0; for(i=1;i<=n;i++) { if(sum[i]==0) b[++k] = i; } printf("%d\n", k); p = 1; for(i=1;i<=n;i++) { if(sum[a[i]]==1) continue; if(b[p]<a[i] || flag[a[i]]==1) [...]

Codeforces Round #436 (Div. 2), problem: (C) Bus Solution In C/C++

By | 2017-09-26T16:36:31+00:00 September 26th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include <bits/stdc++.h> using namespace std; int main(){ int k,sum=0,end,cap,f,tank; for(cin>>end>>cap>>f>>k,tank=cap;k--;f=end-f) if(tank<f||cap<end-f) return cout<<-1,0; else if(tank>=end+(k?end-f:0)) tank-=end; else ++sum,tank=cap-(end-f); cout<<sum; }

Codeforces Round #436 (Div. 2), problem: (B) Polycarp and Letters Solution In C/C++

By | 2017-09-26T16:19:34+00:00 September 26th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include <stdio.h> int c[26]; void reset(){ for(int i=0;i<26;i++){ c[i]=0; } } int main(){ int n,i,cur=0,max=0; scanf("%d",&n); char a[n+1]; scanf("%s",a); reset(); for(i=0;i<n;i++){ if(a[i]>='A' && a[i]<='Z'){ cur=0; reset(); } else if(c[a[i]-'a']==0){ c[a[i]-'a']++; cur++; } if(cur>max){ max=cur; } } printf("%d\n",max); return 0; }

Codeforces Round #436 (Div. 2), problem: (A) Fair Game Solution In C/C++

By | 2017-09-26T16:17:26+00:00 September 26th, 2017|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include<cstdio> #include<iostream> using namespace std; int n,cnt,ans,A,B; int buck[500]; int main(){ scanf("%d",&n); for(int i = 1;i <= n;i++){ cin >> cnt; if(!buck[cnt]){ ans++; if(A) B = cnt; else A = cnt; } buck[cnt]++; } if(ans == 2 && buck[A] == buck[B]) printf("YES\n%d %d",A,B); else [...]

Searching The Right Room For Rent In Gurgaon According To Budget

By | 2017-09-23T20:54:59+00:00 September 23rd, 2017|Categories: Blog, Guest Post, Travel|

Are you looking for just the right room to rent? Maybe you have the time you should have it yourself. After all, this is the age of search engine, and much of details are available to anyone who seriously looks at it. And why [...]