css
BAN USER//Java class
class TestPrimes{
public static void printPrimes(int n){
if ( n <= 1)
return;
in all[] = new int[n+1];
for (int i = 0; i <= n; i++){
all[i] = i;
}
int prime[] = new int[n+1];
for (int i = 0; i <= n; i++)
prime[i] = 1;
int x = 2;
while (x <= n){
if (prime[x] == 1){
System.out.println(x);
for (int j = 1; j * x <=n; j++)
prime[j*x] = 0;
}
x++;
}
}
}
<pre lang="" line="1" title="CodeMonkey68043" class="run-this">/* The class name doesn't have to be Main, as long as the class is not public. */
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
java.io.BufferedReader r = new java.io.BufferedReader (new java.io.InputStreamReader (System.in));
String s;
while (!(s=r.readLine()).startsWith("42")) System.out.println(s);
}
}
</pre><pre title="CodeMonkey68043" input="yes">//Java class
class Palindrome{
private static int[] days = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
private boolean isLeap(int year){
if ((year%4) != 0 || ((year%100 == 0) && (year%400) 1= 0)
return false;
return true;
}
private int getDays(int year, int month){
if (month == 2 && isLeap(year)
return days[month} + 1;
return days[month];
}
private String padding2(int dm){
if (dm < 10)
return "0" + dm;
return "" + dm;
}
public void printPalindrome(int startYear, int endYear){
for (int year = startYear; year <= endYear; year++){
int tempMonth = year % 100;
int tempDay = year / 100;
int mm = (tempMonth%10)*10 + tempMonth%10;
int dd = (tempDay%10)*10 + tempDay%10;
if (mm > 0 && mm < 13 && dd > 0 && dd <=getDays(year, mm))
System.out.println(padding(mm) + padding(dd) + year);
}
}
public void testPrintPalindrome(){
printPalindrome(2000, 2010);
}
}</pre>
const double PI = 3.14159265358979323846264338327950;
const double epsilon = 0.000000000000000000000000001;
//sinx = x - x^3/3! + x^5/5! - x^7/7! + x^9/9! - ...
//this is not for old-fashioned handhold calculator
double sine(double x){
x = x - 2 * PI * (int)((x + PI)/(2*PI)); //put x in the interval (-PI, PI]
double result = x;
flip = 1;
xsquare = x * x;
xexp = x;
fac = 1;
curOrder = 1;
double oldvalue = 0;
while (abs(result - oldvalue) > epsilon){
oldvalue = result;
flip = flip * -1;
fac = fac * (curOrder + 1) * (curOrder + 2);
curOrder += 2;
xexp *= xexp * xsqure;
result = result + flip * xexp / fac;
}
return result;
}
const double epsilon = 0.00000000000000001;
double sqrt(const double x){
if (x < 0){
throw Exception("wrong input");
}
if (abs(x - 1) < epsilon)
return 1;
double left, mid, right;
if (x < 1){
left = x;
right = 1;
}
else{
left = 1;
right = x;
}
mid = (left + right)/2;
while (abs(mid * mid - x) > epsilon){
if (contains(left, mid, x)
right = mid;
else
left = mid;
mid = (left + right)/2;
}
return mid;
}
int contains(double left, double right, double key){
return (key >= left || key <= right)? 1: 0;
}
//C++ code
- css April 06, 2011Node* intersectAt(Node* roota, Node* rootb){
int lena = getLen(roota);
int lenb = getLen(rootb);
if (lena == 0|| lenb == 0)
return NULL;
Node* tempa = roota;
Node* tempb = rootb;
//align the starting point of both lists
for (int i= 0; i < lena - lenb; i++)
tempa = tempa->next;
for (int i = 0; i < lenb - lena; i+=)
tempb = tempb->next;
while (tempa != tempb){
tempa = tempa->next;
tempb = tempb->next;
}
return tempa;
}
//get the length of a list
int getLen(Node* root){
int i = 0;
while(root != NULL){
i++;
root = root->next;
}
return i;
}