code py

def solve(n):
    socs = 0;
    kq = 0;
    while(n):
        kq += n%10;
        n //= 10;
        socs += 1;
    print(kq)
    print(socs)
n = int(input())
solve(n)

code cpp

#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
    ll n;cin >> n;
    ll socs = 0;
    ll kq = 0;
    while(n){
        kq += n%10;
        n /= 10;
        socs += 1;
    }
    cout << kq << endl;
    cout << socs << endl;
    return;
}
int main(){
    //int TC;cin >> TC;
    int TC = 1;
    while (TC--){
        solve();
    }
    return 0;
}

\begin{array}{c} \color{#db1616}{\texttt{#Khoadang09}} \end{array}
`@`$\texttt{C++: }$

#include <iostream>
#define int long long
#define eol '\n'
#define buff ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
signed main(){
    buff;
    int n; cin >> n;
    int sum_number = 0, count_len_number = 0;
    while (n!=0){
        sum_number += n % 10;
        count_len_number ++;
        n /= 10;
    }
    cout << count_len_number << eol << sum_number;
    return 0;
}

`@`$\texttt{Python: }$

n = int(input())
sum_number = 0; count_len_number = 0
while n != 0:
    sum_number += n % 10
    count_len_number += 1
    n //= 10
print(count_len_number)
print(sum_number)

`@`$\texttt{Pascal: }$

var n : nativeint;
    sum_number, count_len_number : longint;
begin
    readln(n);
    sum_number := 0;
    count_len_number := 0;
    while n <> 0 do 
         begin
        inc(sum_number,n mod 10);
        inc(count_len_number);
        n := n div 10;
         end ;
    writeln(count_len_number);
    writeln(sum_number);
end .

  - nativeint : kiểu dữ liệu phụ thuộc vào bộ nhớ máy tính

  - Có thể thay thế nativeint thành int64 để an toàn

`@`$\texttt{Ruby: }$

n = gets.to_i
sum_number = 0; count_len_number = 0
while n != 0
    sum_number += n % 10
    count_len_number += 1
    n /= 10
end
puts count_len_number
puts sum_number

`@`$\texttt{Java: }$

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        long n = scanner.nextLong();
        int sum_number = 0, count_len_number = 0;
        while (n>0){
            sum_number += n % 10;
            count_len_number ++;
            n /= 10;
        }
        System.out.println(count_len_number);
        System.out.println(sum_number);
        scanner.close();
    }
}

`@`$\texttt{C#: }$

using System;
public class Program{
    public static void Main(){
        long n = long.Parse(Console.ReadLine());
        long sum_number = 0, count_len_number = 0;
        while (n>0){
            sum_number += n % 10;
            count_len_number ++;
            n /= 10; 
        }
        Console.WriteLine(count_len_number);
        Console.WriteLine(sum_number); 
    }
}