Here are a few more comments:

The header <bits stdc++.h=""> is not a standard C++ header, surely <vector> would make more sense here.

Surely you have heard that global variables should be avoided. Unfortunately you have some of them, which are useless:

C++

ull n; vector<ull> dp(n + 1, 0);

You use the functions sync_with_stdio() and cin.tie() for no apparent reason. I may be wrong, but I think they are superfluous here.

Using your own datatype when using a std::vector has the problem that it only supports max size_t.

Instead of accessing with the array notation, using the at() method would be safer, since an out_of_range exception would be thrown in case of an invalid index range.

From the comment I assume that the output of a row should look like this:

//1 1 2 3 5 8 13 21 34 55

Also, there seems to be an attempt in the code to find a recursive solution.

Remark: When it comes to calculating Fibonacci numbers efficiently, an iterative solution would be preferable to a recursive one. A recursive approach here is less efficient than an iterative solution because it performs many redundant calculations. For large values of n, this can also lead to a significant slowdown.

A standard vector can also only be addressed with an index of at most size_t, declaring the index with the data type ull is not useful.

To avoid that numbers are calculated several times it could make sense to store already calculated Fibonacci numbers in a vector and access them when needed.

The operator << is not overloaded by default for the datatype unsigned long long, and a direct overloading can lead to an ambiguity. There is something to be said for not using the self-defined datatype in either a std::vector or an ostream.

No matter what you do, there would be some changes to be made here.

A suggestion is to declare the vector as follows:

C++

std::vector<ull> fibSeq;

Then the recursive function with the following signature:

C++

ull fib(size_t n, std::vector<ull>& fibSeq);

call in a loop up to n:

C++

{ for (size_t i = 1; i <= n; ++i) { cout << " " << fib(i, fibSeq); }