Project: Optimal Circuit Synthesis with SAT · Seven-Segment Display

Lesson 2

Nikolai Chukhin · Alexander S. Kulikov

Programming problem. Construct one shared circuit for a decimal seven-segment display.

Input format. The only line contains the maximum number of gates \(k\).

Output format. First print the number of gates \(m\le k\). Then print \(m\) gate lines in the same format as in the previous task. There are four inputs, numbered 0, 1, 2, 3, with the most significant bit first. Finally, print seven source indices for segments \(a,b,c,d,e,f,g\). The checker tests inputs 0 through 9; the remaining six inputs are don't-cares.