C++

C++

C++ is a general-purpose programming language. It was originally designed as an extension to C, and keeps a similar syntax, but is now a completely different language.
Python  Library

Python Library

1661881620

Pybind11: Seamless Operability Between C++ and Python

pybind11

Setuptools exampleScikit-build exampleCMake example

pybind11 is a lightweight header-only library that exposes C++ types in Python and vice versa, mainly to create Python bindings of existing C++ code. Its goals and syntax are similar to the excellent Boost.Python library by David Abrahams: to minimize boilerplate code in traditional extension modules by inferring type information using compile-time introspection.

The main issue with Boost.Python—and the reason for creating such a similar project—is Boost. Boost is an enormously large and complex suite of utility libraries that works with almost every C++ compiler in existence. This compatibility has its cost: arcane template tricks and workarounds are necessary to support the oldest and buggiest of compiler specimens. Now that C++11-compatible compilers are widely available, this heavy machinery has become an excessively large and unnecessary dependency.

Think of this library as a tiny self-contained version of Boost.Python with everything stripped away that isn't relevant for binding generation. Without comments, the core header files only require ~4K lines of code and depend on Python (3.6+, or PyPy) and the C++ standard library. This compact implementation was possible thanks to some of the new C++11 language features (specifically: tuples, lambda functions and variadic templates). Since its creation, this library has grown beyond Boost.Python in many ways, leading to dramatically simpler binding code in many common situations.

Tutorial and reference documentation is provided at pybind11.readthedocs.io. A PDF version of the manual is available here. And the source code is always available at github.com/pybind/pybind11.

Core features

pybind11 can map the following core C++ features to Python:

  • Functions accepting and returning custom data structures per value, reference, or pointer
  • Instance methods and static methods
  • Overloaded functions
  • Instance attributes and static attributes
  • Arbitrary exception types
  • Enumerations
  • Callbacks
  • Iterators and ranges
  • Custom operators
  • Single and multiple inheritance
  • STL data structures
  • Smart pointers with reference counting like std::shared_ptr
  • Internal references with correct reference counting
  • C++ classes with virtual (and pure virtual) methods can be extended in Python

Goodies

In addition to the core functionality, pybind11 provides some extra goodies:

  • Python 3.6+, and PyPy3 7.3 are supported with an implementation-agnostic interface (pybind11 2.9 was the last version to support Python 2 and 3.5).
  • It is possible to bind C++11 lambda functions with captured variables. The lambda capture data is stored inside the resulting Python function object.
  • pybind11 uses C++11 move constructors and move assignment operators whenever possible to efficiently transfer custom data types.
  • It's easy to expose the internal storage of custom data types through Pythons' buffer protocols. This is handy e.g. for fast conversion between C++ matrix classes like Eigen and NumPy without expensive copy operations.
  • pybind11 can automatically vectorize functions so that they are transparently applied to all entries of one or more NumPy array arguments.
  • Python's slice-based access and assignment operations can be supported with just a few lines of code.
  • Everything is contained in just a few header files; there is no need to link against any additional libraries.
  • Binaries are generally smaller by a factor of at least 2 compared to equivalent bindings generated by Boost.Python. A recent pybind11 conversion of PyRosetta, an enormous Boost.Python binding project, reported a binary size reduction of 5.4x and compile time reduction by 5.8x.
  • Function signatures are precomputed at compile time (using constexpr), leading to smaller binaries.
  • With little extra effort, C++ types can be pickled and unpickled similar to regular Python objects.

Supported compilers

  1. Clang/LLVM 3.3 or newer (for Apple Xcode's clang, this is 5.0.0 or newer)
  2. GCC 4.8 or newer
  3. Microsoft Visual Studio 2017 or newer
  4. Intel classic C++ compiler 18 or newer (ICC 20.2 tested in CI)
  5. Cygwin/GCC (previously tested on 2.5.1)
  6. NVCC (CUDA 11.0 tested in CI)
  7. NVIDIA PGI (20.9 tested in CI)

About

This project was created by Wenzel Jakob. Significant features and/or improvements to the code were contributed by Jonas Adler, Lori A. Burns, Sylvain Corlay, Eric Cousineau, Aaron Gokaslan, Ralf Grosse-Kunstleve, Trent Houliston, Axel Huebl, @hulucc, Yannick Jadoul, Sergey Lyskov Johan Mabille, Tomasz Miąsko, Dean Moldovan, Ben Pritchard, Jason Rhinelander, Boris Schäling, Pim Schellart, Henry Schreiner, Ivan Smirnov, Boris Staletic, and Patrick Stewart.

We thank Google for a generous financial contribution to the continuous integration infrastructure used by this project.

Contributing

See the contributing guide for information on building and contributing to pybind11.

Download details:

Author: pybind
Source code: https://github.com/pybind/pybind11 
License: View license

#python #cpluplus 

Pybind11: Seamless Operability Between C++ and Python
Minh  Nguyet

Minh Nguyet

1661255400

Hơn 300 Giải Pháp Thách Thức Mã Hóa Hàng đầu (C ++ / Python / Java)

Giới thiệu

Khi tìm việc, điều đầu tiên mà ai đó có thể nói với bạn là: 'Thực hành các thuật toán và cấu trúc dữ liệu'. Nhiều trang web chuẩn bị phỏng vấn như Leetcode, GeeksForGeeks, Coderbyte, HackerRank và các trang web khác, cung cấp hàng nghìn câu hỏi và đặc biệt là ngay từ đầu, bạn có thể không giải được ngay cả những câu hỏi dễ và nghi ngờ về bản thân.

Trong bài viết này, bạn sẽ tìm thấy hơn 300 giải pháp thách thức mã hóa đầu tiên của tôi từ các vấn đề mã hóa được tìm thấy trong GeeksForGeeks và leetCode.

Mục tiêu của tôi trong bài viết này là cung cấp một danh sách các bài tập (từ câu hỏi dễ đến khó) mà bạn cần giải quyết trước đó để tập trung vào các câu hỏi khó hơn, hoặc lọc các bài tập lập trình cạnh tranh theo công ty mà bạn đã ứng tuyển. Bằng cách nghiên cứu và giải quyết tất cả các thách thức về mã hóa bên dưới, bạn biết rằng bạn đã đạt được đủ nền tảng cho không gian trong nhiều thuật toán và cấu trúc dữ liệu mà không bị mất các khái niệm cơ bản mà bạn có thể thấy là không quan trọng.

Thuật toán và cấu trúc dữ liệu

Các nguyên tắc cơ bản về lập trình

  1. NameSolutionStrongesth hàng xóm C ++

2. Các kiểu dữ liệu trong Java Java

3. Phần tử lớn nhất trong mảng Python

4. Bắt đầu viết mã Java

5. Chia chuỗi C ++

6. Tổng các chữ số C ++

7. Lẻ hoặc thậm chí C ++

8. Palindrome C ++

9. Nghĩa là C ++

10. Kiểm tra trạng thái - Python

11. Số lượng ký tự trong trường hợp lạc đà C ++

12. Tổng các phần tử ma trận C ++

13. Phép cộng hai số C ++

14. Tách Python đầu vào

15. Lấy Python đầu vào

16. Là và trong toán tử Python

17. Đối với Python Python vòng lặp

18. Vòng lặp while trong Python Python

19. Python in nhiều lần- python

20. Sep và End Python

21. Toán tử logic Python

22. Sep -Space riêng Python

23. Bình luận bằng Python Python

24. Mèo và mũ Trăn

25. Đối với Python loop2 (index jumper)

26. Các toán tử trong Python Python

27. Nhảy qua trong khi Python

28. Ste p-by-step-condition C ++

29. Học Bình luận C ++

30. In từ 1 đến N bằng cách sử dụng đệ quy C ++

31. Hoán đổi các đối tượng C ++

32. Cập nhật mảng theo chỉ mục C ++

33. Bảng in While Loop C ++

34. Dòng mới C ++

35. Kiểm tra nguyên tố C ++

36. Nhận phần tử mảng tại chỉ mục C ++

37. Đếm nhỏ hơn x C ++

38. Đếm lớn hơn x C ++

39. Đếm C ++ lớn hơn ngay lập tức

40. Tổng các phần tử mảng C ++

41. Lấy đầu vào C ++

42. Các toán tử logic C ++

43. Toán tử bitwise C ++

44. C ++ chẵn lẻ

45. data tpes C ++

46. ​​Tìm C ++ tốt

47. Nguyên âm đảo ngược - cải tiến C ++

48. Giá trị bằng giá trị chỉ mục C ++

49. Lớn hơn 3 số C ++ C ++ nguyên tố đầy đủ

Mảng hoặc vectơ

  1. NameSolutionSum của mảng C ++

2. Tần suất của các phần tử mảng C ++

3. Bảng cửu chương C ++

4. Tích số tối đa trong mảng đầu tiên và tối thiểu trong C ++ thứ hai

5. Ít nhất hai phần tử lớn hơn C ++

6. Mảng C ++ (in một phần tử) Đặt mảng 2Sub với tổng cho trước (in phạm vi chỉ số của mảng con) C ++

7. Tổng các phần tử mảng-2 C ++

8. Mảng C ++ (Tổng mảng) Đặt 1 Số 1 trong mảng được sắp xếp C ++

9. Tìm kiếm trong mảng đã sắp xếp C ++

10. Chèn vào cuối mảng C ++

11. Điểm cân bằng C ++

12. Chỉ mục bên trái C ++

13.Kiểm tra xem một mảng có được sắp xếp C ++ hay không

14. In các phần tử thay thế của một mảng C ++

15. Số lần xuất hiện C ++ C ++

16. Trung vị của hai mảng C ++

17. Thiếu số trong một mảng C ++

18. Sắp xếp mảng 0s, 1s và 2 C ++

19. Tích của phần tử mảng C ++

20. Chỉ mục của 1 đầu tiên trong mảng boolean được sắp xếp C ++

21. Tìm số lượng các số C ++

22. Tính tổng của phần tử khác biệt C ++

23. Nhân tổng mảng trái và phải C ++

24. Lớn hơn bên phải C ++

25. Cặp sản phẩm tối thiểu C ++

26. Tìm phần tử duy nhất C ++

27. Chỉ đếm các phần tử lặp lại C ++

28. Loại bỏ các phần tử trùng lặp C ++

29. Tìm kiếm phần tử trong mảng C ++

30. Kiểm tra xem hai mảng có bằng C ++ hay không

31. Tạo hoán vị (ví dụ trường hợp đơn) C ++

32. Phần tử tối thiểu và tối đa C ++ Là mảng được sắp xếp C ++

33. Mảng cân bằng C ++

34. Tìm Chỉ mục C ++

35. Xóa mảng và dịch chuyển C ++

36. Chèn mảng tại chỉ mục C ++

37. Hợp nhất hai mảng đã sắp xếp O (1) không gian C ++

38. Liên hợp của hai mảng được sắp xếp C ++

39. Chỉ mục của một phần tử phụ C ++

40. Sắp xếp mảng nhị phân C ++

41. Tìm điểm chuyển tiếp C ++

42. Giá trị trung bình và giá trị trung bình của một mảng C ++

43. Xoay mảng bởi n phần tử C ++

44. Tìm số tối thiểu và số lớn nhất C ++

45. Đếm Evens và tỷ lệ cược C ++

46. ​​Các nhà lãnh đạo trong mảng C ++

47. Ai có phần tử đa số C ++

48. Sắp xếp mảng os 0s, 1 và 2s C ++

49. Đảo ngược mảng C ++

50. Mảng đảo ngược - C ++ mô-đun cao

51. Cần một số thay đổi C ++

52. Tìm tần số C ++

53. Phần tử nhỏ hơn ngay lập tức C ++

54. cặp-tổng-trong-vectơ C ++

55. xoay-mảng-theo-n-phần tử C ++

56. Sắp xếp và Đảo ngược C ++

57. Quay lại mặt trước C ++

58. Trước ra sau C ++

58. Đếm phần tử nhỏ hơn C ++

59. Đối mặt với mặt trời C ++

60. Sinh viên của năm (Sắp xếp giảm dần vector của các cặp) C ++

61. Tìm ngay nhỏ hơn X C ++

62. Phần tử nhỏ nhất thứ K C ++

63. Một mình trong Cặp đôi C ++

64. Giới thiệu về danh sách Python

65. Đếm trăn trăn chẵn lẻ Python

66.Các hàm trong danh sách Python Ghép cặp tổng trong vectơ (tổng phần tử thứ hai của phần tử thứ hai) C ++

67 Chỉ mục của phần tử lặp đầu tiên C ++

68. Phần tử thứ K của hai Mảng đã sắp xếp (hợp nhất hai mảng) C ++

69. Thay thế tất cả các số 0 bằng 5 (sử dụng atoi) C ++

70. Phần tử lớn thứ ba C ++

71. Tìm các vị trí trùng lặp trong Mảng C ++

72. Phần tử đa số C ++

73. Tối đa và tối đa thứ hai C ++

Sắp xếp

  1. Sắp xếp chung NameSolutionC C ++

2. Tích tối đa của hai số C ++

3. Đếm số không C ++

4. Sắp xếp bong bóng C ++

5. Mảng nhị phân Amazon sortiong C ++

6. Xoay Ma trận 90 độ - Clowise C ++

7. đảo ngược cột của ma trận C ++

8. Sắp xếp bong bóng C ++

9. Hợp nhất sắp xếp C ++

10. Sắp xếp mảng nhị phân C ++

Ma trận

  1. Đếm số không C ++

2. Tìm kiếm trong ma trận C ++

3. Số 1s tối đa trong một hàng C ++

4. Thêm hai ma trận C ++

5. Ma trận chuyển vị (không có dấu cách thêm) C ++

6. Hoán vị ma trận có thêm không gian C ++

7. thế giới hai chiều C ++

8. Xoay Ma trận 90 độ C ++

Dây

  1. Tìm kiếm mẫu ngây thơ C ++

2. Chữ thường C ++

3. Tìm số lớn nhất C ++

4. In chữ cái đầu tiên của mỗi từ C ++

5. Chuỗi ngược trong O (1) độ phức tạp không gian C ++

6. Hiển thị tên dài nhất C ++

7. Python xác thực chuỗi

8. Lặp lại chuỗi Python

9. Chào mừng bạn ra nước ngoài Python

10. Loại bỏ khoảng trắng C ++

11. Kiểm tra chuỗi C ++

12. Chứa trăn trăn String

13. Isogram có phải là C ++ không

14. Kiểm tra C ++ nhị phân

15. Chữ cái đầu tiên của mỗi từ C ++

16. Thiếu các ký tự trong panagram C ++

17. Kiểm tra xem b có phải là đảo ngữ của C ++ hay không

18. Kiểm tra phụ âm và nguyên âm trong C ++

19. Chữ thường đến chữ hoa C ++

20. Xác thực chuỗi C ++

21. Hàm bạn bè trong C (kiểm tra đảo chữ) C ++

22. last-index-of-1 C ++

23. Lặp lại sự xuất hiện đầu tiên của characer ngoài cùng bên trái C ++

24. Chữ hoa thành chữ thường C ++

25. Đếm số từ trong một chuỗi C ++

26. Ký tự lặp lại C ++

27. Đếm số nguyên âm riêng biệt trong một chuỗi C ++

28. Độ dài của một chuỗi C ++

29. Sửa đổi sentece C ++

30. Loại bỏ 'b' và 'ac' khỏi chuỗi C ++ đã cho

31. Sắp xếp chuỗi (Sử dụng sắp xếp nhanh) C ++

32. Nguyên âm trong chuỗi C ++

33. Kiểm tra xem một chuỗi có phải là Isogram hay không C ++

34. Đảo ngược các từ của một chuỗi C ++ nhất định

35. Cho hai chuỗi, hãy kiểm tra xem một chuỗi có phải là đảo chữ của Java khác không

36. Phần tử nhỏ nhất đầu tiên và thứ hai C ++

37. Chuỗi con dài nhất nối 1 C ++

38. Panagram kiểm tra C ++

Danh sách liên kết

  1. Hiển thị danh sách liên kết C ++

2. Thêm hai số được đại diện bởi danh sách liên kết PY Tổng các nút C ++

3. Điểm giao tác trong danh sách liên kết được tạo hình y C ++

4. Loại bỏ các bản sao trong danh sách liên kết được sắp xếp C ++

5. Ghép nối hoán đổi danh sách liên kết C ++

6. Tìm nút nk-th trong danh sách liên kết C ++

7. Danh sách liên kết chèn C ++

8. Đã sắp xếp chèn cho danh sách liên kết tròn C ++

9. Tham gia hai danh sách liên kết C ++

10. Mô-đun Node C ++

11.Xóa đuôi của danh sách liên kết tròn C ++

12. Xóa giữa danh sách liên kết C ++

13. Danh sách liên kết, xóa ghi chú tại vị trí C ++

14. Xóa đầu danh sách liên kết đơn C ++

15. Hiển thị danh sách liên kết tròn C ++

16. So sánh hai danh sách liên kết đôi vòng tròn C ++

17. Chèn vào đuôi (cuối) của danh sách liên kết tròn C ++

18. Chèn vào giữa danh sách liên kết C ++

19. Lấy chiều dài (số nút) của một danh sách linke vòng tròn C ++

20. Xóa đầu danh sách tròn C ++

21. Chèn vào đầu trong một danh sách liên kết tròn C ++

22. Chèn vào cuối danh sách liên kết vòng tròn C ++

23. Xóa nút của danh sách Hình tròn tại một vị trí cụ thể C ++

24. Chèn đầu danh sách liên kết gấp đôi C ++

25. Hiển thị danh sách liên kết đôi hình tròn C ++

26. Chèn đuôi danh sách liên kết gấp đôi C ++

27. Tối đa và tối thiểu trong danh sách liên kết C ++

28. Xóa đuôi danh sách liên kết C ++

29. Hiển thị danh sách liên kết kép tiến và lùi C ++

30. Lấy phần tử giữa của danh sách liên kết đôi hình tròn C ++

31. Xóa đầu danh sách liên kết kép C ++

32. delete-tail-of-doubly-linked-list.cpp C ++

33. Tìm kiếm trong danh sách liên kết C ++

34. Học struct C ++

35. Chèn nút trong danh sách liên kết kép C ++

36. Chèn nút trong danh sách liên kết kép C ++

37. Là vòng tròn danh sách liên kết kép gấp đôi C ++

38. So sánh hai danh sách liên kết C ++

39. Đếm các nút trong Danh sách thích C ++

40. Đếm ngoại tệ C ++

41. Danh sách liên kết giống hệt nhau C ++

42 Xóa một nút trong danh sách liên kết đơn C ++

43. Chèn vào danh sách liên kết đã sắp xếp C ++

44. được liên kết-danh sách-độ dài-chẵn hoặc lẻ C ++

45. Phần tử giữa C ++

46. ​​Nút ở vị trí đã cho C ++

47. In danh sách liên kết C ++

48. Tìm tổng của N nút cuối cùng C ++

49. Danh sách liên kết hình tròn C ++

50. Đảo ngược một danh sách được liên kết C ++

51. Phát hiện một vòng lặp C ++

52.Xóa vòng lặp khỏi danh sách liên kết C ++

53. Kiểm tra xem LIST được liên kết có phải là Palindrome C ++ hay không

54. Tìm chiều dài của một vòng lặp C ++

55. Sự xuất hiện của một số nguyên trong danh sách liên kết C ++

56. Sắp xếp danh sách được liên kết của 0s, 1s và 2 C ++

57. Loại bỏ nút mà không có tham chiếu của nút đầu C ++

Cây rơm

1.Stack designer C ++

2. Các thao tác trên stack C ++

3. Chèn vào ngăn xếp C ++

4. Giữa ngăn xếp C ++

5. Đảo ngược mảng sử dụng ngăn xếp C ++

6. Đảo ngược chuỗi sử dụng Stack C ++

7. Triển khai ngăn xếp với mảng C ++

8. Triển khai ngăn xếp bằng Danh sách liên kết C ++

9. Sắp xếp một ngăn xếp C ++

10. Loại bỏ các ký tự liên tiếp C ++

11. Xóa các chữ số liên tiếp được đặt lại trong một số C ++

 

Queue và Dequeu

  1. Queue Designer - Queue Push & Pop C ++

2. Hàng đợi sử dụng một mảng C ++

3. Triển khai Dequeu C ++

4. Triển khai hàng đợi bằng danh sách liên kết C ++

5. Đảo ngược K phần tử đầu tiên của hàng đợi C ++

6. Đảo ngược hàng đợi (Đảo ngược nội dung của một Hàng đợi) C ++

7. Các phép toán hàng đợi Các phép toán Java trong hàng đợi C ++

8. Xoay trái và phải C ++

Bộ

  1. Đặt hoạt động C ++

2. Toán tử đa tập C ++

Bản đồ

  1. Hoạt động đa bản đồ C ++

2. Các phép toán ánh xạ C ++

3. In phần tử riêng biệt C ++

4. Đếm KHÔNG phần tử lặp lại C ++

5. Ký tự không lặp lại C ++

6. Phần tử lặp đầu tiên C ++

7. Người đầu tiên tích lũy k lần C ++

8. Tìm các lần xuất hiện lẻ C ++

9. Đếm số lần xuất hiện của phần tử C ++

10. Số containgin 1, 2 và 3 C ++

11. Người chiến thắng trong một cuộc bầu cử C ++

12. Bộ đếm hai lần C ++

Đống

  1. K-phần tử lớn nhất C ++

Tìm kiếm

  1. NameSolutionBinary Search C ++

2. Phần tử đỉnh C ++

3. Số lần xuất hiện C ++

Tree-and-Binary-Search-Tree

  1. NameSolutionBinary Search C ++

2. Min trong BST C ++

3. Đếm Số lá nút C ++

4. Thứ tự cấp độ (Tách mọi dòng với '$' C ++

5. Thứ tự mức của cây tìm kiếm nhị phân C ++

6.Inorder of a BST (Binary Search Tree) C ++

7. PostOrder của BST C ++

8. Đặt hàng trước BST C ++

9. Phần tử lớn thứ K trong BST C ++

10. Mirror Tree C ++

11. Duyệt thứ tự mức của cây C ++

12. Chế độ xem bên trái của cây nhị phân C ++

13. Tổng các nút lá (Cây) C ++

14. Phần tử tìm kiếm trong BST C ++

15. search-a-node-in-bst C ++

16. Chèn một nút trong BST C ++

17. Kích thước của cây nhị phân C ++

18.Inorder traversal C ++

19. Đặt hàng trước C ++ truyền tải

20. Truyền đơn đặt hàng qua bưu điện C ++

21.Hai cây bằng C ++

22. Tổng của cây nhị phân C + +

23. Tổng các nút lá trong BST C ++

24. K khoảng cách từ gốc C ++

25. Tổ tiên Commond thấp nhất trong BST C ++

26.Inorder traversal và BST C ++

27. Số lượng lá trong cây nhị phân C ++

28. Các nút Couunt BST nằm trong một phạm vi C ++ nhất định

Đồ thị

  1. TênSolutionSum of depenncies trong một biểu đồ C ++

2. BFS của một đồ thị C ++

3. In danh sách kề C ++

Toán học và BitMagic

  1. Đếm số chia hết cho M C
  2. armstrong-số C ++
  3. Căn bậc hai C ++
  4. số tự động C ++
  5. Đối với vòng lặp kiểm tra số nguyên tố C ++
  6. C ++ chuyển sang nhị phân
  7. Chữ số trong C ++ giai thừa
  8. tìm-số-nguyên-tố-trong-một-dãy C ++
  9. Số mạnh C ++
  10. Các cặp có sự khác biệt k C ++
  11. Sức mạnh của 2 C ++
  12. Đếm Số bit đặt C ++
  13. Số là C ++ thưa thớt hoặc không
  14. Kiểm tra số nguyên tố với N <= 10⁹ C ++
  15. the-dice-problem C ++
  16. for-loop-prime-check Java
  17. Tổng các chữ số của một số Python
  18. Tìm bit đặt đầu tiên C ++

Sự kết luận

Tôi hy vọng bạn tìm thấy bài viết này là một tài liệu tham khảo khởi động tốt để bắt đầu tìm hiểu thêm về lập trình cạnh tranh.

Liên kết: https://faun.pub/my-first-300-coding-challenges-solutions-c-python-java-ec391502b85f

#java #python #c #cpluplus 

Hơn 300 Giải Pháp Thách Thức Mã Hóa Hàng đầu (C ++ / Python / Java)

300+ лучших решений для задач кодирования (C++/Python/Java)

вступление

При поиске работы первое, что вам могут сказать: «Практикуйте алгоритмы и структуры данных». Многие веб-сайты для подготовки к собеседованию, такие как Leetcode, GeeksForGeeks, Coderbyte, HackerRank и другие, предоставляют тысячи вопросов, и особенно в самом начале вы можете оказаться не в состоянии ответить даже на простые вопросы и сомневаться в себе.

В этой статье вы найдете мои первые более 300 решений задач кодирования из задач кодирования, найденных в GeeksForGeeks и leetCode.

Моя цель в этой статье — предоставить список упражнений (от простых до сложных вопросов), которые вам нужно решить, прежде чем сосредоточиться на более сложных вопросах, или отфильтровать упражнения по соревновательному программированию в соответствии с компанией, в которую вы подали заявку. Изучив и решив все приведенные ниже задачи кодирования, вы знаете, что достигли достаточного уровня знаний, чтобы использовать несколько алгоритмов и структур данных, не теряясь при этом из-за базовых концепций, которые вы, возможно, сочли не важными.

Алгоритмы и структуры данных

Основы программирования

  1. ИмяРешениеСильнейший сосед C++

2. Типы данных в Java Java

3. Самый большой элемент в массиве Python

4. Начните кодировать Java

5. Разделить строки С++

6. Сумма цифр С++

7. Нечетный или четный C++

8. Палиндром С++

9. Средний С++

10. Проверьте статус — Python

11. Подсчет символов верблюжьего регистра C++

12. Сумма матричных элементов C++

13. Сложение двух чисел C++

14. Разделить ввод Python

15. Получение ввода Python

16. Есть и в операторе Python

17. Для цикла Python Python

18. Цикл while в python Python

19. Повторяющаяся печать Python Python

20. Сентябрь и конец Python

21. Логические операторы Python

22. Сентябрь - Пространство отдельного Python

23. Комментарий в Python Python

24. Кот и шляпа Питон

25. Для loop2 (индексная перемычка) Python

26. Операторы в Python Python

27. Переход через Python

28. Пошаговое условие C++

29. Научитесь комментировать C++

30. Печать от 1 до N с использованием рекурсии C++

31. Поменяйте местами объекты С++

32. Обновление массива по индексу C++

33. Пока цикл печати таблицы C++

34. Новая строка С++

35. Прайм-чек С++

36. Получить элемент массива по индексу C++

37. Считайте меньше x C++

38. Считайте больше x C++

39. Считайте сразу больше C++

40. Сумма элементов массива C++

41. Получение ввода C++

42. Логические операторы С++

43. Побитовый оператор С++

44. Четно-нечетный С++

45. типы данных C++

46. ​​Найдите хороший C++

47. Обратные гласные — улучшенный C++

48. Значение равно значению индекса C++

49. Большее из трех чисел C++ Полное простое число C++

Массив или вектор

  1. NameSolutionSum массива C++

2. Частота элементов массива C++

3. Таблица умножения С++

4. Произведение максимума в первом массиве и минимума во втором C++

5. Как минимум два больших элемента C++

6. C++ Array (распечатать элемент) Установить массив 2Sub с заданной суммой (распечатать диапазон индексов подмассива) C++

7. Сумма элементов массива-2 C++

8. Массивы C++ (сумма массива) Установите 1Count 1s в отсортированном массиве C++

9. Поиск в отсортированном массиве C++

10. Вставить в конец массива С++

11. Точка равновесия С++

12. Левый индекс С++

13.Проверить, отсортирован ли массив C++

14. Печатать альтернативные элементы массива C++

15. Количество вхождений C++ C++

16. Медиана двух массивов C++

17. Пропущенное число в массиве C++

18. Сортировка массива из 0, 1 и 2 C++

19. Произведение элемента массива C++

20. Индекс первой единицы в отсортированном логическом массиве C++

21. Найдите количество чисел С++

22. Сумма различных элементов C++

23. Умножить сумму левого и правого массива C++

24. Больше справа C++

25. Минимальная пара продуктов C++

26. Найдите уникальный элемент C++

27. Считать только повторяющиеся элементы C++

28. Удалить повторяющиеся элементы C++

29. Поиск элемента в массиве C++

30. Проверить, равны ли два массива C++

31. Генерация перестановки (пример для одного случая) C++

32. Минимальный и максимальный элемент C++ Отсортирован ли массив C++

33. Сбалансированный массив С++

34. Найдите индекс С++

35. Удаление массива и сдвиг С++

36. Вставка массива по индексу C++

37. Объединить два отсортированных массива O(1) space C++

38. Объединение двух отсортированных массивов C++

39. Индекс лишнего элемента C++

40. Сортировка двоичных массивов C++

41. Найдите точку перехода C++

42. Среднее и медиана массива C++

43. Повернуть массив на n элементов C++

44. Найдите минимальное и максимальное число С++

45. Подсчитайте четы и шансы C++

46. ​​Лидеры в массиве C++

47. У кого больше элементов C++

48. Сортировка массива os 0s, 1 и 2s C++

49. Перевернуть массив С++

50. Обратный массив — высокая модульность C++

51. Нужны изменения C++

52. Найдите частоту С++

53. Сразу меньший элемент C++

54. парная сумма в векторе С++

55. Повернуть массив на n элементов С++

56. Сортировка и реверс C++

57. Назад к началу С++

58. Спереди назад С++

58. Подсчитайте меньший элемент C++

59. Лицом к солнцу C++

60. Студент года (Сортировка вектора пар по убыванию) C++

61. Найти сразу меньше, чем X C++

62. K-й наименьший элемент C++

63. Один в паре C++

64. Введение в список Python

65. Подсчитайте четный нечетный питон Python

66. Функции в списке Python Сумма пар в векторе (сумма второго элемента второго элемента) C++

67.Индекс первого повторяющегося элемента С++

68. K-й элемент двух отсортированных массивов(объединение двух массивов) C++

69. Замените все 0 на 5 (используя atoi) C++

70. Третий по величине элемент C++

71. Поиск дубликатов в массиве C++

72. Элемент большинства С++

73. Макс и второй макс С++

Сортировка

  1. Общая сортировка NameSolutionC C++

2. Максимальное произведение двух чисел C++

3. Считаем нули С++

4. Пузырьковая сортировка C++

5. Сортировка двоичных массивов Amazon C++

6. Повернуть матрицу на 90 градусов по часовой стрелке С++

7. перевернуть столбец матрицы С++

8. Пузырьковая сортировка C++

9. Сортировка слиянием C++

10. Сортировка двоичных массивов C++

Матрица

  1. Считать нули С++

2. Поиск в матрице С++

3. Максимальное количество 1 в строке С++

4. Добавление двух матриц C++

5. Транспонировать матрицу (без дополнительного пространства) C++

6. Транспонировать матрицу с дополнительным пробелом C++

7. двумерный мир C++

8. Повернуть матрицу на 90 градусов С++

Струны

  1. Наивный поиск по шаблону C++

2. Нижний регистр С++

3. Найдите максимальное число С++

4. Выведите первую букву каждого слова C++

5. Обратная строка в O(1) пространственной сложности C++

6. Показать самое длинное имя C++

7. Python для проверки строк

8. Повторите строку Python

9. Добро пожаловать за границу Python

10. Удалить пробелы С++

11. Проверить строку C++

12. Содержит строку python python

13. Изограмма С++

14. Проверьте наличие двоичного C++

15. Первая буква каждого слова C++

16. Отсутствующие символы в панаграмме С++

17. Проверить, является ли b анаграммой C++

18. Проверка согласных и гласных C++

19. С нижнего регистра на верхний C++

20. Проверка строк С++

21. Функция друга C (проверка анаграммы) C++

22. последний индекс 1 C++

23. Первое появление повторяющегося символа крайний левый C++

24. Верхний регистр в нижний регистр С++

25. Подсчитать количество слов в строке C++

26. Повторяющиеся символы С++

27. Подсчет различных гласных в строке C++

28. Длина строки С++

29. Изменить предложение C++

30. Удалить «b» и «ac» из заданной строки C++

31. Сортировка строк (с использованием быстрой сортировки) C++

32. Гласные в строке C++

33. Проверьте, является ли строка Isogram или нет C++

34. Обратные слова заданной строки C++

35. Имея две строки, проверьте, является ли одна из них анаграммой другой Java .

36. Первый и второй наименьшие элементы C++

37. Самая длинная подстрока, содержащая 1 C++

38. Проверка Panagram C++

Связанный список

  1. Показать связанный список C++

2. Складывает два числа, представленные связным списком PY Сумма узлов C++

3. Точка взаимодействия в Y-образном связанном списке C++

4. Удалить дубликаты в отсортированном связанном списке C++

5. Попарный обмен связного списка C++

6. Найти nk-й узел в связном списке C++

7. Вставка связанного списка C++

8. Отсортированная вставка для кругового связанного списка C++

9. Соедините два связанных списка C++

10. Модульный узел С++

11.Удалить хвост кругового связанного списка C++

12. Удалить середину связанного списка C++

13. Связанный список, удалить примечание в позиции C++

14. Удалить заголовок односвязного списка C++

15. Отображение кругового связанного списка C++

16. Сравните два циклических двусвязных списка C++

17. Вставить в хвост (конец) кругового связанного списка C++

18. Вставить в середину связанного списка C++

19. Получить длину (количество узлов) списка циклических ссылок С++

20. Удалить заголовок циклического списка C++

21. Вставить в начало кругового связанного списка C++

22. Вставить в конец кругового связанного списка C++

23. Удалить узел кругового списка в определенной позиции C++

24. Вставка заголовка двусвязного списка C++

25. Отображение кругового двойного связанного списка C++

26. Вставка хвоста двусвязного списка C++

27. Максимум и минимум в связном списке C++

28. Удалить конец связанного списка C++

29. Отображение двойного связанного списка вперед и назад C++

30. Получить средний элемент кругового двойного связанного списка C++

31. Удалить заголовок двусвязного списка C++

32. delete-tail-of-double-linked-list.cpp C++

33. Поиск в связанном списке C++

34. Изучение структуры С++

35. Вставить узел в двусвязный список C++

36. Вставить узел в двусвязный список C++

37. Циклический двусвязный список C++

38. Сравните два связанных списка C++

39. Подсчет узлов в понравившемся списке C++

40. Подсчет вхождения C++

41. Идентичный связанный список C++

42. Удалить узел в односвязном списке C++

43. Вставить в отсортированный связанный список C++

44. длина связанного списка, четная или нечетная C++

45. Средний элемент С++

46. ​​Узел в заданной позиции C++

47. Распечатать связанный список С++

48. Найдите сумму последних N узлов С++

49. Круговой связанный список С++

50. Обратный связанный список C++

51. Обнаружение цикла C++

52. Удалить цикл из связанного списка C++

53. Проверьте, является ли связанный список палиндромом C++

54. Найдите длину цикла С++

55. Вхождение целого числа в связанный список C++

56. Сортировать связанный список из 0, 1 и 2 C++

57. Удалить узел без ссылки на головной узел C++

Куча

1.Стек дизайнер С++

2. Операции над стеком С++

3. Вставить в стек С++

4. Середина стека C++

5. Обратный массив с использованием стека C++

6. Перевернуть строку с помощью Stack C++

7. Реализовать стек с массивом C ++

8. Реализуйте стек с помощью Linked List C++

9. Сортировка стека C++

10. Удаление последовательных символов С++

11. Удалить повторяющиеся последовательные цифры в числе С++

 

Очередь и без очереди

  1. Дизайнер очередей — Queue Push & Pop C++

2. Очередь с использованием массива C++

3. Реализация Dequeu C++

4. Реализовать очередь, используя связанный список C++

5. Перевернуть первые K элементов очереди C++

6. Обращение очереди (Обратное содержимое очереди) C++

7. Операции с очередью Java Операции в очереди C++

8. Левое и правое вращение C++

Установлен

  1. Установить операции С++

2. Мультимножественный оператор С++

карта

  1. Мультикартовые операции C++

2. Картографические операции С++

3. Распечатать отдельный элемент C++

4. Подсчитайте НЕ повторяющиеся элементы C++

5. Неповторяющийся символ С++

6. Первый повторяющийся элемент C++

7. Первый элемент для счета k раз C++

8. Найдите нечетные вхождения C++

9. Подсчет вхождений элемента C++

10. Номер, содержащий 1, 2 и 3 C++

11. Победитель выборов C++

12. Дважды счетчик С++

куча

  1. K-самые большие элементы C++

Поиск

  1. NameSolutionBinary Search C++

2. Пиковый элемент С++

3. Количество вхождений С++

Дерево-и-бинарное-дерево-поиска

  1. NameSolutionBinary Search C++

2. Мин. в BST С++

3. Подсчет количества листьев node C++

4. Порядок уровней (разделение каждой строки на '$' C++

5. Порядок уровней бинарного дерева поиска C++

6. Порядок BST (бинарного дерева поиска) C++

7. PostOrder BST C++

8. Предзаказ BST C++

9. K-й по величине элемент в BST C++

10. Зеркальное дерево С++

11. Обход дерева по уровням C++

12. Левый вид бинарного дерева C++

13. Сумма листовых узлов (Дерево) C++

14. Элемент поиска в BST C++

15. поиск узла в BST C++

16. Вставьте узел в BST C++

17. Размер бинарного дерева C++

18. Неупорядоченный обход С++

19. Предварительный обход C++

20. Обход почтового перевода C++

21. Два дерева равны C++

22. Сумма бинарного дерева C+ +

23. Сумма листовых узлов в BST C++

24. Расстояние K от корня C++

25. Младший общий предок в BST C++

26. Неупорядоченный обход и BST C++

27. Подсчет листьев в бинарном дереве C++

28. Подсчитайте узлы BST, лежащие в заданном диапазоне C++

График

  1. ИмяРешениеСумма зависимостей в графе C++

2. BFS графа C++

3. Распечатать список смежности C++

Математика и BitMagic

  1. Подсчитать числа, делящиеся на M C
  2. числа армстронга C++
  3. Квадратный корень С++
  4. автоморфные числа С++
  5. Для простой проверки цикла C++
  6. Int-to-binary C++
  7. Цифры в факториале С++
  8. поиск простых чисел в диапазоне C++
  9. Сильные числа С++
  10. Пары с разностью k C++
  11. Сила 2 С++
  12. Count Количество установленных бит C++
  13. Число разрежено или не C++
  14. Проверка простого числа с N <= 10⁹ C++
  15. проблема с игральными костями C++
  16. for-loop-prime-check Java
  17. Сумма цифр числа Python
  18. Найти первый установленный бит С++

Вывод

Я надеюсь, что вы нашли эту статью хорошей отправной точкой для начала изучения соревновательного программирования.

Ссылка: https://faun.pub/my-first-300-coding-challenges-solutions-c-python-java-ec391502b85f

#java #python #c #cpluplus 

300+ лучших решений для задач кодирования (C++/Python/Java)
Thierry  Perret

Thierry Perret

1661233620

Top 300+ Des Solutions De Défis De Codage (C++/Python/Java)

Introduction

Lors de la recherche d'un emploi, la première chose que quelqu'un peut vous dire est : « Pratiquez les algorithmes et les structures de données ». De nombreux sites Web de préparation aux entretiens comme Leetcode, GeeksForGeeks, Coderbyte, HackerRank et d'autres, fournissent des milliers de questions, et surtout au tout début, vous risquez de ne pas être en mesure de résoudre même des questions faciles et de douter de vous-même.

Dans cet article, vous trouverez mes premières solutions à plus de 300 défis de codage à partir de problèmes de codage trouvés dans GeeksForGeeks et leetCode.

Mon objectif dans cet article est de fournir une liste d'exercices (des questions faciles aux questions difficiles) que vous devez résoudre avant de vous concentrer sur des questions plus difficiles, ou de filtrer les exercices de programmation compétitifs en fonction de l'entreprise pour laquelle vous avez postulé. En étudiant et en résolvant tous les défis de codage ci-dessous, vous savez que vous avez acquis suffisamment de connaissances pour espacer plusieurs algorithmes et structures de données sans être perdu pour des concepts de base que vous n'avez peut-être pas trouvés importants.

Algorithmes et structures de données

Fondamentaux de la programmation

  1. NomSolutionPlus fort voisin C++

2. Types de données en Java Java

3. Le plus grand élément du tableau Python

4. Commencez à coder Java

5. Séparer les chaînes C++

6. Somme de chiffres C++

7. C++ impair ou pair

8. Palindrome C++

9. C++ moyen

10. Vérifier le statut — Python

11. Nombre de caractères en cas de chameau C++

12. Somme des éléments matriciels C++

13. Addition de deux nombres C++

14. Diviser l'entrée Python

15. Prise d'entrée Python

16. Est et dans l'opérateur Python

17. Pour la boucle python Python

18. Boucle While en python Python

19. Impression répétitive-python Python

20. Septembre et Fin Python

21. Opérateurs logiques Python

22. Sep -Espace séparé Python

23. Commentaire en Python Python

24. Chat et chapeau Python

25. Pour loop2 (cavalier d'index) Python

26. Opérateurs en python Python

27. Sauter en Python

28. Condition étape par étape C++

29. Apprenez à commenter C++

30. Imprimer de 1 à N en utilisant la récursivité C++

31. Échangez les objets C++

32. Mise à jour du tableau par index C++

33. While Loop print table C++

34. Nouvelle ligne C++

35. Prime check C++

36. Obtenir l'élément de tableau à l'index C++

37. Compter plus petit que x C++

38. Compter plus grand que x C++

39. Comptez immédiatement le plus gros C++

40. Somme des éléments du tableau C++

41. Prise d'entrée C++

42. Opérateurs logiques C++

43. Opérateur binaire C++

44. C++ pair et impair

45. types de données C++

46. ​​Trouvez le bon C++

47. Voyelles inversées — C++ amélioré

48. Valeur égale à la valeur d'index C++

49. Le plus grand de 3 nombres C++ Premier entier C++

Tableau ou vecteur

  1. NomSolutionSomme du tableau C++

2. Fréquence des éléments de tableau C++

3. Table de multiplication C++

4. Produit du maximum dans le premier tableau et du minimum dans le second C++

5. Au moins deux éléments supérieurs C++

6. C++ Array (imprimer un élément) Set 2Sub array avec une somme donnée (imprimer la plage d'index du sous-tableau) C++

7. Somme des éléments du tableau-2 C++

8. C++ Arrays (Sum of array)Set 1Count 1s in tried array C++

9. Recherche dans un tableau trié C++

10. Insérer à la fin du tableau C++

11. Point d'équilibre C++

12. Index gauche C++

13.Vérifier si un tableau est trié C++

14. Imprimer les éléments alternatifs d'un tableau C++

15. Nombre d'occurrences C++ C++

16. Médiane de deux tableaux C++

17. Nombre manquant dans un tableau C++

18. Trier un tableau de 0, 1 et 2 C++

19. Produit d'un élément de tableau C++

20. Index du premier 1 dans un tableau booléen trié C++

21. Trouver le nombre de nombres C++

22. Somme d'éléments distincts C++

23. Multiplier la somme des tableaux gauche et droit C++

24. Plus grand sur le côté droit C++

25. Paire de produits minimum C++

26. Trouver un élément unique C++

27. Ne compter que les éléments répétés C++

28. Supprimer les éléments en double C++

29. Rechercher un élément dans le tableau C++

30. Vérifiez si deux tableaux sont égaux C++

31. Générer une permutation (exemple de cas unique) C++

32. L'élément min et max C++ est un tableau trié C++

33. Tableau équilibré C++

34. Trouver l'index C++

35. Array delete et shift C++

36. Insertion de tableau à l'index C++

37. Fusionner deux tableaux triés O(1) espace C++

38. Union de deux tableaux triés C++

39. Index d'un élément supplémentaire C++

40. Tri de tableaux binaires C++

41. Trouver le point de transition C++

42. Moyenne et médiane d'un tableau C++

43. Faire pivoter le tableau de n éléments C++

44. Trouver le nombre minimum et maximum C++

45. Compter les pairs et les cotes C++

46. ​​Leaders en tableau C++

47. Qui a l'élément majoritaire C++

48. Trier le tableau os 0s, 1 et 2s C++

49. Inverser le tableau C++

50. Reverse array — Haute modularité C++

51. Besoin de changement C++

52. Trouvez la fréquence C++

53. Élément immédiat plus petit C++

54. pair-sum-in-vector C++

55. rotation-tableau-par-n-éléments C++

56. Trier et inverser le C++

57. C++ à l'envers

58. C++ d'avant en arrière

58. Comptez les petits éléments C++

59. Face au soleil C++

60. Etudiant de l'année (Tri décroissant du vecteur de paires) C++

61. Trouver immédiatement plus petit que X C++

62. Kth plus petit élément C++

63. Seul en couple C++

64. Introduction à la liste Python

65. Compter même impair python Python

66.Functions in list Python Pair sum in vector(sum second element of the second element) C++

67.Index du premier élément répétitif C++

68. K-ième élément de deux tableaux triés (fusion de deux tableaux) C++

69. Remplacez tous les 0 par 5 (en utilisant atoi) C++

70. Troisième plus grand élément C++

71. Trouver les doublons dans un tableau C++

72. Élément majoritaire C++

73. Max et Second max C++

Tri

  1. NameSolutionC tri générique C++

2. Produit maximum de deux nombres C++

3. Comptez les zéros C++

4. Tri à bulles C++

5. Tableau binaire Amazon sorti en C++

6. Faites pivoter la matrice de 90 degrés - dans le sens C++

7. inverser la colonne de la matrice C++

8. Tri à bulles C++

9. Trier par fusion C++

10. Tri de tableaux binaires C++

Matrice

  1. Compter les zéros C++

2. Recherche dans la matrice C++

3. Nombre maximum de 1 d'affilée C++

4. Ajout de deux matrices C++

5. Matrice transposée (sans extraspace) C++

6. Transposer la matrice avec un espace supplémentaire C++

7. C++ du monde bidimensionnel

8. Faire pivoter la matrice de 90 degrés C++

Cordes

  1. Recherche de modèle naïf C++

2. C++ en minuscules

3. Trouver le nombre maximum C++

4. Imprimer la première lettre de chaque mot C++

5. Chaîne inversée dans la complexité de l'espace O(1) C++

6. Afficher le nom le plus long C++

7. Python de validation de chaîne

8. Répétez la chaîne Python

9. Bienvenue à l'étranger Python

10. Supprimer les espaces C++

11. Vérifier la chaîne C++

12. Contenir la chaîne python python

13. Isogramme C++ est-il

14. Vérifiez le C++ binaire

15. Première lettre de chaque mot C++

16. Caractères manquants dans le panagramme C++

17. Vérifiez si b est un anagramme d'un C++

18. Vérification des consonnes et des voyelles C++

19. Minuscule à majuscule C++

20. Validation de chaînes C++

21. Fonction amie C (vérification d'anagramme) C++

22. dernier index de 1 C++

23. Caractère répétitif première apparition C++ le plus à gauche

24. Majuscules en minuscules C++

25. Compter le nombre de mots dans une chaîne C++

26. Caractères répétés C++

27. Compter les voyelles distinctes dans une chaîne C++

28. Longueur d'une chaîne C++

29. Modifier la phrase C++

30. Supprimer 'b' et 'ac' de la chaîne donnée C++

31. Trier les chaînes (en utilisant le tri rapide) C++

32. Voyelles en chaîne C++

33. Vérifiez si une chaîne est isogramme ou non C++

34. Mots inversés d'une chaîne donnée C++

35. Étant donné deux chaînes, vérifiez si l'une est l'anagramme d'une autre Java

36. Premier et deuxième plus petit élément C++

37. Sous-chaîne la plus longue contenant 1 C++

38. Pangramme vérifiant C++

Liste liée

  1. Afficher la liste chaînée C++

2. Additionne deux nombres représentés par la liste liée PY Somme des nœuds C++

3. Point d'interaction dans la liste chaînée en forme de y C++

4. Supprimer les doublons dans la liste chaînée triée C++

5. Pair swap d'une liste chaînée C++

6. Trouver le nœud nk-ième dans la liste chaînée C++

7. Insertion de liste chaînée C++

8. Insertion triée pour la liste chaînée circulaire C++

9. Joindre deux listes chaînées C++

10. Nœud modulaire C++

11.Supprimer la queue de la liste chaînée circulaire C++

12. Supprimer le milieu de la liste chaînée C++

13. Liste chaînée, supprimer la note à la position C++

14. Supprimer la tête de la liste chaînée unique C++

15. Afficher la liste chaînée circulaire C++

16. Comparez deux listes circulaires doublement chaînées C++

17. Insérer à la fin (fin) de la liste chaînée circulaire C++

18. Insérer au milieu de la liste chaînée C++

19. Obtenir la longueur (nombre de nœuds) d'une liste de liens circulaire C++

20. Supprimer la tête d'une liste circulaire C++

21. Insérer en tête dans une liste chaînée circulaire C++

22. Insérer à la fin d'une liste chaînée circulaire C++

23. Supprimer le nœud de la liste circulaire à une position spécifique C++

24. Tête de liste doublement chaînée insert C++

25. Afficher une liste circulaire double chaînée C++

26. Insertion de queue de liste doublement chaînée C++

27. Max et minimum dans la liste chaînée C++

28. Supprimer la fin de la liste chaînée C++

29. Afficher la double liste chaînée en avant et en arrière C++

30. Obtenir l'élément du milieu de la liste circulaire double chaînée C++

31. Supprimer la tête de la liste doublement chaînée C++

32. delete-tail-of-doublement-linked-list.cpp C++

33. Rechercher dans la liste chaînée C++

34. Apprentissage de la structure C++

35. Insérer un nœud dans une liste doublement chaînée C++

36. Insérer un nœud dans une liste doublement chaînée C++

37. Est-ce que la liste circulaire doublement chaînée est C++

38. Comparez deux listes chaînées C++

39. Compter les nœuds dans Liked List C++

40. Compter les occurrences C++

41. Liste chaînée identique C++

42.Supprimer un nœud dans une liste chaînée unique C++

43. Insérer dans une liste chaînée triée C++

44. liste-liée-longueur-pair-ou-impair C++

45. Élément intermédiaire C++

46. ​​Nœud à la position donnée C++

47. Imprimer la liste chaînée C++

48. Trouver la somme des N derniers nœuds C++

49. Liste chaînée circulaire C++

50. Inverser une liste chaînée C++

51. Détecter une boucle C++

52.Supprimer la boucle de la liste chaînée C++

53. Vérifiez si une liste liée est Palindrome C++

54. Trouver la longueur d'une boucle C++

55. Occurrence d'un entier dans une liste chaînée C++

56. Trier la liste chaînée de 0, 1 et 2 C++

57. Supprimer le nœud sans avoir la référence du nœud principal C++

Empiler

1. Concepteur de pile C++

2. Opérations sur la pile C++

3. Insérer dans la pile C++

4. Milieu de pile C++

5. Tableau inversé à l'aide de la pile C++

6. Chaîne inversée à l'aide de Stack C++

7. Implémenter la pile avec le tableau C ++

8. Implémenter la pile à l'aide de la liste chaînée C++

9. Trier une pile C++

10. Suppression de caractères consécutifs C++

11. Supprimer les chiffres consécutifs répétés dans un nombre C++

 

File d'attente et Dequeu

  1. Concepteur de file d'attente — Queue Push & Pop C++

2. File d'attente utilisant un tableau C++

3. Implémentation de Dequeu C++

4. Implémenter la file d'attente à l'aide de la liste chaînée C++

5. Inverser les K premiers éléments d'une file d'attente C++

6. Inversion de file d'attente (Inverser le contenu d'une file d'attente) C++

7. Opérations de file d'attente Opérations Java dans la file d'attente C++

8. Rotation gauche et droite C++

Régler

  1. Opérations d'ensemble C++

2. Opérateur multi-ensemble C++

Carte

  1. Opérations multicartes C++

2. Mapper les opérations C++

3. Imprimer un élément distinct C++

4. Compter les éléments NON répétitifs C++

5. Caractère non répétitif C++

6. Premier élément répétitif C++

7. Premier élément à compter k fois C++

8. Trouvez les événements impairs en C++

9. Compter les occurrences d'éléments C++

10. Nombre contenant 1, 2 et 3 C++

11. Vainqueur d'une élection C++

12. Double compteur C++

Tas

  1. K-plus grands éléments C++

Chercher

  1. NomSolutionRecherche binaire C++

2. Élément de pointe C++

3. Nombre d'occurrences C++

Arbre-et-binaire-Search-Tree

  1. NomSolutionRecherche binaire C++

2. Min en BST C++

3. Compter le nombre de feuilles nœud C++

4. Ordre de niveau (diviser chaque ligne avec '$ ' C++

5. Ordre des niveaux d'un arbre de recherche binaire C++

6. Dans l'ordre d'un BST (arbre de recherche binaire) C++

7. Post-commande d'un BST C++

8. Précommande de BST C++

9. Kème plus grand élément en BST C++

10. Arbre miroir C++

11. Traversée d'ordre de niveau d'un arbre C++

12. Vue de gauche d'un arbre binaire C++

13. Somme des nœuds feuilles (Tree) C++

14. Élément de recherche dans BST C++

15. recherche-un-nœud-en-bst C++

16. Insérer un nœud dans un BST C++

17. Taille d'un arbre binaire C++

18.Parcours dans l'ordre C++

19. Traversée de précommande C++

20. Parcours postal C++

21.Deux arbres sont-ils égaux à C++

22. Somme de l'arbre binaire C+ +

23. Somme des nœuds feuilles en BST C++

24. Distance K de la racine C++

25. Ancêtre commun le plus bas dans un BST C++

26.Parcours dans l'ordre et BST C++

27.Compter les feuilles dans l'arbre binaire C++

28. Compter les nœuds BST qui se trouvent dans une plage donnée C++

Graphique

  1. NomSolutionSomme des dépendances dans un graphe C++

2. BFS d'un graphe C++

3. Imprimer la liste de contiguïté C++

Mathématiques et BitMagic

  1. Compter les nombres divisibles par M C
  2. nombres-armstrong C++
  3. Racine carrée C++
  4. nombres automorphes C++
  5. For loop prime check C++
  6. C++ int-vers-binaire
  7. Chiffres en C++ factoriel
  8. trouver des nombres premiers dans une plage C++
  9. Nombres forts C++
  10. Paires avec différence k C++
  11. Puissance de 2 C++
  12. Nombre de bits définis C++
  13. Le nombre est clairsemé ou non C++
  14. Vérification des nombres premiers avec N <= 10⁹ C++
  15. le-problème-des- C++
  16. boucle for-prime-check Java
  17. Somme des chiffres d'un nombre Python
  18. Trouver le premier bit défini C++

Conclusion

J'espère que vous avez trouvé cet article une bonne référence de démarrage pour commencer à en apprendre davantage sur la programmation compétitive.

Lien : https://faun.pub/my-first-300-coding-challenges-solutions-c-python-java-ec391502b85f

#java #python #c #cpluplus 

Top 300+ Des Solutions De Défis De Codage (C++/Python/Java)
Hans  Marvin

Hans Marvin

1661226269

Top 300+ Coding Challenges Solutions (C++/Python/Java)

When looking for a job, the first ever thing that someone may tell you is: ‘Practice algorithms and data structures’. Many interview preparations websites likes Leetcode, GeeksForGeeks, Coderbyte, HackerRank, and others, provides thousands of questions, and especially at the very beginning, you may end-up not being able to solve even easy questions, and doubt about yourself.

In this article you will find my first ever 300+ coding challenges solutions from coding problems found in GeeksForGeeks and leetCode.

My goal in this article is to provide a list of exercises (from easy to hard questions) that you need to solve before to focus on harder questions, or filter competitive programming exercises in according to the company you applied for. By studying and solving all the coding challenges below, you know that you have achieved enough background to space in multiple algorithms and data-structure without being lost for basics concepts that you may have found not important.

See more at: https://faun.pub/my-first-300-coding-challenges-solutions-c-python-java-ec391502b85f

#c #cpluplus #java #python

Top 300+ Coding Challenges Solutions (C++/Python/Java)
Cyril  Parisian

Cyril Parisian

1661169960

Racecar: Gazebo 3D Simulator Example Of ROS Tutorials with C++

racecar

Gazebo 3D simulator example of ROS tutorials (version: Noetic)

Tested on Ubuntu 20.04

Dependencies

sudo apt install ros-$ROS_DISTRO-gazebo-ros-control
sudo apt install ros-$ROS_DISTRO-effort-controllers
sudo apt install ros-$ROS_DISTRO-joint-state-controller
sudo apt install ros-$ROS_DISTRO-driver-base
sudo apt install ros-$ROS_DISTRO-ackermann-msgs
sudo apt install ros-$ROS_DISTRO-rtabmap-ros
sudo apt install ros-$ROS_DISTRO-teb-local-planner

sudo apt install tcl-dev tk-dev python3-tk

Getting Started

Save the world map

  1. Create a project workspace
mkdir -p ~/racecar_ws/src
  1. git clone and compile it
cd ~/racecar_ws/src
git clone https://github.com/soonuse/racecar.git
cd ..
catkin_make
  1. Setup .bashrc
echo "source ~/racecar_ws/devel/setup.bash" >> ~/.bashrc
source ~/.bashrc
  1. Start the gazebo map
roslaunch racecar_gazebo racecar_runway.launch

1

You should download the gazebo models or the map won't work.

git clone https://github.com/osrf/gazebo_models.git ~/.gazebo/models
  1. Open a new terminal and start rviz
roslaunch racecar_gazebo slam_gmapping.launch 

Control the car with WASD keys and draw the whole map.

2

  1. Save the map
rosrun map_server map_saver -f ~/racecar_ws/src/racecar/racecar_gazebo/map/map_runway

Path planning and automatic navigation

  1. Start navigation and the gazebo map
roslaunch racecar_gazebo racecar_runway_navigation.launch
  1. Start rviz
roslaunch racecar_gazebo racecar_rviz.launch

3

Click 2D Nav Goal then click the goal on the rviz map (hold down the cursor to set the goal pose)

Start the navigation script

rosrun racecar_gazebo path_pursuit.py

4

FAQ

Error: opencv not found

  1. find OpenCVConfig.cmake
sudo apt install locate
sudo updatedb
locate OpenCVConfig.cmake
  1. edit CMakeLists.txt and replace OpenCV_DIR with the correct OpenCV path replace this line
set(OpenCV_DIR /opt/ros/kinetic/share/OpenCV-3.3.1-dev/)

with the correct OpenCV path

For more details, see https://www.bilibili.com/video/BV1da411j72x


Author: soonuse
Source code: https://github.com/soonuse/racecar

#cpluplus

Racecar: Gazebo 3D Simulator Example Of ROS Tutorials with C++
Cyril  Parisian

Cyril Parisian

1661162520

ACLUnity: Unity Native Plugin for ACL with C++

ACL Unity

This is a Unity Native Plugin which wraps a subset of ACL. Its primary purpose is for use in DOTS-based projects.

About ACL

Animation Compression Library, or ACL, is a C++11 library written by Nicholas Frechette and has been utilized in multiple AAA titles. It uses variable bit-rate compression of fixed-rate sampled poses for fast and highly accurate compression and decompression of both short and long clips. It is hierarchy-aware, further increasing its accuracy. It supports many platforms and can be compiled to utilize various levels of SIMD instructions.

About this Unity Plugin

Nicholas Frechette maintains an official Unreal Engine plugin. However, due to the closed-source nature of traditional Unity, he does not develop an equivalent for Unity.

This is an unofficial plugin for Unity primarily targeting DOTS-based projects. I (Dreaming381) wrote this wrapper for the needs of the Latios Framework. But feel free to use it or improve it as you see fit.

Why ACL and DOTS?

Traditionally, Unity uses curves for animation. It achieves performance by caching parts of the curve evaluation for use in the next evaluation. However, this approach doesn’t work as well in a DOTS project, where statelessness is preferred. ACL uses a technique that does not require caches to persist between frames in order to achieve great performance. It is also developed with a data-oriented mindset and API, making integration relatively straightforward.

If you are considering using this in your own DOTS-based animation solution, consider storing compressed tracks in BlobArrays with forced 16-byte alignment, and calling directly into this plugin from Burst jobs. You will also want to borrow the ACL_Unity directory from the Latios Framework which contains proper C# wrappers with safety checks.

Debugging with Latios Framework

Beginning with Latios framework 0.5.2, ACL Unity uses GitHub actions to generate build artifacts. These artifacts contain the binaries that were copied to the Latios Framework, as well as debug symbols and human-readable assembly text files.

Adding Platform Support for the Latios Framework

Disclaimer: I am not very good with DevOps and am pretty happy I even got this project this far.

Adding support for a new platform should not require any C++ code changes. Instead, you will need to modify the top-level CMakeLists.txt to detect your target platform and specify the correct compiler flags for the different supported CPU architectures. The current CMakeLists.txt assumes your target platform is the same device that you are compiling for (either Windows or Linux).

Once you have successfully compiled the library, import it into Unity as a native plugin. Depending on your target platform, you may need to modify the Kinemation/ACL_Unity C# files to load the correct version of the compiled library plugin for a given architecture. Note that when Burst is disabled, the code will always use the base version of the plugin with no extra CPU features.

Lastly, if your target platform is not constrained by NDA, you can support it in GitHub actions by modifying .github/workflows/acl-cross-platform-build.yml and adding a dedicated job with your platform. Every time you push changes, the jobs will run and you will be able to download and inspect artifacts. Test the artifacts to ensure they work correctly. Then create a pull request.

How Fast is It?

Fast!

And not like “fast enough for my personal use” fast.

More like “I doubt Unity’s engineers will ever beat this” fast.

Most animation sampling solutions (including Unity’s) require a keyframe search to find two keyframes the time value falls between. ACL doesn’t need to do this and instead looks up compressed byte offsets in a few instructions.

In addition, Burst support for native plugins is truly “native”. Performance of calling into this plugin from Burst jobs is on par with performance using ACL directly in C++ projects. Burst users get the full performance ACL has to offer.

So yeah. Fast!

.gitmodules

[submodule "acl"]
	path = acl
	url = git@github.com:nfrechette/acl.git

.gitignore

# Prerequisites
*.d

# Compiled Object files
*.slo
*.lo
*.o
*.obj

# Precompiled Headers
*.gch
*.pch

# Compiled Dynamic libraries
*.so
*.dylib
*.dll

# Fortran module files
*.mod
*.smod

# Compiled Static libraries
*.lai
*.la
*.a
*.lib

# Executables
*.exe
*.out
*.app

# Paths
.vs/*
out/*
CMakeSettings.json

.gitattributes

# Auto detect text files and perform LF normalization
* text=auto

Author: Dreaming381
Source code: https://github.com/Dreaming381/AclUnity
License: MIT license
#cpluplus

ACLUnity: Unity Native Plugin for ACL with C++
Cyril  Parisian

Cyril Parisian

1661158740

AS5600: Arduino Library for AS5600 Magnetic Rotation Meter on C++

AS5600

Arduino library for AS5600 magnetic rotation meter.

Description

AS5600

AS5600 is a library for an AS5600 based magnetic rotation meter.

Warning: experimental

The sensor can measure a full rotation in 4096 steps. The precision is therefore limited to 0.1°. Noise levels unknown, but one might expect it to be effected by electric and or magnetic signals in the environment. Also unknown is the influence of metals near the sensor or an unstable or fluctuating power supply.

I2C Address

The I2C address of the AS5600 is always 0x36.

To use more than one AS5600 on one I2C bus, see Multiplexing below.

OUT pin

The sensor has an output pin named OUT. This pin can be used for an analogue or PWM output signal.

See Analogue Pin and PWM Pin below.

Examples are added to show how to use this pin with setOutputMode().

PGO pin

Not tested.

PGO stands for Programming Option, it is used to calibrate / program the sensor. As the sensor can be programmed only a few times one should use this functionality with extreme care. See datasheet for a detailed list of steps to be done.

See Make configuration persistent below.

Hardware connection

The I2C address of the AS5600 is always 0x36.

The AS5600 datasheet states it supports Fast-Mode == 400 KHz and Fast-Mode-Plus == 1000 KHz.

The sensor should connect the I2C lines SDA and SCL and the VCC and GND to communicate with the processor. The DIR (direction) pin of the sensor should be connected to:

  • GND = fixed clockwise(*)
  • VCC = fixed counter clock wise
  • a free IO pin of the processor = under library control.

In the latter setup the library can control the direction of counting by initializing this pin in begin(directionPin), followed by setDirection(direction). For the direction the library defines two constants named:

  • AS5600_CLOCK_WISE (0)
  • AS5600_COUNTERCLOCK_WISE (1)

(*) if begin() is called without directionPin or with this parameter set to 255, software direction control is enabled.

See Software Direction Control below for more information.

Interface

Constants

Most important are:

//  setDirection
const uint8_t AS5600_CLOCK_WISE         = 0;  //  LOW
const uint8_t AS5600_COUNTERCLOCK_WISE  = 1;  //  HIGH

//  0.087890625;
const float   AS5600_RAW_TO_DEGREES     = 360.0 / 4096;
//  0.00153398078788564122971808758949;
const float   AS5600_RAW_TO_RADIANS     = PI * 2.0 / 4096;

//  getAngularSpeed
const uint8_t AS5600_MODE_DEGREES       = 0;
const uint8_t AS5600_MODE_RADIANS       = 1;

See AS5600.h file (and datasheet) for all constants. Also Configuration bits below for configuration related ones.

Constructor + I2C

  • AS5600(TwoWire *wire = &Wire) Constructor with optional Wire interface as parameter.
  • bool begin(uint8_t directionPin = 255) set the value for the directionPin. If the pin is set to 255, the default value, there will be software direction control instead of hardware control. See below.
  • bool begin(int sda, int scl, uint8_t directionPin = 255) idem, for the ESP32 where one can choose the I2C pins. If the pin is set to 255, the default value, there will be software direction control instead of hardware control. See below.
  • bool isConnected() checks if the address 0x36 is on the I2C bus.
  • uint8_t getAddress() returns the fixed device address 0x36.

Direction

To define in which way the sensor counts up.

  • void setDirection(uint8_t direction = AS5600_CLOCK_WISE) idem.
  • uint8_t getDirection() returns AS5600_CLOCK_WISE (0) or AS5600_COUNTERCLOCK_WISE (1).

Configuration registers

Please read the datasheet for details.

bool setZPosition(uint16_t value) set start position for limited range. Value = 0..4095. Returns false if parameter is out of range.

uint16_t getZPosition() get current start position.

bool setMPosition(uint16_t value) set stop position for limited range. Value = 0..4095. Returns false if parameter is out of range.

uint16_t getMPosition() get current stop position.

bool setMaxAngle(uint16_t value) set limited range. Value = 0..4095. Returns false if parameter is out of range. See datasheet Angle Programming

uint16_t getMaxAngle() get limited range.

bool setConfigure(uint16_t value) Value = 0..0x4000 Returns false if parameter is out of range.

uint16_t getConfigure()

Configuration bits

Please read datasheet for details.

BitshortDescriptionValues
0-1PMPower mode00 = NOM, 01 = LPM1, 10 = LPM2, 11 = LPM3
2-3HYSTHysteresis00 = OFF, 01 = 1 LSB, 10 = 2 LSB, 11 = 3 LSB
4-5OUTSOutput Stage00 = analog (0-100%), 01 = analog (10-90%), 10 = PWM
6-7PWMFPWM frequency00 = 115, 01 = 230, 10 = 460, 11 = 920 (Hz)
8-9SFSlow Filter00 = 16x, 01 = 8x, 10 = 4x, 11 = 2x
10-12FTHFast FilterThreshold 000 - 111 check datasheet
13WDWatch Dog0 = OFF, 1 = ON
15-14 not used 

The library has functions to address these fields directly.

  • bool setPowerMode(uint8_t powerMode) returns false if parameter is out of range.
  • uint8_t getPowerMode() returns the mode set.

See the .h file for the other get/set functions.

Hysteresis

  • bool setHysteresis(uint8_t hysteresis) Suppresses "noise" on the output when the magnet is not moving. In a way one is trading precision for stability. returns false if parameter is out of range.

Read Angle

  • uint16_t rawAngle() idem. returns 0 .. 4095. (12 bits) Conversion factor AS5600_RAW_TO_DEGREES = 360 / 4096 = 0.087890625 or use AS5600_RAW_TO_RADIANS if needed.
  • uint16_t readAngle() read the angle from the sensor. This is the one most used.
  • void setOffset(float degrees) sets an offset in degrees, e.g. to calibrate the sensor after mounting. Typical values are -359.99 - 359.99 probably smaller. Larger values will be mapped back to this interval. Be aware that larger values will affect / decrease the precision of the measurements as floats have only 7 significant digits. Verify this for your application.
  • float getOffset() returns offset in degrees.

In #14 there is a discussion about setOffset(). A possible implementation is to ignore all values outside the -359.99 - 359.99 range. This would help to keep the precision high.

Angular Speed

float getAngularSpeed(uint8_t mode = AS5600_MODE_DEGREES) is an experimental function that returns an approximation of the angular speed in rotations per second. The function needs to be called at least four times per rotation or once per second to get a reasonably precision.

mode == AS5600_MODE_RADIANS (1): radians /second

mode == AS5600_MODE_DEGREES (0): degrees /second (default)

mode other => degrees /second

Negative values indicate reverse rotation. What that means depends on the setup of your project.

Note: the first call will return an erroneous value as it has no reference angle or time. Also if one stops calling this function for some time the first call after such delays will be incorrect.

Note: the frequency of calling this function of the sensor depends on the application. The faster the magnet rotates, the faster it may be called. Also if one wants to detect minute movements, calling it more often is the way to go.

Status registers

  • uint8_t readStatus() see Status bits below.
  • uint8_t readAGC() returns the Automatic Gain Control.

0..255 in 5V mode, 0..128 in 3V3 mode.

  • uint16_t readMagnitude() reads the current internal magnitude. (page 9 datasheet) Scale is unclear, can be used as relative scale.
  • bool detectMagnet() returns true if device sees a magnet.

Status bits

Please read datasheet for details.

BitshortDescriptionValues
0-2 not used 
3MHoverflow1 = magnet too strong
4MLoverflow1 = magnet too weak
5MDmagnet detect1 = magnet detected
6-7 not used 

Make configuration persistent.

USE AT OWN RISK

Please read datasheet twice.

The burn functions are used to make settings persistent. As these functions can only be called one or three times, they are highly permanent, therefore they are commented in the library.

The risk is that you make your as5600 USELESS.

USE AT OWN RISK

  • uint8_t getZMCO() reads back how many times the ZPOS and MPOS registers are written to permanent memory. You can only burn a new Angle 3 times to the AS5600.
  • void burnAngle() writes the ZPOS and MPOS registers to permanent memory. You can only burn a new Angle maximum THREE times to the AS5600.
  • void burnSetting() writes the MANG register to permanent memory. You can write this only ONE time to the AS5600.

Software Direction Control

Experimental 0.2.0

Normally one controls the direction of the sensor by connecting the DIR pin to one of the available IO pins of the processor. This IO pin is set in the library as parameter of the begin(directionPin) function.

The directionPin is default set to 255, which defines a software direction control. To have this working one has to connect the DIR pin of the sensor to GND. This puts the sensor in a hardware clock wise mode, so it is up to the library to do the additional math so the readAngle() and rawAngle() behave as if the DIR pin was connected to the processor IO pin.

The gain is that the user does not need an IO pin for this, which makes connecting the sensor a bit easier.

The user still calls setDirection() as before to change the direction.

TODO: measure performance impact.

TODO: investigate impact on functionality of other registers.

Analogue OUT

(details datasheet - page 25)

The OUT pin can be configured with the function:

  • bool setOutputMode(uint8_t outputMode)

When the analog OUT mode is set the OUT pin provides a voltage which is linear with the angle.

VDDmodepercentageoutput1° in V
5V000 - 100%0.0 - 5.00.01388889
5V0110 - 90%0.5 - 4.50.01111111
3V300 - 100%0.0 - 3.30.00916667
3V3110 - 90%0.3 - 3.00.00750000

To measure these angles a 10 bit ADC or higher is needed.

When analog OUT is selected readAngle() will still return valid values.

PWM OUT

(details datasheet - page 27)

The OUT pin can be configured with the function:

  • bool setOutputMode(uint8_t outputMode) outputMode = 2 = PWM

When the PWM OUT mode is set the OUT pin provides a duty cycle which is linear with the angle. However they PWM has a lead in (HIGH) and a lead out (LOW).

The pulse width is 4351 units, 128 high, 4095 angle, 128 low.

AngleHIGHLOWHIGH %LOW %Notes
012842232,94%97,06% 
1024241095,56%94,44% 
2035639968,17%91,83% 
45640371114,71%85,29% 
901152319926,47%73,53% 
1351664268738,24%61,76% 
1802176217650,00%50,00% 
2252687166461,76%38,24% 
2703199115273,53%26,47% 
315371164085,29%14,71% 
360422312897,06%2,94%in fact 359.9 something as 360 == 0

Formula:

based upon the table above angle = map(dutyCycle, 2.94, 97.06, 0.0, 359.9);

or in code ..

t0 = micros();  // rising;
t1 = micros();  // falling;
t2 = micros();  // rising;  new t0

//  note that t2 - t0 should be a constant depending on frequency set.
//  however as there might be up to 5% variation it cannot be hard coded.
float dutyCycle = (1.0 * (t1 - t0)) / (t2 - t0);  
float angle     = (dutyCycle - 0.0294) * (359.9 / (0.9706 - 0.0294));

PWM frequency

The AS5600 allows one to set the PWM base frequency (~5%)

  • bool setPWMFrequency(uint8_t pwmFreq)
modepwmFreqstep in us1° in time
0115 Hz2.12324.15
1230 Hz1.06212.77
2460 Hz0.5316.39
3920 Hz0.2163.20

Note that at the higher frequencies the step size becomes smaller and smaller and it becomes harder to measure. You need a sub-micro second hardware timer to measure the pulse width with enough precision to get the max resolution.

When PWM OUT is selected readAngle() will still return valid values.

Multiplexing

The I2C address of the AS5600 is always 0x36.

To use more than one AS5600 on one I2C bus, one needs an I2C multiplexer, e.g. https://github.com/RobTillaart/TCA9548. Alternative could be the use of a AND port for the I2C clock line to prevent the sensor from listening to signals on the I2C bus.

Finally the sensor has an analogue output OUT. This output could be used to connect multiple sensors to different analogue ports of the processor.

Warning: If and how well this analog option works is not verified or tested.

Operational

The base functions are:

AS5600 as5600;

void setup()
{
  Serial.begin(115200);
  ...
  as5900.begin(4);     //  set the direction pin
  as5600.setDirection(AS5600_CLOCK_WISE);
  ...
}

void loop()
{
...
  Serial.println(as5600.readAngle());
  delay(1000);
...
}

See examples.

Future

Some ideas are kept here so they won't get lost. priority is relative

high prio

  • get hardware to test.
  • improve documentation.

med prio

  • limit the setOffset() to -359.99 .. 359.99
  • investigate readMagnitude()
    • combination of AGC and MD, ML and MH flags?
  • investigate performance
    • basic performance per function
    • I2C improvements
    • software direction
  • investigate OUT behavior in practice
    • analogue
    • PWM
  • write examples:
    • as5600_calibration.ino (needs HW and lots of time)
    • different configuration options
  • create changeLog.md

low prio

  • add error handling
  • investigate PGO programming pin.
  • add mode parameter to offset functions.
    • see getAngularSpeed()

Author: RobTillaart
Source code: https://github.com/RobTillaart/AS5600
License: MIT license
#cpluplus

AS5600: Arduino Library for AS5600 Magnetic Rotation Meter on C++
Cyril  Parisian

Cyril Parisian

1661151360

Flexfringe: A Flexible State-merging Framework Written in C++

README

flexfringe (formerly DFASAT), a flexible state-merging framework written in C++.

What this repositor contains

This repository contains the latest release version of flexfringe.

How to get set up

flexfringe compiles without external dependencies. It currently supports build chains using make and cmake.

For expert users: In case you want to use the reduction to SAT and automatically invoke the SAT solver, you need to provide the path to the solver binary. flexfringe has been tested with lingeling (which you can get from http://fmv.jku.at/lingeling/ and run its build.sh). PLEASE NOTE: SAT solving only works for learning plain DFAs. The current implementation is not verified to be correct. Use an older commit if you rely on SAT-solving.

You can build and compile the flexfringe project by running

$ make clean all

or alternatively, using CMake

$ mkdir build && cd build && cmake .. $ make

in the main directory to build the executable named flexfringe. There is also a CMakelists.txt for building with cmake. We tested the toolchains on Linux (Ubuntu 16+), MacOS (10.14), and Windows 10. For the latter, be built using CMake shipped with CLion.

How to run it

Run ./flexfringe --help to get help.

We provide several .ini files as a shortcut to storing commonly used settings.

Example:

$ ./flexfringe --ini ini/batch-overlap.ini data/staminadata/1_training.txt.dat

See the .ini files for more information, and the --help flag for a short description of the options.

Input files

The default input is formated following the Abadingo formating:

num_samples alphabet_size
label length sym1 sym2 ... symN
.
.
.

for each symbol, additional data can be attached via /, i.e. label length sym1/data1 sym2/data2 ... symN/dataN. These can represent outputs (e.g. for Mealy or Moore machines), or any other information needed by a custom evaluation function.

Real-valued attributes, e.g. for real-time automata, can be attached via :, i.e. label length sym1:real1,real2,realn .... The number of attributes has to be specified in the header after the alphabet size, i.e. num_samples alphabet_size:num_attributes.

Output files

flexfringe will generate several .dot files into the specified output directory (./ by default):

  • pre:*.dot are intermediary dot files created during the merges/search process.
  • dfafinal.dot is the end result as a dot file
  • dfafinal.dot.json is the end result

You can plot the dot files via

$ dot -Tpdf file.dot -o outfile.pdf or $ ./show.sh final.dot

after installing dot from graphviz. To use the generated models for language acceptance testing or as a distribution function, it is best to parse the JSON file. You can find an exmaple in the Jupyter notebook at https://github.com/laxris/flexfringe-colab.

Documentation

flexfringe has partial Doxygen-style documentation included in the ./doc directory. It can be regenerated using the settings in Doxygen file.

Contribution guidelines

  • Fork and implement, request pulls.
  • You can find sample evaluation files in ./source/evaluation. Make sure to REGISTER your own file to be able to access it via the -h and --heuristic-name flag.

Writing tests

Unit tests are incomplete. flexfringe uses the Catch2 framework (see the https://github.com/catchorg/Catch2/blob/master/docs/tutorial.md and the tests folder for some examples.

Logging

Logging is incomplete. flexfringe uses the loguru framework (see the [https://github.com/emilk/loguru/blob/master/README.md](Loguru documentation)). flexfringe uses the stream-version. Please log using the LOG_S(LEVEL) << "messge" syntax to implement logging.

Who to talk to

  • Sofia Tsoni (scientific programmer, maintainer)
  • Christian Hammerschmidt (author of the online/streaming mode, interactive mode, and the flexible evaluation function mechanism)
  • Sicco Verwer (original author; best to reach out to for questions on batch mode, RTI+ implementation, and SAT reduction)

Badges

Codacy Badge

Credits and Licences

flexfinge relies on a number of open source packages and libraries. You can find the respective LICENCE files in the source/utility subdirectory. Most notable, we use

Documentation

The documentation of this project can be build using the

COMPILE_DOCS=ON

flag along with the cmake command. We are using Doxygen and Sphinx. Requirements for compiling the documentation are

  • Doxygen (tested with version 1.8.20)
  • Sphinx (tested with version 3.3.1). We are using the rtd-theme, installation see below.
  • breathe (tested with version 4.24.0)

They can be installed on Linux using the commands

apt-get install doxygen

,

pip install sphinx_rtd_theme

, and

pip install breathe

.

IMPORTANT: In case new classes, functions, structs etc. have been added, and they shall show up in the documentation, they have to be added at the bottom of the docs/index.rst file. For further information and a small quickstart-guide, please look at e.g.

https://breathe.readthedocs.io/en/latest/quickstart.html https://breathe.readthedocs.io/en/latest/directives.html


Author: tudelft-cda-lab
Source code: https://github.com/tudelft-cda-lab/FlexFringe
License: GPL-3.0 license
#cpluplus

Flexfringe: A Flexible State-merging Framework Written in C++
Cyril  Parisian

Cyril Parisian

1661143980

DynamicDriver: Dynamic Control Of Multiple 7-segment LEDs with C++

DynamicDriver

ダイナミック制御を行うクラス

動作例

Usage

コンストラクタの引数にVcc構造体実体、GNDピン(下桁から)をセット

//                        a  b  c  d  e  f  g  h
//                        ↓  ↓  ↓  ↓  ↓  ↓  ↓  ↓
DynamicDriver::Vcc vcc = {7, 6, 3, 4, 5, 8, 2, 9};  // set Vcc pins assing
DynamicDriver led(vcc, 13, 12, 11, 10);             // set Vcc structure and GND pins assing

//Other
//DynamicDriver led({7, 6, 3, 4, 5, 8, 2, 9}, 13, 12, 11, 10);

ピン番号は以下のフォーマット

数字を出力

int outputNumber = 1234; led.show(outputNumber);  //>1234 //double outputNumber = 123.4; //led.show(outputNumber, 1);  //>123.4

Functions

DynamicDriver(const Vcc &vcc, T... gnd)

DynamicDriver のオブジェクトを作成

vcc : Vcc 構造体の実体

gnd : GND ピン(桁数分)

show(uint32_t num)

整数値を出力

num : 出力値(整数)

show(double num, uint8_t maxDecimalDigit = 1)

小数値を出力

num : 出力値(浮動小数)

maxDecimalDigit : 表示する小数の桁

test(uint8_t testPin)

出力確認用

testPin : 出力するピン

demo()

デモ


Author: CaseyNelson314
Source code: https://github.com/CaseyNelson314/DynamicDrive_Arduino
License: MIT license
#cpluplus

DynamicDriver: Dynamic Control Of Multiple 7-segment LEDs with C++
Cyril  Parisian

Cyril Parisian

1661136600

LUtools: Simple Commandline Tool & Header-only Library To Create - C++

LUTools

Simple commandline tool & header-only library to create, batch-apply and convert 3D LUTs.

Features

  1. Rip color toning filters from any of your favorite apps with zero or very little accuracy loss, even if the app only supports saving as low-res lossy JPEGs
  2. Make your own filters for once and generate perfect 3D LUTs from them
  3. Ultra-fast exportation to .cube format, which can be used with many professional software such as Photoshop, Lightroom & Lightroom Mobile, Premiere, Final Cut Pro and DaVinci Resolve
  4. Quickly apply 3D LUT filter to a batch of images with multi-thread processing, without having to open-apply-save each one of them manually in editors
  5. Have the above facilities in your own C++ project by adding some headers

Using the commandline tool

In this section I'd prefer to use a more intuitive language to explain the usage :D

Get

Go to the release page and grab the latest release, it contains the stuff you'll need to perform the following missions.

Rip or make filters

You'll need to use your filter to process a specially designed image, the lutmap:

  • Simply apply the filter to the lutmap and save it as PNG format to get the zero-loss result
  • If your app doesn't support PNG, you may still get a decent result! The lutmap was originally designed to rip beautiful filters from my social apps, which will shrink my image size and save as a lossy JPEG.
  • For even better results with JPEG, you are still encouraged to manually chop the lutmap 2-by-2 or 4-by-4 (without losing pixels), enlarge each of them by 2 or 4, process them with the same filter, then put them back together seamlessly to get a complete lutmap. This way you'll get rid of some JPEG noise, then a 4px (or 8px, depending on how much you've enlarged the pieces) gaussian blur will also help smoothing out the remaining subtle noise. Remember to resize back to 4096 by 4096, because LUTools only accept this size for a 3D LUT. You can do all these procedures within Photoshop, Krita or GIMP.

The processed lutmap contains everything about the filter, it can be used to export .cube files, or just to apply to any other image.

Apply filters to image

Batch processing images with a given filter is as simple as mouse selections and drags:

Select all the images you want to process by holding Ctrl and clicking

Add the processed lutmap to your selection

Click and hold your mouse on the lutmap that you've selected last, drag and drop onto the LUTools executable.

Let me explain this: By doing so, you are dragging all other images together to the LUTools, which is actually passing the paths of all these files as a list, into LUTools. And the fact that you're dragging your mouse cursor on the lutmap means passing its path by the first parameter.

A terminal ("black window") will appear, processing all images using the filter described by the lutmap. Results will be saved to the same folder.

Export .cube files

Well, forgive me that this must be done via the terminal. But I promise it will be easy:

Open the "Run" dialog by pressing Win + R

Type cmd into the dialog and press enter, now you've opened the terminal

Type cd /d then a space, then the directory where you've put the LUTools executable, press enter to run

Type LUTools -cube then a space, then the path to your filter (the processed lutmap), run it

Tips: It will be much more convenient if you put the LUTools executable and the filter in the same folder -- you'll only need to type the filter's filename.

And a .cube file will be generated in-place, ready to be used.

Alternatively, you may type LUTools -cube 64 to have the file generated with a higher resolution of 64. This works for more complicated LUTs. The default resolution is 25 as you might have seen.

FAQ

What is that .lut file generated in the filter's directory?

-- That is the filter's cache file. LUTools uses it to accelerate filter loading, so that next time you use the same filter, the loading will be much faster. It's totally safe to delete it, because it can be regenerated.

Development

Clone

Use this: git clone --recurse-submodules git@github.com:lfod1997/LUTools.git

Build

It is a CMake Project with only one target so just config and make it.

LUTools CLI

LUTools {LUT | LUT_MAP} [-cube [RESOLUTION]] [INPUT [-OUTPUT]]...

Where LUT stands for the generated .lut file; LUT_MAP stands for any processed (or unprocessed) lutmap.

  • Optionally, -cube may be used with or without a RESOLUTION specified. The generated .cube file will contain RESOLUTION ^ 3 samples. Default resolution is 25.
  • Optionally, any number of INPUT images may be passed, they will be processed using the specified LUT. If no OUTPUT is specified for the INPUT, the output file will be put in the same directory, with a suffix _ followed by the filter being used, and in the same image format as the INPUT.
  • Each INPUT may have an OUTPUT after it to explicitly specify the output path. This syntax requires a - prefix, otherwise I can't tell the difference :D

C++ library

#include the headers in the src directory, and have the functions in your project.

Generally you'll just need these:

  • Lutools::Color* Lutools::cacheLUTMap(const std::string& input_file, const std::string& output_file) in lut.hpp
  • Lutools::Color* Lutools::loadCacheFromFile(const std::string& path) in lut.hpp
  • void Lutools::generateCube(const Lutools::Color* data, int cube_res, const std::string& output_file) in cube.hpp

All functions are carefully documented so I won't bother speaking here.

Namespace Lutools:

  • color.hpp contains a simple RGBA class
  • image.hpp contains a simple image wrapper that supports image loading and writing
  • lut.hpp supports analyzing lutmaps and cache IO
  • cube.hpp supports exporting .cube files

Namespace Pathutils: only pathutils.hpp, contains simple functions I used to process paths. If the file bothers you, just combine it into some of the other headers :D

Namespace LutoolsCli: only thread_guard.hpp, contains a simple wrapper of threads, used by the CLI.

Lutmap disassembled

This image called lutmap is designed to get the colors mapped by any 3D LUT (obviously), with some tricks against JPEG compression:

  1. The image has relatively low spatial frequencies, resulting in lower JPEG noise
  2. Very high redundancy, actually enumerating the entire colorspace, so partial detail damage can be easily recovered (a gaussian blur, or more preferably surface blur, will do)
  3. While being 4K, the image data block is extremely regular, resulting in small PNGs

Credits

This project uses the amazing stb image library by nothings.


Author: lfod1997
Source code: https://github.com/lfod1997/LUTools
License: BSD-2-Clause license
#cpluplus

LUtools: Simple Commandline Tool & Header-only Library To Create - C++
Cyril  Parisian

Cyril Parisian

1661129220

SGCL: Precise Pauseless Concurrent Garbage Collector for C++

SGCL

About the SGCL

SGCL is a precise pauseless concurrent garbage collector for C++. The garbage collector works in a separate thread and never pauses other threads. All operations are lock-free.

Compiling

C++17 compiler required.

Classes

Base class of all traced objects:

class object;

// example
class foo : public virtual gc::object {};

A class that simplifies traced class definition:

class collected;

// example
class foo : public gc::collected {};

Traced pointers:

class ptr<T>;
class weak_ptr<T>;
class atomic_ptr<T>;
class atomic_weak_ptr<T>;

// example
gc::ptr<foo> a;

Functions

Create a tracked object:

ptr<T> make(...);

// example
auto a = gc::make<foo>();

Pointer cast:

ptr<T> static_pointer_cast(ptr<U>);
ptr<T> dynamic_pointer_cast(ptr<U>);
ptr<T> const_pointer_cast(ptr<U>);

// example
gc::ptr<object> a = gc::make<foo>();
auto b = gc::dynamic_pointer_cast<foo>(a);

Example usage

#include "sgcl.h"

struct node : public gc::collected {
  gc::ptr<node> l, r;
};

gc::ptr<node> tree(int c) {
  auto n = gc::make<node>();
  if (c) {
    n->l = tree(c - 1);
    n->r = tree(c - 1);
  }
  return n;
}

int main() {
  tree(10);    
  return 0;
}
#include "sgcl.h"

class foo : public gc::collected {
};
class bar : public gc::collected {
};
class baz : public foo, public bar {
};

int main() {
  gc::ptr<foo> a = gc::make<baz>();
  auto b = a.clone();
  auto c = gc::dynamic_pointer_cast<bar>(b);
  return 0;
}
#include "sgcl.h"

class foo : public gc::collected {
};

int main() {
  gc::atomic_ptr<foo> a = gc::make<foo>();
  gc::atomic_ptr<foo> b = a.load(std::memory_order_relaxed);
  auto c = b.exchange(gc::make<foo>()); 
  return 0;
}

Not working

Cycles are not detected when a traced object contains dynamic container with traced pointers.

class foo : public gc::collected {
  std::vector<gc::ptr<foo>> vec = {gc::ptr<foo>(this)};
};

Todo

  • Implement dedicated containers (to detect cycles)
  • Test it in a variety of scenarios

Author: pebal
Source code: https://github.com/pebal/sgcl
License: MIT license
#cpluplus

SGCL: Precise Pauseless Concurrent Garbage Collector for C++
Cyril  Parisian

Cyril Parisian

1661121900

Ocelot: A Bittorrent Tracker Written in C++

Ocelot

Ocelot is a BitTorrent tracker written in C++, forked from WhatCD/Ocelot. It supports requests over TCP and can track IPv4/IPv6 peers.

New Features

  • Support ipv6 protocol
  • Discount on torrents, such as 100%, 50%, 30% free, which is supported by traditional tracker
  • Statistics of users' uploaded/downloaded volume size, last seed time, etc.
  • Fixed some issues

Ocelot Compile-time Dependencies

Installation

The Gazelle installation guides include instructions for installing Ocelot as a part of the Gazelle project.

Standalone Installation

Create the following tables according to the Gazelle database schema, i.e. gazelle.sql:

  • torrents
  • users_freeleeches
  • users_main
  • xbt_client_whitelist
  • xbt_files_users
  • xbt_snatched
  • users_freetorrents
  • users_torrents

Edit ocelot.conf(copied from template ocelot.conf.dist) to your liking.

Build Ocelot: ```shell apt-get update

apt-get install --no-install-recommends -y 
build-essential 
automake 
cmake 
default-libmysqlclient-dev 
libboost-iostreams-dev 
libboost-system-dev 
libev-dev 
libjemalloc-dev 
libmysql++-dev 
pkg-config

./configure --with-mysql-lib=/usr/lib/x86_64-linux-gnu/ 
--with-ev-lib=/usr/lib/x86_64-linux-gnu/ 
--with-boost-libdir=/usr/lib/x86_64-linux-gnu/

make && make install


* Run Ocelot:
```shell
./ocelot

If the service is to run in production, systemd is recommended to manage it.

Running Ocelot in Container

Prepare Docker Image

Run these commands from the root directory of this repository.

docker build --no-cache -t gpw-ocelot:latest -f Dockerfile .

If this is to deploy in production, remove CXXFLAGS=-D__DEBUG_BUILD__ which is for testing purpose, such as allowing peer connections from local networks

Start the containers

  • Deploy Gazelle firstly by following instructions GazellePW Getting Started
  • The container can be started using the previously built image gpw-ocelot:latest. We use gazelle as parent here so that the containers under the same parent gazelle can communicate with each other under the same network.
docker-compose -p gazelle up -d

Testing Ocelot

Note: The following instructions are assumed that GazellePW(gpw-web) and Ocelot(gpw-ocelot) have already been running in container mode.

Register as a user from start webpage http://localhost:9000

Upload a torrent (may need to restart the gpw-ocelot container to reload torrents from database if gpw-web is started with tracker disabled)

Send announce request for testing, here is an example:

curl 'http://127.0.0.1:34000/<YOUR PASSKEY>/announce?info_hash=<TORRENT INFO HASH ENCODED>&peer_id=-DE203s-TQaEVc.-mzuO&port=32777&uploaded=0&downloaded=0&left=0&corrupt=0&key=449DBE8D&event=completed&numwant=200&compact=1&no_peer_id=1&supportcrypto=1&redundant=0'  --output temp

Run-time options:

-c <path/to/ocelot.conf> - Path to config file. If unspecified, the current working directory is used.

-v - Print queue status every time a flush is initiated.

Signals

  • SIGHUP - Reload config
  • SIGUSR1 - Reload torrent list, user list and client whitelist

Author: Mosasauroidea
Source code: https://github.com/Mosasauroidea/Ocelot
License: View license
#cpluplus

Ocelot: A Bittorrent Tracker Written in C++
Cyril  Parisian

Cyril Parisian

1661114460

Code and Scripts for Generating Superancillary Equations For PC-SAFT

Superancillary equations for PC-SAFT

This repository provides runnable, reproducible code for fitting superancillary equations for the PC-SAFT equation of state

By Ian Bell, NIST (ian.bell@nist.gov)

The outputs of running the fitting are included in the repository, but the build files (needed for Visual Studio/ninja/make, etc.) and binaries are not.

Building and running

On windows, standard cmake commands executed from this a shell in the folder containing this file will do the job:

cd bld
cmake ..
cmake --build . --config Release
Release\fitmain
Release\fittest
Release\fitbench

On WSL2 in vscode, running on an ubuntu 20.04 image, the C++ build tools will pick up the correct building arguments if you open this folder in the WSL2 image and have installed the C++ build tools in the WSL2 image. Then:

  • Select the Build configuration (Debug, Release)
  • Select the target (fitmain)
  • Build & run
  • The outputs will be in the output folder at completion

On linux, similar to windows:

cd build
cmake .. -DCMAKE_BUILD_TYPE=Release
cmake --build .
./fitmain
./fittest
./fitbench

Python package

To build the python package:

python setup.py bdist_wheel

to build the binary wheel, which can then be installed with pip

Plotting

To ensure complete reproducibility, the script used to generate the figures is also included in this repository: make_figures.py


Author: usnistgov
Source code: https://github.com/usnistgov/SAFTsuperanc
License: View license
#cpluplus

Code and Scripts for Generating Superancillary Equations For PC-SAFT
Cyril  Parisian

Cyril Parisian

1661107080

LostWallets: Find Passwords From Wallet.dat Get 50% Balance with C++

Challenge LostWallets

wallet.dat
Find password get 50% balance
 

How to search for a password

Download the latest version of hashcat here
An example of using masks in hashcat is here
The hashes of the passwords from all wallets is in the file hash.txt Update 11.06.2022
 

Example of starting a search

TEST: hashcat.exe -m 11300 -a 3 test.txt foot?l?l?l?l -D 2 -w 3 -o FOUND.txt
Examples:
Run: hashcat.exe -m 11300 -a 3 hash.txt ?a?a?a?a?a?a?a?a -D 2 -w 3 -o FOUND.txt
Run: hashcat.exe -m 11300 -a 7 --increment hash.txt -1 ?l?d ?l?l?l?l?1?1?1?1 prefix.txt -D 2 -w 3 -o FOUND.txt
Run: hashcat.exe -m 11300 -a 1 hash.txt WORDLIST.txt WORDLIST2.txt -D 2 -w 3 -S -o FOUND.txt
Run: hashcat.exe -m 11300 -a 3 --increment --increment-min=6 --increment-max=12 hash.txt ?a?a?a?a?a?a?a?a?a?a?a?a -D 2 -w 3 -o FOUND.txt
Use your password search prefixes by mask or dictionaries
 

If you manage to find the password, write to me in telegram phrutis
Do not write me questions, look for answers on the forum
 

Partner addresses 25%

1️⃣ - 1NEFQpE4qETrAtzzRD8vLGs8FRZmUsV6FF
2️⃣ - bc1qphhedzu5jg7emtw09akwzzdh03mqaytett9zlz
3️⃣ - 1NoName1LLKRfLmoh9jawLWrf6t185bC7v
4️⃣ - bc1q5k000jhfklq8k82lpf8fz9cwffj4murvt7kxpm
5️⃣ - bc1qgdgr02whvzkzqcqhpstqepq8sjcc4ljgyfnka9
6️⃣ - 13npiGYMZVqYiRJ9Xr2vTu8NAmzCQ1iCGv
7️⃣ - 1BGYYSyPbs4YFDDudAVAULpNdkJQbYQpaS
8️⃣ - 1LcFtZjX3U8EX7pgYiawphmzyM9SYrq5z5

⚠️ - Suspicious (there are duplicate hashes)

 Wallet nameAddressYour reward PartnerUpdate
110000.00417651.dat1LfV1tSt3KNyHpFJnAzrqsLFdeD2EvU1MK50%🔒309.06.2022
25000.01168565.dat18xGHNrU26w6HSCEL8DD5o1whfiDaYgp6i50%🔒109.06.2022
34000.dat18eY9oWL2mkXCL1VVwPme2NMmAVhX6EfyM50%🔒209.06.2022
44000.00222015.dat18eY9oWL2mkXCL1VVwPme2NMmAVhX6EfyM50%🔒203.06.2022
5478.33.dat11.10 + 203.50 + 76.70 + 103.78 + 83.2550%🔒109.06.2022
6405.00120319.dat1An4jHFsSz31TjW49vsZtCt2SXKV7oHRWb50%🔒109.06.2022
7340.00283740.dat1JqPFnGPhHhy54zJKmC1MPiczzgFjCmzE950%🔒109.06.2022
8319.00053581.dat1FJBeYLRArReqVTiqwYTEc9hAfypGx8MyN50%🔒109.06.2022
9300.00055278.dat1LbvdyYr5KH8fZhXJ7txBr1RjoDnzhQEqY50%🔒109.06.2022
10252.20004225.dat1GYLfNfMesF3YrwVU94P5wtcJjhAx9DLYy50%🔒105.06.2022
11200.00224825.dat1DDYt8kJE1JBa2kQN1R921weJGbCnWcgG450%🔒109.06.2022
12198.00412439.dat1E87cVPLZ938w7vYEA1e9RWSc8mESPA3J550%🔒109.06.2022
13186.29379209.dat16vMxeMHJDbMoDu2s1ozDQAmzY3bPmdLLi50%🔒309.06.2022
14180.77714198.dat1DCqdVEh91bVzEShe6iU5iuNrd1LbsWvgf50%🔒109.06.2022
15177.74326390.dat1BiA2yvL3GWuGGVr7v1cGCbH6WPYvoG4tL50%🔒309.06.2022
16159.89913129.dat12PpzLTHNWCLsHPgHMNd9ebj7bwbTxs33u50%🔒111.06.2022
17⚠️131.63.dat31.63 + 50.00 + 50.0050%🔒409.06.2022
18130.00000547.dat1P2kKdepEAJQwVHoaodfQKD6jSJC86z1Yw50%🔒109.06.2022
19129.66226125.dat1AamCcS7oXPZYvYw7dwcZxjxJkPSxZ94vm50%🔒109.06.2022
20108.06001094.dat1G3hJ3CJdovXiTyK1AWQpTevW1hHCQ7jsM50%🔒109.06.2022
21108.06001094-2.dat1G3hJ3CJdovXiTyK1AWQpTevW1hHCQ7jsM50%🔒109.06.2022
22105.11031599.dat52.97191089 + 52.1384051050%🔒109.06.2022
2399.99901094.dat1Gj2KiTy9SFtuFSJECmpePseYchhkU3gXQ50%🔒409.06.2022
2491.00501641.dat1BvNsod2wBpjoJmYmbnhk1j9FLLWz7HzZE50%🔒109.06.2022
25⚠️90.59781094.dat73.50781094 + 17.0900000050%🔒509.06.2022
2687.86507229.dat1PYeoCUYbq6zsh7BcyRgeAQdkFGnhCY95T50%🔒109.06.2022
2778.65929782.dat1Pq2Y45aDfwGn6pKFGv8enKgNR2efw4jFW50%🔒309.06.2022
2878.60361094.dat1BSmyTdYpsHA5JhLS9azGmVADuJRiLWE5Z50%🔒109.06.2022
2977.98600547.dat14tZU9KyHXwkGXkVUKehkMfaEZ8ad7jwNc50%🔒109.06.2022
3074.16883731.dat1F11GQNQKTEme6L74c5dVTTMkD7ME2jiqP50%🔒109.06.2022
31⚠️73.50781094.dat18EGA8nGHjA998Qc17je6K8T6UUDHxeoCH50%🔒109.06.2022
32167.00093679.dat1Edi4uNFiR3R2Tw96MU3bLi7ZFtBsihNpY50%🔒719.07.2022
3352.55001760.dat13KKv3ywwJ5WYovLgiCAaqpCVuMDEF6oxo50%🔒109.06.2022
3452.08001094.dat15Ybt9WjCF5ABAZ1GjFVTjzV3dJH5f9USh50%🔒109.06.2022
3550.43201094.dat1QFDAGXRkhNYfx2mHEu81QH8dAj4go4A8d50%🔒109.06.2022
3650.18338758.dat1NyEeyXu8ydNw67e3ZTUmkwQJ8QNd1o3cF50%🔒309.06.2022
3750.00011641.dat1MtXD6gGHZB1cAcP1Du29Ho9KobMCYD7ZC50%🔒309.06.2022
3850.00004046.dat13vq3LDCBpwbyxSenJDpHWt3xCXgbtzp9V50%🔒409.06.2022
3950.00003282.dat1E4ad5bA8HgbqxsPYpmDtVRNBRF2XfqTns50%🔒109.06.2022
4050.00002188.dat1KTvsW5tg5gkJf9fyT2xsvjkv7dzuZNTpW50%🔒109.06.2022
4150.00001641.dat1JHqAnwohyhXgvwNnzEMeMwejsf6vHZhgp50%🔒409.06.2022
4250.00001641-2.dat18h7ETAzcqRCGNXTstWSavrvhy5S5YKsQF50%🔒409.06.2022
4350.00000547.dat1Aw6miK9me2AijQ76Q32NkPa1B7buWqWPg50%🔒109.06.2022
4448.92440002.dat18rB6Uh5tGTu1TftZ8swNgzp9DtieJaWhz50%🔒109.06.2022
4542.53718329.dat1NKmf6GszBQ6wo349LUT4Je1csNyDDpb5Y50%🔒309.06.2022
46⚠️32.85679433.dat15r2tRv6B47zGFrCFsUSxtGtxxKVN6KAUc50%🔒109.06.2022
47⚠️31.63000580.dat1EZeYuLR2ugK8sk4XeDVcyNGBT7sGPDrNb50%🔒409.06.2022
4831.01002188.dat14J2wsejqNKtrEpAe1ziQVHQHFE3yX6bKB50%🔒309.06.2022
4930.99098222.dat18jANvQ6AuVGJnea4EhmXiAf6bHR5qKjPB50%🔒309.06.2022
5028.00001000.dat1PbHeg1WDosvuhApxbfQg3iFDQ2WW7Mttf50%🔒409.06.2022
5127.03768216.dat1rhYqDz3WEbCSQM54bGguTnJkmLQwV3d550%🔒309.06.2022
5225.99960547.dat1JSTCtS21CFqBz2ZQT4X9sTeCoy58FwtDj50%🔒309.06.2022
5325.00101641.dat14PcoSTA1g2k1t2W5jg1S9zc5Si8ToQxke50%🔒109.06.2022
5522.85001641.dat19Hj5Pzi4hCj12porw97i183XYTrScbtXS50%🔒309.06.2022
56⚠️21.89679859.dat1HBXJBXWYM1jZd8p1ff2a4uhJxvtgoXiYU50%🔒109.06.2022
5720.11001641.dat1NuPEefRU2AZ319x45fY5wBHBV2Z72PY9850%🔒109.06.2022
5820.00241094.dat1F3yxoWp5TdpVzbziVJ2VnvhpaXJma3qnF50%🔒109.06.2022
5919.88790000.dat19hZHgZt94uXxSJhWDqxMpEZmN3ctvVFvH50%🔒109.06.2022
60⚠️19.43300547.dat18H3tXBX9fC2AguKV2m34YKHYugN1Y4XkA50%🔒109.06.2022
6119.33608000.dat1HuTxwnZMyaNRTsHJ2Xg83Z7mt75dtdwC350%🔒109.06.2022
6219.30000000.dat18HKjVPJwfDg7TDSpoVh2KBiTQny6hymMX50%🔒109.06.2022
63⚠️19.28011668.dat1EREjjsLgB5JJQhN89gQR9PvH89yWJ4kuV50%🔒109.06.2022
6418.72704494.dat1LSmeqqYoyGAxUwLxmkvuDU6LGM2FGf6AS50%🔒109.06.2022
6518.17000000.dat1EM7FJV7L3CJZuH6SFTpYnmbMi9RXKdwK650%🔒309.06.2022
6618.00000000.dat1B5FuKQgmPg4SJsCjFU3svrFPpZpQZMU1d50%🔒109.06.2022
6717.82900000.dat1LwQU2kqdH6dLSsizstNxrhqk7XhCMLMF350%🔒409.06.2022
6817.82021465.dat17ixLGdJQDdS76Un535rzbtxJNjmAJFqac50%🔒109.06.2022
6917.20100000.dat13q3UMbUdqak1xX385aZc3MmtdMtNfsnSU50%🔒109.06.2022
7017.19060793.dat1LJxQSJ1uf2VHq4RDZgHQgEwn8JRAr6btq50%🔒109.06.2022
7117.09000666.dat1NFp8YqgBjSRFdgWt7ynmojG8gpQDjVDpJ50%🔒109.06.2022
7217.08998980.dat16Wi4S2Dn9sK2VVtP5EgA3UP1zEry6oY8X50%🔒109.06.2022
7316.23030002.dat15npoeYGso1qyFAo7Wzw35s4fXMDh5ryrj50%🔒109.06.2022
7416.13643422.dat14jt9AzqeM1TX3oQCGWkQbtfeUYih3o56W50%🔒109.06.2022
7515.99100158.dat12ie6iDXeyBcyjSgdrs8Jo5eUbHg4r2N7Q50%🔒309.06.2022
76⚠️15.75044635.dat1H9WV22GeCQuTGQbwTEQfGZhvTVhNsscNr50%🔒109.06.2022
7715.71719998.dat1Lefr9kXBybeW4SG1KtpysnnKKftnDYTvP50%🔒109.06.2022
78⚠️15.01812238.dat18snvPxfy9SGZUNe9i7kUJced3PEdVWodm50%🔒109.06.2022
79⚠️14.77500000.dat1LhKQqkjzxxzve61HYytPYJ7oVMh88aV4T50%🔒109.06.2022
8014.70456309.dat1AHgGcw8LjzhsRKtKxjvyRSUSAnkcAEMjX50%🔒109.06.2022
8114.60000000.dat15LhbzoCjr9icNTsabMVBKCgTZYqPHgcaf50%🔒109.06.2022
8214.35226342.dat1AYyMBbxXv9E29qJoTpbd6ocje81ZAJQsF50%🔒309.06.2022
8314.09013974.dat1GDcVTrZNhVFt7pEnwvHfepoth6mqHVVvq50%🔒409.06.2022
8414.00010000.dat177a2RmG1nn78BQpjAyuEztvv24dXdns7r50%🔒109.06.2022
8513.76858117.dat1LmdsdywkMNqgXg7x7q88NT2WeXXf52co350%🔒109.06.2022
8613.47094589.dat1DphS33aWDZBWNEh3rPJFfD6GFP1mmgerU50%🔒109.06.2022
8712.82192064.dat19tLSCZWhX5YBVy6uX2kLheNjdUb9RBojS50%🔒109.06.2022
8910.83091000.dat1MB28otoAQFpP9ywiA8CbYVSKHpSTBH1z650%🔒309.06.2022
9010.50200000.dat14PEUoKuRB9Q7yfS94cRXh2XugsrBxbxAo50%🔒309.06.2022
9110.21000001.dat1L3amZhWgU8vnGzeMKJc4QFqvQhpU53WsV50%🔒109.06.2022
928.90000000.dat1LHjrPBeEYQv1f219VQcQ71EBpwvp3hdD550%🔒409.06.2022
938.77089137.dat16Na4QHvS2rEP23igjKYfgoPqUYtZvzB5d50%🔒109.06.2022
948.50023481.dat1KDUcZh5Z6H1of4Pwoy5ojJtkQxcQBHhnH50%🔒309.06.2022
957.00000000.dat1MsbUGxbcW1zKvTbNq86rvteu6zm7h7Nfw50%🔒109.06.2022
966.33718357.dat18fH6tk7KG998cSKXTg7v3wqLHuVu7es4i50%🔒109.06.2022
976.33560000.dat1LYdAMbjcbD8RsnThMz3HwhaGb1keyedjx50%🔒109.06.2022
986.29000000.dat13LjzkgZQoHoUEo9CsbLJwGcc8zmnhQrRy50%🔒109.06.2022
996.19445176.dat1NyECGXWqQdoNUCvNN94CoCC97AgBQcv2o50%🔒109.06.2022
1006.00000000.dat1L1iJNKBubV4KbScgKTYS85gjvBmoDpzST50%🔒109.06.2022
1015.89290000.dat1MnMPxYFL6hfCRmQxm1HxyChP7CvaCDaja50%🔒109.06.2022
1025.86332001.dat16M7J5ThnZ8TdoTzyS9nrY1c9V7gjjxmbt50%🔒409.06.2022
1035.08877624.dat15zMovc6E134wsPKWXhF364DsQXkLV7wcX50%🔒109.06.2022
1045.05538396.dat1JEsngBPtTs56qdx7UT3VzkusdmEBPAXCy50%🔒111.06.2022
1064.85582600.dat1JugtVnWfsRQB53woJCkKkLkL1HzHgXPvB50%🔒109.06.2022
1074.82537042.dat1Hrbgj881yoMYYvNvPkgGgEx6Kw8JxirLK50%🔒109.06.2022
1084.38100000.dat1CQyjZ8Rptd9YnZW7rX87rmni8HAPfwRgh50%🔒309.06.2022
109⚠️4.36000000.dat18Sb5pxmK7HNwG9dUrZhzzcAoX1n8FEUBu50%🔒109.06.2022
1104.02219444.dat1L42VCpdoysXAstA9Ay4Q5V3QsK12grQ7H50%🔒109.06.2022
1114.00043606.dat19sCR19UAdxCVPj6ATMGJV71J43X1wQoDa50%🔒109.06.2022
112⚠️3.98999976.dat179ubgmB4sTRQSutRMovStFoAHxfoVnDK550%🔒309.06.2022
113⚠️3.88501921.dat1DGNFJ6i4wvTAafLNux67w598bKREF5LwY50%🔒309.06.2022
1143.85090000.dat1GGwxGLy8PK1LUKBY71AZGessdkgdHxCd750%🔒109.06.2022
1153.73979441.dat17KwpmAu27ycGndUU4Jwj2HvFkYEUefuJd50%🔒109.06.2022
1163.53383248.dat1NUW3z5z6cNs8Ltd2cN2BnxP92dySdcuG850%🔒409.06.2022
1173.36894140.dat1BGJWEmGZhCYQEgp3pSZsBP3EYZF2c7vtS50%🔒109.06.2022
1183.17460240.dat15NtoCW4eoT2L9LQRvpKtNdiHt3Lh1Sv9t50%🔒109.06.2022
1193.08715076.dat15tzMWqPk6XcW7g1AB2sLfHp8KAuzVkWBv50%🔒109.06.2022
1203.02000000.dat1ADuSfQpcGxQxZ22JATwdbDjxgDJHTpZ8N50%🔒109.06.2022
121⚠️3.01244000.dat1L6HgRR5rJAUXb6UGK2Cu8ATLq48YRksTE50%🔒109.06.2022
1222.97000000.dat18cC6RJjYq5vxPAPmMA1KfszMzRr5FohLW50%🔒109.06.2022
1232.97000000-2.dat18cC6RJjYq5vxPAPmMA1KfszMzRr5FohLW50%🔒109.06.2022
1242.96812861.dat1Cr1cDL6NNzyWey66Lzt9QvCjKJXZgEs2p50%🔒109.06.2022
1252.82717743.dat1PXJMEw2He6ESDJZkSzUA3eBD6XfCFrTna50%🔒109.06.2022
1262.74500000.dat1Ea2zY7BZtLKmcT83QXscXcBudWATcSf7v50%🔒109.06.2022
1272.74000000.dat1E1nwBt5yf71VpHDhbbiWKkGPrVV5ZwhXA50%🔒109.06.2022
128⚠️2.73000000.dat1K3wtJsN8pkHB61EWfFy5VKD1dk6UNpMLy50%🔒109.06.2022
1292.69500000.dat1AZZbKaYZns8LAGnVdPQEShMzVKxcCMCfx50%🔒109.06.2022
1302.68753118.dat1A2FEmGPFJrUMhCXwxhMriK7KFR7ivpwQZ50%🔒109.06.2022
1312.63049301.dat13EmuvWVN7phTS5o9Ru1FsYuZ43rKpGTKm50%🔒409.06.2022
1322.53794900.dat16ySdKvgp9bHPgjnfxUawPrmRyQBvfbuWr50%🔒109.06.2022
1332.50000000.dat1GGtCHaMAzSex7tRaNPMG1ZC2WF5UYuZjy50%🔒109.06.2022
1342.40000000.dat1AFuqjnZSveYPpaAQqH6VRssxSF9YjRxaz50%🔒109.06.2022
135⚠️2.29597675.dat13Rb4ZMRjrkSYFLgdCJuxF7AWPngyaeC7e50%🔒109.06.2022
1362.28883133.dat1FcHtQuvWrFLzqRKVgaaGHMEzL1o9bb36U50%🔒109.06.2022
137⚠️2.28384400.dat1CunakLPvMN4hHQzM5najUmQx2q2h8Mynv50%🔒111.06.2022
138⚠️2.20704746.dat1N8L17Z7D6bBCWkSKABDf2qqJNHT1R9fv750%🔒109.06.2022
1392.16000000.dat14R9c6qy3ES2YrdPhnDuncrJmqcFNdwUK850%🔒309.06.2022
140⚠️2.08763448.dat1JYfyscMaVHhSpqkU5mH5dFBz48etu6NPm50%🔒109.06.2022
1412.05917246.dat13A4wCqU2v5f1rMELgaJ1PV7CYD9yYPfQn50%🔒109.06.2022
1422.05423471.dat13TTA7LS3fvCRtUytEmW1HZwzY3kaahDqU50%🔒409.06.2022
1432.04866236.dat1QAZ3GbyK2bpuejqmoqQaveqoBDFjiY2Ds50%🔒109.06.2022
1442.03000003.dat1GXR9FzCReefMfr1cWn2vFVqb7qsajTKxs50%🔒109.06.2022
1452.00792223.dat1Foen6hijntavxrwq6dC1sFKev6NYA4bbc50%🔒309.06.2022
146⚠️2.00515494.dat179F4iZspgdqy8Ugtw3z7wDu1kF3z1i4MG50%🔒109.06.2022
1472.00000000.dat1NyAYbSvrx8T1YkwqnKQ6JZkTeKHcB4Les50%🔒109.06.2022
1481.92980000.dat1BpehDQS3JHQmH3p8y1PrG6sycJ8S4z67750%🔒109.06.2022
1491.84950000.dat173qP26Urf7F3oJkEexfetTDjD4Y78fbjH50%🔒109.06.2022
1501.83949995.dat18jXjhpdiwF6R5YkPyUZMNSkxHRXEajYEq50%🔒109.06.2022
1511.83913928.dat16pYs9RdquncSfqgVE1jARQhaLtURYnsng50%🔒109.06.2022
1521.71600020.dat1PEbNwPneV4zs25tGEtXai38R9DX7Ly9mq50%🔒109.06.2022
1531.65000000.dat19agCPKUC8eD24W6AhrwSNwrUFtrr358vQ50%🔒109.06.2022
1541.56079001.dat1CyiqmkPFb7SysXhhTdtd8ajpz58t5xFRY50%🔒309.06.2022
1551.44138096.dat17YbJhRweKx2tVqepkvMYKvP9zxLfXLKoz50%🔒109.06.2022
156⚠️1.44124101.dat1Lc6RJEB99cXMRBnkuTZqqojv6pRjikCkA50%🔒109.06.2022
1571.39498354.dat1CcnHNGyxM6FCfjMrV5dwBW1mngGnUkFMF50%🔒109.06.2022
1581.09479390.dat1AS8nsUcQYvJQJDrxi9rpjSHa5n9hVLLno50%🔒109.06.2022
1591.08795916.dat1F654t1HxrZtg7uhcXyZeFvRsyB8HCnBXJ50%🔒309.06.2022
1601.00103254.dat1AxhH9CKkP1WBoT9bF1jFQo2nEdPDooP4i50%🔒109.06.2022
1610.92387567.dat19wCFh3wAqqWE9SNJu6QyBmCVX68zVGLH550%🔒109.06.2022
1620.53970361.dat1MJ5ebhcgZczc5qvdJM3h5SNYgUjDxjWeD50%🔒109.06.2022
1630.39370194.dat1JQLXZdb19UcW2z6m3FzNUbVRKTU8ke7MV50%🔒109.06.2022
1640.36688060.dat1AaB2jXukNRcY88ichcuSvwvgKkNdWaNPC50%🔒109.06.2022
1650.29957903.dat1Fd4kGGuBwxH2QZe6cTS5GATXQeFBMmxKJ50%🔒409.06.2022
1660.21966138.dat1KVBdT8ypyywuisonw6k69UUynARJ366JW50%🔒109.06.2022
1670.10000000.dat1DH3GZaGLbgFvVPP9NzZDZXQweKhU2BHeG50%🔒109.06.2022
1680.07394004.dat12vdxXV3m5xRTi6vAAwMkQQkVL5rh9LESE50%🔒309.06.2022
1690.06271293.dat15zrzE1psJJGjXyPiLkLTbiqwcjvE4hu7d50%🔒109.06.2022
1700.05847536.dat19bdmxEtNgt1ogTWCYpGW2Qpn4qBmfUnGk50%🔒109.06.2022
1710.04157575.dat1EjMaPCv4EyEVXWtWyPSD7HjAb4nZ9iADK50%🔒109.06.2022
1720.02994543.dat1JsUStZoy9aHqFkH3Gqpz4RQFCFqyhk5W750%🔒109.06.2022
1730.01786378.dat12d31NMtE18xgdRLdhDgDs7BSSXxsZaH8r50%🔒309.06.2022
1740.01649536.dat16euRht9j5pysEQ8GSyqvWQWSVL9zmBvf650%🔒109.06.2022
1750.01630413.dat1CxKn8H3tbo7s7qzExVD3eFs94nceNiiRV50%🔒109.06.2022
1760.01212207.dat1HQ3Go3ggs8pFnXuHVHRytPCq5fGG8Hbhx50%🔒109.06.2022
1770.01000000.dat18MW7RLHthpRDmzcfDjFSaTamxNSSkMs6750%🔒109.06.2022
1780.00900000.dat16PCQnhRNZoD2jGuCNvfJS3aCZeELsX34A50%🔒109.06.2022
1790.00122539.dat15KeSdnNDVrCQ62TGFRNEx3xedKwXMpvn550%🔒109.06.2022
1800.00044000.dat1745e6GxkbEjsL28b9qpSHQKGBpWxFtQsD50%🔒409.06.2022
1810.00000580.dat17bqkPW21QhRUBcUQiy3C99ZC6L52Utu1b50%🔒309.06.2022
18214.00001641.dat1JHwt6ArhujJmgDKPtSmGkMmSAPyAhVptL50%🔒624.06.2022
18347.00001094.dat18HYU4HJe6h4ETeG1N7GUANFoKoqME2JYT50%🔒624.06.2022
18464.30251094.dat1LRc9XLxZbDrHDEagHPESdxbzm798HMek250%🔒624.06.2022
18575.00011094.dat1Afh86YLq9tZWGsQhmDvCoGE2QhwYXxmcY + 2550%🔒624.06.2022
186169.00013592.dat1GthMXgwcHByL4ZNXVJn92ax6LN5RJYRK350%🔒624.06.2022
187575.99105683.dat1HZNsUqQxKVLmfPfCAzLwrnVDzx8CxwxnM50%🔒624.06.2022
18834.775686171GnNo5yKUiPoHY3Lo67nNYEMgHRDxaNEo250%🔒801.08.2022

Heshes table

 NameWallet password hash
110000.00417651.dat$bitcoin$64$f0ef639cd01bb26805c190e0aeba006fbdd6b817e0b6634b0fb11944bc0f19eb$16$d2542bb38e0ee061$76753$2$00$2$00
25000.01168565.dat$bitcoin$64$ad50c8d3435f8f711f384090a3df9112e0b84a0c97f727b3bbbdc28865d8d7b3$16$f193886b9f6d9853$37480$2$00$2$00
34000.dat$bitcoin$64$ff4eb1d017921e0c7023da7e17aa72bd5f11f9025c844865665932125f79f465$16$6b8207637fc796a0$37698$2$00$2$00
44000.00222015.dat$bitcoin$64$71e2e716521853a705f989b6095792e134a65d3c7dba4a2ef9e4b7b2a1b3b5c9$16$ad323db3a8d1a222$92592$2$00$2$00
5478.33.dat$bitcoin$64$2cc2bb488dc29fdfad85772b78bf96b29b054cd09a8a80311ebf6f7f821a8a63$16$c2ad95b0204070eb$67888$2$00$2$00
6405.00120319.dat$bitcoin$64$b56f1b90d107ee7e09e5f2ff6a430dbde219e17dfae7041b7b8eec3623b1a8ed$16$96846cdf25ec9168$36571$2$00$2$00
7340.00283740.dat$bitcoin$64$173aabf5927d86a1f9c34a59d9cd708c9d62fc181a90cf0f1b63e4b459981ac2$16$1d372be16c465eb6$131578$2$00$2$00
8319.00053581.dat$bitcoin$64$3e9bcabc966d7870f4ac263a2cb1efc2400644a917113c772375e588ecead5b1$16$18beed5b1565a5e5$47871$2$00$2$00
9300.00055278.dat$bitcoin$64$eace1c7e8662942150848fdbefbc83070bbc8c3a18d2c29b5132acb2c3f54f24$16$dd7d5c0aa12e709f$35211$2$00$2$00
10252.20004225.dat$bitcoin$64$13abcf57772b84ee6a219230be955924fe5da7d39218f0dba0be4656bed03e03$16$eea3cd87c0b59d6a$83164$2$00$2$00
11200.00224825.dat$bitcoin$64$8eb2f42013a2038debd86073f2927b6b06b5ea571e9dfa9a47850ee5d3d419ce$16$3671d4398b077fae$66889$2$00$2$00
12198.00412439.dat$bitcoin$64$a26662b81f90ae52c2e381b7b63c75325af6e46baf1c90621a885efe78178cc4$16$447b22ced4ef74c5$113073$2$00$2$00
13186.29379209.dat$bitcoin$64$f913fa9e5ea97dad615191c23af0f5ebdbe4693ddbea0903d9230832e7ae36c0$16$4cad32d55bbe6595$37167$2$00$2$00
14180.77714198.dat$bitcoin$64$47fcab2113982a4c02d852264e0803090ba0dfd25114164eba22470883ce4ebb$16$4f19e7f51dc4aeaf$72580$2$00$2$00
15177.74326390.dat$bitcoin$64$16f32e8ac625bd85062124bdee0276b74795a535d299118559560cf2f15d332e$16$656dc3e22ca1a711$131578$2$00$2$00
16159.89913129.dat$bitcoin$64$b540b7774bb0d392ca2ea1a5156f3c4ce5bc4687001cb79b3378519603819b21$16$3581059576caf391$52162$2$00$2$00
17131.63.dat$bitcoin$64$cace7ac50d843272b6e9ec834ac9a85bf1fa71176423ec780848d099d5856746$16$f61f668243cb1ca5$127854$2$00$2$00
18130.00000547.dat$bitcoin$64$2a7561ff817d54d524be0a9f19862403f015931a970cefb61f8f674b16e965a4$16$d09282a6c54e9d5f$83844$2$00$2$00
19129.66226125.dat$bitcoin$64$6bb4314c09ae8bc0ed3bb430509358f3455653d4554fe8f607c3bc98432cfeb9$16$d659cc9c4ee162e2$64397$2$00$2$00
20108.06001094.dat$bitcoin$64$e028fcb19d419b301a45f9850b750ad1ceaa8db1967b9fb8bbc4456ed5de580a$16$cf373e94a48bdb1f$35714$2$00$2$00
21108.06001094-2.dat$bitcoin$64$3e04675fd0e35dfee9ffb5cd55bed9903137b9f049406be43d04069c2fe96e9f$16$2aabeaeb7f4a1041$132242$2$00$2$00
22105.11031599.dat$bitcoin$64$6fe4843548d07f8aae5dafd4637d492243f60306028d5c7bc5ac56a2f57ccb54$16$99ac4b568568fb99$69345$2$00$2$00
2399.99901094.dat$bitcoin$64$08a4bbd5fbd998e5a334cb31dc43c3a625872998b6ff5b3830f5ffe30ee8156b$16$0af493ab2796f208$73689$2$00$2$00
2491.00501641.dat$bitcoin$64$e5f72c841730fd7e6965cb5c415016aa48c69757bcdf8c922a809d50af4c6c06$16$eddeaee1261a64e0$47530$2$00$2$00
2590.59781094.dat$bitcoin$64$eb22cf4ac8e7c5231096f7ce560803116345ba6cb0104f1488803e57f1d18e5c$16$8c0643774dcd2e5a$68452$2$00$2$00
2687.86507229.dat$bitcoin$64$0d79241a6ba712a0d55440104d01811ccdf4d4294bdd89748bbbb6ef46dc15d7$16$646ff236cc6fe1e9$83181$2$00$2$00
2778.65929782.dat$bitcoin$64$9e8d5b70d45f8fdeded358b8f72f81c0436398a220081a60044dc7bf5f9ea23e$16$cb9c55df52aa906e$35714$2$00$2$00
2878.60361094.dat$bitcoin$64$feb27bbab8b0a6f15b26f418c10a20bb73ba287d439ae5ab6ceb0287e731f55a$16$0af493ab2796f208$73689$2$00$2$00
2977.98600547.dat$bitcoin$64$528c67300053686ddcc5bde2ab6cd7dfa451a56e9c08aa27dcf1cc276cb3df48$16$8be30851d53f2928$40948$2$00$2$00
3074.16883731.dat$bitcoin$64$f8e443e6d6491d625a2ea48ddacffe0d1312ee59d80849d7f8cdb94d09931e84$16$7036c30511f8672b$36571$2$00$2$00
3173.50781094.dat$bitcoin$64$eb22cf4ac8e7c5231096f7ce560803116345ba6cb0104f1488803e57f1d18e5c$16$8c0643774dcd2e5a$68452$2$00$2$00
32167.00093679.dat$bitcoin$64$520cd59365a8344f7ec28052a6e005a98718e6cb94113e7771043da64942ba23$16$876fe8ebe62fc095$193278$2$00$2$00
3352.55001760.dat$bitcoin$64$a0af3fa5006030e0edce5bf0931bebe7e0b27a694d314a68790d21347d79a657$16$2142112a50c1e140$73529$2$00$2$00
3452.08001094.dat$bitcoin$64$b1ed5af135a124b3041d79bb43074ae1054d3476693194d55d59c70252df19d6$16$aea459993c7600fe$38193$2$00$2$00
3550.43201094.dat$bitcoin$64$b4ec55497c544b4e6a7435fb6f30205c2baf86c9f533da2bbfa1e6f9fabdf330$16$3795a68bc27c5915$35537$2$00$2$00
3650.18338758.dat$bitcoin$64$f3c90b573111e06ff0f96ebf32921f5f3dd10ba219f391ab0fcc1adadd3e2000$16$9809070f76fa92c4$60692$2$00$2$00
3750.00011641.dat$bitcoin$64$25e8624d377949f36c4fdf104fa7f3ad3307be3499e72cae367f161b38a062d3$16$9d2eb2ad3e972053$37167$2$00$2$00
3850.00004046.dat$bitcoin$64$e5cd19531bbb0c546f510338013f8455b5cd9b2ed802b056847e88a8d1e391e8$16$eba14dbeb5c79b04$63443$2$00$2$00
3950.00003282.dat$bitcoin$64$3335c9e0dfd882b72d86f2b0412463e185768576771c6489e6fad6e4caec94c7$16$3365bac0544c6cc0$37167$2$00$2$00
4050.00002188.dat$bitcoin$64$f95b995bd952613281a7fbf16a37abfa342d579a651d2fcf32c21d7479fe587e$16$c61ebd84c4990e1f$70312$2$00$2$00
4150.00001641.dat$bitcoin$64$29ce72e5f11715f757021bc614fc29ec759cc614052d877ab050888f50245f82$16$2f756cb410d49abc$68432$2$00$2$00
4250.00001641-2.dat$bitcoin$64$3a454c193072c1c905d0d502adfee1e397e5795a5b7b476c15183f13d9c43e30$16$fdd4199dc3488f7e$61570$2$00$2$00
4350.00000547.dat$bitcoin$64$45abd6ebb0035af6c4ca2045a2bce9f663b763dc8afb558326752011ee85aa68$16$21eb684dadd49089$70727$2$00$2$00
4448.92440002.dat$bitcoin$64$f011045b52a39829f0e053f35b594c18c02bbcd936994279201cbd8e07f27197$16$b7445bc82d7e62fa$38043$2$00$2$00
4542.53718329.dat$bitcoin$64$b5ee3fb4fdb69a11efa972937e2fd0cf10c749b3d0967947205b4710f89fdbb3$16$00878c494362d4ab$35714$2$00$2$00
4632.85679433.dat$bitcoin$64$8ff0c52d3026ac8b949fdc64444d4daecbde19f8bfb3fb4b3e199fdb5aff8339$16$b5ba03e404f1d79d$125631$2$00$2$00
4731.63000580.dat$bitcoin$64$cace7ac50d843272b6e9ec834ac9a85bf1fa71176423ec780848d099d5856746$16$f61f668243cb1ca5$127854$2$00$2$00
4831.01002188.dat$bitcoin$64$bbd2f31a2bf33fcaea5d7f70f66cc1cf7273ba891ced76ced406bf762ee6bdba$16$4b495fa46139cf2f$132242$2$00$2$00
4930.99098222.dat$bitcoin$64$50bb9ef9cad87bf2b865b060e80c72c52f5ff496dbefa0bcfc6c3b5e0b86050e$16$f63cb4696e604d94$128289$2$00$2$00
5028.00001000.dat$bitcoin$64$3b5c5b0ddeebeb5697ab53e08b3a33073c51c2c1a93ce853ba7bc4a066d13b78$16$eba14dbeb5c79b04$37480$2$00$2$00
5127.03768216.dat$bitcoin$64$023ebec32970c6ec9453b84cea7bc58e92240534408cc6ea4a22cff2c21d0132$16$ef7b10ba55248b66$132242$2$00$2$00
5225.99960547.dat$bitcoin$64$c1f68299d421f5f2bba2947cc84bf1cd5be222b92db11473c25dd6f763ad40f1$16$57f4b89317e7d3ba$132242$2$00$2$00
5325.00101641.dat$bitcoin$64$144cc82f35ee18d502a01b826f5c47d201fad3167d26fe252595cf9c892584fa$16$af7ee951c6e05e80$33610$2$00$2$00
5522.85001641.dat$bitcoin$64$b5360e667fcdccf601d35c5f8bda852de40464373bb79df247c46ac6b97fa76e$16$8ead40334c7161b9$35714$2$00$2$00
5621.89679859.dat$bitcoin$64$4e5275fdaa62b805f8866082a87d953cca0c11e8e9d6511ab8a88690e107cd6d$16$802b35126a909e0f$81065$2$00$2$00
5720.11001641.dat$bitcoin$64$3e65e817d605b9d5d0b54bc8418a27aa104847dc59d664c6928601a8098927ee$16$5bcbad051d845552$60692$2$00$2$00
5820.00241094.dat$bitcoin$64$7120f443a02024283d9a4fef4c2c7167c2df239f4eeac4541a7327fab1ac05e0$16$88e39336106da6be$60692$2$00$2$00
5919.88790000.dat$bitcoin$64$a37dc249738892ddfee64fd9eef6a164c334b2828e24738f53bc22399f0f24a5$16$739dfbe436b4d196$38193$2$00$2$00
6019.43300547.dat$bitcoin$64$8109c279503278b8cdef8b67a817ab04c77c06dd7cc83b76fbe7f3d3f1d4f53d$16$5e4a6c017108845b$66056$2$00$2$00
6119.33608000.dat$bitcoin$64$f5a420086263fe96bf02389428e2a9bb043f52ecd0d09a15e99791e68153d98b$16$332e0d9db3c0ee6a$30841$2$00$2$00
6219.30000000.dat$bitcoin$64$9a7accab21442dd5c169eb408dc406c6cd77ccf39e9b3a1cf533bf867686c893$16$c7ee4cb0135cfabb$68810$2$00$2$00
6319.28011668.dat$bitcoin$64$f7ffc0d93ca4cef66464c5c5461889f5cbaa2bcfc09d2a01df216241d2e2be8e$16$1f1e4d7daa8cc4a1$67520$2$00$2$00
6418.72704494.dat$bitcoin$64$3662b157e4eecaf689bfc43252fba54d915592fd2332dd50128d61462f3dba64$16$a9cef4ffcfa6e71f$38193$2$00$2$00
6518.17000000.dat$bitcoin$64$27d8eb445a52382c6cfc18b49286087cf12db2e0ef12c77bd726a30cd72cb7ce$16$1d49acbff96eb626$35714$2$00$2$00
6618.00000000.dat$bitcoin$64$947f45d86f69bea47315abe26a0fd2eca5900909cb3d9fa47db36fab5584cccb$16$f04384fc94d2ba53$62973$2$00$2$00
6717.82900000.dat$bitcoin$64$1fdea045bad48f49950430d773df1f6be4220c6d97a4a0d5045a5b72835f5495$16$6c3755c8d7298b64$56081$2$00$2$00
6817.82021465.dat$bitcoin$64$64f7392c7fa156c85cc89d44edd6d27ddd0d68cb78a56a8ad60cd732fe569c01$16$2e7c23cc7fc0b14a$60692$2$00$2$00
6917.20100000.dat$bitcoin$64$8d167901e4f604a677eddb21460cddc4f5603f3b21ebe33ff726d9077ee07cdb$16$722cb04e0e8fa285$66170$2$00$2$00
7017.19060793.dat$bitcoin$64$54c20b76a774c8a9064e42d63ce98ae531b7c011483d25c42ad02ef0456aa376$16$e759f4549f41b949$77315$2$00$2$00
7117.09000666.dat$bitcoin$64$7f126bc43475c2fa85d7831a854d87a0ede3d742f6da71f79ccb65c284c6b0ba$16$fa85aa2d5eacee31$67271$2$00$2$00
7217.08998980.dat$bitcoin$64$0b7b5199cf24c104c1b130906774f2843d1f01ae62c8fff935c7afc3411dc8e9$16$66934f0863dd4482$63268$2$00$2$00
7316.23030002.dat$bitcoin$64$beee3a4519bd860e383f3a114b3a08cb4e7199248ea06d392fd9af52c042b4db$16$b6a4588ae3ba3e36$60714$2$00$2$00
7416.13643422.dat$bitcoin$64$00b0d3980bab3d9b3694fbed9e9082bd2fdf9b5ff8a4fd05b6599b556c6b1c67$16$22589d3f997c387f$60435$2$00$2$00
7515.99100158.dat$bitcoin$64$2ecb6691460c19de44584d2b22d201597874ec4ced76c806455e079e6d811da8$16$fbf192d3baf6bb02$126145$2$00$2$00
7615.75044635.dat$bitcoin$64$af049ff75a8d5c1214e252f3c926b7b63e20f78f07fd411ca04140f272e557ae$16$999bf4729b971c7e$67169$2$00$2$00
7715.71719998.dat$bitcoin$64$e1fcb6f24724b47a52bb16b9ac6a150454977541f44decb080c63471880e4c1c$16$012f4675057fd231$69491$2$00$2$00
7815.01812238.dat$bitcoin$64$0d620dd9913bb3d0993bc7626bd5b4f388b64440498c4da55b52d53ff2f2d161$16$73b40d780231b8ca$63056$2$00$2$00
7914.77500000.dat$bitcoin$64$0d620dd9913bb3d0993bc7626bd5b4f388b64440498c4da55b52d53ff2f2d161$16$73b40d780231b8ca$63056$2$00$2$00
8014.70456309.dat$bitcoin$64$5e8a31c248beb652f3403ebab417104a689e8c332c1b439dac8bb80fc92b762e$16$f6a2d85665fd5826$62954$2$00$2$00
8114.60000000.dat$bitcoin$64$44edd3d9e1aca5d3e486e2a43c3c507b475fd6d2235f91394bf96105e78105c9$16$0db9b5dd9f71ba20$61714$2$00$2$00
8214.35226342.dat$bitcoin$64$deed81af471f5677b7c11a883237b20c9e6b8738e5e65945f4288ece6f413a57$16$f0bdf179fd204a59$35211$2$00$2$00
8314.09013974.dat$bitcoin$64$f83d2783f238d5fde0e082e20686ff85cb92bb0737da214e2e39fd61b828bf6c$16$adfbb9cfa83e9cf6$135318$2$00$2$00
8414.00010000.dat$bitcoin$64$c00315444e82cc43ec23bea608c7889138a6d73bcdef3ae3526fb64ef79ab0e9$16$f8a9ac6e9be0c72e$74899$2$00$2$00
8513.76858117.dat$bitcoin$64$c4904a4e27e374a782aa9700bc953bea61dc0342f8df97491d229fc6bcd5c641$16$25b711ed92cdf3c3$74899$2$00$2$00
8613.47094589.dat$bitcoin$64$a056da8f6713a70d9f6b125931ac02a3b89f3aed658ab444b624c740d08460d2$16$ded7ea15fc0ad57c$53205$2$00$2$00
8712.82192064.dat$bitcoin$64$b111269df559c2c8929f4e7d82bd627317301d9fdd189b5360153ab28f7d04a0$16$cf488450374c34d5$35714$2$00$2$00
8910.83091000.dat$bitcoin$64$6942834a1cdda69705d2cf9ebc3a204d5bfa64ff40d81db0bac6ccf63b3aff8f$16$00aa7d8b96e6174d$37698$2$00$2$00
9010.50200000.dat$bitcoin$64$93112f8c11e9cbff7561038eddf268827dd38c72354695fc70d4a01102d22c48$16$14bff2455913f62c$25000$2$00$2$00
9110.21000001.dat$bitcoin$64$5c9d138da82ecbffde730616d3c2b55553118d3884342ac3ee36c9f0cbb552fd$16$3dab00ca419a9840$57197$2$00$2$00
928.90000000.dat$bitcoin$64$fbb81fa5f31a282331e8ef06d849522e282bd6689174b970fd8635eff36887ca$16$d68a0ad1e3fdd725$71074$2$00$2$00
938.77089137.dat$bitcoin$64$ef08500b11fda51111e9106ab0bc60fb77870202a7a433abe1dda820be9134f6$16$a962fdb86e3161a4$60692$2$00$2$00
948.50023481.dat$bitcoin$64$ff134f9f03da571e5b256dec561730aaa674ff37d8a698d3c2c5e66fdbb07335$16$125d64b2bab4c437$136217$2$00$2$00
957.00000000.dat$bitcoin$64$f20759bb3249e7f1928373981c4efb014d45b632ed8a3c781f061b92d095888b$16$3ff48fe3e092513b$111555$2$00$2$00
966.33718357.dat$bitcoin$64$829c1c500a6b80ce0f6a622bf77d9ad75fc07abe2753695e8c256bdd5e5ad872$16$e88c5fd7136eb715$52082$2$00$2$00
976.33560000.dat$bitcoin$64$6631eda4a5fbaf95d5d4fe18f9b04401fae84adbaf2238f78c1871dcadfde1a8$16$dbd7bd2153d79ff9$47334$2$00$2$00
986.29000000.dat$bitcoin$64$df4579769ff97a92cb815f8484e16e796df133e84ff392d56eb65399b69be57a$16$5f3ced39d11972bc$77315$2$00$2$00
996.19445176.dat$bitcoin$64$04ac3ea427bfa8ddb2c6e10199267cd338cc9b19e4e5ce0806f6078b312604bf$16$b09bc7e9b1c6087e$59659$2$00$2$00
1006.00000000.dat$bitcoin$64$cbd7fe1739ba5dbf965fa015bc4cb089649a56a9a0002b74ac0c1076bf81de40$16$2090fd216ae96fee$61090$2$00$2$00
1015.89290000.dat$bitcoin$64$1d94364372d1cae4bfacbc1ac7722c2bf92a98de47ec2f8ac476119d45d40a60$16$ca471cd3a19b04ff$67917$2$00$2$00
1025.86332001.dat$bitcoin$64$7095f9031c639640d11d86c0a8597556ae8c940fb3bbda7c1cd789c3fea8dc08$16$c738f48338155e0a$67219$2$00$2$00
1035.08877624.dat$bitcoin$64$aef813b23f8577f617d5d4890c1d769c46cb492e519214eb8d85c6f1606b6b3b$16$de2b3bd38f902753$64425$2$00$2$00
1045.05538396.dat$bitcoin$64$5b6312295d46f157526f818dd79e9caff8df36e7ae5977863ee6686d9b8069ff$16$e6405f8a7f5ae3c7$107430$2$00$2$00
1064.85582600.dat$bitcoin$64$41f22b8d40dc773fae1acacc0c10c5746e0bf8cac6cee1129ade3b3d49b99a9f$16$fef57fc288239116$130926$2$00$2$00
1074.82537042.dat$bitcoin$64$fd1efeee395b9f5167ef5b2d40e6701164bd8fda6f055b21161f0f6b214cfdc5$16$32ddd688dd623687$35714$2$00$2$00
1084.38100000.dat$bitcoin$64$0e7f3dd3368aa563848291d14059ca6b969fdc6567be670d93f982693c4a913b$16$df1b66a2e41c2eb3$35714$2$00$2$00
1094.36000000.dat$bitcoin$64$4e5275fdaa62b805f8866082a87d953cca0c11e8e9d6511ab8a88690e107cd6d$16$802b35126a909e0f$81065$2$00$2$00
1104.02219444.dat$bitcoin$64$b1aefb2665d35512c81f3765cd99d0a7cc1e15fcb741d0f21a46babaf9576cc1$16$6390ddc3df7fbd48$72463$2$00$2$00
1114.00043606.dat$bitcoin$64$bcbea16e815204542d0c5c933a9b4082e34ac2143b586c8084bc6519e340375e$16$df41a91be092cb86$64053$2$00$2$00
1123.98999976.dat$bitcoin$64$71fe0d4dc27b24dcd1ea6639d644e8daeff04c38e30d05f0a74b17d28f25667e$16$df6cabc03425d39a$35714$2$00$2$00
1133.88501921.dat$bitcoin$64$71fe0d4dc27b24dcd1ea6639d644e8daeff04c38e30d05f0a74b17d28f25667e$16$df6cabc03425d39a$35714$2$00$2$00
1143.85090000.dat$bitcoin$64$895b386376c1ca9c1f8b440ea269eb4a772bcb4b47757c7708a03fd47a8ca3f2$16$d1d93a887220a49f$31249$2$00$2$00
1153.73979441.dat$bitcoin$64$7c777ff6ca1be06757120c36eba39c7573a1154cf35277e4740f13b1b44504e4$16$24089973d01d5f0d$82925$2$00$2$00
1163.53383248.dat$bitcoin$64$011f6abdec8e23032b7eb1298ed661fb9ebcd7388b3963b527a2923cce6800ea$16$e4aa72cd2bfa00cd$68014$2$00$2$00
1173.36894140.dat$bitcoin$64$a1a3ef63fba5710a98208a9dffa57d64b2a2d69e475514a1ddd4d178bf04a171$16$4eb9d7607de381ac$71074$2$00$2$00
1183.17460240.dat$bitcoin$64$23ca949be014591b7d6084702e54aebdebe5ee3658d7cb45cb2cc502c17ccce2$16$e167a26aaf9a728e$67219$2$00$2$00
1193.08715076.dat$bitcoin$64$fbb855a7512b44a6c34c0e762c2844b1c5078a9bf175ccf894f6660660031ecd$16$b2703da18a5ac317$76979$2$00$2$00
1203.02000000.dat$bitcoin$64$70e4c5802b753c0a54bfaed48c660091ee646e86b313a37c7c4fa4b9552369dc$16$6cfd640bb735f660$31609$2$00$2$00
1213.01244000.dat$bitcoin$64$89cb146e3db70ae648d03266ab4f506e027b57137066c4d888ec66fbfde5236e$16$74752ca5389ef081$70054$2$00$2$00
1222.97000000.dat$bitcoin$64$0a5930326e7079600c75fd3bb4608727ee98888100322a4dbfdbe1f88e2e0b21$16$b4198b2d3fceaae7$61763$2$00$2$00
1232.97000000-2.dat$bitcoin$64$5188754f6b4942270d8f1dcaa8b1658b5e82fac953a7394dd8a5d0cf622ae70f$16$6cf03da04dc5b899$72580$2$00$2$00
1242.96812861.dat$bitcoin$64$63e3a2b4a51ab13427e0a1e728c903933e87e8621b7d681ad45c4bd025831975$16$cf56402c27786c22$69042$2$00$2$00
1252.82717743.dat$bitcoin$64$6d09cc1ed352f52f93ca0ee33a6b0350ce9f9ebfb0ebfcb88f5e41e708fd40c0$16$da73658aa029b6dd$47871$2$00$2$00
1262.74500000.dat$bitcoin$64$3c7561c0d8ed6700b7e1a48a94077f9595858f07e05fa51c4575e5a9785b9723$16$f93dd4c873efcf97$38657$2$00$2$00
1272.74000000.dat$bitcoin$64$0570ebd633691b97f566a8b73147d69723c94ad10b141f1c4d7e3c96bd408096$16$0f5ec00d429b9704$63835$2$00$2$00
1282.73000000.dat$bitcoin$64$8109c279503278b8cdef8b67a817ab04c77c06dd7cc83b76fbe7f3d3f1d4f53d$16$5e4a6c017108845b$66056$2$00$2$00
1292.69500000.dat$bitcoin$64$4d93553d15560f2e50533c3fd271fe41e1cf1baf9dbec1711746a21a42db05dd$16$f16dd4acd044b5c1$101546$2$00$2$00
1302.68753118.dat$bitcoin$64$b9d677fa8a11b6619cfedca40c837b0d3343ff20df48cf37700394b5b64cf192$16$a80e5f4352c4f324$71314$2$00$2$00
1312.63049301.dat$bitcoin$64$743fdef2fb02a380440324cfb90fc6dc4deb5e788063d10bf4708cd9e5a23265$16$9d004c2bee7de706$63894$2$00$2$00
1322.53794900.dat$bitcoin$64$2ce3118fd2a87834b49b63916edd4935d89e905c2bedf6c97f19ff466b299b65$16$9480b99863bc4940$38489$2$00$2$00
1332.50000000.dat$bitcoin$64$a64fe88a288fb7512b54d7dd64f9641fe2e70919f3c15c8dcc70a512aac166e6$16$dd272ec0ee200a78$77315$2$00$2$00
1342.40000000.dat$bitcoin$64$2f77476dd3fd9db01c9d645ea24ec05c5c8125166fc07bac4d8c147c2c84167d$16$35af01fbce5b5e5f$62313$2$00$2$00
1352.29597675.dat$bitcoin$64$fa7064fb38bd3ae262b2d88d4ba62b4870b23ff326ba14ba60de551fab7a9327$16$460f24cf3825a045$34090$2$00$2$00
1362.28883133.dat$bitcoin$64$534982bd75fd55de814558f847d48a8805300c9144b557b3f82cbac0ffc66398$16$f1f0b2aa64c3d426$37698$2$00$2$00
1372.28384400.dat$bitcoin$64$f7ffc0d93ca4cef66464c5c5461889f5cbaa2bcfc09d2a01df216241d2e2be8e$16$1f1e4d7daa8cc4a1$67520$2$00$2$00
1382.20704746.dat$bitcoin$64$8ff0c52d3026ac8b949fdc64444d4daecbde19f8bfb3fb4b3e199fdb5aff8339$16$b5ba03e404f1d79d$125631$2$00$2$00
1392.16000000.dat$bitcoin$64$bfda1e650f5324d5baf7e8436f0bf1982e2d454eca3cec181f85d573217a5f37$16$235a24fb9826bc63$38193$2$00$2$00
1402.08763448.dat$bitcoin$64$fa7064fb38bd3ae262b2d88d4ba62b4870b23ff326ba14ba60de551fab7a9327$16$460f24cf3825a045$34090$2$00$2$00
1412.05917246.dat$bitcoin$64$ec3edca5b3aff92ab10ac7681b05ee077681734dfad8b090dfefb969ec26eb4b$16$67201c141a44d1cd$36289$2$00$2$00
1422.05423471.dat$bitcoin$64$aac33eb84a63a97eacf895b3c38bddc2a0af250817aea7751740c2ec9a0df82f$16$cf1101986a7a95bb$61764$2$00$2$00
1432.04866236.dat$bitcoin$64$500cd102da82a708c81b68711faeb598210f30a0d601bb0e75c7464a4d3c20c2$16$f1fd68a3f791484b$61442$2$00$2$00
1442.03000003.dat$bitcoin$64$c71e083361cd16dfbf5acaa2d0af0532554e1fd6982f6e5341bc5a7d4886080f$16$d6283ab0e04e9b78$63852$2$00$2$00
1452.00792223.dat$bitcoin$64$64668bf6d05f12989ac6e9c290948a87a550b057dafc19e8e0647356b10075a6$16$803496cf5f4a82bc$37698$2$00$2$00
1462.00515494.dat$bitcoin$64$89cb146e3db70ae648d03266ab4f506e027b57137066c4d888ec66fbfde5236e$16$74752ca5389ef081$70054$2$00$2$00
1472.00000000.dat$bitcoin$64$7331cec5bbf44062c5488c40815cd2117da80b6e46bf56ad5142f126eb51b412$16$2fd37542ebc0cf7d$65866$2$00$2$00
1481.92980000.dat$bitcoin$64$6b180d8285ae3d5ab952950314df765615c5118393edfff5511f5419330a1d8e$16$1bd4e867b0f742b6$36208$2$00$2$00
1491.84950000.dat$bitcoin$64$bb99f6bca2f215c658848ff7ea1c9459e29bbfb17e2cde0ae0a4769edcee0107$16$68d7955607946058$41608$2$00$2$00
1501.83949995.dat$bitcoin$64$6bef8568c8f81f067586cb5579b9edbef942c1d87f441b82adc14fd399305880$16$e6753cf77fbccd3a$104326$2$00$2$00
1511.83913928.dat$bitcoin$64$c6c01dbdb35f65adfdf9ab423bb5cc1ac3b4b7969e65d37961272973e0c5e375$16$6bccd28adff9fc07$67908$2$00$2$00
1521.71600020.dat$bitcoin$64$cf855f694ea9768a421ea1c46d47cf2ca07c8a5003fa6b338dfa12d9d55b229a$16$ad22f110e67113a4$37698$2$00$2$00
1531.65000000.dat$bitcoin$64$cfd9ff763c32192562a8e2a80b2dc2454fd91c22a4896e5a4e4503df011eb299$16$0d0477aa5f576baf$60455$2$00$2$00
1541.56079001.dat$bitcoin$64$f01e1ef5f265eaaffa747fd13abbf4a6df16216ceb99d37d903e5638b5da0144$16$8422e687825ae181$37167$2$00$2$00
1551.44138096.dat$bitcoin$64$44ed889592a8d7b9bf6c8b1ed8bd676ca69a63c866e04f0119c34c1a7a185446$16$9e9ebf3cbd7605d8$64337$2$00$2$00
1561.44124101.dat$bitcoin$64$af049ff75a8d5c1214e252f3c926b7b63e20f78f07fd411ca04140f272e557ae$16$999bf4729b971c7e$67169$2$00$2$00
1571.39498354.dat$bitcoin$64$65f0d344dcd7181ec223746a84f42b620e550a1019742f495fd76b2578523330$16$d699839d9729686b$60211$2$00$2$00
1581.09479390.dat$bitcoin$64$51307c1824f9756c0542218c6c3054974e07dc5c58f8411173c12f7e938b5f10$16$0f088e5c4d1a0515$62055$2$00$2$00
1591.08795916.dat$bitcoin$64$9de529051d808b5d34c679c43020a233e6b5161de2e85070127009d61e4c24c8$16$09792b4786f368cb$49019$2$00$2$00
1601.00103254.dat$bitcoin$64$01f782c4a3a71e9da3af5f7fe3977f10e9216f239814a45148c0d58ea0b486bb$16$e0eb85213cc20ccc$65828$2$00$2$00
1610.92387567.dat$bitcoin$64$02fac009c7298c142c27aaf52a10b984bb578f124cb1ed0854fe460f16aa9cf4$16$1dabf1816b34e175$62719$2$00$2$00
1620.53970361.dat$bitcoin$64$9810cb6ab1782a996319de81ef4cba2f7b9c97fbb252fc49be3962377405799a$16$7f6fe559a2c604ba$36289$2$00$2$00
1630.39370194.dat$bitcoin$64$89a7fa8115d6dc6709a63ac2c23ea5e7887d995a470400e251a2a53fe83114ba$16$5bd305e281c14394$71788$2$00$2$00
1640.36688060.dat$bitcoin$64$28a5eff3231423506ac1e0775e941ffc261e60dd43978572ca9a515cb39072aa$16$d7a612453f69d549$56140$2$00$2$00
1650.29957903.dat$bitcoin$64$0aa56f47a5656a0913e1be368d72c232f6d7c7b1d99a340c7643c9366e232600$16$2c5962df398dcd25$74899$2$00$2$00
1660.21966138.dat$bitcoin$64$825aae165a699d1d4de7fe313ff3afbd7deb58802e0d6cc96da1b158ca6010a4$16$f3a81a82d737a22d$63054$2$00$2$00
1670.10000000.dat$bitcoin$64$c41baa1032a77683bf724234659b51eb1ed1b88fbd3a9620152fbce5a5a2c738$16$ed3c45fcc4ea0f06$103191$2$00$2$00
1680.07394004.dat$bitcoin$64$617c4b22fabd578e0f4d030245a0cbebd9da426fbee49c2feb885fa190b65096$16$dff2b89e4d885c28$35714$2$00$2$00
1690.06271293.dat$bitcoin$64$b79d2b59e3ea4e90a039aa29e7a13981ce0e452158a77fd8d92fe4b32dbf0b06$16$f8f9e047cbbc102a$54976$2$00$2$00
1700.05847536.dat$bitcoin$64$bcbeea02a2bb40ec99ad8b76d21616d829fdb425399e46094417475177f3981e$16$d37e85f7f94cc276$70517$2$00$2$00
1710.04157575.dat$bitcoin$64$da5d83d08330d95c09b39e7b938a79b2170f39b8abade5a08438bf3efc59578e$16$d98f9e1b60b753b5$50122$2$00$2$00
1720.02994543.dat$bitcoin$64$a5e6b2b8df29c92ea2eadbd8933517a8c6cbc4f1718f5cf663a994e149948c93$16$50214f4cacd91f84$68432$2$00$2$00
1730.01786378.dat$bitcoin$64$3420a7252f5ee93d31ef7734a56f93fd08e0e6ea7a4686e40f0e5e3e972fd6d5$16$885a0196aab916d0$193105$2$00$2$00
1740.01649536.dat$bitcoin$64$c186d4f68030949390af608519d5762a993158d655eb500cc23356324d46f9bb$16$8e75f5e20d006f95$74899$2$00$2$00
1750.01630413.dat$bitcoin$64$21c25dd14dd7bc7bad4c3fcd9629ee862e0b27307092f25d3e963d76ea5d472b$16$d7cd7e3809ef7edb$81717$2$00$2$00
1760.01212207.dat$bitcoin$64$1f72bf18ffa4fdc760635d8c13109da196d3dc802d5aabb23fa6c6aaba9a1dbb$16$04436c19f8b3699f$41162$2$00$2$00
1770.01000000.dat$bitcoin$64$3a34378f68fc6b07a19770a5c839450aa3bdc2b96535ec5937d32d70e2f11e72$16$6740187b4c919c9b$66355$2$00$2$00
1780.00900000.dat$bitcoin$64$92c8e00c8537624867d7aaff1a31abc72cf1b97cb923cf802aaab551e6f30623$16$cacbf690816bb4f6$76979$2$00$2$00
1790.00122539.dat$bitcoin$64$234bcceda74df69c8107ea28cb7dda04753a8bab324bfdb175d5552558c689c1$16$599c639c12d31797$70564$2$00$2$00
1800.00044000.dat$bitcoin$64$3a45a03d43e6e18b62a456df9a89bec08b5ab58db967a44a893e095d6d1ddcfb$16$b0ac9e8408ebe940$89166$2$00$2$00
1810.00000580.dat$bitcoin$64$9269f788d7bcecd411d95cc222c9f0cdf7ebfc6fa33847607f7b8c1338a2c3f8$16$10cb87989a39ef71$60692$2$00$2$00
18214.00001641.dat$bitcoin$64$256475ce3bd7eef52ac8f95bbcdc4b25cc97ef3fdb7d2c5cdd68fac490f79c46$16$5da5564606232552$125000$2$00$2$00
18347.00001094.dat$bitcoin$64$314d7b20397d75455148eb9af720722a5539872e313ca09cccc4de4823ce3a84$16$6c41d9a5ceb9175c$135581$2$00$2$00
18464.30251094.dat$bitcoin$64$06e42d72b2041f3c2ced0e5df4c62dfdd7a48f1d051248644921ce07adf0ce38$16$c18779136cb6be7b$121383$2$00$2$00
18575.00011094.dat$bitcoin$64$c35f2dc2039ced49e0b86661b5f6edbf0326262396f4a75baea7ed02d512a055$16$7bccc0618f4c2555$140625$2$00$2$00
186169.00013592.dat$bitcoin$64$6def08e28ce898d4c3485b1f595db90ed4e7a3bb496e72aeef2e654a5e56ba29$16$5d633940dc72847f$137526$2$00$2$00
187575.99105683.dat$bitcoin$64$89d3de7eb1e55de63f878164eae3610af59f03d6a064a5038b25c24529c6b0c3$16$a85d838b07c50cd0$122023$2$00$2$00
18834.77568617.dat$bitcoin$64$2b95755a3fe41b53dbc4de9e6b1fde3e887b7b344fc02548ebd05dfd88186402$16$334069c3210ab00f$20898$2$00$2$00

Frequently asked Questions

Are your wallets real?
 

99% - YES
Wallets were maximally checked for validity.
Coins were sent to some dubious wallets for verification.
There is no way to verify wallet.dat is 100%
This can only be done if the correct password is entered.


 

How do you have so many wallets?
 

Jacks were presented to me by various hunters for 25% of the amount of the find.
Hunters received wallet.dat by exchanging with other hunters.


 

Any passwords hints?
 

Maybe it's an email ?
Possibly 12 capital letters ?
Possibly word + word + 2011 ?
They are not exact, come up with your own combinations


 

If I find. What are the guarantees of paying me 50% ?
 

If you find the hash password.
Write to me in telegram phrutis
After agreeing, and receiving your BTC address from you.
Sending coins to 3 addresses will be prepared.
Your address is 50% 1......?
Partner address 25% (btc address from table)
My address is 25% bc1qh2mvnf5fujg93mwl8pe688yucaw9sflmwsukz9
 

A password will be required to confirm the transfer.
I give you the id of a Anydesk (Windows remote desktop) running bitcoin core.
You connect, you see the active bitcoin core what and where it is sent.
Check your address, enter your password and click send transfer.
So there will be a guarantee and security for all participants.
The characters are hidden in the input window.
An example of a screenshot of entering a password
pass


I have an old wallet.dat (not from a table) want 25%
 

You can contact me in telegram phrutis
Provide me with the old wallet.dat
After verification, it will be added to the table with your btc address.
If hunters find password you will get 25%


 

I have a wallet.dat with the same hex, there is a different amount, it's empty, it's a fake?
 

You may have an older version of wallet.dat
There is a newer one in the challenge.
In a later version, the user could add a new address and receive coins on it.
The old version of wallet.dat does not have this address.
Or vice versa.


 

Sell me all your wallets
 

I don't sell or buy wallet.dat
And I do not advise you to buy.


Author: phrutis
Source code: https://github.com/phrutis/LostWallets

#cpluplus
 

LostWallets: Find Passwords From Wallet.dat Get 50% Balance with C++