-
-
Save makaliuk/89be3fbaaedcd78da398ffbb0c4f9e5c to your computer and use it in GitHub Desktop.
Makaliuk Maxim 1
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
сложн ( ̄ー ̄) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package com.company; | |
public class Main { | |
public static void main(String[] args) { | |
int i = 1; | |
while (i < 7) { | |
System.out.println( "I will adopt best practices "); | |
i++; | |
} | |
}} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package com.company; | |
public class Main { | |
public static void main(String args[]){ | |
for (int i = 0; i <= 10; i = i + 2) { | |
System.out.print(i + " "); | |
} | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package com.company; | |
public class Main { | |
public static void main(String args[]){ | |
for (int i = 0; i <= 20; i = i + 2) { | |
System.out.print(i + " "); | |
} | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package com.company; | |
public class Main { | |
public static void main(String args[]){ | |
int[] intArr = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; | |
for (int i=0; i< intArr.length; i++){ | |
if(intArr[i] % 3 == 0){ | |
System.out.print(intArr[i] + " "); | |
} | |
} | |
} } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment