Java tutorial
//package com.java2s; /* * Copyright (c) 2010, 2011 AnjLab * * This file is part of * Reference Implementation of Romanov's Polynomial Algorithm for 3-SAT Problem. * * Reference Implementation of Romanov's Polynomial Algorithm for 3-SAT Problem * is free software: you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * Reference Implementation of Romanov's Polynomial Algorithm for 3-SAT Problem * is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with * Reference Implementation of Romanov's Polynomial Algorithm for 3-SAT Problem. * If not, see <http://www.gnu.org/licenses/>. */ import java.util.Arrays; public class Main { private static String leadingZeros(int value, int length) { String result = String.valueOf(value); if (result.length() < length) { result = getString('0', length - result.length()) + result; } return result; } private static String getString(char c, int length) { char[] line = new char[length]; Arrays.fill(line, c); String string = new String(line); return string; } }