1) If we want the same $C$ for all $A$:
1.a) If $B$ is singular ($\det(B)=0$) then there exists a matrix $V$ such that $BV=0$ ($B$ has $0$ as eigenvalue; pick $V=(v\ v \ \ldots \ v)$ with $v$ an eigenvector for $0$). Then with $C:=I+V$ we have
$$\text{trace}(AB(I+V))=\text{trace}(ABI)+\text{trace}(ABV)=\text{trace}(AB).$$
1.b) If $B$ is regular it is impossible. Consider $A:=XB^{-1}$ with $X$ any matrix. Then
$$\text{trace}(XC)=\text{trace}(ABC)=\text{trace}(AB)=\text{trace}(X),$$
so $\sum_{i=1}^n\sum_{j=1}^n x_{ij}c_{ji} - \sum_{i=1}^n x_{ii}=0$ for every matrix $X$, which implies $C=I$ by considering the elementary matrices $X=E_{ij}$.
2) If we allow $C$ to depend on $A$:
If the diagonal of $AB$ is not full of zeros then we can always choose a diagonal $D\neq I$ such that trace$(ABD)=$trace$(AB)$. For example, if $AB_{n,n}\neq 0$ pick $D=$diag$(0,\ldots,0,$trace$(AB))$. Otherwise, pick $P$ invertible such that $PABP^{-1}$ has some nonzero diagonal element and pick $D$ for this matrix. Then, with $C:=P^{-1}DP$,
$$\text{trace}(ABP^{-1}DP)=\text{trace}(PABP^{-1}D)=\text{trace}(PABP^{-1})=\text{trace}(AB).$$