Submission #74778757

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <stdio.h>
int cnt[11234567];
int main(void) {
  int N;
  int x, y;
  int i, k = 0, first = 1;
  if (scanf("%d", &N) != 1) return 1;
  for (x = 1; x * x <= N; x++) {
    for (y = x + 1; x * x + y * y <= N; y++) {
      cnt[x * x + y * y]++;
    }
  }
  for (i = 1; i <= N; i++) {
    if (cnt[i] == 1) k++;
  }
  printf("%d\n", k);
  for (i = 1; i <= N; i++) {
    if (cnt[i] == 1) {
      printf(" %d" + first, i);
      first = 0;
    }
  }
  putchar('\n');
  return 0;
}
/*
Numbers that are the sum of 2 distinct nonzero squares in exactly 1 way.
https://oeis.org/A025302
→ いっぱいある あまり役に立たなそう
*/
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int cnt[11234567];

int main(void) {
	int N;
	int x, y;
	int i, k = 0, first = 1;
	if (scanf("%d", &N) != 1) return 1;
	for (x = 1; x * x <= N; x++) {
		for (y = x + 1; x * x + y * y <= N; y++) {
			cnt[x * x + y * y]++;
		}
	}
	for (i = 1; i <= N; i++) {
		if (cnt[i] == 1) k++;
	}
	printf("%d\n", k);
	for (i = 1; i <= N; i++) {
		if (cnt[i] == 1) {
			printf(" %d" + first, i);
			first = 0;
		}
	}
	putchar('\n');
	return 0;
}

/*

Numbers that are the sum of 2 distinct nonzero squares in exactly 1 way.
https://oeis.org/A025302

→ いっぱいある あまり役に立たなそう

*/

Submission Info

Judge Result