fork(1) download
copy 
  1. #include <iostream>
  2. using namespace std;
  3. int main () {
  4. 	long long N;
  5. 	cin >> N ;
  6. 	long long num = N;
  7. 	int divisorCount = 1;
  8. 	for ( long long i = 2; i *i <= num ; i ++) {
  9. 		int factorCount = 0;
  10. 		while ( num % i == 0) {
  11. 			factorCount ++;
  12. 			num /= i ;
  13. 		}
  14. 		divisorCount *= (1 + factorCount );
  15. 		if(factorCount > 0)
  16. 			cout << "i: " << i << ", num: " << num << ", divisorCount: " << divisorCount << endl;
  17. 	}
  18. 	if ( num > 1) { // Sisa faktor
  19. 		divisorCount *= 2;
  20. 	}
  21. 	cout << "divisorCount: " << divisorCount << endl;
  22. 	if ( divisorCount % 2 == 0) {
  23. 		cout << " lampu ␣ mati " << endl ;
  24. 	} else {
  25. 		cout << " lampu ␣ menyala " << endl ;
  26. 	}
  27. }
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin
copy 
2020
stdout
copy 
i: 2, num: 505, divisorCount: 3
i: 5, num: 101, divisorCount: 6
divisorCount: 12
 lampu ␣ mati
https://ideone.com/QcUHQ2
language:
C++ (gcc 8.3)
created:
13 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!