{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":545633236,"defaultBranch":"main","name":"Data-structure-and-Algorithms","ownerLogin":"TheSalimi","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-10-04T18:04:09.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/108394058?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1680624864.0","currentOid":""},"activityList":{"items":[{"before":"e80ccc60a69475cc042a8ab048182d1999c83d05","after":"a2b4e90128ad9bd57987c5a42fdc4e6847c9f04f","ref":"refs/heads/main","pushedAt":"2023-04-17T09:27:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"0e7d7a9d0cef3abd3950be83241d40d2b1a181d1","after":"e80ccc60a69475cc042a8ab048182d1999c83d05","ref":"refs/heads/main","pushedAt":"2023-04-15T21:41:35.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Merge branch 'main' of https://github.com/TheSalimi/Data-structure-and-Algorithms","shortMessageHtmlLink":"Merge branch 'main' of <a href=\"https://github.com/TheSalimi/Data-structure-and-Algorithms\">https://github.com/TheSalimi/Data-structure-an…</a>"}},{"before":"5618965969b2f996b6fc31a78d994e5d503cab2b","after":"0e7d7a9d0cef3abd3950be83241d40d2b1a181d1","ref":"refs/heads/main","pushedAt":"2023-04-15T16:56:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"8ffea44494fecc95cf10473eea27e58776f8255c","after":"5618965969b2f996b6fc31a78d994e5d503cab2b","ref":"refs/heads/main","pushedAt":"2023-04-04T16:14:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"هیتلر مخفی\n\nدر گذشته‌ای نه چندان دور چند کشور داشتیم که یکی از آن‌ها آلمان نازی بود و به رهبری هیتلر به دنبال فتح جهان بودند. برای راحتی، کشورها و روابط بین آن‌ها را به شکل گرافی \r\nنشان می‌دهیم که راس‌ها نشان دهنده‌ی کشور‌ها و یال‌ها نشان دهنده‌ی همسایگی دو طرفه بین کشورها است\r\n\r\nدر ابتدا کشور \r\niام قدرت\r\nai\r\n  را دارد و یکی از آن‌ها آلمان نازی است. هیتلر در جهت کشورگشایی هر بار می‌تواند یک کشور جدید که حداقل یکی از همسایه‌هایش فتح شده را انتخاب کند، و اگر قدرت آلمان نازی بیشتر اکید از آن بود، آن کشور را فتح کند. پس از فتح یک کشور، به اندازه‌ی قدرت آن کشور، به قدرت آلمان نازی اضافه می‌شود.\r\n\r\nسوالی که آن زمان فکر سیاست مداران را به خود درگیر کرده بود، این بود که آیا هیتلر می‌تواند موفق شود همه‌ی کشورها را فتح کند یا خیر؟ و اگر نمی‌تواند، حداقل چه مقدار باید قدرت آلمان نازی افزایش یابد تا بتواند به این هدف برسد؟ اما از آن‌جایی که هیتلر مخفی است و مکان اولیه آلمان نازی را نمی‌دانیم، شما باید به ازای هر کشور، این مقدار را محاسبه کنید!","shortMessageHtmlLink":"هیتلر مخفی"}},{"before":"372f90096d187d7d5495e6f1a032518e3cc9c633","after":"8ffea44494fecc95cf10473eea27e58776f8255c","ref":"refs/heads/main","pushedAt":"2023-03-24T16:22:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Create ChromatixIndex.cs\n\nدد رنگی یالی یک گراف کوچکترین عدد صحیح نامنفی\n�\nk است به طوری که یال‌های گراف را بتوان با\nk رنگ طوری رنگ کرد که هر دو یالی که یک سر آن‌ها با هم برابر است، رنگ متفاوت داشته باشند","shortMessageHtmlLink":"Create ChromatixIndex.cs"}},{"before":"3929d6bb608c193bc461fca745d5b14136bc51e1","after":"372f90096d187d7d5495e6f1a032518e3cc9c633","ref":"refs/heads/main","pushedAt":"2023-03-23T13:32:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"find shortest path using BFS","shortMessageHtmlLink":"find shortest path using BFS"}},{"before":"5d7aab7ff6e4bd9b0be5809ea80ba609e74f3954","after":"3929d6bb608c193bc461fca745d5b14136bc51e1","ref":"refs/heads/main","pushedAt":"2023-03-23T12:18:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Create shortestPath.cs\n\nگرافی n راسی ھمبند بدون جھت با 1 - n یال داریم. حال بھ شما دو راس u و v داده میشود و شما\nباید طبق الگوریتم DFS فاصلھ (تعداد حداقل یال) برای رسیدن از راس u بھ v را بگویید.\n\nورودی:\nابتدا عدد n داده میشود کھ 100000 <= n <= 1\nسپس در 1 – n خط بعدی ۲ عدد داده میشود کھ بھ ترتیب ۲راس یک یال ھستند\nسپس ۲ راس u و vداده میشود\nخروجی:\nفاصلھ دو راس u و v را چاپ نمایید","shortMessageHtmlLink":"Create shortestPath.cs"}},{"before":"42a50be1b5feb1c81527fd92a6189f0e0898e487","after":"5d7aab7ff6e4bd9b0be5809ea80ba609e74f3954","ref":"refs/heads/main","pushedAt":"2023-03-16T21:50:43.259Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"HW2-6 greedy\n\nhttps://quera.org/course/assignments/51430/problems","shortMessageHtmlLink":"HW2-6 greedy"}},{"before":"0afd2dac2005465ee6d8ccd41f4f2ec452056e75","after":"42a50be1b5feb1c81527fd92a6189f0e0898e487","ref":"refs/heads/main","pushedAt":"2023-03-12T16:38:43.055Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"cd508a5d4eef0877c933b458e57a70c464b35d29","after":"0afd2dac2005465ee6d8ccd41f4f2ec452056e75","ref":"refs/heads/main","pushedAt":"2023-03-10T08:14:55.442Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"9cdb9b75374ee99d8570805c12507136a4565611","after":"cd508a5d4eef0877c933b458e57a70c464b35d29","ref":"refs/heads/main","pushedAt":"2023-03-09T14:40:43.236Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Serg mort\n\nhttps://quera.org/problemset/6403/","shortMessageHtmlLink":"Serg mort"}},{"before":"6f8e5b694bfe8a79bc76bb841170c7224a60e009","after":"9cdb9b75374ee99d8570805c12507136a4565611","ref":"refs/heads/main","pushedAt":"2023-03-08T08:27:15.178Z","pushType":"push","commitsCount":1,"pusher":{"login":"TheSalimi","name":"Amir Salimi","path":"/TheSalimi","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/108394058?s=80&v=4"},"commit":{"message":"Create rodCutting.cs","shortMessageHtmlLink":"Create rodCutting.cs"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADGilbigA","startCursor":null,"endCursor":null}},"title":"Activity · TheSalimi/Data-structure-and-Algorithms"}