제출 #82162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
82162		Just_Solve_The_Problem	Beautiful row (IZhO12_beauty)	C++11	0 / 100	2076 ms	576 KiB

beauty

#include <stdio.h>
#include <algorithm>

using namespace std;

#define ll long long

int a[22];
int n;

int get(int x) {
	int res = 0;
	while (x) {
		res += (x % 3 == 1);
		x /= 3;
	}
	return res;
}

int get1(int x) {
	int res = 0;
	while (x) {
		res += (x % 2 == 1);
		x /= 2;
	}
	return res;
}

main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	sort(a + 1, a + n + 1);
	int ans = 0;
	do {
		int ok = 1;
		for (int i = 1; i < n; i++) {
			ok &= (get1(a[i]) == get1(a[i + 1]) || get(a[i]) == get(a[i + 1]));
		}
		ans += ok;
	} while(next_permutation(a + 1, a + n + 1));
	printf("%d", ans);
}

컴파일 시 표준 에러 (stderr) 메시지

beauty.cpp:29:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
beauty.cpp: In function 'int main()':
beauty.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
beauty.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

• Subtask 1: 0 / 100