Trial software

DHARMASETYA dharmasetya

11988

11988

Rank

2

2

Badges

270

270

Score

View Community Profile

1 – 28 of 28

DHARMASETYA dharmasetyasubmitted解决方案1243388toProblem 33. Create times-tables

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243382toProblem 48. Making change

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243378toProblem 39. Which values occur exactly three times?

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243376toProblem 30. Sort a list of complex numbers based on far they are from the origin.

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243374toProblem 9. Who Has the Most Change?

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243369toProblem 25. Remove any row in which a NaN appears

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243354toProblem 28. Counting Money

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243335toProblem 23. Finding Perfect Squares

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243331toProblem 106. Weighted average

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243329toProblem 12. Fibonacci sequence

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243321toProblem 19. Swap the first and last columns

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted aCommentto解决方案1243318

MANTAP JAYA!!!!!!!!!!

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243318toProblem 4. Make a checkerboard matrix

on 1 Aug 2017

DHARMASETYA dharmasetyasubmitted解决方案1243317toProblem 17. Find all elements less than 0 or greater than 10 and replace them with NaN

on 1 Aug 2017

DHARMASETYA dharmasetyareceivedCommenterbadge for解决方案1243270

on 31 Jul 2017

DHARMASETYA dharmasetyasubmitted aCommentto解决方案1243270

function [index1, index2] = nearestNumbers(A) s=[1,1,Inf]; for i = 1:length(A)-1 for j= 1:length(A)-i s1=[i,i+j,abs(A(i)-A(i+j))]; if s1(3)

on 31 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1243270toProblem 29. Nearest Numbers

on 31 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239946toProblem 10. Determine whether a vector is monotonically increasing

on 26 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239933toProblem 7. Column Removal

on 26 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239930toProblem 20. Summing digits

on 26 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239922toProblem 5. Triangle Numbers

on 26 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239921toProblem 6. Select every other element of a vector

on 26 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239919toProblem 26. Determine if input is odd

on 26 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239116toProblem 2. Make the vector [1 2 3 4 5 6 7 8 9 10]

on 25 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239115toProblem 3. Find the sum of all the numbers of the input vector

on 25 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239098toProblem 8. Add two numbers

on 25 Jul 2017

DHARMASETYA dharmasetyareceivedSolverbadge for解决方案1239082

on 25 Jul 2017

DHARMASETYA dharmasetyasubmitted解决方案1239082toProblem 1. Times 2 - START HERE

on 25 Jul 2017

1 – 28 of 28

Trial software