igorich1376

Leciono #3

Aug 6th, 2024 (edited)
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Pascal 0.70 KB | None | 0 0
  1. // лекция 04-08-2024
  2. ##
  3. uses school;
  4. var x := 525;
  5. x.IsPrime.Println;
  6. var d := x.Divisors;
  7. Println(d[1:^1],d[1:^1].Sum );
  8. var f := x.Factorize;
  9. Println(f, f.Distinct)
  10. //
  11. ##
  12. uses school;
  13. var x := 12bi**45 + 23bi**4 - 678;
  14. Println(x,TypeName(x))
  15. {Println(Bin(x), Oct(x), Hex(x));
  16. var t := ToBase(x,2);
  17. Println(t);
  18. var z := '123ABCXYZ';
  19. var d := Dec(z,36);
  20. Println(d);}
  21. //
  22. ## uses school;
  23. var x := 75;
  24. var m := x.Digits(75);
  25. Println(ToBase(x,5), m, m[^2]);
  26. //
  27. ## uses school;
  28. for var i := 250201 to 250800 do
  29.   begin
  30.     var d := i.Divisors[1:^1];
  31.     if d.Count > 0 then
  32.       begin
  33.         var s := d.Min + d.Max;
  34.         if (s mod 123 = 17) then Println(i, s);
  35.       end;
  36.   end;
Advertisement
Add Comment
Please, Sign In to add comment