/
Peter.cs
94 lines (73 loc) · 2.42 KB
/
Peter.cs
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace SPOJ
{
class Peter
{
public static Boolean isPalindrome(String number)
{
char[] numberAsArray = number.ToArray();
int arrayLength = numberAsArray.Length;
int numberLength = arrayLength-1;
double halfOfArrayLength = ((arrayLength) / 2);
int halfOfArrayLengthCeilled = (int)Math.Ceiling(halfOfArrayLength);
for (int i = 0; i < halfOfArrayLengthCeilled; i++, numberLength--)
{
if(!isSameNumber(numberAsArray[i], numberAsArray[numberLength])){
return false;
}
if(isMoreThanHalfChecked(numberLength, i))
{
break;
}
}
return true;
}
private static Boolean isSameNumber(char value1, char value2){
if (value1 == value2)
{
return true;
}
return false;
}
private static Boolean isMoreThanHalfChecked(int numberLength, int currentPosition)
{
if (numberLength < currentPosition)
{
return true;
}
return false;
}
public static String reverseNumber(String number)
{
char[] numberAsArray = number.ToArray();
int numberLength = numberAsArray.Length - 1;
String reverseNumber = null;
for(int i = numberLength; i >= 0; i--){
reverseNumber += numberAsArray[i];
}
return reverseNumber;
}
public static String makeAddition(String number, String reverseNumber)
{
int result = int.Parse(number) + int.Parse(reverseNumber);
return result.ToString();
}
static void Main(string[] args)
{
String input = Console.ReadLine();
int numberOfAdditions = 0;
String reversedNumber;
while (!isPalindrome(input))
{
reversedNumber = reverseNumber(input);
input = makeAddition(input, reversedNumber);
numberOfAdditions++;
}
Console.Write(input + " " + numberOfAdditions);
}
}
}