diff options
| author | Mohammad Sajid Anwar <Mohammad.Anwar@yahoo.com> | 2024-01-16 19:46:31 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-01-16 19:46:31 +0000 |
| commit | f29b6691f71e0dd071eb0668a2e5e2f0cb8077de (patch) | |
| tree | c0890836544be7360a1dcfe463c611746633eadc /challenge-252/luca-ferrari/java | |
| parent | f5349696fd043be2b23e915bf0d869f4966a819b (diff) | |
| parent | 65a2d0d671dfe4c0ce3e2664b6ac7abce8f0856c (diff) | |
| download | perlweeklychallenge-club-f29b6691f71e0dd071eb0668a2e5e2f0cb8077de.tar.gz perlweeklychallenge-club-f29b6691f71e0dd071eb0668a2e5e2f0cb8077de.tar.bz2 perlweeklychallenge-club-f29b6691f71e0dd071eb0668a2e5e2f0cb8077de.zip | |
Merge pull request #9414 from fluca1978/PWC252
PWC 252
Diffstat (limited to 'challenge-252/luca-ferrari/java')
| -rw-r--r-- | challenge-252/luca-ferrari/java/ch_1.java | 13 | ||||
| -rw-r--r-- | challenge-252/luca-ferrari/java/ch_2.java | 40 |
2 files changed, 53 insertions, 0 deletions
diff --git a/challenge-252/luca-ferrari/java/ch_1.java b/challenge-252/luca-ferrari/java/ch_1.java new file mode 100644 index 0000000000..c903dfbb88 --- /dev/null +++ b/challenge-252/luca-ferrari/java/ch_1.java @@ -0,0 +1,13 @@ +public class ch_1 { + public static void main( String argv[] ) { + int sum = 0; + for ( int i = 0; i < argv.length; i++ ) { + if ( argv.length % ( i + 1 ) != 0 ) + continue; + + sum += Math.pow( Integer.parseInt( argv[ i ] ), 2 ); + } + + System.out.println( sum ); + } +} diff --git a/challenge-252/luca-ferrari/java/ch_2.java b/challenge-252/luca-ferrari/java/ch_2.java new file mode 100644 index 0000000000..5a4b46083a --- /dev/null +++ b/challenge-252/luca-ferrari/java/ch_2.java @@ -0,0 +1,40 @@ +import java.util.*; + +public class ch_2 { + public static void main( String argv[] ) throws Exception { + int size = Integer.parseInt( argv[ 0 ] ); + + if ( size <= 3 ) + throw new Exception( "Cannot work with a size less than 3!" ); + + List<Integer> nums = new LinkedList<Integer>(); + + + if ( size % 2 == 0 ) { + for ( int i = 1; i < size / 2 ; i++ ) { + nums.add( i ); + nums.add( i * -1 ); + } + } + else { + for ( int i = 1; i < ( size - 1 ) / 2 ; i++ ) { + nums.add( i ); + nums.add( i * -1 ); + } + + int next = ( size - 1 ) / 2 + 1; + nums.add( next ); + nums.add( next + 1 ); + nums.add( ( next * 2 + 1 ) * -1 ); + } + + + boolean printedOne = false; + for ( int i : nums ) { + System.out.print( i + ( printedOne ? ", " : "" ) ); + printedOne = true; + } + + System.out.println(); + } +} |
