35 lines
1.1 KiB
Java
35 lines
1.1 KiB
Java
|
public class Lab1 {
|
|||
|
|
public static void main(String[] args) {
|
|||
|
|
System.out.println( (double) 0 / 0 );
|
|||
|
|
System.out.println( Math.sqrt(-1) );
|
|||
|
|
double s = 0;
|
|||
|
|
/*for (int i = 1; i <= 3; i++) { // 1) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> i = 1, 2) <20><><EFBFBD><EFBFBD> <20> <= 3, 3) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 䳿 <20> <20><> <20><><EFBFBD><EFBFBD><EFBFBD>,
|
|||
|
|
System.out.println(i); // 4) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><> 1, 5) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD> 2
|
|||
|
|
// s = s + i;
|
|||
|
|
s += i;
|
|||
|
|
}*/
|
|||
|
|
/*int[] array = new int[2];
|
|||
|
|
for (int i = 0; i < array.length; i++) {
|
|||
|
|
|
|||
|
|
}*/
|
|||
|
|
final int A = -1;
|
|||
|
|
final int B = 1;
|
|||
|
|
final int N = 2;
|
|||
|
|
final int M = 2;
|
|||
|
|
|
|||
|
|
final int C = 1;
|
|||
|
|
|
|||
|
|
for (int i = A; i <= N; i++) {
|
|||
|
|
if (i + C == 0) { // todo optimize
|
|||
|
|
System.out.println("Division by zero!");
|
|||
|
|
break; //todo flag vs return;
|
|||
|
|
}
|
|||
|
|
for (int j = B; j <= M; j++) {
|
|||
|
|
s += (double) (i + j) / (i + C);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
System.out.println("s = " + s);
|
|||
|
|
}
|
|||
|
|
}
|