Học lập trình chất lượng cao từ STDIO Training
STDIO TRAINING - LẬP TRÌNH TỪ NỀN TẢNG
https://drive.google.com/open?id=1VGz5e449S5uhxg6-71oFFIO4za8_00br
We have a wide range of products that covers most of today's consumer segments, ranging from middle-class devices to high-end flagships. At first, let's take the Huawei P20 Pro into consideration. Huawei's current flagship is a very unique smartphone with three rear-mounted cameras; 1 / 1.7 '' super large sensor; it scores 114 points in DxOMark’s photography chart which ranks first when compared to samsung Galaxy S9 + (104 points) and Iphone X (101 points). In addition, the device is provided with AI that e
function KiemTraHoTen() {

        var getHoTen = $('#txtHoTen').val();
        console.log("abc");

        if(getHoTen.length < 6) {
            $('#tbHoTen').html("Ít nhất 6 ký tự");
            return false;
        }
        else {
            var re = /[a-zA-Z]*[0-9]+[!@#$%^&*()_+\-=\[\]{};':"\\|,.<>\/?]+/;
            if(!re.test(getHoTen)) {
                $('#tbHoTen').html("Nhập sai format");
                return false;
            }
             $('#tbHoTen').html("* ");
            return t
https://send.firefox.com/download/fa95a27bcf/#_PEHcltXHqkZ_KMbBw5gsQ
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

char str[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int n, k;

void ahihi(){
    if (!n){
        return;
    }
    
    int res = n % k;
    n /= k;
    
    ahihi();
    
    cout << str[res];
}

int main() {
    cin >> n >> k;
    
    ahihi();
    
    return 0;
}
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

char str[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int n, k;

int main() {
    cin >> n >> k;
    string res = "";
    
    while (n > 0){
        res.push_back(str[n % k]);
        n /= k;
    }
    
    std::reverse(res.begin(), res.end());
    cout << res;
    
    return 0;
}
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
using namespace std;


int main() {
    string s;
    getline(cin, s);
    for (int i = 0; i < s.length(); ++i){
        s[i] = tolower(s[i]);
    }
    stringstream ss(s);
    vector<string> words;
    string tmp;
    while (ss >> tmp){
        words.push_back(tmp);
    }
    s = words[0];
    s[0] = toupper(s[0]);
    
    for (int i = 1; i < words.size(); ++i){
        s += (
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <map>
using namespace std;


int main() {
    string s;
    getline(cin, s);
    stringstream ss(s);
    string tmp;
    map<string, int> myMap;
    while (ss >> tmp){
        myMap[tmp]++;
    }
    int mx = 0;
    for (auto i : myMap){
        if (i.second > mx){
            mx = i.second;
        }
    }
    for (auto i : myMap){
        if (i.second == mx){
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stdlib.h>
#include <limits>
using namespace std;

int n, m, a, b;
int f[100][100];
int check[100];
int res;


void ahihi(int s){
    if (s == b){
        ++res;
        return;
    }
    
    for (int i = 0; i < n; ++i){
        if (f[s][i] > 0 && check[i]){
            check[i] = 0;
            ahihi(i);
            check[i] = 1;
        }
    }
}

int main() {
   
    cin >> n >> m >> a
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    long long value = 0, f1 = 0, f2 = 0, f3 = 0, n = 0;

    cin >> n;
    while (n--){
        cin >> value;
        f3 = max(f2, f1 + value);
        f1 = f2;
        f2 = f3;
    }
    cout << f3;
    
    return 0;
}
first_page
chevron_left
1
chevron_rightlast_page