UVa Online Judge Challenge "10110"

“There is man named ”mabu” for switching on-off light in our University. He switches on-off the lights in a corridor. Every bulb has its own toggle switch. That is, if it is pressed then the bulb turns on. Another press will turn it off. To save power consumption (or may be he is mad or something else) he does a peculiar thing. If in a corridor there is n bulbs, he walks along the corridor back and forth n times and in i-th walk he toggles only the switches whose serial is divisable by i. He does not press any switch when coming back to his initial position. A i-th walk is defined as going down the corridor (while doing the peculiar thing) and coming back again. Now you have to determine what is the final condition of the last bulb. Is it on or off?”

Java #uva #coding challenge

Problem

My Solution

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		while (sc.hasNext()) {

			boolean light = true;
			long n = sc.nextLong();

			if (n == 0) {
				System.exit(0);
			}

			long a = Math.round(Math.sqrt(n));

			if ((a * a) == n) {
				light = true;
			} else {
				light = false;
			}

			if (light) {
				System.out.println("yes");
			} else {
				System.out.println("no");
			}

		}
	}
}

Related entries

Selected from shared tags, categories, and nearby entries in the same section.

Problem

My Solution

Related entries

Troubleshooting N-Central Take Control

k-means Clustering

Blending Textures With Open Simplex Noise

Cube Wave

Connected Memory