Recent projects

# -------------------------------------------------- # Funkcja generująca losowe punkty w kole # -------------------------------------------------- dane <- function(srodek, promien, n) { x0 <- srodek[1] y0 <- srodek[2] theta <- 2 * pi * run

#include <stdio.h> #include <stdlib.h> #include <math.h> int a; int main() { printf("Entrez le nombre. \n"); scanf("%d",&a); if (a%2==0) {

import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void main(String[] args) { int[] tablica = {10, 20, 30, 40, 50}; for (var i = 1 ; i<tablica.length; i++) {

# -------------------------------------------------- # Funkcja generująca losowe punkty w kole # -------------------------------------------------- dane <- function(srodek, promien, n) { x0 <- srodek[1] y0 <- srodek[2] theta <- 2 * pi * run

public class Cola { // Propiedades de la estructura tipo cola private int inicio; private int fin; private int capacidad; private String[] elementos; // Arreglo de cadenas que simula la estructura tipo cola // Constructor de

//let albom =" name of the song is " //let song = 2 //hikayatte //let songofalbom = albom + string( song ) //print(" songofalbom ") //var fruits = ["Apple", "Banana", "Orange"] //fruits.append("Kiwi") //print(fruits)

//let albom =" name of the song is " //let song = 2 //hikayatte //let songofalbom = albom + string( song ) //print(" songofalbom ") //var fruits = ["Apple", "Banana", "Orange"] //fruits.append("Kiwi") //print(fruits)

controlla il mio codice: #include <stdio.h>  /* prendi in input numeri interi positivi finche non si inserisce un numero negativo. i numeri pari le sommi e i numeri dispari le moltiplichi. e segna il massimo tra i pari e il minimo tra i dispari. il

M=[40 0 0 50]; K=[35 -20 -20 20]; [F,L]=eig(K,M) w=L.^0.5 UNOS=[1 1]; FPM=F'*M*UNOS; CUA=FPM.^2;

person_det_id person_id person_comp_id col001 active created_date created_by start_date end_date 18147441 496099 2038732 IDENTTYP02 TRUE 2026-11-14 20:55:21.225+05:30 434619 11/2/2026 0:00 12/31/9999 0:00 18147442 496099 2038732 IDENTTYP01 TRUE 2026

-- ========================================== -- PROJETO LOJA - ANHANGUERA -- VERSAO COMPATIVEL COM MYCOMPILER -- ========================================== -- 1. TABELA ESTADO CREATE TABLE Estado ( ID INT NOT NULL AUTO_INCREMENT,

#include <stdio.h> #include <stdlib.h> int a,b; int main() { scanf("%d%d",&a,&b); printf("%d\n%d\n",a,b); if (a>0 && b>0 || a<0 && b<0) { printf("Le signe de la multiplication est positif. \n");} else if (a>0 && b<0 || a<0 && b>0) {

CREATE TABLE Subjects( SubjectID INT AUTO_INCREMENT PRIMARY KEY, Subjectname VARCHAR(50) ); CREATE TABLE Quizzes( QuizID INT AUTO_INCREMENT PRIMARY KEY, Quiz VARCHAR(500), Subject_ID INT );

CREATE TABLE Insitutions( Institution_ID INT PRIMARY KEY, Name VARCHAR(255), Location VARCHAR(255), Contact VARCHAR(255), Website VARCHAR(255) ); CREATE TABLE Courses( Course_ID INT PRIMARY KEY,

person_det_id person_id person_comp_id col001 active created_date created_by start_date end_date emp_num active_ind 18147202 496076 2038732 IDENTTYP02 TRUE 2026-11-12 22:50:54.095+05:30 434618 10/31/2026 0:00 12/31/9999 0:00 6781 N 18147441 496099 2

CREATE TABLE Subjects( SubjectID AUTO_INCREMENT PRIMARY KEY, Subjectname VARCHAR(50) ) CREATE TABLE Quizzes( QuizID AUTO_INCREMENT PRIMARY KEY, Quiz VARCHAR(500), Subject_ID INT )

#include <iostream> #include <vector> #include <climits> using namespace std; int minSubArrayLen(int target, vector<int>& nums) { int n = nums.size(); int left = 0;

#include <stdio.h> int main() { int age,jour,prix,reduction=0; char etudiant; printf("veuillez entrer votre age\n"); scanf("%d",&age);

clc clear close all %% Input and output data V = (-100:5:-65)'; Iss = [-10; -8; -7.5; -6.5; -4; -2; 0.5; 7]; %% Scale voltage for numerical stability V_mean = mean(V);

/* * Author: Iván Iglesias * Date: 23-11-2026 * Description: PR2 - The goal of this exercise is to replace the parallel vector implementation * with a design based on hierarchical data structures (tuples) * and to break the code down into act