{"request":{"endpoint":"https://exercism.org/api/v2/tracks/dart/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"1a3d0f96e455494486a6a9b8cc3164c7","snippet":"class PrimeFactors { List factors(int n) { List r = []; int i = 1; while (n > 1) { i++; if (n % i == 0) { r.add(i); n = n ~/ i; i = 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":18,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-28T10:12:32.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"vachtung-gigabidze"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/vachtung-gigabidze","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"c3dbb1a17a4d486f85d7e8486924c395","snippet":"class PrimeFactors { List factors(int number) { List result = []; int divisor = 2; while (number > 1) { while (number % divisor == 0) { result.add(divisor); number ~/= divisor; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":11,"num_iterations":1,"num_loc":14,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-06-27T04:55:28.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"ElbinBinil"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/ElbinBinil","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"f7f683b8b9224a29b96c79d6341144d9","snippet":"class PrimeFactors { List factors(int number) { List result = []; int divisor = 2; while (number > 1) { while (number % divisor == 0) { result.add(divisor); number ~/= divisor; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":9,"num_iterations":1,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-21T06:39:17.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"valli-5"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/valli-5","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"24fd16fc5c0446bfbabf4659d98299a4","snippet":"class PrimeFactors { List factors(int x){ List results=[]; int prime = 2; while(x >1){ if(x% prime == 0){ x = x / prime as int; results.add(prime); }else prime = getNextPrime(prime); ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":1,"num_loc":29,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2023-06-02T11:46:50.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"hesham04Dev"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/hesham04Dev","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"e924975068b84be2921fbe22dda3bc96","snippet":"class PrimeFactors { List factors(int number) { List primeFactors = []; int divider = 2; while (number != 1) { if (number % divider != 0) { divider += 1; continue; } primeFactors.add(divider); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-05-01T19:54:01.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"gokmen"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/gokmen","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"33c3f6a9db9d49728f673912595addfc","snippet":"class PrimeFactors { List factors(num number) { List ans = []; if (number == 1) return ans; var i = 2; while (number != 1) { if (number % i == 0) { ans.add(i); number /= i; continue; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-04-08T17:58:14.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"ymadd-4899"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/ymadd-4899","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"39bda2b63a634cea8efd546306fd9454","snippet":"class PrimeFactors { List factors(int num) { List factor = []; int count = 0; if(num == 1) { return factor; } else { factor.add(1); } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":25,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2022-08-10T15:05:21.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"anirudh-agarwalla"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/anirudh-agarwalla","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"7ae2c4ecb8f24bdb90fe71809198d69e","snippet":"class PrimeFactors { List factors(int number) { List factors = []; for (int i = 2; i <= number; i++) { while (number % i == 0) { factors.add(i); number = number ~/ i; } } return factors; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-01T14:58:17.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"arfazkhan"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/arfazkhan","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"d67e77e6e89346cc8314499bb92555a6","snippet":"class PrimeFactors { List factors(int x) { List fList = []; int factor = 2; while (x >= 2) { if (x % factor == 0) { x = x ~/ factor; fList.add(factor); } else { factor++; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-08-02T16:07:41.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"teamvals"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/teamvals","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"9ba10e50f76149358df7d1b7f2b65e6d","snippet":"class PrimeFactors { List factors(int number) { List result = []; for (int i = 2; i <= number; i++) { while (number % i == 0) { result.add(i); number = number ~/ i; } } return result; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-07-05T07:51:14.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"LHHan"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/LHHan","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"934748d63909422bbb752d3bbc728fa4","snippet":"import 'dart:core'; class PrimeFactors { // Put your code here List factors(int number) { List factorList = []; for (int i = 2; number >= i; i++) { while (number % i == 0) { factorList.add(i); print(i); number ~/= i; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-10T10:36:25.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"hiennguyendinhthe"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/hiennguyendinhthe","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"ff9f05975b56499c9020d7217d0ed01e","snippet":"class PrimeFactors { List factors(int num) { bool jPrime = false; List list = []; int j = 2; while (num != 1) { if (num % j == 0) { num = num ~/ j; jPrime = isPrime(j); if (jPrime) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-07-22T14:44:02.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"legendsobosob"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/legendsobosob","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"d06c69efa6d04acc88ddfbcdbf6cb031","snippet":"class PrimeFactors { // Put your code here List factors(int number) { if (number < 2) return []; int factor = 2; List lstFactors = []; while (number / factor != 1) { if (number % factor == 0) { ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-09-23T13:47:16.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"theaussie86"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/theaussie86","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"4148733d920e4d4d9b652ef60ad7d60e","snippet":"class PrimeFactors { List factors(int number) { List primeFactors = []; int factor = 2; while (number > 1) { while (number % factor != 0) { factor++; } primeFactors.add(factor); number = number ~/ factor; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-18T07:29:38.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"vuphan-agilityio"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/vuphan-agilityio","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"80d205b4238d447a8adbacf23379dd20","snippet":"class PrimeFactors { // Put your code here } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":2,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2023-10-10T10:44:46.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"Marushetty"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/Marushetty","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"f276ac3cfea94f6791e432963a1e5c9c","snippet":"import 'dart:math'; class PrimeFactors { List factors(int number) { List primeFactors = []; double calc = number.toDouble(); while (calc % 2 == 0) { primeFactors.add(2); calc = calc / 2; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-08-23T16:01:52.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"fabrusso"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/fabrusso","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"f7ab0430c4b640b893ab1a339139e0e7","snippet":"class PrimeFactors { int _factor = 2; List _factors = new List(); // finds prime factors for the given number. List factors(int number) { int current = number; while(current != 1) { if (current % _factor == 0) { current = current ~/ _factor; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":16,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2019-07-02T12:59:03.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"sachq"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/sachq","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"68dd53256e4d49b69702082f5b8a753e","snippet":"class PrimeFactors { List factors(int number) { List result = []; int start = 2; while (number != 1) { if(number % start == 0) { number = number ~/ start; result.add(start); } else { start += 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-06-02T12:58:40.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"KadoBOT"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/KadoBOT","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"5c8d60fde3fd4feba179a5cdedfda3de","snippet":"class PrimeFactors { List factors(int number) { List divisors = []; int curr = 2; // Start from 2 int target = number; while(curr < target) { if(target % curr == 0) { target = target ~/ curr; divisors.add(curr); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2019-10-30T21:20:48.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"heydouglas"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/heydouglas","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"a2f217f891894e3bac01190a6e9a0651","snippet":"// import 'dart:math'; class PrimeFactors { List factors(int number) { List primes = []; int residue = number; int i = 2; do { int remainder = number % i; if (remainder == 0) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2020-01-02T16:15:26.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"Aeon-Avinash"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/Aeon-Avinash","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"37d6652ad13741c6a3d5e8b214dc9b6c","snippet":"class PrimeFactors { List factors(int n){ var r = List(); for(int f = 2; n >= f; f++) for(;n % f == 0; n ~/= f) r.add(f); return r; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2020-01-31T20:34:47.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"stegrams"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/stegrams","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"63b40e14f07d41a3a2dc966d4c8744eb","snippet":"class PrimeFactors { List factors(int num){ List result=[]; if(num<2){ return []; } else if(num==2 || num ==3 ){ return [num]; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2020-04-24T19:18:42.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"ajkategar"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/ajkategar","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"2ee995d8281743cea37e09aa3aa07469","snippet":"class PrimeFactors { List primeCashe = [2, 3, 5, 7, 11]; int curMaxPrime = 11; int nextPrime(int n) { if (n <= curMaxPrime) { return primeCashe.firstWhere((prime) => n <= prime); } int i = curMaxPrime + 1; while (primeCashe.firstWhere((prime) => i % prime == 0, orElse: () => -1) != -1) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":40,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2020-02-17T08:42:10.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"read-only-man"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/read-only-man","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}},{"uuid":"70fbbb1c8226425d933a22078cfff8db","snippet":"class PrimeFactors { List factors(int n) { List res = List(); if (n == 1) { return res; } while (n != 1) { for (int i = 2; i <= n; n++) { if (n % i == 0) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"tests_failed","published_iteration_head_tests_status":"failed","published_at":"2020-09-25T02:27:02.000Z","is_out_of_date":true,"language":"dart","author":{"handle":"SimonBartonPSU"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/solutions/SimonBartonPSU","private_iterations_url":"https://exercism.org/el/tracks/dart/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":267,"total_pages":12,"unscoped_total":267}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders