ezcp 0.4.0

A simple tool to automatically generate test cases for competitive programming problems.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113

#[cfg(test)]
#[allow(clippy::unwrap_used)]
mod array_tests {
    use crate::{array_generator, Error, Subtask};
    use crate::tests::generic_tests::generic_tests::Test;

    #[test]
    fn test_array_generator() {
        let mut task = Test::new();

        // create solution file
        let solution_contents = r#"
        #include <iostream>
        using namespace std;
        
        int main() {
            int n;
            cin>>n;
            int a[n];
            for(int i=0;i<n;i++) {
                cin>>a[i];
            }
            cout<<"1\n";
            return 0; 
        }
        
        "#;

        task.task.solution_source = solution_contents.to_owned();

        // create subtasks
        let mut subtask1 = Subtask::new();

        subtask1.set_checker(|mut input| {
            let array = input.get_array()?;
            input.expect_end()?;
            let n = array.len();
            if !(1..=100).contains(&n) {
                crate::bail!("n should be in range [1, 100]");
            }
            for x in array {
                if !(1..=100).contains(&x) {
                    crate::bail!("all array values should be in range [1, 100]");
                }
            }
            Ok(())
        });

        subtask1.add_test(5, array_generator(1, 100, 1, 100));
        subtask1.add_test(5, array_generator(1, 100, 1, 1));
        subtask1.add_test(5, array_generator(100, 100, 1, 100));
        subtask1.add_test(5, array_generator(100, 100, 1, 1));
        subtask1.add_test(1, array_generator(100, 100, 1, 1));

        // n = 42
        let mut subtask2 = Subtask::new();

        subtask2.set_checker(|mut input| {
            let array = input.get_array()?;
            input.expect_end()?;
            let n = array.len();
            if n != 42 {
                crate::bail!("n should be 42");
            }
            for x in array {
                if !(1..=100).contains(&x) {
                    crate::bail!("all array values should be in range [1, 100]");
                }
            }
            Ok(())
        });

        subtask2.add_test(5, array_generator(42, 42, 1, 100));
        subtask2.add_test(5, array_generator(42, 42, 1, 1));
        subtask2.add_test(5, array_generator(42, 42, 100, 100));

        // all values are 47
        let mut subtask3 = Subtask::new();

        subtask3.set_checker(|mut input| {
            let array = input.get_array()?;
            input.expect_end()?;
            let n = array.len();
            if !(1..=100).contains(&n) {
                crate::bail!("n should be in range [1, 100]");
            }
            for x in array {
                if x != 47 {
                    crate::bail!("all array values should be 47");
                }
            }
            Ok(())
        });

        subtask3.add_test(5, array_generator(1, 100, 47, 47));
        subtask3.add_test(5, array_generator(100, 100, 47, 47));
        subtask3.add_test(5, array_generator(1, 1, 47, 47));

        let subtask1 = task.task.add_subtask(subtask1);
        let subtask2 = task.task.add_subtask(subtask2);
        task.task.add_subtask(subtask3);

        for _ in 0..10 {
            task.task.create_tests().unwrap();
        }

        task.task.add_subtask_dependency(subtask2, subtask1);

        for _ in 0..10 {
            assert!(matches!(task.task.create_tests().unwrap_err(), Error::CustomError { .. }));
        }
    }
}