photo

GeeTwo


Last seen: 1日 前 |  2022 年からアクティブ

Followers: 0   Following: 0

Proud father, underwater acoustician, FIRST robotics volunteer, once and future FIRST mentor

Programming Languages:
C++, C, Java, Javascript, MATLAB, SQL, HTML, CSS, Arduino, Shell, Assembly, Fortran
Spoken Languages:
English

統計

All
MATLAB Answers

1 質問
5 回答

Cody

1 問題
761 解答

ランク
8,422
of 302,328

評判
5

コントリビューション
1 質問
5 回答

回答採用率
100.0%

獲得投票数
1

ランク
 of 21,722

評判
N/A

平均評価
0.00

コントリビューション
0 ファイル

ダウンロード
0

ALL TIME ダウンロード
0

ランク
110
of 181,300

コントリビューション
1 問題
761 解答

スコア
11,481

バッジ数
64

コントリビューション
0 投稿

コントリビューション
0 パブリック チャネル

平均評価

コントリビューション
0 ハイライト

平均いいねの数

  • Thankful Level 1
  • Knowledgeable Level 1
  • Creator
  • Combinatorics I Master
  • Cody5 Hard Master
  • Speed Demon
  • Sequences And Series III Master
  • Scholar
  • Promoter
  • Sequences And Series II Master
  • Indexing III Master
  • Computational Geometry I Master

バッジを表示

Feeds

表示方法

解決済み


The Omega Protocol: Hyper-dimensional Navigation and the Singularity Constraint
Description [EMERGENCY TRANSMISSION - GALACTIC COMMAND] Subject: Mission Omega-7 - Navigation through the K-94 Tesseract Anoma...

1日 前

解決済み


Play PRIMEGAME
Have you ever used the Sieve of Eratosthenes and said, "I wonder whether there’s a less efficient way to find prime numbers."? N...

12日 前

解決済み


Construct a prime circle
A <https://mathworld.wolfram.com/PrimeCircle.html prime circle> is a circular arrangement of the numbers 1 to 2n such that pairs...

12日 前

解決済み


Determine digits of the Copeland-Erdos constant
<https://www.mathworks.com/matlabcentral/cody/problems/1477-champernowne-constant/solutions/new Cody Problem 1477> asks us to de...

12日 前

解決済み


Identify primorial primes
Cody Problems <https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial 46054> and <https...

13日 前

解決済み


Find the last non-zero digit in a primorial
<https://www.mathworks.com/matlabcentral/cody/groups/2001/problems/45251 Cody Problem 45251> asked us to find the last non-zero ...

13日 前

解決済み


Count trailing zeros in a primorial
<https://www.mathworks.com/matlabcentral/cody/problems/44068-the-number-of-trailing-zero-digit-of-a-factorial Cody Problem 44068...

13日 前

解決済み


Identify Wagstaff primes
The numbers 3, 43, and 2731 are examples of <https://mathworld.wolfram.com/WagstaffPrime.html Wagstaff primes>. Write a func...

14日 前

解決済み


Identify full reptend primes

14日 前

解決済み


Determine whether a number is a cluster prime
A <https://mathworld.wolfram.com/ClusterPrime.html cluster prime> is an odd prime number _p_ such that all even numbers less tha...

14日 前

解決済み


Investigate the frequency of last digits of prime numbers
The last digit of a prime number greater than 5 can be 1, 3, 7, or 9. If the primes are distributed randomly, then these digits ...

14日 前

解決済み


Compute the nth Naerogahtyp emirp

14日 前

解決済み


Determine RSA keys (public and private) given two prime number character strings (p and q)
Given two prime number character strings (p and q), generate the RSA public and private keys (n and d) with e = 65537. The more ...

8ヶ月 前

問題


Precise Almost Pythagorean Triples
This is essentially the same as: Problem 52834. Easy Sequences 32: Almost Pythagorean Triples; it even presents the same set o...

8ヶ月 前 | 3 | 3 個のソルバー

解決済み


Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...

8ヶ月 前

解決済み


Record the Actions ( Medium )
Find the minimum steps to get T units from jugs A and B. Return the sequence of actions as cell array of strings. Available act...

8ヶ月 前

解決済み


The Broken Jug: Constrain ( Hard )
One of your jugs is "broken": it can not be Emptied to the drain. It can only be Filled or Poured to another jug. Input: C, T, ...

8ヶ月 前

解決済み


The Classic 8-5-3 Sharing ( Medium )
You have 3 jugs with capacities [8,5,3]. The 8L jug, the others are empty: [8,0,0]. There is no tap and no drain. You can only p...

8ヶ月 前

解決済み


Total Volume Goal ( Medium )
Usually, the target T must be in one jug. In this version, the target T is the sum of water in all N jugs. Example: C = [3,5], ...

8ヶ月 前

解決済み


The Ultimate Water Challenge ( Expert )
Description: In the previous problems, you were given a target T and asked to find the minimum number of steps to reach it. ...

8ヶ月 前

解決済み


The Generalized N-Jug Water Pouring Problem ( Hard )
Description: You are given N water jugs with maximum capacities specified in a vector C = [ c1, c2, c3,.., c_n]. Initially, all...

8ヶ月 前

解決済み


Two Jugs: Minimum Steps ( Medium )
Following the first problem, now you need to find the shortest path. Given two jugs with capacities A and B, find the minimum nu...

8ヶ月 前

解決済み


Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...

8ヶ月 前

解決済み


Is it Possible? ( Easy )
In the first part of series, we simplify the problem. Given two jugs with capacities A and B, and a target amount T, determine i...

8ヶ月 前

解決済み


Clueless - Lord Ned in the Game Room with the Technical Computing Language
[Warning: this is a nontrivial programming problem] Worried about the decline in reasoning skills in the clueless populace of...

8ヶ月 前

さらに読み込む