mirror of
				https://github.com/ASDjonok/OOP_IO-2x_2023.git
				synced 2025-11-04 00:29:24 +02:00 
			
		
		
		
	add lab1
This commit is contained in:
		
							parent
							
								
									13e1a61ad9
								
							
						
					
					
						commit
						41ad598b79
					
				
							
								
								
									
										34
									
								
								src/Lab1.java
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										34
									
								
								src/Lab1.java
									
									
									
									
									
										Normal file
									
								
							@ -0,0 +1,34 @@
 | 
				
			|||||||
 | 
					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) <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD> i = 1, 2) <EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD> <= 3, 3) <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 䳿 <EFBFBD> <EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>,
 | 
				
			||||||
 | 
					            System.out.println(i);     // 4) <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD> <EFBFBD><EFBFBD> 1, 5) <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD> <EFBFBD><EFBFBD><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);
 | 
				
			||||||
 | 
					    }
 | 
				
			||||||
 | 
					}
 | 
				
			||||||
		Loading…
	
	
			
			x
			
			
		
	
		Reference in New Issue
	
	Block a user