Submission #74758782

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
38
39
40
41
#include <stdio.h>
int sousa(int x) {
  int res = 0;
  while (x > 0) {
    int d = x % 10;
    x /= 10;
    res += d * d;
  }
  return res;
}
char visited[114514];
int main(void) {
  int N;
  if (scanf("%d", &N) != 1) return 1;
  while (N != 1) {
    if (visited[N]) {
      puts("No");
      return 0;
    }
    visited[N] = 1;
    N = sousa(N);
  }
  puts("Yes");
  return 0;
}
/*
実験の結果、多分244までしかいかない
Python 3.11.4 (tags/v3.11.4:d2340ef, Jun  7 2023, 05:45:37) [MSC v.1934 64 bit (AMD64)] on win32
Type "help", "copyright", "credits" or "license" for more information.
>>> def sousa(x):
...  return sum([int(c) * int(c) for c in str(x)])
...
>>> sousa(2026)
44
>>> m = 0
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int sousa(int x) {
	int res = 0;
	while (x > 0) {
		int d = x % 10;
		x /= 10;
		res += d * d;
	}
	return res;
}

char visited[114514];

int main(void) {
	int N;
	if (scanf("%d", &N) != 1) return 1;
	while (N != 1) {
		if (visited[N]) {
			puts("No");
			return 0;
		}
		visited[N] = 1;
		N = sousa(N);
	}
	puts("Yes");
	return 0;
}

/*

実験の結果、多分244までしかいかない

Python 3.11.4 (tags/v3.11.4:d2340ef, Jun  7 2023, 05:45:37) [MSC v.1934 64 bit (AMD64)] on win32
Type "help", "copyright", "credits" or "license" for more information.
>>> def sousa(x):
...  return sum([int(c) * int(c) for c in str(x)])
...
>>> sousa(2026)
44
>>> m = 0
>>> for i in range(1, 2026 + 1):
...  v = i
...  for _ in range(10000):
...   v = sousa(v)
...   m = max(v, m)
...
>>> m
244
>>>

*/

Submission Info

Judge Result