About Admin

This author has not yet filled in any details.
So far Admin has created 561 blog entries.

Codeforces Round #381 (Div. 1), problem: (C) Alyona and towers Solution C/C++

By | 2017-04-07T22:11:49+00:00 November 27th, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , , |

Hi guys , I just solved the third problem of round 381 , Hope you like it , feel free to comment any better solution .   #include <bits/stdc++.h> using namespace std; #define pb push_back #define fi first #define se second typedef long long [...]

Codeforces Round #381 (Div. 1), problem: (B) Alyona and a tree Solution in C/C++

By | 2017-04-07T22:11:49+00:00 November 27th, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , , |

Hi guys , I just solved the second problem of round 381 , Hope you like it , feel free to comment any better solution .   #include<stdio.h> #include<stdlib.h> typedef long long unsigned llu; typedef unsigned u; u P[19][222222],S[222222],R[222222],A[222222]; u *G[222222],Ga[222222],Gi[222222]; llu W[19][222222]; void [...]

Codeforces Round #381 (Div. 2), problem: (A) Alyona and copybooks Solution in C/C++

By | 2017-04-07T22:11:49+00:00 November 27th, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , , |

Hi guys , I just solved the first problem of round 381 , Hope you like it , feel free to comment any better solution .   #include<stdio.h> int main() { int n,a[5]={0}; scanf("%d %d %d %d",&n,&a[1],&a[2],&a[3]); if (a[3]+a[3]<a[1]-a[3]) a[1]=a[3]+a[3]+a[3]; if (a[3]+a[2]<a[1]) a[1]=a[3]+a[2]; if [...]

Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (E) Tanya is 5! Solution in C/C++

By | 2017-04-07T22:11:49+00:00 November 21st, 2016|Categories: C/C++, Programming|Tags: , , , , , , , |

Hi Guys , I Just Tried to solve the Tanya is 5! problem , hope you might like it , please share if you've any better code .     #include <bits/stdc++.h> #define time privet #define F first #define S second using namespace std; [...]

Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (D) Financiers Game Solution in C/C++

By | 2017-04-07T22:11:49+00:00 November 21st, 2016|Categories: C/C++, Programming|Tags: , , , , , , , |

Hi Guys , I Just Tried to solve the Financiers Game problem , hope you might like it , please share if you've any better code .   #define _CRT_SECURE_NO_DEPRECATE #include <iostream> #include <string> #include <vector> #include <sstream> #include <queue> #include <algorithm> #include <iomanip> [...]

Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (C) Subordinates Solution in C/C++

By | 2017-04-07T22:11:49+00:00 November 21st, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , |

Hi Guys , I Just Tried to solve the Subordinates problem , hope you might like it , please share if you've any better code .   #include<stdio.h> #include<stdlib.h> typedef unsigned u; u Z[222222],R[222222],C[222222]; int main() { u n,s,i,k,fz=0,fnz=0,x,a=-1u; scanf("%u%u",&n,&s);--s; for(i=-1;++i<n;) { scanf("%u",&k); if(!k&&i!=s)++fz; [...]

Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (B) Sea Battle Solution in C/C++

By | 2017-04-07T22:11:49+00:00 November 21st, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , , |

Hi Guys , I Just Tried to solve the Sea Battle problem , hope you might like it , please share if you've any better code . #include<stdio.h> #include<stdlib.h> typedef unsigned u; char S[222222];u Q[222222],Qi; int main() { u n,a,b,i,j,k; scanf("%u%u%u%u%s",&n,&a,&b,&k,S); for(i=-1,j=0;++i<n;) { //printf("!%u [...]

Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 – Elimination Round 2), problem: (A) Road to Cinema Solution in C/C++

By | 2017-04-07T22:11:49+00:00 November 21st, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , |

Hi Guys , I Just Tried to solve the Road to Cinema problem , hope you might like it , please share if you've any better code . #include #include typedef long long unsigned llu; typedef unsigned u; int F(const void*x,const void*y){return*(int*)x-*(int*)y;} u G[222222],C[222222],V[222222]; [...]

Social Media Buzz Words – Free English lesson to learn trending words

By | 2016-11-21T17:25:43+00:00 November 21st, 2016|Categories: Uncategorized|Tags: , , , , , , , , |

Social Media Buzz Words – Free English lesson to learn trending words Blog : http://www.learnex.in/social-media-buzz-words-free-esl-lesson This ESL lesson is all about “Social media buzzwords”. These are English words that have created a buzz over the social media which means that they are popularly used [...]

Codeforces Round #379 (Div. 2), problem: (C) Anton and Making Potions Solution in C

By | 2017-04-07T22:11:50+00:00 November 16th, 2016|Categories: C/C++, Programming|Tags: , , , , , , , |

Hey guys I just tried the Anton and Making Potions problem , hope you might like my solution feel free to comment better solution . #include #define N 200000 struct type2 { int c, d; } yy[N]; int binsearch(struct type2 *yy, int x, int [...]