{"request":{"endpoint":"https://exercism.org/api/v2/tracks/sml/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"da9da85c09f74c8188d2defd75a4f7f5","snippet":"fun primeFactors n = let fun getPrimeFactors num curDivider = if curDivider * curDivider > num then if num > 1 then [num] else [] else if num mod curDivider = 0 then [curDivider] @ getPrimeFactors (num div curDivider) curDivider else getPrimeFactors num (curDivider + 1) in getPrimeFactors n 2 end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-02-19T14:24:39.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"fifiman"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/fifiman","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"731209a1c9e8409e9e773b77498a00b0","snippet":"fun primeFactors n = let val rec factorize = fn (n:int, f: int, fs: int list) => if f * f > n then if n > 1 then n :: fs else fs else if n mod f = 0 then factorize (n div f, f, f :: fs) else factorize (n, f + 1, fs) in rev (factorize (n, 2, [])) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-27T20:43:41.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"glennj"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/glennj","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"407dba753cd94cb2b510d424e5ca6e6d","snippet":"fun primeFactors n = let fun loop candidate residue = if candidate * candidate > residue then ( if residue > 1 then [residue] else []) else if residue mod candidate = 0 then candidate :: loop candidate (residue div candidate) else loop (candidate + 1) residue in loop 2 (abs n) end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-04-04T04:04:40.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"nzok"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/nzok","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"bacfc34f828143d7a43b9d9d1799faac","snippet":" fun primeFactors n = let fun primeFactorsImpl n p = if n = 1 then nil else if p * p > n then n :: nil else if n mod p = 0 then p :: primeFactorsImpl (n div p) p ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-08-01T10:34:37.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"keiraville"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/keiraville","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"a933c7b96a424f6fbae827c0e118a6e1","snippet":"fun primeFactors(n): int list = let fun primeFactors'(1, divisor, factors) = factors | primeFactors'(n, divisor, factors) = if n mod divisor = 0 then primeFactors'(n div divisor, divisor, factors @ [divisor]) else primeFactors'(n, divisor + 1, factors) in primeFactors'(n, 2, []) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-26T22:50:36.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"cristobal"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/cristobal","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"4142b7933af6465bb04ea2ce0bfab791","snippet":"fun prime(input, ls, n) = (*If performance is needed swop the @ for :: and reverse the list on submission.*) if n > input then ls else if input mod n =0 then prime( input div n , ls@[n], 2) else prime(input, ls, n+1) fun primeFactors n = prime(n,[],2) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-13T07:56:24.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"Steedalion"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/Steedalion","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"f81342c1d7b54aaf92dc829bb1a7fc9d","snippet":"local open LargeInt in fun primeFactors (n: int) : int list = primeFactors' (n, 2) and primeFactors' (n: int, m: int) : int list = if m <= n then if rem (n, m) = 0 then m :: primeFactors' (quot (n, m), m) else primeFactors' (n, m + 1) else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-09-20T20:29:20.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"chicolismo"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/chicolismo","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"2faa54332bee421790f52ea5d0c6250f","snippet":"fun primeFactors n = let fun factors n i = if i * i > n then if n > 1 then [n] else [] else if n mod i = 0 then i :: factors (n div i) i else factors n (i + 1) in ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-25T22:16:51.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"FranklinChen"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/FranklinChen","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"c59c708e63934f6097d11520230be69c","snippet":"(* --------------------------------------------------------------------------- exercism.io SML Track Exercise: prime-factors Contributed: Anthony J. Borla (ajborla@bigpond.com) -------------------------------------------------------------------------- *) fun gen_prime_factors (1, _, factors) = List.rev factors | gen_prime_factors (dividend, divisor, factors) = let val remainder = dividend mod divisor ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-26T20:14:27.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"ajborla"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/ajborla","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"abde009d43f8439e91daff64890bf065","snippet":"fun primeFactors limit = let fun aux n divisor = if n < 2 then [] else if n mod divisor = 0 then [divisor] @ aux (n div divisor) divisor else aux n (divisor + 1) in aux limit 2 end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-10-25T13:58:34.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"menketechnologies"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/menketechnologies","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"846a1b6194e94aeead285ce143806c90","snippet":"fun primeFactors n = let fun go (1, _, acc) = acc | go (n, f, acc) = if n mod f = 0 then go (n div f, f, f :: acc) else go (n, f + 1, acc) in rev (go (n, 2, [])) end","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-08-29T15:03:17.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"gepapado"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/gepapado","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"69a30b71246f4395a14b83d5988776e3","snippet":"val intSqrt = ceil o Math.sqrt o real fun erastothenesInit (limit: int) : bool vector = let val limit' = ceil (Math.sqrt (real limit)) fun aux acc i = if i < limit' then aux (Vector.mapi (fn (j, x) => x andalso (j <= i orelse j mod i <> 0)) acc) (i + 2) else acc in aux (Vector.tabulate (limit, fn i => i > 1 andalso (i = 2 orelse i mod 2 <> 0))) 3 ","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":"2022-05-06T16:02:27.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"Munksgaard"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/Munksgaard","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"97a56a7a63604e9c8eb2611ba514c7c8","snippet":"fun primeFactors n = let fun factor n d acc = if n <= 1 then List.rev acc else if n mod d = 0 then factor (n div d) d (d::acc) else if d * d > n then List.rev (n::acc) else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-05-02T18:48:31.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"VickMahase"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/VickMahase","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"8ddea3ca1545402c90a0050533a0c474","snippet":"(* * The argument must be LargeInt.int because the last test * is too large for Int.int * *) fun primeFactors (n : LargeInt.int) = let fun td n f = if n > 1 then if n mod f = 0 then f :: td (n div f) f ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-27T16:49:29.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"grenle"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/grenle","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"35413a5fbdd44e3fbc9f2836b07a6501","snippet":"val primeFactors = let fun next v st = if (v mod st) = 0 then st else next v (st + 1) fun aux acc vl = if vl = 1 then acc else let val num = next vl 2 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-08-04T11:34:18.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"simisc"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/simisc","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"35415aba476f4ebd919603484e45682d","snippet":"fun isPrime 2 = true | isPrime n = if n < 2 orelse n mod 2 = 0 then false else( let fun helper m = if m * m > n then true else if n mod m = 0 then false else helper (m+2) in helper 3 ","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":"2021-12-27T04:05:16.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"harrietobrien"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/harrietobrien","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"67ae07a9749d4794baf67e2c3003251c","snippet":"fun primeFactors n = let fun gather x candidate primes = (* Invariants: - no prime less then candidate divides x. - n = x * product of all 'primes' *) if (x mod candidate = 0) then (* hence candidate is prime *) gather (x div candidate) candidate (candidate :: primes) else if (candidate * candidate < x) then (* the usual sqrt-trick *) gather x (candidate + 1) primes ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-04-11T21:22:22.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"rainij"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/rainij","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"03efb55930b74c0da90981fcab433255","snippet":"fun primeFactors n = let fun aux prime n = if prime * prime > n then [n] else if n mod prime = 0 then prime :: aux prime (n div prime) else if prime = 2 then aux (prime + 1) n else aux (prime + 2) n ","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":"2023-06-10T06:56:07.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"Jeevan1234"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/Jeevan1234","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"4f590d21a7ec4410b49239845443154a","snippet":"fun pf 1 _ fs = List.rev fs | pf n d fs = if n mod d = 0 then pf (n div d) d (d::fs) else pf n (d+1) fs fun primeFactors n = pf n 2 [] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":3,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-06-27T00:12:45.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"stutonk"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/stutonk","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"0737f4659fc84f23a40140012d6b3863","snippet":"local fun primes(n, i, ps) = if i > n then ps else if n mod i = 0 then primes(n div i, i, ps @ [i]) else primes(n, i + 1, ps) in fun primeFactors n = primes(n, 2, []) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-17T20:35:40.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"stellartux"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/stellartux","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}},{"uuid":"fe48f1d270d14e02bad18cce73d92f9d","snippet":"fun primeFactors n = let fun loop num fac = if num < fac then [] else if num mod fac = 0 then fac :: loop (num div fac) fac else loop num (fac + 1) in loop n 2 end","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-10-27T04:06:59.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"hl4"},"exercise":{"title":"अभाज्य गुणनखंड","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/solutions/hl4","private_iterations_url":"https://exercism.org/hi/tracks/sml/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":21,"total_pages":1,"unscoped_total":21}}}}}

भाषा ट्रैक

Jiki के साथ कोड करना सीखिए

आपकी यात्रा

आपके पसंदीदानया

Exercism के खास फायदे

कम्युनिटी वीडियो

संक्षिप्त परिचय शृंखला

इंटरव्यू और कहानियाँ

Discord

फोरम

शुरुआत करें

मेंटर बनें

डॉक्स

योगदानकर्ता

अनुवादकनया

दान करें

Exercism के बारे में

हमारा प्रभाव

GitHub सिंकरनया

इनसाइडर्स