Datasets:
Tasks:
Text Generation
Modalities:
Text
Formats:
json
Languages:
English
Size:
< 1K
ArXiv:
Tags:
competitive-programming
code-generation
specification-generation
proof-generation
verification
rust
License:
| use vstd::prelude::*; | |
| fn main() {} | |
| verus! { | |
| pub struct Solution; | |
| impl Solution { | |
| pub open spec fn count(s: Seq<i32>, v: i32) -> int | |
| decreases s.len(), | |
| { | |
| if s.len() == 0 { | |
| 0 | |
| } else { | |
| (if s.last() == v { 1int } else { 0int }) + Self::count(s.drop_last(), v) | |
| } | |
| } | |
| pub fn can_be_equal(target: Vec<i32>, arr: Vec<i32>) -> (res: bool) | |
| requires | |
| target.len() == arr.len(), | |
| 1 <= target.len() <= 1000, | |
| forall |i: int| 0 <= i < target.len() ==> 1 <= target[i] <= 1000, | |
| forall |i: int| 0 <= i < arr.len() ==> 1 <= arr[i] <= 1000, | |
| ensures | |
| res == (forall |v: i32| Self::count(target@, v) == Self::count(arr@, v)), | |
| { | |
| let n = target.len(); | |
| let mut counts: Vec<i32> = Vec::new(); | |
| let mut k: usize = 0; | |
| while k < 1001 { | |
| counts.push(0i32); | |
| k = k + 1; | |
| } | |
| let mut i: usize = 0; | |
| while i < n { | |
| let tv = target[i]; | |
| let av = arr[i]; | |
| counts.set(tv as usize, counts[tv as usize] + 1); | |
| counts.set(av as usize, counts[av as usize] - 1); | |
| i = i + 1; | |
| } | |
| let mut k2: usize = 0; | |
| while k2 < 1001 { | |
| if counts[k2] != 0 { | |
| return false; | |
| } | |
| k2 = k2 + 1; | |
| } | |
| true | |
| } | |
| } | |
| } | |