HADİ EN SON KİM MESAJ ATACAK BU TOPİCE (1865. sayfa)

Write("From: "); 
              var from = int.Parse(ReadLine()); 
              Write("To: "); 
              var to = int.Parse(ReadLine()); 
              Write("Number 1: "); 
              var n1 = int.Parse(ReadLine()); 
              Write("Number 2: "); 
              var n2 = int.Parse(ReadLine()); 
   
              if (n1 > n2) 
              { 
                  var t = n1; 
                  n1 = n2; 
                  n2 = t; 
              } 
   
              var k1 = new List<int>(); 
              var k2 = new List<int>(); 
              var ekok = 1; 
              var count = 0; 
   
              for(int i = 1; i <= n1; i++) 
              { 
                  k1.Add(i * n1); 
                  k2.Add(i * n2); 
              } 
   
              for (int i = n1 + 1; i <= n2; i++) 
                  k2.Add(i * n2); 
   
              foreach (int k in k2) 
                  if (k1.Contains(k) && ekok == 1) 
                      ekok = k; 
   
              var mod = from % ekok; 
              if (mod != 0) 
                  count += n1 - mod; 
   
              for (int i = from + ekok - mod; i <= to; i += ekok) 
                  count += count + n1 <= to ? n1 : to - i; 
   
              WriteLine($"Count: {count}"); 
              ReadKey();

            var from = 100; 
              var to = 200; 
              var n1 = 6; 
              var n2 = 8; 
              var k1 = new List<int>(); 
              var k2 = new List<int>(); 
              var ekok = 1; 
              var count = 0; 
              for (int i = 1; i <= n1; i++) 
              { 
                  k1.Add(i * n1); 
                  k2.Add(i * n2); 
              } 
              for (int i = n1 + 1; i <= n2; i++) 
                  k2.Add(i * n2); 
              foreach (int k in k2) 
                  if (k1.Contains(k) && ekok == 1) 
                      ekok = k; 
              var mod = from % ekok; 
              if (mod != 0) 
                  count += n1 - mod; 
              for (int i = from + ekok - mod; i <= to; i += ekok) 
                  count += count + n1 <= to ? n1 : to - i; 
              WriteLine($"Count: {count}"); 
              ReadKey();

X=100:200; Y=X; 
  S=0;  K(1)=0; k=1; 
  for i=1:length(X) 
       for j=(1:length(Y)) 
             if( 0.06*X(i)==0.08*Y(j)) 
                S=S+1; 
                K(k)=X(i); 
                K1(k)=Y(j); 
                k=k+1; 
             end 
       end 
  end

K = 
   
     136   140   144   156   160   164   168   172   188   192   196   200 
   
  >> K1 
   
  K1 = 
   
     102   105   108   117   120   123   126   129   141   144   147   150