import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;


/**
 * @author Pankaj
 * 
 * The file on execution generates an Erdős–Rényi graph using three
 * parameters, namely 'n', 'p' and 'sequence'. This generates G(n,p)
 * of 'sequence' sequence number.
 *
 */
public class GraphGenerator {
	public static void main(String[] args){
		int n = Integer.parseInt(args[0]);
		double p = (double)Integer.parseInt(args[1])/100;
		int sequence = Integer.parseInt(args[2]);
		
		try{
			File inputDir = new File( "input" );
			inputDir.mkdir();
			FileWriter fWr = new FileWriter("input/" + n + "-" + args[1] + "-" + (sequence > 9 ? "" : "0") + sequence + ".txt");
			BufferedWriter file = new BufferedWriter(fWr);
			
			file.write(n + " " + p + " " + "\n");
			
			for (int i = 0; i < n-1; i++)
				for (int j = i+1; j < n; j++)
					if (Math.random() < p)
						file.write(i + " " + j + "\n");
			
			file.close();
		} catch (Exception e){
			System.out.println("Unable to open file");
		}
	}
}