Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
std::vector<std::vector<int>> combination(int n) { std::vector<std::vector<int>> dp(n + 1, std::vector<int>(n + 1, 0)); for (int i = 0; i <= n; ++i) { dp[i][0] = 1; // C(n, 0) = 1 dp[i][i] = 1; // C(n, n) = 1 } for (int i = 1; i <= n; ++i) { for (int j = 1; j < i; ++j) { dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]; } } return dp; } glm::vec2 CalculateBezierPoint( std::span<glm::vec2> points, float const t) { // your code here: glm::vec2 result = glm::vec2 {0, 0}; int n = static_cast<int>(points.size()) - 1; auto comb = combination(n); for (int i = 0; i <= n; ++i) { float coeff = static_cast<float>(comb[n][i]) * std::pow(t, i) * std::pow(1 - t, n - i); result += coeff * points[i]; } return result; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
