diff --git "a/data/rust/data/humanevalbugs.json" "b/data/rust/data/humanevalbugs.json" --- "a/data/rust/data/humanevalbugs.json" +++ "b/data/rust/data/humanevalbugs.json" @@ -1 +1,494 @@ -[{"buggy_solution": "\n for i in 0..numbers.len(){\n for j in 1..numbers.len(){\n\n if i != j {\n let distance:f32 = numbers[i] - numbers[j];\n\n if distance.abs() < threshold{\n return true;\n }\n\n }\n \n }\n }\n\n return false;\n\n}\n"}, {"buggy_solution": "\n let mut result:Vec = vec![];\n let mut current_string:String = String::new();\n let mut current_depth:u32 = 0;\n\n for c in paren_string.chars(){\n if c == '('{\n current_depth += 1;\n current_string.push(c);\n }\n else if c == ')' {\n current_depth -= 1;\n current_string.push(c);\n\n if current_depth == 0{\n result.push(current_string.clone());\n current_string.clear()\n }\n \n }\n\n\n }\n return result;\n}\n"}, {"buggy_solution": "\n return number % 1.0;\n}\n"}, {"buggy_solution": "\n\nlet mut balance:i32 = 0;\nfor op in operations {\n balance = balance + op;\n if balance < 0 {\n return true;\n }\n }\n return false;\n}\n"}, {"buggy_solution": "\n let mean:f32 = numbers.iter().fold(0.0,|acc:f32, x:&f32| acc + x) / numbers.len() as f32;\n return numbers.iter().map(|x:&f32| (x - mean).abs()).sum::() / numbers.len() as f32;\n}\n\n"}, {"buggy_solution": "\n let mut res:Vec = vec![];\n numbers.iter().for_each(|item:&u32| {res.push(*item); res.push(delimeter);});\n res.pop();\n return res;\n}\n"}, {"buggy_solution": "\n let mut result:Vec = vec![];\n let mut depth:i32 = 0;\n let mut max_depth:i32 = 0;\n\n for splits in paren_string.split(' '){\n for c in splits.chars(){ \n if c == '('{\n depth = depth + 1;\n max_depth = max(depth, max_depth);\n }\n else{\n depth = depth - 1;\n }\n }\n \n if depth == 0 {\n result.push(max_depth);\n max_depth = 0;\n }\n }\n\n return result;\n}\n"}, {"buggy_solution": "\n return strings.iter().filter(|x:&&String| x.contains(&substring)).map(String::from).collect();\n}\n"}, {"buggy_solution": "\n let sum = |xs: &Vec| xs.iter()\n .fold(0, |mut sum, &val| { sum += val; \n sum }\n );\n let product = |xs: &Vec| xs.iter()\n .fold(1, |mut prod, &val| { prod *= val; \n prod }\n );\n return (sum(&numbers),product(&numbers));\n}\n"}, {"buggy_solution": "\n let mut running_max :Option = None;\n let mut result:Vec = vec![];\n\n for n in numbers{\n if running_max == None {\n running_max = Some(n);\n\n }else{\n running_max = max(running_max, Some(n));\n }\n\n result.push(running_max.unwrap());\n }\n return result;\n\n}\n"}, {"buggy_solution": "\n let s: String = str.chars().rev().collect();\n return s==str;\n }\n \n fn make_palindrome(str: &str) -> String {\n let mut i: usize = 0;\n for i in 0..str.len() {\n let rstr: &str = &str[i..];\n if is_palindrome_10(rstr) {\n let nstr: &str = &str[0..i];\n let n2str: String = nstr.chars().rev().collect();\n return str.to_string()+&n2str;\n }\n }\n let n2str: String = str.chars().rev().collect();\n return str.to_string()+&n2str;\n }\n"}, {"buggy_solution": "\n\n let xor = |i:char, j:char| {if i == j{return \"0\".to_string()}else{return \"1\".to_string()}};\n return a.chars().into_iter().zip(b.chars().into_iter()).map(|(i,j)| \"\".to_string() + &xor(i,j)).collect(); \n}\n"}, {"buggy_solution": "\n if strings.is_empty(){\n return None;\n }\n let mut max:i32 = 0;\n let mut res:String = String::new();\n\n for s in strings{\n if s.len() as i32 > max {\n res = s;\n max = res.len() as i32;\n } \n }\n return Some(res);\n}\n"}, {"buggy_solution": "\n while b > 0 {\n (a, b) = (b, a % b);\n }\n return a;\n}\n\n"}, {"buggy_solution": "\n let mut res:Vec = vec![];\n let mut res_str:String = String::new();\n\nfor c in string.chars(){\n res_str.push(c);\n res.push(res_str.clone());\n}\nreturn res;\n}\n\n"}, {"buggy_solution": "\n let mut res:String = String::new();\n\n for number in 0..n + 1{\n res = res + &number.to_string() + \" \";\n }\n \n return res.trim_end().to_string();\n\n}\n"}, {"buggy_solution": "\n let res:HashSet = str.chars().into_iter().map(|x:char| x.to_ascii_lowercase()).collect();\n return res.len() as i32;\n}\n"}, {"buggy_solution": "\n\n let map = |x:&str| {match x {\n \"o\" => 4,\n \"o|\" => 2,\n \".|\" => 1,\n _ => 0\n } \n};\n return music_string.split(\" \").map(|x:&str| map(&x.to_string())).filter(|x:&i32| x != &0).collect();\n}\n"}, {"buggy_solution": "\n let mut times:i32 = 0;\n\n for i in 0..(string.len() as i32 - substring.len() as i32 + 1){\n if string.get(i as usize..(i + substring.len() as i32) as usize).unwrap().to_string() == substring {\n times += 1;\n } \n }\n return times;\n}\n"}, {"buggy_solution": "\n let str_to_i32 = |x:&str| {match x{\n \"zero\" => 0,\n \"one\" => 1,\n \"two\" => 2,\n \"three\" => 3,\n \"four\" => 4,\n \"five\" => 5,\n \"six\" => 6,\n \"seven\" => 7,\n \"eight\" => 8,\n \"nine\" => 9,\n _ => 1000\n }};\n\n let i32_to_str = |x:&i32| {match x{\n 0 => \"zero\".to_string(),\n 1 => \"one\".to_string(),\n 2 => \"two\".to_string(),\n 3 => \"three\".to_string(),\n 4 => \"four\".to_string(),\n 5 => \"five\".to_string(),\n 6 => \"six\".to_string(),\n 7 => \"seven\".to_string(),\n 8 => \"eight\".to_string(),\n 9 => \"nine\".to_string(),\n _ => \"none\".to_string()\n}};\n\n let mut nmbrs:Vec = numbers.split_ascii_whitespace().map(|x:&str| str_to_i32(x)).collect(); \n nmbrs.sort();\n let res:String = nmbrs.iter().map(|x:&i32| i32_to_str(x) + \" \").collect();\n return res.trim_end().to_string();\n}\n"}, {"buggy_solution": "\n let mut closest_pair = (0.0,0.0);\n let mut distance:Option = None;\n\n for (idx, elem) in numbers.iter().enumerate(){\n for (idx2, elem2) in numbers.iter().enumerate() {\n if idx != idx2 {\n if distance == None {\n distance = Some((elem - elem2).abs());\n if *elem < *elem2{\n closest_pair = (*elem, *elem2);\n }else{\n closest_pair = (*elem2, *elem);\n }\n\n }else{\n let new_distance:f32= (elem - elem2).abs();\n if new_distance < distance.unwrap(){\n distance = Some(new_distance);\n\n if *elem < *elem2{\n closest_pair = (*elem, *elem2);\n }else{\n closest_pair = (*elem2, *elem);\n }\n \n \n }\n }\n }\n }\n }\n return closest_pair;\n\n\n}\n"}, {"buggy_solution": "\n let min_number= *numbers.iter().min_by(|a, b| a.partial_cmp(b).unwrap()).unwrap();\n let max_number= *numbers.iter().max_by(|a, b| a.partial_cmp(b).unwrap()).unwrap();\n return numbers.iter().map(|x:&f32| (x-min_number) / (max_number - min_number)).collect();\n}\n"}, {"buggy_solution": "\n let mut out: Vec = Vec::new();\n for value in values {\n if let Some(i) = value.downcast_ref::() {\n out.push(*i);\n }\n }\n out\n }\n"}, {"buggy_solution": "\n return strings.len() as i32;\n}\n"}, {"buggy_solution": "\n let mut res:i32 = 0;\n let sqn = 1..n;\n \n for i in sqn.rev(){\n if n % i == 0 {\n res = i;\n break;\n }\n }\n\n return res;\n}\n"}, {"buggy_solution": "\n let mut n = n;\n let mut factors = vec![];\n let mut divisor = 2;\n while divisor * divisor <= n {\n while n % divisor == 0 {\n factors.push(divisor);\n n = n / divisor;\n }\n divisor = divisor + 1;\n }\n if n > 1 {\n factors.push(n);\n }\n factors\n}\n"}, {"buggy_solution": "\n let mut m: HashMap = HashMap::new();\n\n for n in &numbers {\n *m.entry(*n).or_default() += 1;\n }\n let res:Vec = numbers.into_iter().filter(|x| m.get(x) == Some(&1)).collect();\n return res;\n}\n"}, {"buggy_solution": "\n return string.chars().into_iter().fold(String::new(), |res:String, c:char| {if c.is_ascii_lowercase(){return res + &c.to_uppercase().to_string();}else{return res + &c.to_ascii_lowercase().to_string();}});\n}\n"}, {"buggy_solution": "\n return strings.iter().fold(String::new(),|res: String, x:&String| res + &x.to_string());\n\n}\n"}, {"buggy_solution": "\n return strings.into_iter().filter(|s| s.starts_with(&prefix)).collect();\n}\n"}, {"buggy_solution": "\n return numbers.into_iter().filter(|n| n.is_positive()).collect();\n\n}\n"}, {"buggy_solution": "\n if n < 2{\n return false;\n}\nfor k in 2..n-1 {\n if n % k == 0{\n return false;\n }\n}\nreturn true;\n\n}\n"}, {"buggy_solution": "\n let mut sum = 0.0;\n for i in 0..xs.len() {\n sum += xs[i] * x.powi(i as i32);\n }\n sum\n }\n \n fn find_zero(xs: &Vec) -> f64 {\n let mut ans = 0.0;\n let mut value = poly(xs, ans);\n while value.abs() > 1e-6 {\n let mut driv = 0.0;\n for i in 1..xs.len() {\n driv += xs[i] * ans.powi((i - 1) as i32) * (i as f64);\n }\n ans = ans - value / driv;\n value = poly(xs, ans);\n }\n ans\n }\n"}, {"buggy_solution": "\n let mut third = vec![];\n let mut out:Vec = vec![];\n\n for (indx,elem) in l.iter().enumerate(){\n if indx%3 == 0 && indx != 0{\n third.push(elem)\n }\n }\n third.sort();\n let mut indx_t:usize = 0;\n\n for i in 0..l.len() {\n if i%3 == 0 && i != 0{\n if indx_t < third.len(){\n out.push(*third[indx_t]);\n indx_t += 1;\n }\n }else{\n out.push(l[i]);\n }\n \n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut res:Vec = nmbs.clone();\n res.sort();\n res.dedup();\n return res;\n }\n"}, {"buggy_solution": "\n return *nmbs.iter().max().unwrap();\n }\n\n"}, {"buggy_solution": "\n let mut ns:Vec = vec![];\n\n for i in 0..n{\n if i % 11 == 0 || i % 13 == 0{\n ns.push(i);\n }\n }\n\n let s:String = ns.into_iter().fold(String::new(),|s:String, n:i32| {s + &n.to_string()});\n let mut ans:i32 = 0;\n\n for c in s.chars(){\n if c == '7'{\n ans += 1;\n }\n }\n return ans;\n}\n"}, {"buggy_solution": "\n let mut even = vec![];\n let mut out:Vec = vec![];\n\n for (indx,elem) in nmbs.iter().enumerate(){\n if indx%2 == 0{\n even.push(elem)\n }\n }\n even.sort();\n let mut indx_t:usize = 0;\n\n for i in 0..nmbs.len() {\n if i%2 == 0{\n if indx_t < even.len(){\n out.push(*even[indx_t]);\n indx_t += 1;\n }\n }else{\n out.push(nmbs[i]);\n }\n \n }\n return out;\n}\n"}, {"buggy_solution": "\n\n let l = s.len();\n let num = (l + 2) / 3;\n let mut output = String::new();\n for i in 0..num {\n let group = &s[i * 3..std::cmp::min(l, (i + 1) * 3)];\n // revert the cycle performed by the encode_cyclic function\n if group.len() == 3 {\n let x = format!(\"{}{}{}\", &group[2..3], &group[0..1], &group[1..2]);\n output.push_str(&x);\n } else {\n output.push_str(group);\n }\n }\n output\n}\n\npub fn encode_cyclic(s: &str) -> String {\n // returns encoded string by cycling groups of three characters.\n // split string to groups. Each of length 3.\n let l = s.len();\n let num = (l + 2) / 3;\n let mut output = String::new();\n for i in 0..num {\n let group = &s[i * 3..std::cmp::min(l, (i + 1) * 3)];\n // cycle elements in each group. Unless group has fewer elements than 3.\n if group.len() == 3 {\n let x = format!(\"{}{}{}\", &group[1..2], &group[2..3], &group[0..1]);\n output.push_str(&x);\n } else {\n output.push_str(group);\n }\n }\n output\n}\n\n"}, {"buggy_solution": "\n let mut f1 = 1;\n let mut f2 = 2;\n let mut count = 0;\n while count < n {\n f1 = f1 + f2;\n let m = f1;\n f1 = f2;\n f2 = m;\n let mut isprime = true;\n for w in 2..(f1 as f32).sqrt() as i32 + 1 {\n if f1 % w == 0 {\n isprime = false;\n break;\n }\n }\n if isprime {\n count += 1;\n }\n if count == n {\n return f1;\n }\n }\n 0\n}\n"}, {"buggy_solution": "\n for i in 0.. nmbs.len(){\n for j in i + 1.. nmbs.len(){\n for k in j + 1.. nmbs.len(){\n if *nmbs.get(i).unwrap() + *nmbs.get(j).unwrap() + *nmbs.get(k).unwrap() == 0{\n return true;\n }\n }\n }\n }\nreturn false;\n\n}\n"}, {"buggy_solution": "\n return n*n;\n}\n"}, {"buggy_solution": "\n return l.into_iter().map(|n:i32| n + 1).collect();\n}\n"}, {"buggy_solution": "\n for (i, l1) in l.iter().enumerate(){\n for j in i + 1.. l.len(){\n if l1 + l[j] == 0{\n return true;\n }\n }\n }\n\n return false;\n}\n"}, {"buggy_solution": "\n let mut ret:String = \"\".to_string();\n let mut x1 = x;\n\n while x1 > 0{\n ret = (x1 % base).to_string() + &ret;\n x1 = x1 / base;\n }\n return ret;\n}\n"}, {"buggy_solution": "\n return (a * h) as f64 / 2.0;\n}\n"}, {"buggy_solution": "\n let mut results:Vec = vec![0, 0, 2, 0];\n\n if n < 4 {\n return *results.get(n as usize).unwrap();\n }\n\n for _ in 4.. n + 1{\n results.push(results.get(results.len()-1).unwrap() + results.get(results.len()-2).unwrap()\n + results.get(results.len()-3).unwrap() + results.get(results.len()-4).unwrap());\n results.remove(0);\n }\n\n return *results.get(results.len()-1).unwrap();\n\n \n}\n"}, {"buggy_solution": "\n let mut res:Vec = l.clone();\n res.sort();\n if res.len() % 2 == 1{\n return *res.get(res.len() / 2).unwrap() as f64;\n }else{ \n return (res.get(res.len() / 2 -1).unwrap() + res.get(res.len() / 2).unwrap()) as f64/ 2.0;\n }\n}\n"}, {"buggy_solution": "\n let pr: String = text.chars().rev().collect();\n return pr == text;\n}\n"}, {"buggy_solution": "\n if n == 0 {\n return 1;\n } else {\n return (modp(n - 1, p) * 2) % p;\n }\n}\n"}, {"buggy_solution": "\n let alphabet:Vec<&str> = vec![\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\"\n , \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"];\n let mut output = String::new();\n\n for c in s.chars() {\n let mut lower = false;\n if c.is_ascii_lowercase(){\n lower = true;\n }\n let mut c_shift:String = \"\".to_string();\n if lower {\n let index:usize = alphabet.iter().position(|&x| x == c.to_string()).unwrap();\n c_shift = alphabet[(index + 5) % 26].to_string();\n }else{\n let c_lower:String = c.to_ascii_lowercase().to_string();\n let index:usize = alphabet.iter().position(|&x| x == c_lower).unwrap();\n c_shift = alphabet[(index + 5) % 26].to_string();\n c_shift = c_shift.to_ascii_uppercase().to_string();\n \n }\n\n output.push_str(&c_shift);\n }\n output\n}\n\npub fn decode_shift(s: &str) -> String {\n let alphabet:Vec<&str> = vec![\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\"\n , \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"];\n let mut output = String::new();\n\n for c in s.chars() {\n let mut lower = false;\n if c.is_ascii_lowercase(){\n lower = true;\n }\n let mut c_shift:String = \"\".to_string();\n if lower {\n let index:usize = alphabet.iter().position(|&x| x == c.to_string()).unwrap();\n c_shift = alphabet[((26 + (index as i32 - 5)) % 26) as usize].to_string();\n }else{\n let c_lower:String = c.to_ascii_lowercase().to_string();\n let index:usize = alphabet.iter().position(|&x| x == c_lower).unwrap();\n c_shift = alphabet[((26 + (index as i32 - 5)) % 26) as usize].to_string();\n c_shift = c_shift.to_ascii_uppercase().to_string();\n \n }\n\n output.push_str(&c_shift);\n }\n output\n}\n"}, {"buggy_solution": "\n let vowels = \"AEIOUaeiou\";\n let mut out = String::new();\n for c in text.chars() {\n if !vowels.contains(c) {\n out.push(c);\n }\n }\n out\n}\n"}, {"buggy_solution": "\n for i in l {\n if i >= t {\n return false;\n }\n }\n return true;\n}\n"}, {"buggy_solution": "\n return x + y;\n}\n"}, {"buggy_solution": "\n let mut v1:Vec = str1.chars().into_iter().collect();\n v1.sort();\n v1.dedup();\n\n let mut v2:Vec = str2.chars().into_iter().collect();\n v2.sort();\n v2.dedup();\n\n return v1 == v2;\n}\n"}, {"buggy_solution": "\n if n == 0{\n return 0;\n }\n if n == 1{\n return 1;\n }\n\n return fib(n-1) + fib(n-2);\n}\n"}, {"buggy_solution": "\n let mut level:i32=0;\n\n for i in 0..bkts.len(){\n\n if bkts.chars().nth(i).unwrap()== '<' {level+=1;}\n \n if bkts.chars().nth(i).unwrap() == '>' { level-=1;}\n \n if level<0 {return false;} \n }\n if level!=0 {return false;}\n return true;\n}\n"}, {"buggy_solution": "\n let mut l1:Vec = l.clone();\n let mut l2:Vec = l.clone();\n l2.sort(); l2.reverse();\n l1.sort();\n\n if l == l1 || l == l2 {return true}\n return false;\n\n}\n"}, {"buggy_solution": "\nlet mut res:Vec = l1.into_iter().filter(|n:&i32| l2.contains(n)).collect();\nres.sort();\nreturn res;\n}\n"}, {"buggy_solution": "\n let mut n1 = n.clone();\n for i in 2.. n1{\n while n1%i == 0 && n1>i{n1 = n1/i;}\n }\n return n1;\n}\n"}, {"buggy_solution": "\n n*(n+1)/2\n}\n"}, {"buggy_solution": "\n let mut level:i32=0;\n\n for i in 0..bkts.len(){\n\n if bkts.chars().nth(i).unwrap()== '(' {level+=1;}\n \n if bkts.chars().nth(i).unwrap() == ')' { level-=1;}\n \n if level<0 {return false;} \n }\n if level!=0 {return false;}\n return true;\n }\n"}, {"buggy_solution": "\n let mut res:Vec =vec![];\n for i in 1..xs.len(){\n res.push(i as i32 * xs.get(i).unwrap());\n }\n return res;\n\n} \n"}, {"buggy_solution": "\n if n == 0 || n == 1{\n return 0;\n }\n if n == 2{\n return 1;\n }\n\n return fibfib(n-1) + fibfib(n-2) + fibfib(n-3);\n\n}\n"}, {"buggy_solution": "\n let vowels:&str = \"aeiouAEIOU\";\n let mut count:i32 = 0;\n\n for i in 0..s.len() {\n let c:char = s.chars().nth(i).unwrap();\n if vowels.contains(c){\n count += 1;\n } \n }\n if s.chars().nth(s.len() -1).unwrap() == 'y' || s.chars().nth(s.len() -1).unwrap() == 'Y' {count+=1;}\n\n return count;\n}\n"}, {"buggy_solution": "\n let mut xcp:Vec = x.to_string().chars().into_iter().collect();\n let mut res:Vec = x.to_string().chars().into_iter().collect();\n\n for (indx,c) in xcp.iter().enumerate(){\n let despl = (indx as i32 + shift) % x.to_string().len() as i32;\n replace(&mut res[despl as usize], *c);\n }\n\n return res.into_iter().collect();\n\n}\n"}, {"buggy_solution": "\n return s.chars().into_iter().filter(|c:&char| c.is_uppercase()).map(|c:char| c as i32).sum();\n}\n"}, {"buggy_solution": "\n let sub:i32 = s.split_ascii_whitespace().into_iter().filter(|c| c.parse::().is_ok()).map(|c| c.parse::().unwrap()).sum();\n return n-sub;\n}\n\n"}, {"buggy_solution": "\n let mut out:Vec = vec![];\n\n for i in 0.. arr.len(){\n if arr[i]%2 == 0 && (out.len() == 0 || arr[i]> = Vec::new();\n let mut max = -1;\n for i in 0..lst.len() {\n let mut has = false;\n for j in 0..freq.len() {\n if lst[i] == freq[j][0] {\n freq[j][1] += 1;\n has = true;\n if freq[j][1] >= freq[j][0] && freq[j][0] > max {\n max = freq[j][0];\n }\n }\n }\n if !has {\n freq.push(vec![lst[i], 1]);\n if max == -1 && lst[i] == 1 {\n max = 1;\n }\n }\n }\n return max;\n}\n"}, {"buggy_solution": "\n let mut cp:Vec = lst.clone();\n let mut res:Vec = vec![];\n\n for (indx, _) in lst.iter().enumerate(){\n if indx%2 == 1 {\n let max:i32 = *cp.iter().max().unwrap();\n res.push(max);\n cp.remove(cp.iter().position(|x| *x == max).unwrap());\n }\n else{\n let min:i32 = *cp.iter().min().unwrap();\n res.push(min);\n cp.remove(cp.iter().position(|x| *x == min).unwrap());\n }\n }\n return res;\n}\n"}, {"buggy_solution": "\n if a+b<=c || a+c<=b || b+c<=a {return -1.0;}\n let h:f64=(a+b+c) / 2.0;\n let mut area:f64;\n area = f64::powf(h*(h-a)*(h-b)*(h-c),0.5);\n return area;\n}\n"}, {"buggy_solution": "\n if q.iter().sum::() > w {\n return false;\n }\n let mut i = 0;\n let mut j = q.len() - 1;\n\n while i < j {\n if q[i] != q[j] {\n return false;\n }\n i += 1;\n j -= 1;\n }\n return true;\n}\n"}, {"buggy_solution": "\n let mut ans: i32 = 0;\n for i in 0..arr.len() / 2 {\n if arr[i] != arr[arr.len() - i - 1] {\n ans += 1\n }\n }\n return ans;\n}\n"}, {"buggy_solution": "\n let total_1: usize = lst1\n .iter()\n .fold(0, |acc: usize, str: &&str| acc + str.chars().count());\n let total_2: usize = lst2\n .iter()\n .fold(0, |acc: usize, str: &&str| acc + str.chars().count());\n\n if total_1 <= total_2 {\n return lst1.into_iter().map(|x| x.to_string()).collect();\n } else {\n return lst2.into_iter().map(|x| x.to_string()).collect();\n }\n}\n"}, {"buggy_solution": "\n let mut a1 = a;\n let mut num = 0;\n for i in 2..a {\n while a1 % i == 0 && a1 > i {\n a1 /= i;\n num += 1;\n }\n }\n if num == 2 {\n return true;\n }\n return false;\n}\n"}, {"buggy_solution": "\n let mut p: i32 = 1;\n let mut count: i32 = 0;\n\n while p <= x && count < 100 {\n if p == x {\n return true;\n };\n p = p * n;\n count += 1;\n }\n return false;\n}\n"}, {"buggy_solution": "\n let a1: f64 = i32::abs(a) as f64;\n let sqrt_3 = f64::powf(a1, 1.0 / 3.0).ceil();\n\n return i32::pow(sqrt_3 as i32, 3) == a1 as i32;\n}\n\n"}, {"buggy_solution": "\n let primes: Vec<&str> = vec![\"2\", \"3\", \"5\", \"7\", \"B\", \"D\"];\n let mut total: i32 = 0;\n for i in 0..num.len() {\n if primes.contains(&num.get(i..i + 1).unwrap()) {\n total += 1;\n }\n }\n return total;\n}\n"}, {"buggy_solution": "\n let mut d_cp = decimal;\n let mut out: String = String::from(\"\");\n if d_cp == 0 {\n return \"db0db\".to_string();\n }\n while d_cp > 0 {\n out = (d_cp % 2).to_string() + &out;\n d_cp = d_cp / 2;\n }\n out = \"db\".to_string() + &out + &\"db\".to_string();\n return out;\n}\n"}, {"buggy_solution": "\n let str: Vec = s.chars().into_iter().collect();\n if str.len() < 3 {\n return false;\n }\n for i in 2..str.len() {\n if str[i] == str[i - 1] || str[i] == str[i - 2] {\n return false;\n }\n }\n return true;\n}\n"}, {"buggy_solution": "\n let mut res: Vec = vec![];\n for (i, gpa) in grades.iter().enumerate() {\n if gpa == &4.0 {\n res.push(\"A+\".to_string());\n } else if gpa > &3.7 {\n res.push(\"A\".to_string());\n } else if gpa > &3.3 {\n res.push(\"A-\".to_string());\n } else if gpa > &3.0 {\n res.push(\"B+\".to_string());\n } else if gpa > &2.7 {\n res.push(\"B\".to_string());\n } else if gpa > &2.3 {\n res.push(\"B-\".to_string());\n } else if gpa > &2.0 {\n res.push(\"C+\".to_string());\n } else if gpa > &1.7 {\n res.push(\"C\".to_string());\n } else if gpa > &1.3 {\n res.push(\"C-\".to_string());\n } else if gpa > &1.0 {\n res.push(\"D+\".to_string());\n } else if gpa > &0.7 {\n res.push(\"D\".to_string());\n } else if gpa > &0.0 {\n res.push(\"D-\".to_string());\n } else {\n res.push(\"E\".to_string());\n }\n }\n return res;\n}\n"}, {"buggy_solution": "\n let l: usize = str.len();\n if l == 0 || l == 1 {\n return false;\n }\n\n for i in 2..l {\n if l % i == 0 {\n return false;\n }\n }\n return true;\n}\n"}, {"buggy_solution": "\n if n == 1 {\n return 1;\n };\n return 18 * i32::pow(10, (n - 2) as u32);\n}\n"}, {"buggy_solution": "\n let sum: i32 = n\n .to_string()\n .chars()\n .into_iter()\n .fold(0, |acc, c| acc + c.to_digit(10).unwrap() as i32);\n return format!(\"{sum:b}\");\n}\n"}, {"buggy_solution": "\n let mut sum: i32 = 0;\n\n for (indx, elem) in lst.iter().enumerate() {\n if indx % 2 == 1 {\n if elem % 2 == 0 {\n sum += elem\n }\n }\n }\n return sum;\n}\n"}, {"buggy_solution": "\n let mut res: String = String::new();\n\n for i in s.split_ascii_whitespace() {\n let mut str: Vec = i.chars().into_iter().collect();\n str.sort_by(|a, b| (*a as u32).cmp(&(*b as u32)));\n let str_sorted: String = str.into_iter().collect();\n res.push_str(&(str_sorted + &\" \".to_string()));\n }\n res = res.trim_end().to_string();\n return res;\n}\n"}, {"buggy_solution": "\n let mut out: Vec> = vec![];\n for (indxi, elem1) in lst.iter().enumerate() {\n for (indxj, _) in elem1.iter().rev().enumerate() {\n if lst[indxi][indxj] == x {\n out.push(vec![indxi as i32, indxj as i32]);\n }\n }\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut res: Vec = array.clone();\n\n if array.len() == 0 {\n return res;\n }\n\n if (array[0] + array[array.len() - 1]) % 2 == 0 {\n res.sort();\n return res.into_iter().rev().collect();\n } else {\n res.sort();\n return res;\n }\n}\n"}, {"buggy_solution": "\n let d: Vec = \"abcdefghijklmnopqrstuvwxyz\"\n .to_string()\n .chars()\n .into_iter()\n .collect();\n let mut out: String = String::new();\n for c in s.chars() {\n if d.contains(&c) {\n let indx: usize = (d.iter().position(|x| c == *x).unwrap() + 2 * 2) % 26;\n out += &d[indx].to_string();\n } else {\n out += &c.to_string();\n }\n }\n\n return out;\n}\n"}, {"buggy_solution": "\n let mut res = 0;\n let mut lst_cp = lst.clone();\n let mut first: i32 = 0;\n let mut second: i32 = 0;\n\n if lst.iter().min() == None {\n res = -1;\n } else {\n if lst.iter().min() != None {\n first = *lst.iter().min().unwrap();\n let indx = lst.iter().position(|x| *x == first).unwrap();\n lst_cp.remove(indx);\n\n if lst_cp.iter().min() != None {\n second = *lst_cp.iter().min().unwrap();\n }\n if first != second {\n res = second;\n } else {\n res = -1;\n }\n }\n }\n return res;\n}\n"}, {"buggy_solution": "\n let mut count = 0;\n let regex = Regex::new(r\"[.?!]\\s*\").expect(\"Invalid regex\");\n let sqn: Vec<&str> = regex.split(s).into_iter().collect();\n for s in sqn {\n if s.starts_with(\"I \") {\n count += 1;\n }\n }\n return count;\n}\n"}, {"buggy_solution": "\n if a.fract() == 0.0 && b.fract() == 0.0 && c.fract() == 0.0 {\n return a + b == c || a + c == b || b + c == a;\n } else {\n return false;\n }\n}\n"}, {"buggy_solution": "\n let mut res: String = String::new();\n let v: Vec = \"aeiouAEIOU\".to_string().chars().into_iter().collect();\n let d: Vec = \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .to_string()\n .chars()\n .into_iter()\n .collect();\n\n for (indx, elem) in message.chars().into_iter().enumerate() {\n let mut c = elem.to_string();\n\n if v.contains(&elem) {\n let indx: usize = d.iter().position(|x| &elem == x).unwrap();\n c = d[indx + 2 as usize].to_string();\n }\n\n if elem.is_uppercase() {\n c = c.to_lowercase().to_string();\n } else {\n c = c.to_uppercase().to_string();\n }\n res.push_str(&c);\n }\n return res;\n}\n"}, {"buggy_solution": "\n let mut largest = 0;\n for i in 0..lst.len() {\n if lst[i] > largest {\n let mut prime = true;\n let mut j = 2;\n while j * j <= lst[i] {\n if lst[i] % j == 0 {\n prime = false;\n }\n j += 1;\n }\n\n if prime {\n largest = lst[i];\n }\n }\n }\n let mut sum: i32 = 0;\n let mut s: String = String::new();\n s = largest.to_string();\n\n for n in s.chars().into_iter() {\n sum += n.to_digit(10).unwrap() as i32;\n }\n return sum;\n}\n"}, {"buggy_solution": "\n if dict.is_empty() {\n return false;\n }\n let string_lower: fn(str: &str) -> bool = |str: &str| {\n return str.chars().into_iter().all(|c| c.is_ascii_lowercase());\n };\n let string_upper: fn(str: &str) -> bool = |str: &str| {\n return str.chars().into_iter().all(|c| c.is_ascii_uppercase());\n };\n\n let lower: bool = dict.keys().into_iter().all(|str| string_lower(str));\n let upper: bool = dict.keys().into_iter().all(|str| string_upper(str));\n return lower || upper;\n}\n"}, {"buggy_solution": "\n let mut primes: Vec = vec![];\n\n for i in 2..n {\n let mut is_prime: bool = true;\n\n for j in 2..i {\n if i % j == 0 {\n is_prime = false;\n break;\n }\n }\n if is_prime {\n primes.push(i);\n }\n }\n return primes;\n}\n"}, {"buggy_solution": "\n return (i32::abs(a) % 10) * (i32::abs(b) % 10);\n}\n"}, {"buggy_solution": "\n let uvowel: &str = \"AEIOU\";\n let mut count: i32 = 0;\n\n for (indx, elem) in s.chars().into_iter().enumerate() {\n if indx % 2 == 0 {\n if uvowel.contains(elem) {\n count += 1;\n }\n }\n }\n return count;\n}\n"}, {"buggy_solution": "\n return value.parse::().unwrap().round() as i32;\n}\n"}, {"buggy_solution": "\n let mut out: Vec = vec![n];\n\n for i in 1..n {\n out.push(out[out.len() - 1] + 2);\n }\n\n return out;\n}\n"}, {"buggy_solution": "\n return s\n .to_string()\n .split(|c: char| c == ',' || c.is_whitespace())\n .into_iter()\n .filter(|x| x != &\"\")\n .map(|x| x.to_string())\n .collect();\n}\n"}, {"buggy_solution": "\n if y < x {\n return -1;\n }\n if y == x && y % 2 == 1 {\n return -1;\n }\n if y % 2 == 1 {\n return y - 1;\n }\n return y;\n}\n"}, {"buggy_solution": "\n if n > m {\n return \"-1\".to_string();\n };\n let mut num: i32 = (m + n) / 2;\n let mut out: String = String::from(\"\");\n while num > 0 {\n out = (num % 2).to_string() + &out;\n num = num / 2;\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut res: Vec = vec![];\n for (_, elem) in x.into_iter().enumerate() {\n let mut elem_cp: i32 = elem;\n let mut u: bool = true;\n if elem == 0 {\n u = false;\n }\n while elem_cp > 0 && u {\n if elem_cp % 2 == 0 {\n u = false;\n }\n elem_cp = elem_cp / 10;\n }\n if u {\n res.push(elem)\n };\n }\n res.sort();\n return res;\n}\n"}, {"buggy_solution": "\n let mut res: Vec = vec![];\n let mut arr_cp: Vec = arr.clone();\n arr_cp.sort();\n arr_cp.reverse();\n let map: HashMap = HashMap::from([\n (0, \"Zero\"),\n (1, \"One\"),\n (2, \"Two\"),\n (3, \"Three\"),\n (4, \"Four\"),\n (5, \"Five\"),\n (6, \"Six\"),\n (7, \"Seven\"),\n (8, \"Eight\"),\n (9, \"Nine\"),\n ]);\n\n for elem in arr_cp {\n if elem >= 1 && elem <= 9 {\n res.push(map.get(&elem).unwrap().to_string());\n }\n }\n\n return res;\n}\n"}, {"buggy_solution": "\n let mut sum: i32 = 0;\n let mut prod: i32 = 1;\n let mut out: Vec = vec![];\n\n for i in 1..n + 1 {\n sum += i;\n prod *= i;\n\n if i % 2 == 0 {\n out.push(prod);\n } else {\n out.push(sum)\n };\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut even = 0;\n let mut odd = 0;\n\n for i in 1..n + 1 {\n let mut w: String = i.to_string();\n let mut p: String = w.chars().rev().collect();\n\n if w == p && i % 2 == 1 {\n odd += 1;\n }\n if w == p && i % 2 == 0 {\n even += 1;\n }\n }\n (even, odd)\n}\n"}, {"buggy_solution": "\n let mut num: i32 = 0;\n\n for nmbr in n {\n if nmbr > 0 {\n num += 1;\n } else {\n let mut sum: i32 = 0;\n let mut w: i32;\n w = i32::abs(nmbr);\n\n while w >= 10 {\n sum += w % 10;\n w = w / 10;\n }\n sum -= w;\n if sum > 0 {\n num += 1;\n }\n }\n }\n return num;\n}\n"}, {"buggy_solution": "\n let mut num = 0;\n if arr.len() == 0 {\n return true;\n }\n for i in 1..arr.len() {\n if arr[i] < arr[i - 1] {\n num += 1;\n }\n }\n if arr[arr.len() - 1] > arr[0] {\n num += 1;\n }\n if num < 2 {\n return true;\n }\n return false;\n}\n"}, {"buggy_solution": "\n let mut num = 0;\n for i in 0..lst1.len() {\n if lst1[i] % 2 == 0 {\n num += 1;\n }\n }\n for i in 0..lst2.len() {\n if lst2[i] % 2 == 0 {\n num += 1;\n }\n }\n if num >= lst1.len() {\n return \"YES\".to_string();\n }\n return \"NO\".to_string();\n}\n"}, {"buggy_solution": "\n let mut res: HashMap = HashMap::new();\n if test == \"\" {\n return res;\n }\n for c in test.split_ascii_whitespace() {\n if res.contains_key(&c.chars().next().unwrap()) {\n res.entry(c.chars().next().unwrap()).and_modify(|n| {\n *n += 1;\n });\n } else {\n res.insert(c.chars().next().unwrap(), 1);\n }\n }\n let max: i32 = *res.values().max().unwrap();\n let non_maxs: Vec = res\n .keys()\n .filter(|k: &&char| *res.get(k).unwrap() != max)\n .map(|c| *c)\n .collect();\n non_maxs.iter().for_each(|c| {\n res.remove(c);\n });\n\n return res;\n}\n"}, {"buggy_solution": "\n let mut n = String::new();\n for i in 0..s.len() {\n if !c.contains(s.chars().nth(i).unwrap()) {\n n.push(s.chars().nth(i).unwrap());\n }\n }\n if n.len() == 0 {\n return vec![n, \"True\".to_string()];\n }\n let w: String = n.chars().rev().collect();\n if w == n {\n return vec![n, \"True\".to_string()];\n }\n return vec![n, \"False\".to_string()];\n}\n"}, {"buggy_solution": "\n let mut out: Vec = Vec::new();\n for i in 0..lst.len() {\n let mut sum = 0;\n for j in 0..lst[i].len() {\n if lst[i].chars().nth(j).unwrap() >= '0'\n && lst[i].chars().nth(j).unwrap() <= '9'\n && lst[i].chars().nth(j).unwrap().to_digit(10).unwrap() % 2 == 1\n {\n sum += 1;\n }\n }\n let mut s = \"the number of odd elements in the string i of the input.\".to_string();\n let mut s2 = \"\".to_string();\n for j in 0..s.len() {\n if s.chars().nth(j).unwrap() == 'i' {\n s2.push_str(&sum.to_string());\n } else {\n s2.push(s.chars().nth(j).unwrap());\n }\n }\n out.push(s2);\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut current = nums[0];\n let mut min = nums[0];\n for i in 1..nums.len() {\n if current < 0 {\n current = current + nums[i];\n } else {\n current = nums[i];\n }\n if current < min {\n min = current;\n }\n }\n min\n}\n"}, {"buggy_solution": "\n let mut out: i32 = 0;\n\n for i in 0..grid.len() {\n let mut sum: i32 = 0;\n\n for j in 0..grid[i].len() {\n sum += grid[i][j];\n }\n if sum > 0 {\n out += (sum - 1) / capacity + 1;\n }\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut arr_cp = arr.clone();\n let mut bin = vec![];\n let mut m;\n\n for i in 0..arr_cp.len() {\n let mut b = 0;\n let mut n = arr_cp[i].abs();\n while n > 0 {\n b += n % 2;\n n = n / 2;\n }\n bin.push(b);\n }\n for i in 0..arr_cp.len() {\n for j in 1..arr_cp.len() {\n if bin[j] < bin[j - 1] || (bin[j] == bin[j - 1] && arr_cp[j] < arr_cp[j - 1]) {\n m = arr_cp[j];\n arr_cp[j] = arr_cp[j - 1];\n arr_cp[j - 1] = m;\n m = bin[j];\n bin[j] = bin[j - 1];\n bin[j - 1] = m;\n }\n }\n }\n return arr_cp;\n}\n"}, {"buggy_solution": "\n let vowels = \"aeiouAEIOU\";\n let mut current = String::new();\n let mut out = Vec::new();\n let mut numc = 0;\n let mut s = s.to_string();\n s.push(' ');\n for i in 0..s.len() {\n if s.chars().nth(i).unwrap() == ' ' {\n if numc == n {\n out.push(current);\n }\n current = String::new();\n numc = 0;\n } else {\n current.push(s.chars().nth(i).unwrap());\n if (s.chars().nth(i).unwrap() >= 'A' && s.chars().nth(i).unwrap() <= 'Z')\n || (s.chars().nth(i).unwrap() >= 'a' && s.chars().nth(i).unwrap() <= 'z')\n {\n if !vowels.contains(s.chars().nth(i).unwrap()) {\n numc += 1;\n }\n }\n }\n }\n out\n}\n"}, {"buggy_solution": "\n let vowels = \"AEIOUaeiou\";\n let mut out = \"\".to_string();\n for i in (1..word.len() - 1).rev() {\n if vowels.contains(word.chars().nth(i).unwrap()) {\n if !vowels.contains(word.chars().nth(i + 1).unwrap()) {\n if !vowels.contains(word.chars().nth(i - 1).unwrap()) {\n out.push(word.chars().nth(i).unwrap());\n return out;\n }\n }\n }\n }\n out\n}\n"}, {"buggy_solution": "\n let l1 = lst[0].to_string() + lst[1];\n let mut count = 0;\n let mut can = true;\n for i in 0..l1.len() {\n if l1.chars().nth(i).unwrap() == '(' {\n count += 1;\n }\n if l1.chars().nth(i).unwrap() == ')' {\n count -= 1;\n }\n if count < 0 {\n can = false;\n }\n }\n if count != 0 {\n return \"No\";\n }\n if can == true {\n return \"Yes\";\n }\n let l1 = lst[1].to_string() + lst[0];\n let mut can = true;\n for i in 0..l1.len() {\n if l1.chars().nth(i).unwrap() == '(' {\n count += 1;\n }\n if l1.chars().nth(i).unwrap() == ')' {\n count -= 1;\n }\n if count < 0 {\n can = false;\n }\n }\n if can == true {\n return \"Yes\";\n }\n return \"No\";\n}\n"}, {"buggy_solution": "\n let mut arr = arr;\n arr.sort();\n let mut arr_res: Vec = arr.iter().rev().take(k as usize).cloned().collect();\n arr_res.sort();\n return arr_res;\n}\n"}, {"buggy_solution": "\n let mut sum = 0;\n for (indx, elem) in lst.iter().enumerate() {\n if indx % 2 == 0 {\n if elem % 2 == 1 {\n sum += elem;\n }\n }\n }\n return sum;\n}\n"}, {"buggy_solution": "\n let mut sum = 0;\n for i in 0..k {\n if arr[i as usize] >= -99 && arr[i as usize] <= 99 {\n sum += arr[i as usize];\n }\n }\n sum\n}\n"}, {"buggy_solution": "\n let mut out = vec![1];\n let mut n = n;\n while n != 1 {\n if n % 2 == 1 {\n out.push(n);\n n = n * 3 + 1;\n } else {\n n = n / 2;\n }\n }\n out.sort();\n out\n}\n\n"}, {"buggy_solution": "\n let mut mm = 0;\n let mut dd = 0;\n let mut yy = 0;\n let mut i = 0;\n if date.len() != 10 {\n return false;\n }\n for i in 0..10 {\n if i == 2 || i == 5 {\n if date.chars().nth(i).unwrap() != '-' {\n return false;\n }\n } else if date.chars().nth(i).unwrap() < '0' || date.chars().nth(i).unwrap() > '9' {\n return false;\n }\n }\n mm = date[0..2].parse::().unwrap();\n dd = date[3..5].parse::().unwrap();\n yy = date[6..10].parse::().unwrap();\n if mm < 1 || mm > 12 {\n return false;\n }\n if dd < 1 || dd > 31 {\n return false;\n }\n if dd == 31 && (mm == 4 || mm == 6 || mm == 9 || mm == 11 || mm == 2) {\n return false;\n }\n if dd == 30 && mm == 2 {\n return false;\n }\n return true;\n}\n"}, {"buggy_solution": "\n let mut out: Vec = Vec::new();\n let alphabet: HashMap = HashMap::from([\n ('a', 0),\n ('b', 1),\n ('c', 2),\n ('d', 3),\n ('e', 4),\n ('f', 5),\n ('g', 6),\n ('h', 7),\n ('i', 8),\n ('j', 9),\n ('k', 10),\n ('l', 11),\n ('m', 12),\n ('n', 13),\n ('o', 14),\n ('p', 15),\n ('q', 16),\n ('r', 17),\n ('s', 18),\n ('t', 19),\n ('u', 20),\n ('v', 21),\n ('w', 22),\n ('x', 23),\n ('y', 24),\n ('z', 25),\n ]);\n\n if txt.contains(' ') {\n out = txt\n .split_whitespace()\n .into_iter()\n .map(|c| c.to_string())\n .collect();\n } else if txt.contains(',') {\n out = txt.split(',').into_iter().map(|c| c.to_string()).collect();\n } else {\n let count = txt\n .chars()\n .into_iter()\n .filter(|c| c.is_ascii_lowercase())\n .filter(|c| alphabet.get(c).unwrap() % 2 == 1)\n .count();\n out.push(count.to_string());\n }\n\n return out;\n}\n"}, {"buggy_solution": "\n for i in 1..lst.len() {\n if lst[i] < lst[i - 1] {\n return false;\n }\n if i >= 2 && lst[i] == lst[i - 1] && lst[i] == lst[i - 2] {\n return false;\n }\n }\n true\n}\n"}, {"buggy_solution": "\n let inter1 = std::cmp::max(interval1[0], interval2[0]);\n let inter2 = std::cmp::min(interval1[1], interval2[1]);\n let l = inter2 - inter1;\n if l < 2 {\n return \"NO\".to_string();\n }\n for i in 2..l {\n if l % i == 0 {\n return \"NO\".to_string();\n }\n }\n return \"YES\".to_string();\n}\n"}, {"buggy_solution": "\n if arr.is_empty() {\n return -32768;\n }\n let mut sum = 0;\n let mut prods = 1;\n for i in arr {\n sum += i.abs();\n if i == 0 {\n prods = 0;\n }\n if i < 0 {\n prods = -prods;\n }\n }\n sum * prods\n}\n\n"}, {"buggy_solution": "\n let mut out: Vec = vec![];\n let mut x = 0;\n let mut y = 0;\n let mut min: i32 = (grid.len() * grid.len()) as i32;\n for i in 0..grid.len() {\n for j in 0..grid[i].len() {\n if grid[i][j] == 1 {\n x = i;\n y = j;\n }\n }\n }\n if x > 0 && grid[x - 1][y] < min {\n min = grid[x - 1][y];\n }\n if x < grid.len() - 1 && grid[x + 1][y] < min {\n min = grid[x + 1][y];\n }\n if y > 0 && grid[x][y - 1] < min {\n min = grid[x][y - 1];\n }\n if y < grid.len() - 1 && grid[x][y + 1] < min {\n min = grid[x][y + 1];\n }\n let mut out = vec![];\n for i in 0..k {\n if i % 2 == 0 {\n out.push(1);\n } else {\n out.push(min);\n }\n }\n out\n}\n"}, {"buggy_solution": "\n let mut out = vec![1, 3];\n if n == 0 {\n return vec![1];\n }\n for i in 2..=n {\n if i % 2 == 0 {\n out.push(1 + i / 2);\n } else {\n out.push(out[(i - 1) as usize] + out[(i - 2) as usize] + 1 + (i + 1) / 2);\n }\n }\n out\n}\n"}, {"buggy_solution": "\n let mut prod: i32 = 1;\n let mut has = 0;\n let s = n.to_string();\n for i in 0..s.len() {\n if s.chars().nth(i).unwrap().to_digit(10).unwrap() % 2 == 1 {\n has = 1;\n prod = prod * (s.chars().nth(i).unwrap().to_digit(10).unwrap()) as i32;\n }\n }\n if has == 0 {\n return 0;\n }\n prod\n}\n"}, {"buggy_solution": "\n let mut count = 0;\n let mut maxcount = 0;\n for i in 0..str.len() {\n if str.chars().nth(i).unwrap() == '[' {\n count += 1;\n }\n if str.chars().nth(i).unwrap() == ']' {\n count -= 1;\n }\n if count < 0 {\n count = 0;\n }\n if count > maxcount {\n maxcount = count;\n }\n if count <= maxcount - 2 {\n return true;\n }\n }\n return false;\n}\n"}, {"buggy_solution": "\n let mut sum: f32 = 0.0;\n for i in 0..lst.len() {\n sum = sum + (lst[i].ceil() * lst[i].ceil());\n }\n sum as i32\n}\n"}, {"buggy_solution": "\n if txt.len() == 0 {\n return false;\n }\n let chr = txt.chars().last().unwrap();\n if chr < 'A' || (chr > 'Z' && chr < 'a') || chr > 'z' {\n return false;\n }\n if txt.len() == 1 {\n return true;\n }\n let chr = txt.chars().nth(txt.len() - 2).unwrap();\n if (chr >= 'A' && chr <= 'Z') || (chr >= 'a' && chr <= 'z') {\n return false;\n }\n true\n}\n"}, {"buggy_solution": "\n let mut max: i32 = -1;\n for i in 0..arr.len() {\n if arr[i] <= i as i32 {\n max = i as i32;\n }\n }\n max\n}\n\n"}, {"buggy_solution": "\n let mut maxneg = 0;\n let mut minpos = 0;\n for i in 0..lst.len() {\n if lst[i] < 0 && (maxneg == 0 || lst[i] > maxneg) {\n maxneg = lst[i];\n }\n if lst[i] > 0 && (minpos == 0 || lst[i] < minpos) {\n minpos = lst[i];\n }\n }\n vec![maxneg, minpos]\n}\n"}, {"buggy_solution": "\n let a_f64 = Any_to_f64(a);\n let b_f64 = Any_to_f64(b);\n\n if a_f64 > b_f64 {\n return original_type(a);\n }\n\n if a_f64 < b_f64 {\n return original_type(b);\n } else {\n return RtnType::String(\"None\".to_string());\n }\n}\n\n#[derive(Debug, PartialEq)]\npub enum RtnType {\n Empty(),\n String(S),\n Float(F),\n Int(I),\n}\n\nfn Any_to_f64(a: &dyn Any) -> f64 {\n let mut a_f64 = 0.0;\n\n if a.downcast_ref::() == None {\n match a.downcast_ref::<&str>() {\n Some(as_string) => {\n a_f64 = as_string.parse::().unwrap();\n }\n None => {}\n }\n\n match a.downcast_ref::() {\n Some(as_i32) => {\n a_f64 = *as_i32 as f64;\n }\n None => {}\n }\n } else {\n a_f64 = *a.downcast_ref::().unwrap();\n }\n\n return a_f64;\n}\n\nfn original_type(a: &dyn Any) -> RtnType {\n let mut res = RtnType::Empty();\n match a.downcast_ref::<&str>() {\n Some(as_string) => {\n res = RtnType::String(as_string.parse::().unwrap());\n }\n None => {}\n }\n\n match a.downcast_ref::() {\n Some(as_i32) => {\n res = RtnType::Int(*as_i32);\n }\n None => {}\n }\n\n match a.downcast_ref::() {\n Some(as_f64) => res = RtnType::Float(*as_f64),\n None => {}\n }\n return res;\n}\n"}, {"buggy_solution": "\n if n % 2 == 0 && n >= 8 {\n return true;\n }\n return false;\n}\n"}, {"buggy_solution": "\n let mut fact = 1;\n let mut bfact: i64 = 1;\n for i in 1..=n {\n fact = fact * i;\n bfact = bfact * fact as i64;\n }\n bfact\n}\n"}, {"buggy_solution": "\n let mut out = String::new();\n let mut spacelen = 0;\n for c in text.chars() {\n if c == ' ' {\n spacelen += 1;\n } else {\n if spacelen == 1 {\n out.push('_');\n }\n if spacelen == 2 {\n out.push_str(\"__\");\n }\n if spacelen > 2 {\n out.push('-');\n }\n spacelen = 0;\n out.push(c);\n }\n }\n if spacelen == 1 {\n out.push('_');\n }\n if spacelen == 2 {\n out.push_str(\"__\");\n }\n if spacelen > 2 {\n out.push('-');\n }\n out\n}\n"}, {"buggy_solution": "\n let mut numdigit = 0;\n let mut numdot = 0;\n if file_name.len() < 5 {\n return \"No\";\n }\n let w = file_name.chars().nth(0).unwrap();\n if w < 'A' || (w > 'Z' && w < 'a') || w > 'z' {\n return \"No\";\n }\n let last = &file_name[file_name.len() - 4..];\n if last != \".txt\" && last != \".exe\" && last != \".dll\" {\n return \"No\";\n }\n for c in file_name.chars() {\n if c >= '0' && c <= '9' {\n numdigit += 1;\n }\n if c == '.' {\n numdot += 1;\n }\n }\n if numdigit > 3 || numdot != 1 {\n return \"No\";\n }\n return \"Yes\";\n}\n"}, {"buggy_solution": "\n let mut sum = 0;\n for i in 0..lst.len() {\n if i % 3 == 0 {\n sum += lst[i] * lst[i];\n } else if i % 4 == 0 {\n sum += lst[i] * lst[i] * lst[i];\n } else {\n sum += lst[i];\n }\n }\n return sum;\n}\n"}, {"buggy_solution": "\n let mut out = String::new();\n let mut current = String::new();\n let mut sentence = sentence.to_string();\n sentence.push(' ');\n\n for i in 0..sentence.len() {\n if sentence.chars().nth(i).unwrap() != ' ' {\n current.push(sentence.chars().nth(i).unwrap());\n } else {\n let mut isp = true;\n let l = current.len();\n if l < 2 {\n isp = false;\n }\n for j in 2..(l as f64).sqrt() as usize + 1 {\n if l % j == 0 {\n isp = false;\n }\n }\n if isp {\n out.push_str(¤t);\n out.push(' ');\n }\n current = String::new();\n }\n }\n if out.len() > 0 {\n out.pop();\n }\n out\n}\n"}, {"buggy_solution": "\n let mut a = 0;\n let mut b = 0;\n let mut c = 0;\n let mut d = 0;\n let mut i = 0;\n for i in 0..x.len() {\n if x.chars().nth(i).unwrap() == '/' {\n a = x\n .chars()\n .take(i)\n .collect::()\n .parse::()\n .unwrap();\n b = x\n .chars()\n .skip(i + 1)\n .collect::()\n .parse::()\n .unwrap();\n }\n }\n for i in 0..n.len() {\n if n.chars().nth(i).unwrap() == '/' {\n c = n\n .chars()\n .take(i)\n .collect::()\n .parse::()\n .unwrap();\n d = n\n .chars()\n .skip(i + 1)\n .collect::()\n .parse::()\n .unwrap();\n }\n }\n if (a * c) % (b * d) == 0 {\n return true;\n }\n return false;\n}\n"}, {"buggy_solution": "\n let mut result = arr.clone();\n result.sort_by_key(|&x| (sum_of_digits(x)));\n result\n}\n\npub fn sum_of_digits(n: i32) -> i32 {\n let mut sum = 0;\n let mut n = n;\n if n < 0 {\n let right = n / 10;\n let mut left;\n\n if right != 0 {\n left = n % 10;\n left = -1 * left;\n } else {\n left = n % 10;\n }\n sum = right + left;\n return sum;\n }\n\n while n > 0 {\n sum += n % 10;\n n /= 10;\n }\n sum\n}\n"}, {"buggy_solution": "\n let mut num = 0;\n for i in 0..nums.len() {\n if nums[i] > 10 {\n let w = nums[i].to_string();\n if w.chars().nth(0).unwrap().to_digit(10).unwrap() % 2 == 1\n && w.chars().last().unwrap().to_digit(10).unwrap() % 2 == 1\n {\n num += 1;\n }\n }\n }\n num\n}\n"}, {"buggy_solution": "\n let mut a = vec![];\n let mut sum = vec![vec![0, 0, 0]];\n let mut sum2 = vec![vec![0, 0, 0]];\n\n for i in 1..=n {\n a.push((i * i - i + 1) % 3);\n sum.push(sum[sum.len() - 1].clone());\n sum[i as usize][a[i as usize - 1] as usize] += 1;\n }\n\n for times in 1..3 {\n for i in 1..=n {\n sum2.push(sum2[sum2.len() - 1].clone());\n if i >= 1 {\n for j in 0..=2 {\n sum2[i as usize][(a[i as usize - 1] + j) as usize % 3] +=\n sum[i as usize - 1][j as usize];\n }\n }\n }\n sum = sum2.clone();\n sum2 = vec![vec![0, 0, 0]];\n }\n\n return sum[n as usize][0];\n}\n"}, {"buggy_solution": "\n let planets = vec![\n \"Mercury\", \"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\", \"Uranus\", \"Neptune\",\n ];\n let mut pos1: i32 = -1;\n let mut pos2: i32 = -1;\n let mut m;\n for m in 0..planets.len() {\n if planets[m] == planet1 {\n pos1 = m as i32;\n }\n if planets[m] == planet2 {\n pos2 = m as i32;\n }\n }\n if pos1 == -1 || pos2 == -1 {\n return vec![];\n }\n if pos1 > pos2 {\n m = pos1;\n pos1 = pos2;\n pos2 = m;\n }\n let mut out = vec![];\n for m in pos1 + 1..pos2 {\n out.push(planets[m as usize].to_string());\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut out: Vec<&str> = Vec::new();\n for i in 0..lst.len() {\n if lst[i].len() % 2 == 0 {\n out.push(lst[i]);\n }\n }\n out.sort();\n for i in 0..out.len() {\n for j in 1..out.len() {\n if out[j].len() < out[j - 1].len() {\n let mid = out[j];\n out[j] = out[j - 1];\n out[j - 1] = mid;\n }\n }\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut isp = true;\n if n < 2 {\n isp = false;\n }\n for i in 2..=n / 2 {\n if n % i == 0 {\n isp = false;\n }\n }\n if isp {\n return x;\n }\n return y;\n}\n"}, {"buggy_solution": "\n let mut sum: i64 = 0;\n for i in 0..lst.len() {\n if (lst[i] - lst[i].round()).abs() < 1e-4 {\n if lst[i] > 0.0 && (lst[i].round() as i64) % 2 == 1 {\n sum += (lst[i].round() as i64) * (lst[i].round() as i64);\n }\n }\n }\n return sum;\n}\n"}, {"buggy_solution": "\n let mut out: Vec = Vec::new();\n for i in 0..game.len() {\n out.push(i32::abs(game[i] - guess[i]));\n }\n return out;\n}\n"}, {"buggy_solution": "\n let mut strongest = \"\";\n let mut max = -1000;\n for i in 0..extensions.len() {\n let mut strength = 0;\n for j in 0..extensions[i].len() {\n let chr = extensions[i].chars().nth(j).unwrap();\n if chr >= 'A' && chr <= 'Z' {\n strength += 1;\n }\n if chr >= 'a' && chr <= 'z' {\n strength -= 1;\n }\n }\n if strength > max {\n max = strength;\n strongest = extensions[i];\n }\n }\n format!(\"{}.{}\", class_name, strongest)\n}\n"}, {"buggy_solution": "\n for i in 0..b.len() {\n let rotate = format!(\"{}{}\", &b[i..], &b[..i]);\n if a.contains(&rotate) {\n return true;\n }\n }\n false\n}\n\n"}, {"buggy_solution": "\n let w = num.abs().to_string();\n let mut n1 = 0;\n let mut n2 = 0;\n for i in 0..w.len() {\n if w.chars().nth(i).unwrap().to_digit(10).unwrap() % 2 == 1 {\n n1 += 1;\n } else {\n n2 += 1;\n }\n }\n vec![n2, n1]\n}\n"}, {"buggy_solution": "\n let mut current = String::new();\n let mut number = number;\n let rep = vec![\n \"m\", \"cm\", \"d\", \"cd\", \"c\", \"xc\", \"l\", \"xl\", \"x\", \"ix\", \"v\", \"iv\", \"i\",\n ];\n let num = vec![1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\n let mut pos = 0;\n while number > 0 {\n while number >= num[pos] {\n current.push_str(rep[pos]);\n number -= num[pos];\n }\n if number > 0 {\n pos += 1;\n }\n }\n current\n}\n"}, {"buggy_solution": "\n if (a * a + b * b - c * c).abs() < 1e-4\n || (a * a + c * c - b * b).abs() < 1e-4\n || (b * b + c * c - a * a).abs() < 1e-4\n {\n return true;\n }\n return false;\n}\n"}, {"buggy_solution": "\n let mut max = \"\";\n let mut maxu = 0;\n for i in 0..words.len() {\n let mut unique = String::from(\"\");\n for j in 0..words[i].len() {\n if !unique.contains(words[i].chars().nth(j).unwrap()) {\n unique.push(words[i].chars().nth(j).unwrap());\n }\n }\n if unique.len() > maxu || (unique.len() == maxu && words[i] < max) {\n max = words[i];\n maxu = unique.len();\n }\n }\n max\n}\n"}, {"buggy_solution": "\n if need > remaining {\n return vec![number + remaining, 0];\n }\n return vec![number + need, remaining - need];\n}\n"}, {"buggy_solution": "\n let mut operand: Vec = operand;\n let mut num: Vec = vec![];\n let mut posto: Vec = vec![];\n for i in 0..operand.len() {\n posto.push(i as i32);\n }\n for i in 0..operato.len() {\n if operato[i] == \"**\" {\n while posto[posto[i] as usize] != posto[i] {\n posto[i] = posto[posto[i] as usize];\n }\n while posto[posto[i + 1] as usize] != posto[i + 1] {\n posto[i + 1] = posto[posto[i + 1] as usize];\n }\n operand[posto[i] as usize] =\n operand[posto[i] as usize].pow(operand[posto[i + 1] as usize] as u32);\n posto[i + 1] = posto[i];\n }\n }\n for i in 0..operato.len() {\n if operato[i] == \"*\" || operato[i] == \"//\" {\n while posto[posto[i] as usize] != posto[i] {\n posto[i] = posto[posto[i] as usize];\n }\n while posto[posto[i + 1] as usize] != posto[i + 1] {\n posto[i + 1] = posto[posto[i + 1] as usize];\n }\n if operato[i] == \"*\" {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] * operand[posto[i + 1] as usize];\n } else {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] / operand[posto[i + 1] as usize];\n }\n posto[i + 1] = posto[i];\n }\n }\n for i in 0..operato.len() {\n if operato[i] == \"+\" || operato[i] == \"-\" {\n while posto[posto[i] as usize] != posto[i] {\n posto[i] = posto[posto[i] as usize];\n }\n while posto[posto[i + 1] as usize] != posto[i + 1] {\n posto[i + 1] = posto[posto[i + 1] as usize];\n }\n if operato[i] == \"+\" {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] + operand[posto[i + 1] as usize];\n } else {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] - operand[posto[i + 1] as usize];\n }\n posto[i + 1] = posto[i];\n }\n }\n operand[0]\n}\n"}, {"buggy_solution": "\n let mut nletter = 0;\n let mut out = String::new();\n for c in s.chars() {\n let mut w = c;\n if w >= 'A' && w <= 'Z' {\n w = w.to_ascii_lowercase();\n } else if w >= 'a' && w <= 'z' {\n w = w.to_ascii_uppercase();\n } else {\n nletter += 1;\n }\n out.push(w);\n }\n if nletter == s.len() {\n out.chars().rev().collect()\n } else {\n out\n }\n}\n"}, {"buggy_solution": "\n if text.is_empty() {\n return \"None\".to_string();\n }\n\n let digest = md5::compute(text.as_bytes());\n return format!(\"{:x}\", digest);\n}\n"}, {"buggy_solution": "\n let mut a = a;\n let mut b = b;\n let mut m;\n\n if b < a {\n m = a;\n a = b;\n b = m;\n }\n\n let mut out = vec![];\n for i in a..=b {\n if i < 10 && i % 2 == 0 {\n out.push(i);\n }\n }\n out\n}\n"}] \ No newline at end of file +[ + { + "buggy_solution": "\n for i in 0..numbers.len(){\n for j in 1..numbers.len(){\n\n if i != j {\n let distance:f32 = numbers[i] - numbers[j];\n\n if distance.abs() < threshold{\n return true;\n }\n\n }\n \n }\n }\n\n return false;\n\n}\n" + }, + { + "buggy_solution": "\n let mut result:Vec = vec![];\n let mut current_string:String = String::new();\n let mut current_depth:u32 = 0;\n\n for c in paren_string.chars(){\n if c == '('{\n current_depth += 1;\n current_string.push(c);\n }\n else if c == ')' {\n current_depth -= 1;\n current_string.push(c);\n\n if current_depth == 0{\n result.push(current_string.clone());\n current_string.clear()\n }\n \n }\n\n\n }\n return result;\n}\n" + }, + { + "buggy_solution": "\n return number % 1.0;\n}\n" + }, + { + "buggy_solution": "\n\nlet mut balance:i32 = 0;\nfor op in operations {\n balance = balance + op;\n if balance < 0 {\n return true;\n }\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mean:f32 = numbers.iter().fold(0.0,|acc:f32, x:&f32| acc + x) / numbers.len() as f32;\n return numbers.iter().map(|x:&f32| (x - mean).abs()).sum::() / numbers.len() as f32;\n}\n\n" + }, + { + "buggy_solution": "\n let mut res:Vec = vec![];\n numbers.iter().for_each(|item:&u32| {res.push(*item); res.push(delimeter);});\n res.pop();\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut result:Vec = vec![];\n let mut depth:i32 = 0;\n let mut max_depth:i32 = 0;\n\n for splits in paren_string.split(' '){\n for c in splits.chars(){ \n if c == '('{\n depth = depth + 1;\n max_depth = max(depth, max_depth);\n }\n else{\n depth = depth - 1;\n }\n }\n \n if depth == 0 {\n result.push(max_depth);\n max_depth = 0;\n }\n }\n\n return result;\n}\n" + }, + { + "buggy_solution": "\n return strings.iter().filter(|x:&&String| x.contains(&substring)).map(String::from).collect();\n}\n" + }, + { + "buggy_solution": "\n let sum = |xs: &Vec| xs.iter()\n .fold(0, |mut sum, &val| { sum += val; \n sum }\n );\n let product = |xs: &Vec| xs.iter()\n .fold(1, |mut prod, &val| { prod *= val; \n prod }\n );\n return (sum(&numbers),product(&numbers));\n}\n" + }, + { + "buggy_solution": "\n let mut running_max :Option = None;\n let mut result:Vec = vec![];\n\n for n in numbers{\n if running_max == None {\n running_max = Some(n);\n\n }else{\n running_max = max(running_max, Some(n));\n }\n\n result.push(running_max.unwrap());\n }\n return result;\n\n}\n" + }, + { + "buggy_solution": "\n let s: String = str.chars().rev().collect();\n return s==str;\n }\n \n fn make_palindrome(str: &str) -> String {\n let mut i: usize = 0;\n for i in 0..str.len() {\n let rstr: &str = &str[i..];\n if is_palindrome_10(rstr) {\n let nstr: &str = &str[0..i];\n let n2str: String = nstr.chars().rev().collect();\n return str.to_string()+&n2str;\n }\n }\n let n2str: String = str.chars().rev().collect();\n return str.to_string()+&n2str;\n }\n" + }, + { + "buggy_solution": "\n\n let xor = |i:char, j:char| {if i == j{return \"0\".to_string()}else{return \"1\".to_string()}};\n return a.chars().into_iter().zip(b.chars().into_iter()).map(|(i,j)| \"\".to_string() + &xor(i,j)).collect(); \n}\n" + }, + { + "buggy_solution": "\n if strings.is_empty(){\n return None;\n }\n let mut max:i32 = 0;\n let mut res:String = String::new();\n\n for s in strings{\n if s.len() as i32 > max {\n res = s;\n max = res.len() as i32;\n } \n }\n return Some(res);\n}\n" + }, + { + "buggy_solution": "\n while b > 0 {\n (a, b) = (b, a % b);\n }\n return a;\n}\n\n" + }, + { + "buggy_solution": "\n let mut res:Vec = vec![];\n let mut res_str:String = String::new();\n\nfor c in string.chars(){\n res_str.push(c);\n res.push(res_str.clone());\n}\nreturn res;\n}\n\n" + }, + { + "buggy_solution": "\n let mut res:String = String::new();\n\n for number in 0..n + 1{\n res = res + &number.to_string() + \" \";\n }\n \n return res.trim_end().to_string();\n\n}\n" + }, + { + "buggy_solution": "\n let res:HashSet = str.chars().into_iter().map(|x:char| x.to_ascii_lowercase()).collect();\n return res.len() as i32;\n}\n" + }, + { + "buggy_solution": "\n\n let map = |x:&str| {match x {\n \"o\" => 4,\n \"o|\" => 2,\n \".|\" => 1,\n _ => 0\n } \n};\n return music_string.split(\" \").map(|x:&str| map(&x.to_string())).filter(|x:&i32| x != &0).collect();\n}\n" + }, + { + "buggy_solution": "\n let mut times:i32 = 0;\n\n for i in 0..(string.len() as i32 - substring.len() as i32 + 1){\n if string.get(i as usize..(i + substring.len() as i32) as usize).unwrap().to_string() == substring {\n times += 1;\n } \n }\n return times;\n}\n" + }, + { + "buggy_solution": "\n let str_to_i32 = |x:&str| {match x{\n \"zero\" => 0,\n \"one\" => 1,\n \"two\" => 2,\n \"three\" => 3,\n \"four\" => 4,\n \"five\" => 5,\n \"six\" => 6,\n \"seven\" => 7,\n \"eight\" => 8,\n \"nine\" => 9,\n _ => 1000\n }};\n\n let i32_to_str = |x:&i32| {match x{\n 0 => \"zero\".to_string(),\n 1 => \"one\".to_string(),\n 2 => \"two\".to_string(),\n 3 => \"three\".to_string(),\n 4 => \"four\".to_string(),\n 5 => \"five\".to_string(),\n 6 => \"six\".to_string(),\n 7 => \"seven\".to_string(),\n 8 => \"eight\".to_string(),\n 9 => \"nine\".to_string(),\n _ => \"none\".to_string()\n}};\n\n let mut nmbrs:Vec = numbers.split_ascii_whitespace().map(|x:&str| str_to_i32(x)).collect(); \n nmbrs.sort();\n let res:String = nmbrs.iter().map(|x:&i32| i32_to_str(x) + \" \").collect();\n return res.trim_end().to_string();\n}\n" + }, + { + "buggy_solution": "\n let mut closest_pair = (0.0,0.0);\n let mut distance:Option = None;\n\n for (idx, elem) in numbers.iter().enumerate(){\n for (idx2, elem2) in numbers.iter().enumerate() {\n if idx != idx2 {\n if distance == None {\n distance = Some((elem - elem2).abs());\n if *elem < *elem2{\n closest_pair = (*elem, *elem2);\n }else{\n closest_pair = (*elem2, *elem);\n }\n\n }else{\n let new_distance:f32= (elem - elem2).abs();\n if new_distance < distance.unwrap(){\n distance = Some(new_distance);\n\n if *elem < *elem2{\n closest_pair = (*elem, *elem2);\n }else{\n closest_pair = (*elem2, *elem);\n }\n \n \n }\n }\n }\n }\n }\n return closest_pair;\n\n\n}\n" + }, + { + "buggy_solution": "\n let min_number= *numbers.iter().min_by(|a, b| a.partial_cmp(b).unwrap()).unwrap();\n let max_number= *numbers.iter().max_by(|a, b| a.partial_cmp(b).unwrap()).unwrap();\n return numbers.iter().map(|x:&f32| (x-min_number) / (max_number - min_number)).collect();\n}\n" + }, + { + "buggy_solution": "\n let mut out: Vec = Vec::new();\n for value in values {\n if let Some(i) = value.downcast_ref::() {\n out.push(*i);\n }\n }\n out\n }\n" + }, + { + "buggy_solution": "\n return strings.len() as i32;\n}\n" + }, + { + "buggy_solution": "\n let mut res:i32 = 0;\n let sqn = 1..n;\n \n for i in sqn.rev(){\n if n % i == 0 {\n res = i;\n break;\n }\n }\n\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut n = n;\n let mut factors = vec![];\n let mut divisor = 2;\n while divisor * divisor <= n {\n while n % divisor == 0 {\n factors.push(divisor);\n n = n / divisor;\n }\n divisor = divisor + 1;\n }\n if n > 1 {\n factors.push(n);\n }\n factors\n}\n" + }, + { + "buggy_solution": "\n let mut m: HashMap = HashMap::new();\n\n for n in &numbers {\n *m.entry(*n).or_default() += 1;\n }\n let res:Vec = numbers.into_iter().filter(|x| m.get(x) == Some(&1)).collect();\n return res;\n}\n" + }, + { + "buggy_solution": "\n return string.chars().into_iter().fold(String::new(), |res:String, c:char| {if c.is_ascii_lowercase(){return res + &c.to_uppercase().to_string();}else{return res + &c.to_ascii_lowercase().to_string();}});\n}\n" + }, + { + "buggy_solution": "\n return strings.iter().fold(String::new(),|res: String, x:&String| res + &x.to_string());\n\n}\n" + }, + { + "buggy_solution": "\n return strings.into_iter().filter(|s| s.starts_with(&prefix)).collect();\n}\n" + }, + { + "buggy_solution": "\n return numbers.into_iter().filter(|n| n.is_positive()).collect();\n\n}\n" + }, + { + "buggy_solution": "\n if n < 2{\n return false;\n}\nfor k in 2..n-1 {\n if n % k == 0{\n return false;\n }\n}\nreturn true;\n\n}\n" + }, + { + "buggy_solution": "\n let mut sum = 0.0;\n for i in 0..xs.len() {\n sum += xs[i] * x.powi(i as i32);\n }\n sum\n }\n \n fn find_zero(xs: &Vec) -> f64 {\n let mut ans = 0.0;\n let mut value = poly(xs, ans);\n while value.abs() > 1e-6 {\n let mut driv = 0.0;\n for i in 1..xs.len() {\n driv += xs[i] * ans.powi((i - 1) as i32) * (i as f64);\n }\n ans = ans - value / driv;\n value = poly(xs, ans);\n }\n ans\n }\n" + }, + { + "buggy_solution": "\n let mut third = vec![];\n let mut out:Vec = vec![];\n\n for (indx,elem) in l.iter().enumerate(){\n if indx%3 == 0 && indx != 0{\n third.push(elem)\n }\n }\n third.sort();\n let mut indx_t:usize = 0;\n\n for i in 0..l.len() {\n if i%3 == 0 && i != 0{\n if indx_t < third.len(){\n out.push(*third[indx_t]);\n indx_t += 1;\n }\n }else{\n out.push(l[i]);\n }\n \n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut res:Vec = nmbs.clone();\n res.sort();\n res.dedup();\n return res;\n }\n" + }, + { + "buggy_solution": "\n return *nmbs.iter().max().unwrap();\n }\n\n" + }, + { + "buggy_solution": "\n let mut ns:Vec = vec![];\n\n for i in 0..n{\n if i % 11 == 0 || i % 13 == 0{\n ns.push(i);\n }\n }\n\n let s:String = ns.into_iter().fold(String::new(),|s:String, n:i32| {s + &n.to_string()});\n let mut ans:i32 = 0;\n\n for c in s.chars(){\n if c == '7'{\n ans += 1;\n }\n }\n return ans;\n}\n" + }, + { + "buggy_solution": "\n let mut even = vec![];\n let mut out:Vec = vec![];\n\n for (indx,elem) in nmbs.iter().enumerate(){\n if indx%2 == 0{\n even.push(elem)\n }\n }\n even.sort();\n let mut indx_t:usize = 0;\n\n for i in 0..nmbs.len() {\n if i%2 == 0{\n if indx_t < even.len(){\n out.push(*even[indx_t]);\n indx_t += 1;\n }\n }else{\n out.push(nmbs[i]);\n }\n \n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n\n let l = s.len();\n let num = (l + 2) / 3;\n let mut output = String::new();\n for i in 0..num {\n let group = &s[i * 3..std::cmp::min(l, (i + 1) * 3)];\n // revert the cycle performed by the encode_cyclic function\n if group.len() == 3 {\n let x = format!(\"{}{}{}\", &group[2..3], &group[0..1], &group[1..2]);\n output.push_str(&x);\n } else {\n output.push_str(group);\n }\n }\n output\n}\n\npub fn encode_cyclic(s: &str) -> String {\n // returns encoded string by cycling groups of three characters.\n // split string to groups. Each of length 3.\n let l = s.len();\n let num = (l + 2) / 3;\n let mut output = String::new();\n for i in 0..num {\n let group = &s[i * 3..std::cmp::min(l, (i + 1) * 3)];\n // cycle elements in each group. Unless group has fewer elements than 3.\n if group.len() == 3 {\n let x = format!(\"{}{}{}\", &group[1..2], &group[2..3], &group[0..1]);\n output.push_str(&x);\n } else {\n output.push_str(group);\n }\n }\n output\n}\n\n" + }, + { + "buggy_solution": "\n let mut f1 = 1;\n let mut f2 = 2;\n let mut count = 0;\n while count < n {\n f1 = f1 + f2;\n let m = f1;\n f1 = f2;\n f2 = m;\n let mut isprime = true;\n for w in 2..(f1 as f32).sqrt() as i32 + 1 {\n if f1 % w == 0 {\n isprime = false;\n break;\n }\n }\n if isprime {\n count += 1;\n }\n if count == n {\n return f1;\n }\n }\n 0\n}\n" + }, + { + "buggy_solution": "\n for i in 0.. nmbs.len(){\n for j in i + 1.. nmbs.len(){\n for k in j + 1.. nmbs.len(){\n if *nmbs.get(i).unwrap() + *nmbs.get(j).unwrap() + *nmbs.get(k).unwrap() == 0{\n return true;\n }\n }\n }\n }\nreturn false;\n\n}\n" + }, + { + "buggy_solution": "\n return n*n;\n}\n" + }, + { + "buggy_solution": "\n return l.into_iter().map(|n:i32| n + 1).collect();\n}\n" + }, + { + "buggy_solution": "\n for (i, l1) in l.iter().enumerate(){\n for j in i + 1.. l.len(){\n if l1 + l[j] == 0{\n return true;\n }\n }\n }\n\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mut ret:String = \"\".to_string();\n let mut x1 = x;\n\n while x1 > 0{\n ret = (x1 % base).to_string() + &ret;\n x1 = x1 / base;\n }\n return ret;\n}\n" + }, + { + "buggy_solution": "\n return (a * h) as f64 / 2.0;\n}\n" + }, + { + "buggy_solution": "\n let mut results:Vec = vec![0, 0, 2, 0];\n\n if n < 4 {\n return *results.get(n as usize).unwrap();\n }\n\n for _ in 4.. n + 1{\n results.push(results.get(results.len()-1).unwrap() + results.get(results.len()-2).unwrap()\n + results.get(results.len()-3).unwrap() + results.get(results.len()-4).unwrap());\n results.remove(0);\n }\n\n return *results.get(results.len()-1).unwrap();\n\n \n}\n" + }, + { + "buggy_solution": "\n let mut res:Vec = l.clone();\n res.sort();\n if res.len() % 2 == 1{\n return *res.get(res.len() / 2).unwrap() as f64;\n }else{ \n return (res.get(res.len() / 2 -1).unwrap() + res.get(res.len() / 2).unwrap()) as f64/ 2.0;\n }\n}\n" + }, + { + "buggy_solution": "\n let pr: String = text.chars().rev().collect();\n return pr == text;\n}\n" + }, + { + "buggy_solution": "\n if n == 0 {\n return 1;\n } else {\n return (modp(n - 1, p) * 2) % p;\n }\n}\n" + }, + { + "buggy_solution": "\n let alphabet:Vec<&str> = vec![\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\"\n , \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"];\n let mut output = String::new();\n\n for c in s.chars() {\n let mut lower = false;\n if c.is_ascii_lowercase(){\n lower = true;\n }\n let mut c_shift:String = \"\".to_string();\n if lower {\n let index:usize = alphabet.iter().position(|&x| x == c.to_string()).unwrap();\n c_shift = alphabet[(index + 5) % 26].to_string();\n }else{\n let c_lower:String = c.to_ascii_lowercase().to_string();\n let index:usize = alphabet.iter().position(|&x| x == c_lower).unwrap();\n c_shift = alphabet[(index + 5) % 26].to_string();\n c_shift = c_shift.to_ascii_uppercase().to_string();\n \n }\n\n output.push_str(&c_shift);\n }\n output\n}\n\npub fn decode_shift(s: &str) -> String {\n let alphabet:Vec<&str> = vec![\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\"\n , \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"];\n let mut output = String::new();\n\n for c in s.chars() {\n let mut lower = false;\n if c.is_ascii_lowercase(){\n lower = true;\n }\n let mut c_shift:String = \"\".to_string();\n if lower {\n let index:usize = alphabet.iter().position(|&x| x == c.to_string()).unwrap();\n c_shift = alphabet[((26 + (index as i32 - 5)) % 26) as usize].to_string();\n }else{\n let c_lower:String = c.to_ascii_lowercase().to_string();\n let index:usize = alphabet.iter().position(|&x| x == c_lower).unwrap();\n c_shift = alphabet[((26 + (index as i32 - 5)) % 26) as usize].to_string();\n c_shift = c_shift.to_ascii_uppercase().to_string();\n \n }\n\n output.push_str(&c_shift);\n }\n output\n}\n" + }, + { + "buggy_solution": "\n let vowels = \"AEIOUaeiou\";\n let mut out = String::new();\n for c in text.chars() {\n if !vowels.contains(c) {\n out.push(c);\n }\n }\n out\n}\n" + }, + { + "buggy_solution": "\n for i in l {\n if i >= t {\n return false;\n }\n }\n return true;\n}\n" + }, + { + "buggy_solution": "\n return x + y;\n}\n" + }, + { + "buggy_solution": "\n let mut v1:Vec = str1.chars().into_iter().collect();\n v1.sort();\n v1.dedup();\n\n let mut v2:Vec = str2.chars().into_iter().collect();\n v2.sort();\n v2.dedup();\n\n return v1 == v2;\n}\n" + }, + { + "buggy_solution": "\n if n == 0{\n return 0;\n }\n if n == 1{\n return 1;\n }\n\n return fib(n-1) + fib(n-2);\n}\n" + }, + { + "buggy_solution": "\n let mut level:i32=0;\n\n for i in 0..bkts.len(){\n\n if bkts.chars().nth(i).unwrap()== '<' {level+=1;}\n \n if bkts.chars().nth(i).unwrap() == '>' { level-=1;}\n \n if level<0 {return false;} \n }\n if level!=0 {return false;}\n return true;\n}\n" + }, + { + "buggy_solution": "\n let mut l1:Vec = l.clone();\n let mut l2:Vec = l.clone();\n l2.sort(); l2.reverse();\n l1.sort();\n\n if l == l1 || l == l2 {return true}\n return false;\n\n}\n" + }, + { + "buggy_solution": "\nlet mut res:Vec = l1.into_iter().filter(|n:&i32| l2.contains(n)).collect();\nres.sort();\nreturn res;\n}\n" + }, + { + "buggy_solution": "\n let mut n1 = n.clone();\n for i in 2.. n1{\n while n1%i == 0 && n1>i{n1 = n1/i;}\n }\n return n1;\n}\n" + }, + { + "buggy_solution": "\n n*(n+1)/2\n}\n" + }, + { + "buggy_solution": "\n let mut level:i32=0;\n\n for i in 0..bkts.len(){\n\n if bkts.chars().nth(i).unwrap()== '(' {level+=1;}\n \n if bkts.chars().nth(i).unwrap() == ')' { level-=1;}\n \n if level<0 {return false;} \n }\n if level!=0 {return false;}\n return true;\n }\n" + }, + { + "buggy_solution": "\n let mut res:Vec =vec![];\n for i in 1..xs.len(){\n res.push(i as i32 * xs.get(i).unwrap());\n }\n return res;\n\n} \n" + }, + { + "buggy_solution": "\n if n == 0 || n == 1{\n return 0;\n }\n if n == 2{\n return 1;\n }\n\n return fibfib(n-1) + fibfib(n-2) + fibfib(n-3);\n\n}\n" + }, + { + "buggy_solution": "\n let vowels:&str = \"aeiouAEIOU\";\n let mut count:i32 = 0;\n\n for i in 0..s.len() {\n let c:char = s.chars().nth(i).unwrap();\n if vowels.contains(c){\n count += 1;\n } \n }\n if s.chars().nth(s.len() -1).unwrap() == 'y' || s.chars().nth(s.len() -1).unwrap() == 'Y' {count+=1;}\n\n return count;\n}\n" + }, + { + "buggy_solution": "\n let mut xcp:Vec = x.to_string().chars().into_iter().collect();\n let mut res:Vec = x.to_string().chars().into_iter().collect();\n\n for (indx,c) in xcp.iter().enumerate(){\n let despl = (indx as i32 + shift) % x.to_string().len() as i32;\n replace(&mut res[despl as usize], *c);\n }\n\n return res.into_iter().collect();\n\n}\n" + }, + { + "buggy_solution": "\n return s.chars().into_iter().filter(|c:&char| c.is_uppercase()).map(|c:char| c as i32).sum();\n}\n" + }, + { + "buggy_solution": "\n let sub:i32 = s.split_ascii_whitespace().into_iter().filter(|c| c.parse::().is_ok()).map(|c| c.parse::().unwrap()).sum();\n return n-sub;\n}\n\n" + }, + { + "buggy_solution": "\n let mut out:Vec = vec![];\n\n for i in 0.. arr.len(){\n if arr[i]%2 == 0 && (out.len() == 0 || arr[i]> = Vec::new();\n let mut max = -1;\n for i in 0..lst.len() {\n let mut has = false;\n for j in 0..freq.len() {\n if lst[i] == freq[j][0] {\n freq[j][1] += 1;\n has = true;\n if freq[j][1] >= freq[j][0] && freq[j][0] > max {\n max = freq[j][0];\n }\n }\n }\n if !has {\n freq.push(vec![lst[i], 1]);\n if max == -1 && lst[i] == 1 {\n max = 1;\n }\n }\n }\n return max;\n}\n" + }, + { + "buggy_solution": "\n let mut cp:Vec = lst.clone();\n let mut res:Vec = vec![];\n\n for (indx, _) in lst.iter().enumerate(){\n if indx%2 == 1 {\n let max:i32 = *cp.iter().max().unwrap();\n res.push(max);\n cp.remove(cp.iter().position(|x| *x == max).unwrap());\n }\n else{\n let min:i32 = *cp.iter().min().unwrap();\n res.push(min);\n cp.remove(cp.iter().position(|x| *x == min).unwrap());\n }\n }\n return res;\n}\n" + }, + { + "buggy_solution": "\n if a+b<=c || a+c<=b || b+c<=a {return -1.0;}\n let h:f64=(a+b+c) / 2.0;\n let mut area:f64;\n area = f64::powf(h*(h-a)*(h-b)*(h-c),0.5);\n return area;\n}\n" + }, + { + "buggy_solution": "\n if q.iter().sum::() > w {\n return false;\n }\n let mut i = 0;\n let mut j = q.len() - 1;\n\n while i < j {\n if q[i] != q[j] {\n return false;\n }\n i += 1;\n j -= 1;\n }\n return true;\n}\n" + }, + { + "buggy_solution": "\n let mut ans: i32 = 0;\n for i in 0..arr.len() / 2 {\n if arr[i] != arr[arr.len() - i - 1] {\n ans += 1\n }\n }\n return ans;\n}\n" + }, + { + "buggy_solution": "\n let total_1: usize = lst1\n .iter()\n .fold(0, |acc: usize, str: &&str| acc + str.chars().count());\n let total_2: usize = lst2\n .iter()\n .fold(0, |acc: usize, str: &&str| acc + str.chars().count());\n\n if total_1 <= total_2 {\n return lst1.into_iter().map(|x| x.to_string()).collect();\n } else {\n return lst2.into_iter().map(|x| x.to_string()).collect();\n }\n}\n" + }, + { + "buggy_solution": "\n let mut a1 = a;\n let mut num = 0;\n for i in 2..a {\n while a1 % i == 0 && a1 > i {\n a1 /= i;\n num += 1;\n }\n }\n if num == 2 {\n return true;\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mut p: i32 = 1;\n let mut count: i32 = 0;\n\n while p <= x && count < 100 {\n if p == x {\n return true;\n };\n p = p * n;\n count += 1;\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let a1: f64 = i32::abs(a) as f64;\n let sqrt_3 = f64::powf(a1, 1.0 / 3.0).ceil();\n\n return i32::pow(sqrt_3 as i32, 3) == a1 as i32;\n}\n\n" + }, + { + "buggy_solution": "\n let primes: Vec<&str> = vec![\"2\", \"3\", \"5\", \"7\", \"B\", \"D\"];\n let mut total: i32 = 0;\n for i in 0..num.len() {\n if primes.contains(&num.get(i..i + 1).unwrap()) {\n total += 1;\n }\n }\n return total;\n}\n" + }, + { + "buggy_solution": "\n let mut d_cp = decimal;\n let mut out: String = String::from(\"\");\n if d_cp == 0 {\n return \"db0db\".to_string();\n }\n while d_cp > 0 {\n out = (d_cp % 2).to_string() + &out;\n d_cp = d_cp / 2;\n }\n out = \"db\".to_string() + &out + &\"db\".to_string();\n return out;\n}\n" + }, + { + "buggy_solution": "\n let str: Vec = s.chars().into_iter().collect();\n if str.len() < 3 {\n return false;\n }\n for i in 2..str.len() {\n if str[i] == str[i - 1] || str[i] == str[i - 2] {\n return false;\n }\n }\n return true;\n}\n" + }, + { + "buggy_solution": "\n let mut res: Vec = vec![];\n for (i, gpa) in grades.iter().enumerate() {\n if gpa == &4.0 {\n res.push(\"A+\".to_string());\n } else if gpa > &3.7 {\n res.push(\"A\".to_string());\n } else if gpa > &3.3 {\n res.push(\"A-\".to_string());\n } else if gpa > &3.0 {\n res.push(\"B+\".to_string());\n } else if gpa > &2.7 {\n res.push(\"B\".to_string());\n } else if gpa > &2.3 {\n res.push(\"B-\".to_string());\n } else if gpa > &2.0 {\n res.push(\"C+\".to_string());\n } else if gpa > &1.7 {\n res.push(\"C\".to_string());\n } else if gpa > &1.3 {\n res.push(\"C-\".to_string());\n } else if gpa > &1.0 {\n res.push(\"D+\".to_string());\n } else if gpa > &0.7 {\n res.push(\"D\".to_string());\n } else if gpa > &0.0 {\n res.push(\"D-\".to_string());\n } else {\n res.push(\"E\".to_string());\n }\n }\n return res;\n}\n" + }, + { + "buggy_solution": "\n let l: usize = str.len();\n if l == 0 || l == 1 {\n return false;\n }\n\n for i in 2..l {\n if l % i == 0 {\n return false;\n }\n }\n return true;\n}\n" + }, + { + "buggy_solution": "\n if n == 1 {\n return 1;\n };\n return 18 * i32::pow(10, (n - 2) as u32);\n}\n" + }, + { + "buggy_solution": "\n let sum: i32 = n\n .to_string()\n .chars()\n .into_iter()\n .fold(0, |acc, c| acc + c.to_digit(10).unwrap() as i32);\n return format!(\"{sum:b}\");\n}\n" + }, + { + "buggy_solution": "\n let mut sum: i32 = 0;\n\n for (indx, elem) in lst.iter().enumerate() {\n if indx % 2 == 1 {\n if elem % 2 == 0 {\n sum += elem\n }\n }\n }\n return sum;\n}\n" + }, + { + "buggy_solution": "\n let mut res: String = String::new();\n\n for i in s.split_ascii_whitespace() {\n let mut str: Vec = i.chars().into_iter().collect();\n str.sort_by(|a, b| (*a as u32).cmp(&(*b as u32)));\n let str_sorted: String = str.into_iter().collect();\n res.push_str(&(str_sorted + &\" \".to_string()));\n }\n res = res.trim_end().to_string();\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut out: Vec> = vec![];\n for (indxi, elem1) in lst.iter().enumerate() {\n for (indxj, _) in elem1.iter().rev().enumerate() {\n if lst[indxi][indxj] == x {\n out.push(vec![indxi as i32, indxj as i32]);\n }\n }\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut res: Vec = array.clone();\n\n if array.len() == 0 {\n return res;\n }\n\n if (array[0] + array[array.len() - 1]) % 2 == 0 {\n res.sort();\n return res.into_iter().rev().collect();\n } else {\n res.sort();\n return res;\n }\n}\n" + }, + { + "buggy_solution": "\n let d: Vec = \"abcdefghijklmnopqrstuvwxyz\"\n .to_string()\n .chars()\n .into_iter()\n .collect();\n let mut out: String = String::new();\n for c in s.chars() {\n if d.contains(&c) {\n let indx: usize = (d.iter().position(|x| c == *x).unwrap() + 2 * 2) % 26;\n out += &d[indx].to_string();\n } else {\n out += &c.to_string();\n }\n }\n\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut res = 0;\n let mut lst_cp = lst.clone();\n let mut first: i32 = 0;\n let mut second: i32 = 0;\n\n if lst.iter().min() == None {\n res = -1;\n } else {\n if lst.iter().min() != None {\n first = *lst.iter().min().unwrap();\n let indx = lst.iter().position(|x| *x == first).unwrap();\n lst_cp.remove(indx);\n\n if lst_cp.iter().min() != None {\n second = *lst_cp.iter().min().unwrap();\n }\n if first != second {\n res = second;\n } else {\n res = -1;\n }\n }\n }\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut count = 0;\n let regex = Regex::new(r\"[.?!]\\s*\").expect(\"Invalid regex\");\n let sqn: Vec<&str> = regex.split(s).into_iter().collect();\n for s in sqn {\n if s.starts_with(\"I \") {\n count += 1;\n }\n }\n return count;\n}\n" + }, + { + "buggy_solution": "\n if a.fract() == 0.0 && b.fract() == 0.0 && c.fract() == 0.0 {\n return a + b == c || a + c == b || b + c == a;\n } else {\n return false;\n }\n}\n" + }, + { + "buggy_solution": "\n let mut res: String = String::new();\n let v: Vec = \"aeiouAEIOU\".to_string().chars().into_iter().collect();\n let d: Vec = \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n .to_string()\n .chars()\n .into_iter()\n .collect();\n\n for (indx, elem) in message.chars().into_iter().enumerate() {\n let mut c = elem.to_string();\n\n if v.contains(&elem) {\n let indx: usize = d.iter().position(|x| &elem == x).unwrap();\n c = d[indx + 2 as usize].to_string();\n }\n\n if elem.is_uppercase() {\n c = c.to_lowercase().to_string();\n } else {\n c = c.to_uppercase().to_string();\n }\n res.push_str(&c);\n }\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut largest = 0;\n for i in 0..lst.len() {\n if lst[i] > largest {\n let mut prime = true;\n let mut j = 2;\n while j * j <= lst[i] {\n if lst[i] % j == 0 {\n prime = false;\n }\n j += 1;\n }\n\n if prime {\n largest = lst[i];\n }\n }\n }\n let mut sum: i32 = 0;\n let mut s: String = String::new();\n s = largest.to_string();\n\n for n in s.chars().into_iter() {\n sum += n.to_digit(10).unwrap() as i32;\n }\n return sum;\n}\n" + }, + { + "buggy_solution": "\n if dict.is_empty() {\n return false;\n }\n let string_lower: fn(str: &str) -> bool = |str: &str| {\n return str.chars().into_iter().all(|c| c.is_ascii_lowercase());\n };\n let string_upper: fn(str: &str) -> bool = |str: &str| {\n return str.chars().into_iter().all(|c| c.is_ascii_uppercase());\n };\n\n let lower: bool = dict.keys().into_iter().all(|str| string_lower(str));\n let upper: bool = dict.keys().into_iter().all(|str| string_upper(str));\n return lower || upper;\n}\n" + }, + { + "buggy_solution": "\n let mut primes: Vec = vec![];\n\n for i in 2..n {\n let mut is_prime: bool = true;\n\n for j in 2..i {\n if i % j == 0 {\n is_prime = false;\n break;\n }\n }\n if is_prime {\n primes.push(i);\n }\n }\n return primes;\n}\n" + }, + { + "buggy_solution": "\n return (i32::abs(a) % 10) * (i32::abs(b) % 10);\n}\n" + }, + { + "buggy_solution": "\n let uvowel: &str = \"AEIOU\";\n let mut count: i32 = 0;\n\n for (indx, elem) in s.chars().into_iter().enumerate() {\n if indx % 2 == 0 {\n if uvowel.contains(elem) {\n count += 1;\n }\n }\n }\n return count;\n}\n" + }, + { + "buggy_solution": "\n return value.parse::().unwrap().round() as i32;\n}\n" + }, + { + "buggy_solution": "\n let mut out: Vec = vec![n];\n\n for i in 1..n {\n out.push(out[out.len() - 1] + 2);\n }\n\n return out;\n}\n" + }, + { + "buggy_solution": "\n return s\n .to_string()\n .split(|c: char| c == ',' || c.is_whitespace())\n .into_iter()\n .filter(|x| x != &\"\")\n .map(|x| x.to_string())\n .collect();\n}\n" + }, + { + "buggy_solution": "\n if y < x {\n return -1;\n }\n if y == x && y % 2 == 1 {\n return -1;\n }\n if y % 2 == 1 {\n return y - 1;\n }\n return y;\n}\n" + }, + { + "buggy_solution": "\n if n > m {\n return \"-1\".to_string();\n };\n let mut num: i32 = (m + n) / 2;\n let mut out: String = String::from(\"\");\n while num > 0 {\n out = (num % 2).to_string() + &out;\n num = num / 2;\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut res: Vec = vec![];\n for (_, elem) in x.into_iter().enumerate() {\n let mut elem_cp: i32 = elem;\n let mut u: bool = true;\n if elem == 0 {\n u = false;\n }\n while elem_cp > 0 && u {\n if elem_cp % 2 == 0 {\n u = false;\n }\n elem_cp = elem_cp / 10;\n }\n if u {\n res.push(elem)\n };\n }\n res.sort();\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut res: Vec = vec![];\n let mut arr_cp: Vec = arr.clone();\n arr_cp.sort();\n arr_cp.reverse();\n let map: HashMap = HashMap::from([\n (0, \"Zero\"),\n (1, \"One\"),\n (2, \"Two\"),\n (3, \"Three\"),\n (4, \"Four\"),\n (5, \"Five\"),\n (6, \"Six\"),\n (7, \"Seven\"),\n (8, \"Eight\"),\n (9, \"Nine\"),\n ]);\n\n for elem in arr_cp {\n if elem >= 1 && elem <= 9 {\n res.push(map.get(&elem).unwrap().to_string());\n }\n }\n\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut sum: i32 = 0;\n let mut prod: i32 = 1;\n let mut out: Vec = vec![];\n\n for i in 1..n + 1 {\n sum += i;\n prod *= i;\n\n if i % 2 == 0 {\n out.push(prod);\n } else {\n out.push(sum)\n };\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut even = 0;\n let mut odd = 0;\n\n for i in 1..n + 1 {\n let mut w: String = i.to_string();\n let mut p: String = w.chars().rev().collect();\n\n if w == p && i % 2 == 1 {\n odd += 1;\n }\n if w == p && i % 2 == 0 {\n even += 1;\n }\n }\n (even, odd)\n}\n" + }, + { + "buggy_solution": "\n let mut num: i32 = 0;\n\n for nmbr in n {\n if nmbr > 0 {\n num += 1;\n } else {\n let mut sum: i32 = 0;\n let mut w: i32;\n w = i32::abs(nmbr);\n\n while w >= 10 {\n sum += w % 10;\n w = w / 10;\n }\n sum -= w;\n if sum > 0 {\n num += 1;\n }\n }\n }\n return num;\n}\n" + }, + { + "buggy_solution": "\n let mut num = 0;\n if arr.len() == 0 {\n return true;\n }\n for i in 1..arr.len() {\n if arr[i] < arr[i - 1] {\n num += 1;\n }\n }\n if arr[arr.len() - 1] > arr[0] {\n num += 1;\n }\n if num < 2 {\n return true;\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mut num = 0;\n for i in 0..lst1.len() {\n if lst1[i] % 2 == 0 {\n num += 1;\n }\n }\n for i in 0..lst2.len() {\n if lst2[i] % 2 == 0 {\n num += 1;\n }\n }\n if num >= lst1.len() {\n return \"YES\".to_string();\n }\n return \"NO\".to_string();\n}\n" + }, + { + "buggy_solution": "\n let mut res: HashMap = HashMap::new();\n if test == \"\" {\n return res;\n }\n for c in test.split_ascii_whitespace() {\n if res.contains_key(&c.chars().next().unwrap()) {\n res.entry(c.chars().next().unwrap()).and_modify(|n| {\n *n += 1;\n });\n } else {\n res.insert(c.chars().next().unwrap(), 1);\n }\n }\n let max: i32 = *res.values().max().unwrap();\n let non_maxs: Vec = res\n .keys()\n .filter(|k: &&char| *res.get(k).unwrap() != max)\n .map(|c| *c)\n .collect();\n non_maxs.iter().for_each(|c| {\n res.remove(c);\n });\n\n return res;\n}\n" + }, + { + "buggy_solution": "\n let mut n = String::new();\n for i in 0..s.len() {\n if !c.contains(s.chars().nth(i).unwrap()) {\n n.push(s.chars().nth(i).unwrap());\n }\n }\n if n.len() == 0 {\n return vec![n, \"True\".to_string()];\n }\n let w: String = n.chars().rev().collect();\n if w == n {\n return vec![n, \"True\".to_string()];\n }\n return vec![n, \"False\".to_string()];\n}\n" + }, + { + "buggy_solution": "\n let mut out: Vec = Vec::new();\n for i in 0..lst.len() {\n let mut sum = 0;\n for j in 0..lst[i].len() {\n if lst[i].chars().nth(j).unwrap() >= '0'\n && lst[i].chars().nth(j).unwrap() <= '9'\n && lst[i].chars().nth(j).unwrap().to_digit(10).unwrap() % 2 == 1\n {\n sum += 1;\n }\n }\n let mut s = \"the number of odd elements in the string i of the input.\".to_string();\n let mut s2 = \"\".to_string();\n for j in 0..s.len() {\n if s.chars().nth(j).unwrap() == 'i' {\n s2.push_str(&sum.to_string());\n } else {\n s2.push(s.chars().nth(j).unwrap());\n }\n }\n out.push(s2);\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut current = nums[0];\n let mut min = nums[0];\n for i in 1..nums.len() {\n if current < 0 {\n current = current + nums[i];\n } else {\n current = nums[i];\n }\n if current < min {\n min = current;\n }\n }\n min\n}\n" + }, + { + "buggy_solution": "\n let mut out: i32 = 0;\n\n for i in 0..grid.len() {\n let mut sum: i32 = 0;\n\n for j in 0..grid[i].len() {\n sum += grid[i][j];\n }\n if sum > 0 {\n out += (sum - 1) / capacity + 1;\n }\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut arr_cp = arr.clone();\n let mut bin = vec![];\n let mut m;\n\n for i in 0..arr_cp.len() {\n let mut b = 0;\n let mut n = arr_cp[i].abs();\n while n > 0 {\n b += n % 2;\n n = n / 2;\n }\n bin.push(b);\n }\n for i in 0..arr_cp.len() {\n for j in 1..arr_cp.len() {\n if bin[j] < bin[j - 1] || (bin[j] == bin[j - 1] && arr_cp[j] < arr_cp[j - 1]) {\n m = arr_cp[j];\n arr_cp[j] = arr_cp[j - 1];\n arr_cp[j - 1] = m;\n m = bin[j];\n bin[j] = bin[j - 1];\n bin[j - 1] = m;\n }\n }\n }\n return arr_cp;\n}\n" + }, + { + "buggy_solution": "\n let vowels = \"aeiouAEIOU\";\n let mut current = String::new();\n let mut out = Vec::new();\n let mut numc = 0;\n let mut s = s.to_string();\n s.push(' ');\n for i in 0..s.len() {\n if s.chars().nth(i).unwrap() == ' ' {\n if numc == n {\n out.push(current);\n }\n current = String::new();\n numc = 0;\n } else {\n current.push(s.chars().nth(i).unwrap());\n if (s.chars().nth(i).unwrap() >= 'A' && s.chars().nth(i).unwrap() <= 'Z')\n || (s.chars().nth(i).unwrap() >= 'a' && s.chars().nth(i).unwrap() <= 'z')\n {\n if !vowels.contains(s.chars().nth(i).unwrap()) {\n numc += 1;\n }\n }\n }\n }\n out\n}\n" + }, + { + "buggy_solution": "\n let vowels = \"AEIOUaeiou\";\n let mut out = \"\".to_string();\n for i in (1..word.len() - 1).rev() {\n if vowels.contains(word.chars().nth(i).unwrap()) {\n if !vowels.contains(word.chars().nth(i + 1).unwrap()) {\n if !vowels.contains(word.chars().nth(i - 1).unwrap()) {\n out.push(word.chars().nth(i).unwrap());\n return out;\n }\n }\n }\n }\n out\n}\n" + }, + { + "buggy_solution": "\n let l1 = lst[0].to_string() + lst[1];\n let mut count = 0;\n let mut can = true;\n for i in 0..l1.len() {\n if l1.chars().nth(i).unwrap() == '(' {\n count += 1;\n }\n if l1.chars().nth(i).unwrap() == ')' {\n count -= 1;\n }\n if count < 0 {\n can = false;\n }\n }\n if count != 0 {\n return \"No\";\n }\n if can == true {\n return \"Yes\";\n }\n let l1 = lst[1].to_string() + lst[0];\n let mut can = true;\n for i in 0..l1.len() {\n if l1.chars().nth(i).unwrap() == '(' {\n count += 1;\n }\n if l1.chars().nth(i).unwrap() == ')' {\n count -= 1;\n }\n if count < 0 {\n can = false;\n }\n }\n if can == true {\n return \"Yes\";\n }\n return \"No\";\n}\n" + }, + { + "buggy_solution": "\n let mut arr = arr;\n arr.sort();\n let mut arr_res: Vec = arr.iter().rev().take(k as usize).cloned().collect();\n arr_res.sort();\n return arr_res;\n}\n" + }, + { + "buggy_solution": "\n let mut sum = 0;\n for (indx, elem) in lst.iter().enumerate() {\n if indx % 2 == 0 {\n if elem % 2 == 1 {\n sum += elem;\n }\n }\n }\n return sum;\n}\n" + }, + { + "buggy_solution": "\n let mut sum = 0;\n for i in 0..k {\n if arr[i as usize] >= -99 && arr[i as usize] <= 99 {\n sum += arr[i as usize];\n }\n }\n sum\n}\n" + }, + { + "buggy_solution": "\n let mut out = vec![1];\n let mut n = n;\n while n != 1 {\n if n % 2 == 1 {\n out.push(n);\n n = n * 3 + 1;\n } else {\n n = n / 2;\n }\n }\n out.sort();\n out\n}\n\n" + }, + { + "buggy_solution": "\n let mut mm = 0;\n let mut dd = 0;\n let mut yy = 0;\n let mut i = 0;\n if date.len() != 10 {\n return false;\n }\n for i in 0..10 {\n if i == 2 || i == 5 {\n if date.chars().nth(i).unwrap() != '-' {\n return false;\n }\n } else if date.chars().nth(i).unwrap() < '0' || date.chars().nth(i).unwrap() > '9' {\n return false;\n }\n }\n mm = date[0..2].parse::().unwrap();\n dd = date[3..5].parse::().unwrap();\n yy = date[6..10].parse::().unwrap();\n if mm < 1 || mm > 12 {\n return false;\n }\n if dd < 1 || dd > 31 {\n return false;\n }\n if dd == 31 && (mm == 4 || mm == 6 || mm == 9 || mm == 11 || mm == 2) {\n return false;\n }\n if dd == 30 && mm == 2 {\n return false;\n }\n return true;\n}\n" + }, + { + "buggy_solution": "\n let mut out: Vec = Vec::new();\n let alphabet: HashMap = HashMap::from([\n ('a', 0),\n ('b', 1),\n ('c', 2),\n ('d', 3),\n ('e', 4),\n ('f', 5),\n ('g', 6),\n ('h', 7),\n ('i', 8),\n ('j', 9),\n ('k', 10),\n ('l', 11),\n ('m', 12),\n ('n', 13),\n ('o', 14),\n ('p', 15),\n ('q', 16),\n ('r', 17),\n ('s', 18),\n ('t', 19),\n ('u', 20),\n ('v', 21),\n ('w', 22),\n ('x', 23),\n ('y', 24),\n ('z', 25),\n ]);\n\n if txt.contains(' ') {\n out = txt\n .split_whitespace()\n .into_iter()\n .map(|c| c.to_string())\n .collect();\n } else if txt.contains(',') {\n out = txt.split(',').into_iter().map(|c| c.to_string()).collect();\n } else {\n let count = txt\n .chars()\n .into_iter()\n .filter(|c| c.is_ascii_lowercase())\n .filter(|c| alphabet.get(c).unwrap() % 2 == 1)\n .count();\n out.push(count.to_string());\n }\n\n return out;\n}\n" + }, + { + "buggy_solution": "\n for i in 1..lst.len() {\n if lst[i] < lst[i - 1] {\n return false;\n }\n if i >= 2 && lst[i] == lst[i - 1] && lst[i] == lst[i - 2] {\n return false;\n }\n }\n true\n}\n" + }, + { + "buggy_solution": "\n let inter1 = std::cmp::max(interval1[0], interval2[0]);\n let inter2 = std::cmp::min(interval1[1], interval2[1]);\n let l = inter2 - inter1;\n if l < 2 {\n return \"NO\".to_string();\n }\n for i in 2..l {\n if l % i == 0 {\n return \"NO\".to_string();\n }\n }\n return \"YES\".to_string();\n}\n" + }, + { + "buggy_solution": "\n if arr.is_empty() {\n return -32768;\n }\n let mut sum = 0;\n let mut prods = 1;\n for i in arr {\n sum += i.abs();\n if i == 0 {\n prods = 0;\n }\n if i < 0 {\n prods = -prods;\n }\n }\n sum * prods\n}\n\n" + }, + { + "buggy_solution": "\n let mut out: Vec = vec![];\n let mut x = 0;\n let mut y = 0;\n let mut min: i32 = (grid.len() * grid.len()) as i32;\n for i in 0..grid.len() {\n for j in 0..grid[i].len() {\n if grid[i][j] == 1 {\n x = i;\n y = j;\n }\n }\n }\n if x > 0 && grid[x - 1][y] < min {\n min = grid[x - 1][y];\n }\n if x < grid.len() - 1 && grid[x + 1][y] < min {\n min = grid[x + 1][y];\n }\n if y > 0 && grid[x][y - 1] < min {\n min = grid[x][y - 1];\n }\n if y < grid.len() - 1 && grid[x][y + 1] < min {\n min = grid[x][y + 1];\n }\n let mut out = vec![];\n for i in 0..k {\n if i % 2 == 0 {\n out.push(1);\n } else {\n out.push(min);\n }\n }\n out\n}\n" + }, + { + "buggy_solution": "\n let mut out = vec![1, 3];\n if n == 0 {\n return vec![1];\n }\n for i in 2..=n {\n if i % 2 == 0 {\n out.push(1 + i / 2);\n } else {\n out.push(out[(i - 1) as usize] + out[(i - 2) as usize] + 1 + (i + 1) / 2);\n }\n }\n out\n}\n" + }, + { + "buggy_solution": "\n let mut prod: i32 = 1;\n let mut has = 0;\n let s = n.to_string();\n for i in 0..s.len() {\n if s.chars().nth(i).unwrap().to_digit(10).unwrap() % 2 == 1 {\n has = 1;\n prod = prod * (s.chars().nth(i).unwrap().to_digit(10).unwrap()) as i32;\n }\n }\n if has == 0 {\n return 0;\n }\n prod\n}\n" + }, + { + "buggy_solution": "\n let mut count = 0;\n let mut maxcount = 0;\n for i in 0..str.len() {\n if str.chars().nth(i).unwrap() == '[' {\n count += 1;\n }\n if str.chars().nth(i).unwrap() == ']' {\n count -= 1;\n }\n if count < 0 {\n count = 0;\n }\n if count > maxcount {\n maxcount = count;\n }\n if count <= maxcount - 2 {\n return true;\n }\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mut sum: f32 = 0.0;\n for i in 0..lst.len() {\n sum = sum + (lst[i].ceil() * lst[i].ceil());\n }\n sum as i32\n}\n" + }, + { + "buggy_solution": "\n if txt.len() == 0 {\n return false;\n }\n let chr = txt.chars().last().unwrap();\n if chr < 'A' || (chr > 'Z' && chr < 'a') || chr > 'z' {\n return false;\n }\n if txt.len() == 1 {\n return true;\n }\n let chr = txt.chars().nth(txt.len() - 2).unwrap();\n if (chr >= 'A' && chr <= 'Z') || (chr >= 'a' && chr <= 'z') {\n return false;\n }\n true\n}\n" + }, + { + "buggy_solution": "\n let mut max: i32 = -1;\n for i in 0..arr.len() {\n if arr[i] <= i as i32 {\n max = i as i32;\n }\n }\n max\n}\n\n" + }, + { + "buggy_solution": "\n let mut maxneg = 0;\n let mut minpos = 0;\n for i in 0..lst.len() {\n if lst[i] < 0 && (maxneg == 0 || lst[i] > maxneg) {\n maxneg = lst[i];\n }\n if lst[i] > 0 && (minpos == 0 || lst[i] < minpos) {\n minpos = lst[i];\n }\n }\n vec![maxneg, minpos]\n}\n" + }, + { + "buggy_solution": "\n let a_f64 = Any_to_f64(a);\n let b_f64 = Any_to_f64(b);\n\n if a_f64 > b_f64 {\n return original_type(a);\n }\n\n if a_f64 < b_f64 {\n return original_type(b);\n } else {\n return RtnType::String(\"None\".to_string());\n }\n}\n\n#[derive(Debug, PartialEq)]\npub enum RtnType {\n Empty(),\n String(S),\n Float(F),\n Int(I),\n}\n\nfn Any_to_f64(a: &dyn Any) -> f64 {\n let mut a_f64 = 0.0;\n\n if a.downcast_ref::() == None {\n match a.downcast_ref::<&str>() {\n Some(as_string) => {\n a_f64 = as_string.parse::().unwrap();\n }\n None => {}\n }\n\n match a.downcast_ref::() {\n Some(as_i32) => {\n a_f64 = *as_i32 as f64;\n }\n None => {}\n }\n } else {\n a_f64 = *a.downcast_ref::().unwrap();\n }\n\n return a_f64;\n}\n\nfn original_type(a: &dyn Any) -> RtnType {\n let mut res = RtnType::Empty();\n match a.downcast_ref::<&str>() {\n Some(as_string) => {\n res = RtnType::String(as_string.parse::().unwrap());\n }\n None => {}\n }\n\n match a.downcast_ref::() {\n Some(as_i32) => {\n res = RtnType::Int(*as_i32);\n }\n None => {}\n }\n\n match a.downcast_ref::() {\n Some(as_f64) => res = RtnType::Float(*as_f64),\n None => {}\n }\n return res;\n}\n" + }, + { + "buggy_solution": "\n if n % 2 == 0 && n >= 8 {\n return true;\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mut fact = 1;\n let mut bfact: i64 = 1;\n for i in 1..=n {\n fact = fact * i;\n bfact = bfact * fact as i64;\n }\n bfact\n}\n" + }, + { + "buggy_solution": "\n let mut out = String::new();\n let mut spacelen = 0;\n for c in text.chars() {\n if c == ' ' {\n spacelen += 1;\n } else {\n if spacelen == 1 {\n out.push('_');\n }\n if spacelen == 2 {\n out.push_str(\"__\");\n }\n if spacelen > 2 {\n out.push('-');\n }\n spacelen = 0;\n out.push(c);\n }\n }\n if spacelen == 1 {\n out.push('_');\n }\n if spacelen == 2 {\n out.push_str(\"__\");\n }\n if spacelen > 2 {\n out.push('-');\n }\n out\n}\n" + }, + { + "buggy_solution": "\n let mut numdigit = 0;\n let mut numdot = 0;\n if file_name.len() < 5 {\n return \"No\";\n }\n let w = file_name.chars().nth(0).unwrap();\n if w < 'A' || (w > 'Z' && w < 'a') || w > 'z' {\n return \"No\";\n }\n let last = &file_name[file_name.len() - 4..];\n if last != \".txt\" && last != \".exe\" && last != \".dll\" {\n return \"No\";\n }\n for c in file_name.chars() {\n if c >= '0' && c <= '9' {\n numdigit += 1;\n }\n if c == '.' {\n numdot += 1;\n }\n }\n if numdigit > 3 || numdot != 1 {\n return \"No\";\n }\n return \"Yes\";\n}\n" + }, + { + "buggy_solution": "\n let mut sum = 0;\n for i in 0..lst.len() {\n if i % 3 == 0 {\n sum += lst[i] * lst[i];\n } else if i % 4 == 0 {\n sum += lst[i] * lst[i] * lst[i];\n } else {\n sum += lst[i];\n }\n }\n return sum;\n}\n" + }, + { + "buggy_solution": "\n let mut out = String::new();\n let mut current = String::new();\n let mut sentence = sentence.to_string();\n sentence.push(' ');\n\n for i in 0..sentence.len() {\n if sentence.chars().nth(i).unwrap() != ' ' {\n current.push(sentence.chars().nth(i).unwrap());\n } else {\n let mut isp = true;\n let l = current.len();\n if l < 2 {\n isp = false;\n }\n for j in 2..(l as f64).sqrt() as usize + 1 {\n if l % j == 0 {\n isp = false;\n }\n }\n if isp {\n out.push_str(¤t);\n out.push(' ');\n }\n current = String::new();\n }\n }\n if out.len() > 0 {\n out.pop();\n }\n out\n}\n" + }, + { + "buggy_solution": "\n let mut a = 0;\n let mut b = 0;\n let mut c = 0;\n let mut d = 0;\n let mut i = 0;\n for i in 0..x.len() {\n if x.chars().nth(i).unwrap() == '/' {\n a = x\n .chars()\n .take(i)\n .collect::()\n .parse::()\n .unwrap();\n b = x\n .chars()\n .skip(i + 1)\n .collect::()\n .parse::()\n .unwrap();\n }\n }\n for i in 0..n.len() {\n if n.chars().nth(i).unwrap() == '/' {\n c = n\n .chars()\n .take(i)\n .collect::()\n .parse::()\n .unwrap();\n d = n\n .chars()\n .skip(i + 1)\n .collect::()\n .parse::()\n .unwrap();\n }\n }\n if (a * c) % (b * d) == 0 {\n return true;\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mut result = arr.clone();\n result.sort_by_key(|&x| (sum_of_digits(x)));\n result\n}\n\npub fn sum_of_digits(n: i32) -> i32 {\n let mut sum = 0;\n let mut n = n;\n if n < 0 {\n let right = n / 10;\n let mut left;\n\n if right != 0 {\n left = n % 10;\n left = -1 * left;\n } else {\n left = n % 10;\n }\n sum = right + left;\n return sum;\n }\n\n while n > 0 {\n sum += n % 10;\n n /= 10;\n }\n sum\n}\n" + }, + { + "buggy_solution": "\n let mut num = 0;\n for i in 0..nums.len() {\n if nums[i] > 10 {\n let w = nums[i].to_string();\n if w.chars().nth(0).unwrap().to_digit(10).unwrap() % 2 == 1\n && w.chars().last().unwrap().to_digit(10).unwrap() % 2 == 1\n {\n num += 1;\n }\n }\n }\n num\n}\n" + }, + { + "buggy_solution": "\n let mut a = vec![];\n let mut sum = vec![vec![0, 0, 0]];\n let mut sum2 = vec![vec![0, 0, 0]];\n\n for i in 1..=n {\n a.push((i * i - i + 1) % 3);\n sum.push(sum[sum.len() - 1].clone());\n sum[i as usize][a[i as usize - 1] as usize] += 1;\n }\n\n for times in 1..3 {\n for i in 1..=n {\n sum2.push(sum2[sum2.len() - 1].clone());\n if i >= 1 {\n for j in 0..=2 {\n sum2[i as usize][(a[i as usize - 1] + j) as usize % 3] +=\n sum[i as usize - 1][j as usize];\n }\n }\n }\n sum = sum2.clone();\n sum2 = vec![vec![0, 0, 0]];\n }\n\n return sum[n as usize][0];\n}\n" + }, + { + "buggy_solution": "\n let planets = vec![\n \"Mercury\", \"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\", \"Uranus\", \"Neptune\",\n ];\n let mut pos1: i32 = -1;\n let mut pos2: i32 = -1;\n let mut m;\n for m in 0..planets.len() {\n if planets[m] == planet1 {\n pos1 = m as i32;\n }\n if planets[m] == planet2 {\n pos2 = m as i32;\n }\n }\n if pos1 == -1 || pos2 == -1 {\n return vec![];\n }\n if pos1 > pos2 {\n m = pos1;\n pos1 = pos2;\n pos2 = m;\n }\n let mut out = vec![];\n for m in pos1 + 1..pos2 {\n out.push(planets[m as usize].to_string());\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut out: Vec<&str> = Vec::new();\n for i in 0..lst.len() {\n if lst[i].len() % 2 == 0 {\n out.push(lst[i]);\n }\n }\n out.sort();\n for i in 0..out.len() {\n for j in 1..out.len() {\n if out[j].len() < out[j - 1].len() {\n let mid = out[j];\n out[j] = out[j - 1];\n out[j - 1] = mid;\n }\n }\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut isp = true;\n if n < 2 {\n isp = false;\n }\n for i in 2..=n / 2 {\n if n % i == 0 {\n isp = false;\n }\n }\n if isp {\n return x;\n }\n return y;\n}\n" + }, + { + "buggy_solution": "\n let mut sum: i64 = 0;\n for i in 0..lst.len() {\n if (lst[i] - lst[i].round()).abs() < 1e-4 {\n if lst[i] > 0.0 && (lst[i].round() as i64) % 2 == 1 {\n sum += (lst[i].round() as i64) * (lst[i].round() as i64);\n }\n }\n }\n return sum;\n}\n" + }, + { + "buggy_solution": "\n let mut out: Vec = Vec::new();\n for i in 0..game.len() {\n out.push(i32::abs(game[i] - guess[i]));\n }\n return out;\n}\n" + }, + { + "buggy_solution": "\n let mut strongest = \"\";\n let mut max = -1000;\n for i in 0..extensions.len() {\n let mut strength = 0;\n for j in 0..extensions[i].len() {\n let chr = extensions[i].chars().nth(j).unwrap();\n if chr >= 'A' && chr <= 'Z' {\n strength += 1;\n }\n if chr >= 'a' && chr <= 'z' {\n strength -= 1;\n }\n }\n if strength > max {\n max = strength;\n strongest = extensions[i];\n }\n }\n format!(\"{}.{}\", class_name, strongest)\n}\n" + }, + { + "buggy_solution": "\n for i in 0..b.len() {\n let rotate = format!(\"{}{}\", &b[i..], &b[..i]);\n if a.contains(&rotate) {\n return true;\n }\n }\n false\n}\n\n" + }, + { + "buggy_solution": "\n let w = num.abs().to_string();\n let mut n1 = 0;\n let mut n2 = 0;\n for i in 0..w.len() {\n if w.chars().nth(i).unwrap().to_digit(10).unwrap() % 2 == 1 {\n n1 += 1;\n } else {\n n2 += 1;\n }\n }\n vec![n2, n1]\n}\n" + }, + { + "buggy_solution": "\n let mut current = String::new();\n let mut number = number;\n let rep = vec![\n \"m\", \"cm\", \"d\", \"cd\", \"c\", \"xc\", \"l\", \"xl\", \"x\", \"ix\", \"v\", \"iv\", \"i\",\n ];\n let num = vec![1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\n let mut pos = 0;\n while number > 0 {\n while number >= num[pos] {\n current.push_str(rep[pos]);\n number -= num[pos];\n }\n if number > 0 {\n pos += 1;\n }\n }\n current\n}\n" + }, + { + "buggy_solution": "\n if (a * a + b * b - c * c).abs() < 1e-4\n || (a * a + c * c - b * b).abs() < 1e-4\n || (b * b + c * c - a * a).abs() < 1e-4\n {\n return true;\n }\n return false;\n}\n" + }, + { + "buggy_solution": "\n let mut max = \"\";\n let mut maxu = 0;\n for i in 0..words.len() {\n let mut unique = String::from(\"\");\n for j in 0..words[i].len() {\n if !unique.contains(words[i].chars().nth(j).unwrap()) {\n unique.push(words[i].chars().nth(j).unwrap());\n }\n }\n if unique.len() > maxu || (unique.len() == maxu && words[i] < max) {\n max = words[i];\n maxu = unique.len();\n }\n }\n max\n}\n" + }, + { + "buggy_solution": "\n if need > remaining {\n return vec![number + remaining, 0];\n }\n return vec![number + need, remaining - need];\n}\n" + }, + { + "buggy_solution": "\n let mut operand: Vec = operand;\n let mut num: Vec = vec![];\n let mut posto: Vec = vec![];\n for i in 0..operand.len() {\n posto.push(i as i32);\n }\n for i in 0..operato.len() {\n if operato[i] == \"**\" {\n while posto[posto[i] as usize] != posto[i] {\n posto[i] = posto[posto[i] as usize];\n }\n while posto[posto[i + 1] as usize] != posto[i + 1] {\n posto[i + 1] = posto[posto[i + 1] as usize];\n }\n operand[posto[i] as usize] =\n operand[posto[i] as usize].pow(operand[posto[i + 1] as usize] as u32);\n posto[i + 1] = posto[i];\n }\n }\n for i in 0..operato.len() {\n if operato[i] == \"*\" || operato[i] == \"//\" {\n while posto[posto[i] as usize] != posto[i] {\n posto[i] = posto[posto[i] as usize];\n }\n while posto[posto[i + 1] as usize] != posto[i + 1] {\n posto[i + 1] = posto[posto[i + 1] as usize];\n }\n if operato[i] == \"*\" {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] * operand[posto[i + 1] as usize];\n } else {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] / operand[posto[i + 1] as usize];\n }\n posto[i + 1] = posto[i];\n }\n }\n for i in 0..operato.len() {\n if operato[i] == \"+\" || operato[i] == \"-\" {\n while posto[posto[i] as usize] != posto[i] {\n posto[i] = posto[posto[i] as usize];\n }\n while posto[posto[i + 1] as usize] != posto[i + 1] {\n posto[i + 1] = posto[posto[i + 1] as usize];\n }\n if operato[i] == \"+\" {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] + operand[posto[i + 1] as usize];\n } else {\n operand[posto[i] as usize] =\n operand[posto[i] as usize] - operand[posto[i + 1] as usize];\n }\n posto[i + 1] = posto[i];\n }\n }\n operand[0]\n}\n" + }, + { + "buggy_solution": "\n let mut nletter = 0;\n let mut out = String::new();\n for c in s.chars() {\n let mut w = c;\n if w >= 'A' && w <= 'Z' {\n w = w.to_ascii_lowercase();\n } else if w >= 'a' && w <= 'z' {\n w = w.to_ascii_uppercase();\n } else {\n nletter += 1;\n }\n out.push(w);\n }\n if nletter == s.len() {\n out.chars().rev().collect()\n } else {\n out\n }\n}\n" + }, + { + "buggy_solution": "\n if text.is_empty() {\n return \"None\".to_string();\n }\n\n let digest = md5::compute(text.as_bytes());\n return format!(\"{:x}\", digest);\n}\n" + }, + { + "buggy_solution": "\n let mut a = a;\n let mut b = b;\n let mut m;\n\n if b < a {\n m = a;\n a = b;\n b = m;\n }\n\n let mut out = vec![];\n for i in a..=b {\n if i < 10 && i % 2 == 0 {\n out.push(i);\n }\n }\n out\n}\n" + } +] \ No newline at end of file