- Checkout source code at bitbucket
git clone https://tabvn@bitbucket.org/tabvn/livex_dashboard.git
| #include <iostream> | |
| #include <vector> | |
| #include <algorithm> | |
| using namespace std; | |
| struct Line | |
| { | |
| long int a,b; | |
| long long length; |
| #include <iostream> | |
| #include <iomanip> | |
| using namespace std; | |
| #include<iostream> | |
| #include <iomanip> | |
| using namespace std; | |
| double chia(double x, int n){ |
| #include <iostream> | |
| #include <vector> | |
| using namespace std; | |
| struct Flat | |
| { | |
| int isLightOn; | |
| int index; | |
| Flat *left; | |
| Flat *right; |
| #include <iostream> | |
| #include <vector> | |
| #include <algorithm> | |
| using namespace std; | |
| struct Num | |
| { | |
| long int value; | |
| long long index; |
| #include <iostream> | |
| using namespace std; | |
| long long jump(long long a, long long b, long long k){ | |
| if(k == 1){ | |
| return a; | |
| } | |
| if(k == 2){ |
| #include <iostream> | |
| #include <vector> | |
| #include <algorithm> | |
| using namespace std; | |
| vector<long int> v; | |
| vector<long int> result; | |
| bool descSort(long int a, long int b){ |
| #include <iostream> | |
| #include <vector> | |
| using namespace std; | |
| const int KEO = 0; // KEO la nguoi di duoc | |
| struct Money | |
| { | |
| int value; | |
| bool isTaken; |
| bool doiXung(string s, long long length){ | |
| if(length == 1){ | |
| return true; | |
| } | |
| bool dx = false; | |
| long long i, j; | |
| i = 0; | |
| j = length - 1; | |
| while(s[i] == s[j]){ |
| #include <iostream> | |
| #include <vector> | |
| #include <algorithm> | |
| using namespace std; | |
| vector<long int> s; | |
| vector<long int> p; | |
| long int a[20000]; | |
| long long total = 0; |