public static String encryption(String s) {
    // Write your code here
    
    double squareRoot = Math.sqrt(s.length());
    int column = (int)Math.ceil(squareRoot);
    
    String output="";
    for (int i = 0; i < column; i++) {
        for (int j = i; j < s.length(); j+=column) {
            output+=s.charAt(j);
        }
        output+=" ";
    }
        return output;
    }

def encryption(s):
    # Write your code here
    s = s.replace(' ', '')
    length = len(s)
    col = math.ceil(length ** 0.5)
    row = math.ceil(length / col)
    encrypted = ''
    
            
    while col * row < length:
        if (col + 1) * row <= length:
            col += 1
        else:
            row += 1
    
    added = []
    for i in range(row + 1):
        a = ''
        for j in range(0, length, col):
            if i+j < length and i+j not in added:
                print(i, ' j=', j, ' i+j= ', i+j)
                a += s[i+j]
                added.append(i+j)
                
        encrypted += a + ' '
        
    return encrypted

#include <iostream>
#include <string>
#include <cmath>
#include <climits>

using namespace std;

int main(int argc, char const *argv[])
{
    string str;
    cin >> str;
    int len = (int)str.size();
    int lb = (int) sqrt(1.0 * len);
    int ub = (int) ceil(sqrt(1.0 * len));
    int ans = INT_MAX;
    int r = 0, c = 0;
    for (int row = lb; row <= ub; row++)
        for (int col = row; col <= ub; col++)
            if (row * col >= len && row * col < ans)
            {
                ans = row * col;
                r = row;
                c = col;
            }
    for (int i = 0; i < c; i++)
    {
        for (int j = 0; j < r; j++)
            if (j*c + i < len)
                cout << str[j*c + i];
        cout << " ";
    }

    return 0;
}

const l = s.length;
    const words = Math.ceil(Math.sqrt(l));
    const letters = Math.floor(Math.sqrt(l));
    const d = Number.isInteger(Math.sqrt(l)) ? 0 : 1;
    let r = '';
    
    for(let i =0; i<words; i++) {
        for(let j = i; j < l; j += letters + d) {
            r += s[j];
        }
        r += ' '; // 1 space
    }
    
    return r;