Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
How many Squares in Rectangle
import java.util.Scanner ; class Rextester { static final int WIDTH = 543 ; static final int HEIGHT = 130 ; public static void main( String args[] ) { Scanner in = new Scanner( System.in ) ; int a = in.nextInt() ; int n = 0 ; if ( ( a <= HEIGHT ) && ( a <= WIDTH ) ) n = ( HEIGHT / a ) * ( WIDTH / a ) ; System.out.println( n ) ; } }
run
|
edit
|
history
|
help
0
test
2(B).
get top k frequent elements ( Priority Queue implementation )
Problem_binary
Basic LinkedList in Java
test1
jb12.0 threads.enums
Item battle rolyal
Project Euler #2
Graph adjacency list representation