I want to solve the problem using a dynamic array. But the compiler outputs this: HEAP CORRUPTION DETECTED: after Normal block (#150) at 0x000001EEFBCDB420.
CRT detected that the application wronte to memory after end of heap buffer.

#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
void main()
{
    int size = 0, i = 0;
        int* a = new int[size];
    unsigned int x;
    while (cin >> x)
    {
        size += 1;
        for (; i < size;++i)
        {
            a[i] = x;

        }

    }

    for (int i = size-1; i >= 0; --i)
    {
        cout << fixed << setprecision(4) << sqrt(a[i]) << endl;
    }
    delete[] a;

Edited by author 20.03.2023 12:40

When need stop the flow. Help me pls!

#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

int main() {

    double number;
    vector<double> numbers;

    while (cin >> number)
        numbers.push_back(number);

    cout.precision(4);
    cout.setf(std::ios::fixed);

    for (auto iter = numbers.rbegin(); iter != numbers.rend(); ++iter)
        cout << sqrt(*iter) << endl;

    return 0;
}

/* https://acm.timus.ru/problem.aspx?space=1&num=1001 */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
/* #include <sys/queue.h> */
/*
 * Singly-linked List definitions.
 */
#define    SLIST_HEAD(name, type)                        \
struct name {                                \
    struct type *slh_first;    /* first element */            \
}

#define    SLIST_HEAD_INITIALIZER(head)                    \
    { NULL }

#define    SLIST_ENTRY(type)                        \
struct {                                \
    struct type *sle_next;    /* next element */            \
}

/*
 * Singly-linked List functions.
 */
#define    SLIST_INIT(head) do {                        \
    (head)->slh_first = NULL;                    \
} while (/*CONSTCOND*/0)

#define    SLIST_INSERT_AFTER(slistelm, elm, field) do {            \
    (elm)->field.sle_next = (slistelm)->field.sle_next;        \
    (slistelm)->field.sle_next = (elm);                \
} while (/*CONSTCOND*/0)

#define    SLIST_INSERT_HEAD(head, elm, field) do {            \
    (elm)->field.sle_next = (head)->slh_first;            \
    (head)->slh_first = (elm);                    \
} while (/*CONSTCOND*/0)

#define    SLIST_REMOVE_HEAD(head, field) do {                \
    (head)->slh_first = (head)->slh_first->field.sle_next;        \
} while (/*CONSTCOND*/0)

#define    SLIST_REMOVE(head, elm, type, field) do {            \
    if ((head)->slh_first == (elm)) {                \
        SLIST_REMOVE_HEAD((head), field);            \
    }                                \
    else {                                \
        struct type *curelm = (head)->slh_first;        \
        while(curelm->field.sle_next != (elm))            \
            curelm = curelm->field.sle_next;        \
        curelm->field.sle_next =                \
            curelm->field.sle_next->field.sle_next;        \
    }                                \
} while (/*CONSTCOND*/0)

#define    SLIST_FOREACH(var, head, field)                    \
    for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)

/*
 * Singly-linked List access methods.
 */
#define    SLIST_EMPTY(head)    ((head)->slh_first == NULL)
#define    SLIST_FIRST(head)    ((head)->slh_first)
#define    SLIST_NEXT(elm, field)    ((elm)->field.sle_next)

struct num_entry {
    double num;
    SLIST_ENTRY(num_entry) entries;
};
SLIST_HEAD(tq_num, num_entry);

#define my_abs(x) ((x)>0?(x):-(x))

double my_sqrt(double c) {
    double err = 1e-15;
    double t = c;
    if (c < 0) {
        return -1;
    }
    while (my_abs(t- c/t) > err * t) {
        t = (c/t + t) / 2.0;
    }
    return t;
}

int main() {
    struct tq_num head;
    struct num_entry *np;
    unsigned long long m;

    SLIST_INIT(&head);
    /* https://acm.timus.ru/help.aspx?topic=cpp */
    while (scanf("%llu ", &m) != EOF) {
#ifndef ONLINE_JUDGE
        printf("m=%llu\n", m);
#endif
        np = (struct num_entry *)malloc(sizeof(struct num_entry));
        np->num = (double)m;
        SLIST_INSERT_HEAD(&head, np, entries);
    }
    while (!SLIST_EMPTY(&head)) {
        np = SLIST_FIRST(&head);
        printf("%.4f\n", my_sqrt(np->num));
        SLIST_REMOVE(&head, np, num_entry, entries);
        free(np);
    }
    return 0;
}

Edited by author 28.04.2024 12:11

//please tell me what's wrong, cause i cant understand...

#include <bits/stdc++.h>
#include<fstream>
#define all(a) (a).begin(), (a).end()
#define ll long long
#define sz size
#define dbl double
#define vll vector <ll>
#define INF LLONG_MAX
#define uniq(x) x.resize(unique(begin(x),end(x))-begin(x))
#define forik(i,m,n) for(ll i=m;i<n;++i)
#define re return

using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie();
    vll numbers;
    ll num;
    while (cin >> num) {
        numbers.push_back(num);
    }
    for (ll i = numbers.size() - 1; i >= 0; i--) {
        dbl nek = sqrt(numbers[i]);
        cout << fixed << setprecision(4) << nek << endl;
    }
    re 0;
}

#include <iostream>
#include <stack>
#include <cmath>
using namespace std;

int main()
{
    stack<double> root;
    double input;

    while(cin >> input)
    {
        root.push(sqrt(input));
    }

    while(!root.empty())
    {
        cout << root.top() << endl;
        root.pop();
    }

    return 0;
}

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
using namespace std;


int main() {
    double element, a;
    vector<double> numbers;
    while (cin >> element) {
        numbers.push_back(element);
    }
    reverse(numbers.begin(), numbers.end());
    for (size_t i = 0; i != numbers.size(); i++) {
        a = sqrt(numbers[i]);
        cout << setprecision(4) << a << "\n";
    }
    return 0;
}

Edited by author 11.01.2024 20:23

How can the program recognize when there aren´t more inputs if use python3 ?
my program:
nums = [int(x) for x in input().split()]
nums.reverse()
for num in nums:
    print('{:.4f}'.format(num ** 0.5))

What's wrong? anyone can tell me ,pls

Edited by author 29.11.2023 07:42

Edited by author 29.11.2023 07:43

#include <iostream>

using namespace std;

int main()
{

    double k;
    while(cin >> k) {
        cout << fixed << setprecision(4) << sqrt(k) << endl;
    }

}

lines = []
for line in stdin:
    for i in range(0, len(line.split())):
        lines.append(line.split()[i])
lines = [int(i) for i in lines]
lines_rev = list(reversed(lines))
numbers = []
for i in range(0, len(lines_rev)):
    numbers.append(lines_rev[i]**0.5)
for i in range(len(numbers)):
    print(f"{numbers[i]:.4f}")

using System;

public class Reverse
{
   private static void Main()
   {
      string[] numbers = Console.ReadLine().Split(new char[] {' ', '\t', '\n', '\r'}, StringSplitOptions.RemoveEmptyEntries);

      for(int i = numbers.Length-1; i >= 0; i--)
      {
         double result = Math.Sqrt(double.Parse(numbers[i]));
         Console.WriteLine($"{result:F4}");
      }
   }
}

Edited by author 07.03.2023 20:45

#include <cstdlib>
#include <iomanip>

#include <iostream>

#include <cstdio>
#include <math.h>
#include <vector>
#include <string.h>


#include <algorithm>




using namespace std;
vector <double> numbers = {};

int main(int argc, const char * argv[]) {

    double n;
    while (std::cin >> n)
    {
        numbers.push_back(n);
        if (cin.peek() == '\n' ){
            reverse(numbers.begin(),numbers.end());
            for(int i = 0;i < numbers.size();++i){
                cout<<fixed<<setprecision(4)<<sqrt(numbers[i])<<endl;
            }

            break;
        };
    }

    return 0;
}




I have a correct answer with input numbers in sample, and i see message "wrong answer" in 2 test. First test was passed, but i don't see where i lose...

#include <bits/stdc++.h>
using namespace std;

int main(){
    long long n, res;
    vector <long long> vt;
    while(cin>>n){
        vt.push_back(n);
    }
    int len = vt.size();

    for(int i = len-1; i >= 0; i--){
        double n = sqrt(vt[i]);
        printf("%0.4lf\n", n);
    }

return 0;
}

Edited by author 07.09.2019 11:05

Edited by author 07.09.2019 11:11

a=[int(i) for i in input().split()]
for i in a[::-1]:
    print(f"{float(i)**0.5:.4f}")

#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
using namespace std;

int main (){
    double Input=0 ;
    double number[] ;
    int counter=0;

    while ( cin >> Input && Input != EOF){
        number[counter] = Input;
        cout << number[counter];
        counter++ ;
    }

    for (int i=counter ; i>0; i--){
        cout << setprecision(4) << sqrt (number[counter]) << endl;
    }
}

* deleted *

Edited by moderator 23.07.2022 20:33

#include<stdio.h>
#include<math.h>
int main(){
    unsigned long long int a,b,c,d;
    double Sqrt,Sqrt1,Sqrt2,Sqrt3;
scanf("%llu %llu %llu %llu",&a,&b,&c,&d);
Sqrt=sqrt(a);
Sqrt1=sqrt(b);
Sqrt2=sqrt(c);
Sqrt3=sqrt(d);



printf(" %0.4lf %0.4lf %0.4lf %0.4lf",Sqrt,Sqrt1,Sqrt2,Sqrt3);
}


Edited by author 23.06.2022 13:46

Edited by author 23.06.2022 13:46

I'm just learning python. Can you please tell me where could be the error?

import math

data = input()
length = len(data)
list = []
i = 0

while i < length:
    if data[i] != " " and data[i] != "\n":
        end_index = i
        for j in range(i + 1, length):
            if data[j] == " " or data[i] == "\n":
                break
            end_index += 1
        list.insert(0, int(data[i:end_index + 1]))
        i = end_index + 1
    else:
        i += 1

for e in list:
    value = round(math.sqrt(e), 4)
    print(f'{value:.4f}')

package main

import(
  "fmt"
  "strings"
  "bufio"
  "os"
  "strconv"
  "math"
)

func main(){
  scanner := bufio.NewScanner(os.Stdin)
  scanner.Scan()
  line := scanner.Text()
  s := strings.Fields(line)


  for ix := len(s) - 1; ix >= 0; ix--{
    i, _ := strconv.Atoi(s[ix])
    x := fmt.Sprintf("%.4f", math.Sqrt(float64(i)))
    fmt.Println(x)
  }
}

I investigated on internet, but most of the answers were putting a type of character that breaks the cycle, but in the input example there´s no character and it´s not enough with a "while(cin >> n)" pls help