الربح من اليوتيوب وطرق الاستهداف باستخدام Google Trends

By |2016-11-29T00:24:21+00:00November 29th, 2016|Categories: Uncategorized|Tags: , , , , , , , , , , , , , , , , , , , , , , , , |

الربح من اليوتيوب في اربع خطوات أو خمس خطوات أو حتي 6 خطوات مش مهم :) المهم أني سأشارك معكم اساليب الاستهداف واختيار الكلمات المفتاحية عن طرق مؤشرات جوجل هو موضوع اليوم, مشاركة لاستراتيجيات الربح والبحث من خلال المؤشرات اليومية أو الشهرية أو السنوية [...]

Codeforces Round #381 (Div. 1), problem: (E) Gosha is hunting Solution in C/C++

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

Hi guys , I just solved the fifth problem of round 381 , Hope you like it , feel free to comment any better solution .     #include <bits/stdc++.h> using namespace std; const int MAXN = 2007; pair<double,double> p[MAXN]; double dp[MAXN][MAXN]; int main(){ [...]

Codeforces Round #381 (Div. 1), problem: (D) Recover a functional graph Solution in C/C++

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

Hi guys , I just solved the fourth problem of round 381 , Hope you like it , feel free to comment any better solution .     #include<cstring> #include<cstdlib> #include<cstdio> #include<cmath> #include<iostream> #include<vector> #define N 310 #define pb push_back using namespace std; struct [...]

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

By |2017-04-07T22:11:49+00:00November 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:00November 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:00November 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: (F) Dirty plates Solution in C/C++

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

Hi Guys , I Just Tried to solve the Dirty plates problem , hope you might like it , please share if you've any better code .   #include <iostream> #include <fstream> #include <set> #include <map> #include <string> #include <vector> #include <bitset> #include <algorithm> [...]

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:00November 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:00November 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:00November 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; [...]