package com.menzus.gcj._2012.qualification.c;

import com.menzus.gcj.common.InputBlockParser;
import com.menzus.gcj.common.OutputProducer;
import com.menzus.gcj.common.impl.AbstractProcessorFactory;

public class CProcessorFactory extends AbstractProcessorFactory<CInput, COutputEntry> {
    public CProcessorFactory(String inputFileName) {
	super(inputFileName);
    }

    @Override
    protected InputBlockParser<CInput> createInputBlockParser() {
	return new CInputBlockParser();
    }

    @Override
    protected OutputProducer<CInput, COutputEntry> createOutputProducer() {
	return new COutputProducer();
    }
}

import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class Solver {
	Scanner inFile=null;
	PrintWriter outFile=null;
	int caseNo;
	public Solver(int caseNo){
		this.caseNo=caseNo;
	}
	public void processInput(Scanner inFile,PrintWriter outFile){
		this.inFile=inFile;
		this.outFile=outFile;
		readInput();
		produceoutput();
		
	}
	private void produceoutput() {
       
	
		//outFile.printf("Case #"+caseNo+": %d\n",candidatecount);
		
		
	}
	public void readInput(){
		String s="";
		if(inFile.hasNext()){
			//get the store credit
			int A=Integer.parseInt(inFile.next().trim());
			int B=Integer.parseInt(inFile.next().trim());
			RecycleNumber r=new RecycleNumber(A,B);
			outFile.printf("Case #"+caseNo+": %d\n",r.count);
			if(inFile.hasNext())inFile.nextLine();			
		}
	}

}
