monika.leslivania
BAN USERusing System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Test
{
internal class SubstringAddition
{
public static void Main(string[] args) {
string[] numbers = Console.ReadLine().Trim().Split(" ");
int sum = Convert.ToInt32(Console.ReadLine().Trim());
string result = Total(numbers, sum);
Console.WriteLine(result);
}
public static string Total(string[] numbers, int sum) {
int total = 0;
int lowerBoundIdx = 0;
for (int i = 0; i < numbers.Length - 1; i++) {
total += Convert.ToInt32(numbers[i]);
if (total == sum)
{
return "(" + Convert.ToString(lowerBoundIdx + 1) + "-" + Convert.ToString(i + 1) + ")";
}
if (total > sum) {
total = total - Convert.ToInt32(numbers[lowerBoundIdx]);
lowerBoundIdx ++;
if (total == sum)
{
return "(" + Convert.ToString(lowerBoundIdx + 1) + "-" + Convert.ToString(i + 1) + ")";
}
}
}
return "(not found)";
}
}
}
C# solution. any comments are welcome:
using System;
namespace Test
{
public class CareerCup
{
public static void Main(string[] args)
{
string n = Console.ReadLine().Trim();
lookAndSay(n, 10);
}
public static void lookAndSay(string n, int repetition) {
for (int i = 0; i < repetition; i++) {
if (n != "0" && n!="")
{
n = spellTheNumbers(n);
Console.WriteLine(n); ;
}
else
{
break;
}
}
}
public static string spellTheNumbers(string number) {
string result = "";
int counter = 1;
for (int i = 0; i < number.Length; i++) {
if (i > 0 && number[i] == number[i - 1])
{
counter++;
}
if (i > 0 && number[i] != number[i - 1])
{
result += Convert.ToString(counter) + Convert.ToString(number[i - 1]);
counter = 1;
}
if (i == number.Length - 1)
{
result += Convert.ToString(counter) + Convert.ToString(number[i]);
counter = 1;
}
}
return result;
}
}
}
C# solution
- monika.leslivania January 03, 2023