{"request":{"endpoint":"https://exercism.org/api/v2/tracks/d/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"dac17e35313f4d92b3c0c0af7126af20","snippet":"module prime_factors; pure int[] factors(immutable long value) { int[] result; long n = value; int p = 2; while (p * p <= n) { while (n % p == 0) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-10-13T04:14:44.000Z","is_out_of_date":false,"language":"d","author":{"handle":"keiraville"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/keiraville","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"9be915e2b85347339dfe0c00325346ed","snippet":"module prime_factors; bool isPrime(int n) { for ( int i = 2; i*i <= n; ++i ) { if ( n % i == 0) { return false; } } return true; } auto factors(int n) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-05-20T05:07:53.000Z","is_out_of_date":false,"language":"d","author":{"handle":"fingerfly"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/fingerfly","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"f12ba8d8325645b39c47256f655bf069","snippet":"module prime_factors; pure int[] factors(immutable long value) { long val = value; int[] fac; int divisor = 2; while (val > 1) { while (val % divisor == 0) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-10-06T15:06:56.000Z","is_out_of_date":false,"language":"d","author":{"handle":"menketechnologies"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/menketechnologies","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"73c8742e757f42f1ad3060297cfed4d8","snippet":"module prime_factors; import std.traits; bool isPrime(T)(T num) if (isNumeric!(T)) { for (T i = 2; i^^2 < num; ++i) if (num%i == 0) return false; return true; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-11-09T19:47:09.000Z","is_out_of_date":false,"language":"d","author":{"handle":"qu345"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/qu345","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"54601e91852c46bd99a55f58de222d49","snippet":"module prime_factors; pure int[] factors(immutable long value) { long val = value; int f = 2; int[] fs; while (f < val) { if (val % f == 0) { fs ~= f; val /= f; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-10-05T00:31:29.000Z","is_out_of_date":false,"language":"d","author":{"handle":"glennj"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/glennj","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"5b255d22d8184d3db7d8c701b926da10","snippet":"module prime_factors; /** * Computes the prime factors of a given natural number. * * @param value The natural number for which to find prime factors. * @return An array of integers representing the prime factors of the value. */ pure int[] factors(immutable long value) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-05-21T20:58:55.000Z","is_out_of_date":false,"language":"d","author":{"handle":"VickMahase"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/VickMahase","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"f7f6daedf65246c0b62f5e199f7c1639","snippet":"module prime_factors; pure int[] factors(immutable long value) { long n = value; int d = 2; int[] result; while (n > 1) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-02-17T00:55:18.000Z","is_out_of_date":false,"language":"d","author":{"handle":"amscotti"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/amscotti","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"60cb14192d9f433ea687a840a95188ba","snippet":"module prime_factors; real[] factors(real input) { real[] result; real n = input; real i = 2; while (i <= n) { if (n % i == 0) { result ~= i; n /= i; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-06T13:20:08.000Z","is_out_of_date":false,"language":"d","author":{"handle":"bobhobelman"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/bobhobelman","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"8652f8295f1e4a00a6e6e805c25a7252","snippet":"module prime_factors; import std.array : appender; ulong[] factors(ulong n) nothrow pure { if (n == 1) return []; ulong[] result; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-10-30T15:20:32.000Z","is_out_of_date":false,"language":"d","author":{"handle":"Betelgeyser"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/Betelgeyser","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"76343a21b1854ed6b685effda70de6ab","snippet":"module prime_factors; pure @safe int[] factors(long number) { int[] output; while ((number & 1) == 0) { output ~= 2; number >>= 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-06T19:33:14.000Z","is_out_of_date":false,"language":"d","author":{"handle":"bobahop"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/bobahop","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"b6cafedd8cbf4a1fac51c0b85e56e8e3","snippet":"module prime_factors; /// Returns array of prime factors of x auto factors(int x) { // Try and divide int divisor = 2; int[] factors; while(divisor <= x) { if (x % divisor == 0) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-18T12:38:46.000Z","is_out_of_date":false,"language":"d","author":{"handle":"rjkilpatrick"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/rjkilpatrick","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"a526ecfb624f45bba01a2d7ac9addf6e","snippet":"module prime_factors; import core.math : sqrt; import std.stdio : writeln; pure long[] factors(long num) { // Numbers less than 2 cannot have any factors if (num < 2) return []; long[] primes; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-02T17:07:50.000Z","is_out_of_date":false,"language":"d","author":{"handle":"KaceyXam"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/KaceyXam","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"abf170ac39324e3bb1a8f8dbb9b38845","snippet":"module prime_factors; int[] factors(long number) { int[] result; int factor = 2; while (number > 1) { while (number % factor != 0) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-28T15:50:53.000Z","is_out_of_date":false,"language":"d","author":{"handle":"ErikSchierboom"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"28f990fab9f94c25abec5b613cd893c5","snippet":"module prime_factors; import std.stdio; import std.algorithm.iteration; import std.math; long[] factors(long n) { long[] res; long p = 2; while (p * p <= n) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-12-01T15:43:39.000Z","is_out_of_date":false,"language":"d","author":{"handle":"dfhwze"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/dfhwze","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"e72eca74652b494e9d5cdf9e998ad83e","snippet":"module prime_factors; import std.math : sqrt; import std.conv : to; bool isPrime(long num) pure { if (num < 2) return false; if (num > 2 && num % 2 == 0) return false; if (num == 2) return true; for (size_t n = 3; n <= sqrt(cast(double)num); n += 2) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":46,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-27T12:06:33.000Z","is_out_of_date":false,"language":"d","author":{"handle":"mojamedali"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/mojamedali","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"a89858c0ea054e6ab630527350bcd8ff","snippet":"module prime_factors; int[] factors(int n) { int[] result = []; for (int i = 2; n % i == 0; n /= i) result ~= i; for (int i = 3; n >= i * i; i += 2) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-17T19:04:31.000Z","is_out_of_date":false,"language":"d","author":{"handle":"menjaraz"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/menjaraz","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"89b8a83eb0ee4bdf905ea523237efe5e","snippet":"module prime_factors; int[] factors(ulong n) { int i = 2; int[] factors; while (n != 1) { if (n % i == 0) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-21T13:00:00.000Z","is_out_of_date":false,"language":"d","author":{"handle":"anagonousourou"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/anagonousourou","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"6e798955b52d4d63befe5c8f6bc1f6c5","snippet":"module prime_factors; ulong[] primes = [2,3]; bool isPrime(ulong n) { foreach(p; primes) { if(p*p>n) { return true; } if(n%p==0) { return false; } } assert(0); } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":61,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-01T16:44:02.000Z","is_out_of_date":false,"language":"d","author":{"handle":"nex1984"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/nex1984","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"0623846c1af24bf0813ce11103a14f05","snippet":"module prime_factors; pure int[] factors(long value) { import std.range : iota; int[] result = []; while (value > 1) { foreach (i; iota(2, value + 1)) { if (value % i == 0) { value /= i; result ~= cast(int)i; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-20T14:41:39.000Z","is_out_of_date":false,"language":"d","author":{"handle":"AMathMonkey"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/AMathMonkey","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"ea46c0871f124b1f84e22b04869ffc53","snippet":"module prime_factors; long[] factors(long n) { long[] result; long factor = 2; while (n > 1) { while (n % factor == 0) { result ~= factor; n /= factor; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-10T00:50:40.000Z","is_out_of_date":false,"language":"d","author":{"handle":"gizmomogwai"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/gizmomogwai","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"3893750ab4ac42fe9128652f69447173","snippet":"module prime_factors; // Function to compute prime factors long[] factors(long number) { long[] primes; for (long factor = 2; number > 1; ++factor) { while (number % factor == 0) { primes ~= factor; // Append factor to primes array number /= factor; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-11T09:13:50.000Z","is_out_of_date":false,"language":"d","author":{"handle":"david82"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/david82","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"96f29373cbc341d5ae329d840b03b9a4","snippet":"module prime_factors; pure int[] factors(immutable long value) { // implement this function int[] fs; long v = value; while (v % 2 == 0) { fs ~= 2; v /= 2; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-12-25T05:58:33.000Z","is_out_of_date":false,"language":"d","author":{"handle":"alterpatzer"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/alterpatzer","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"ebcbe059af03402d866ec7c6c31d8ac8","snippet":"module prime_factors; T[] factors(T)(T n) { import std.range; import std.functional; import std.math; T[] results; while(n % 2 == 0) { results ~= 2; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-30T21:01:17.000Z","is_out_of_date":false,"language":"d","author":{"handle":"orvly"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/orvly","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}},{"uuid":"7f1a3297a8d748a99358a658f1611feb","snippet":"module prime_factors; uint[] factors(long number) { uint[] factors; while (~number & 1) { factors ~= 2; number >>= 1; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-08-29T06:33:28.000Z","is_out_of_date":false,"language":"d","author":{"handle":"razvbir"},"exercise":{"title":"মৌলিক গুণনীয়ক","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"D","icon_url":"https://assets.exercism.org/tracks/d.svg","highlightjs_language":"d"},"links":{"public_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/solutions/razvbir","private_iterations_url":"https://exercism.org/bn/tracks/d/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":27,"total_pages":2,"unscoped_total":27}}}}}

ভাষার ট্র্যাক

Jiki-এর সাথে কোড শেখা

আপনার যাত্রা

আপনার পছন্দের তালিকানতুন

Exercism-এর সুবিধা

কমিউনিটি ভিডিও

সংক্ষিপ্ত পরিচিতি সিরিজ

সাক্ষাৎকার ও গল্প

Discord

ফোরাম

শুরু করা

মেন্টরিং

ডকুমেন্টেশন

কনট্রিবিউটর

অনুবাদকনতুন

ডোনেট করুন

Exercism সম্পর্কে

আমাদের প্রভাব

GitHub সিঙ্কারনতুন

ইনসাইডার্স