Example
#{example}"); ipb.editor_values.get('templates')['togglesource'] = new Template(""); ipb.editor_values.get('templates')['toolbar'] = new Template(""); ipb.editor_values.get('templates')['button'] = new Template("
Emoticons
"); // Add smilies into the mix ipb.editor_values.set( 'show_emoticon_link', false ); ipb.editor_values.set( 'bbcodes', $H({"snapback":{"id":"1","title":"Post Snap Back","desc":"This tag displays a little linked image which links back to a post - used when quoting posts from the board. Opens in same window by default.","tag":"snapback","useoption":"0","example":"[snapback]100[/snapback]","switch_option":"0","menu_option_text":"","menu_content_text":"","single_tag":"0","optional_option":"0","image":""},"topic":{"id":"5","title":"Topic Link","desc":"This tag provides an easy way to link to a topic","tag":"topic","useoption":"1","example":"[topic=1]Click me![/topic]","switch_option":"0","menu_option_text":"Enter the topic ID","menu_content_text":"Enter the title for this link","single_tag":"0","optional_option":"0","image":""},"post":{"id":"6","title":"Post Link","desc":"This tag provides an easy way to link to a post.","tag":"post","useoption":"1","example":"[post=1]Click me![/post]","switch_option":"0","menu_option_text":"Enter the Post ID","menu_content_text":"Enter the title for this link","single_tag":"0","optional_option":"0","image":""},"spoiler":{"id":"7","title":"Spoiler","desc":"Spoiler tag","tag":"spoiler","useoption":"0","example":"[spoiler]Some hidden text[/spoiler]","switch_option":"0","menu_option_text":"","menu_content_text":"Enter the text to be masked","single_tag":"0","optional_option":"0","image":""},"acronym":{"id":"8","title":"Acronym","desc":"Allows you to make an acronym that will display a description when moused over","tag":"acronym","useoption":"1","example":"[acronym='Laugh Out Loud']lol[/acronym]","switch_option":"0","menu_option_text":"Enter the description for this acronym (EG: Laugh Out Loud)","menu_content_text":"Enter the acronym (EG: lol)","single_tag":"0","optional_option":"0","image":""},"hr":{"id":"12","title":"Horizontal Rule","desc":"Adds a horizontal rule to separate text","tag":"hr","useoption":"0","example":"[hr]","switch_option":"0","menu_option_text":"","menu_content_text":"","single_tag":"1","optional_option":"0","image":""},"php":{"id":"14","title":"PHP Code","desc":"Allows you to enter PHP code into a formatted/highlighted syntax box","tag":"php","useoption":"0","example":"[php]$variable = true;\n\nprint_r($variable);[/php]","switch_option":"0","menu_option_text":"","menu_content_text":"","single_tag":"0","optional_option":"0","image":""},"html":{"id":"15","title":"HTML Code","desc":"Allows you to enter formatted/syntax-highlighted HTML code","tag":"html","useoption":"0","example":"[html]\n \n[/html]","switch_option":"0","menu_option_text":"","menu_content_text":"","single_tag":"0","optional_option":"0","image":""},"sql":{"id":"16","title":"SQL Code","desc":"Allows you to enter formatted/syntax-highlighted SQL code","tag":"sql","useoption":"0","example":"[sql]SELECT p.*, t.* FROM posts p LEFT JOIN topics t ON t.tid=p.topic_id WHERE t.tid=7[/sql]","switch_option":"0","menu_option_text":"","menu_content_text":"","single_tag":"0","optional_option":"0","image":""},"xml":{"id":"17","title":"XML Code","desc":"Allows you to enter formatted/syntax-highlighted XML code","tag":"xml","useoption":"0","example":"[xml]5 Replies - 51 Views - Last Post: Today, 10:29 AM
#1
Reputation: 0
- Posts: 3
- Joined: Today, 09:53 AM
Posted Today, 09:58 AM
I'm on a book exercise Java-Illuminated-Learning-Approach, it asks me to test whether a given array is a magic square or not, my problem is that I don't know how to do the diagonal code, I re-read the book and it has nothing about it, I already implied that idea that it must be a box, and the columns and rows sum must be the same, Here's my code so far:public static boolean magicSquare(int[][] a) { int sum=0; int lastSum=0; for (int i=0; i< a.length; i++) { if (a.length!=a[i].length) { return false; } } for (int i=0; i < a[0].length; i++) { sum=0; for (int j=0; j < a.length; j++) { sum+=a[i][j]; } if (i==0) { lastSum=sum; } else if (lastSum!=sum) { return false; } } for (int i=0; i < a[0].length; i++) { sum=0; for (int j=0; j < a.length; j++) { sum+=a[j][i]; } if (i==0) { lastSum=sum; } else if (lastSum!=sum) { return false; } } return true; }
And here's my array:
int[][] array = { {2,7,6},{9,5,1},{4,3,8} };
that I pass.
Thanks
Is This A Good Question/Topic? 0
Replies To: Java MagicSquare, How to check if a multi-array is actually Magic
#2
Reputation: 1991
- Posts: 4,846
- Joined: 10-September 10
Re: Java MagicSquare, How to check if a multi-array is actually Magic
Posted Today, 10:11 AM
What do you mean, you "don't know how to do the diagonal code?"
#3
Reputation: 0
- Posts: 3
- Joined: Today, 09:53 AM
Re: Java MagicSquare, How to check if a multi-array is actually Magic
Posted Today, 10:13 AM
GregBrannon, on 28 May 2013 - 10:11 AM, said:
What do you mean, you "don't know how to do the diagonal code?"
I need to find the sum of the diagonal numbers, for ex;
1 2 3
4 5 6
7 8 9
the answer is 1 + 5 + 9 = 15
I know the logic but I can't implement it in anyway
#4
Reputation: 6498
- Posts: 23,625
- Joined: 12-June 08
Re: Java MagicSquare, How to check if a multi-array is actually Magic
Posted Today, 10:20 AM
Think about it logically. If your first index in the multi-d array is the row, and the second is the column you can easily push through an array by starting at 0,0... then next would be 1,1... then next would be 2,2.. etc.0 1 2 -- -- -- 0 | 1 2 3 1 | 4 5 6 2 | 7 8 9
#5
Reputation: 1991
- Posts: 4,846
- Joined: 10-September 10
Re: Java MagicSquare, How to check if a multi-array is actually Magic
Posted Today, 10:20 AM
In an array[i, j], the diagonal you've highlighted is all terms where i = j. You can create a pretty simple loop to find those elements and sum them. How many loops does it take?
#6
Reputation: 0
- Posts: 3
- Joined: Today, 09:53 AM
Re: Java MagicSquare, How to check if a multi-array is actually Magic
Posted Today, 10:29 AM
I was able to solve it by my self, I won't provide the code but you need two for loops one for going southeast and one for going southwest.. Thanks folks
Page 1 of 1
wwdc madden 13 cover dalai lama tamera mowry slow jam the news madden cover obama slow jams the news
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.