Treceți la conținutul principal

legea lui ohm listing code vcnet

using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Windows.Forms;

namespace _3DS
{
    public partial class Form1 : Form
    {
        public Form1()
        {
            InitializeComponent();
        }

        public double fc(TextBox txtBoxX) {

            double nr = 0.0;
            try
            {
                nr = Convert.ToDouble(txtBoxX.Text);
            }
            catch { }
            return nr;

        }

        private void button2_Click(object sender, EventArgs e)
        {
            try
            {
                if (fc(txtU) != 0.0)
                {
                    if (fc(txtI) != 0.0)
                    {

                        txtR.Text = Convert.ToString(fc(txtU) / fc(txtI));

                    }
                    else
                    {
                        if (fc(txtP) != 0.0)
                        {
                            txtR.Text = Convert.ToString((fc(txtU) * fc(txtU)) / fc(txtP));
                        }

                    }
                }
                else {
                    if (fc(txtP) != 0.0)
                    {
                        
                        if (fc(txtI) != 0.0)
                        {

                            txtR.Text = Convert.ToString(fc(txtP) / (fc(txtI)*fc(txtI)));

                        }
                    }
                }
            }
            catch { }
            /*
             r = u/i
             r = (u*u)/p 
             r=p/(i*i)
             */
        }

        private void button3_Click(object sender, EventArgs e)
        {
         




            try
            {
                if (fc(txtI) != 0.0)
                {
                    if (fc(txtR) != 0.0)
                    {

                        txtU.Text = Convert.ToString(fc(txtR) * fc(txtI));

                    }
                    else
                    {
                        if (fc(txtP) != 0.0)
                        {
                            txtU.Text = Convert.ToString(fc(txtP) / fc(txtI));
                        }

                    }
                }
                else
                {
                    if (fc(txtP) != 0.0)
                    {

                        if (fc(txtR) != 0.0)
                        {

                            txtU.Text = Convert.ToString(Math.Sqrt(fc(txtP) * fc(txtR)));

                        }
                    }
                }
            }
            catch { }


            /*
            u = r*i
            u = p/i 
            u=sqrt(p*r)
            */
        }

        private void button4_Click(object sender, EventArgs e)
        {
           

            try
            {
                if (fc(txtU) != 0.0)
                {
                    if (fc(txtR) != 0.0)
                    {

                        txtI.Text = Convert.ToString(fc(txtU) / fc(txtR));

                    }
                    else
                    {
                        if (fc(txtP) != 0.0)
                        {
                            txtI.Text = Convert.ToString(fc(txtP) / fc(txtU));
                        }

                    }
                }
                else
                {
                    if (fc(txtP) != 0.0)
                    {

                        if (fc(txtR) != 0.0)
                        {

                            txtI.Text = Convert.ToString(Math.Sqrt(fc(txtP) / fc(txtR)));

                        }
                    }
                }
            }
            catch { }

            /*
           i = u/r
           i = p/u 
           i=sqrt(p/r)
           */
        }

        private void button5_Click(object sender, EventArgs e)
        {
          

            try
            {
                if (fc(txtI) != 0.0)
                {
                    if (fc(txtU) != 0.0)
                    {

                        txtP.Text = Convert.ToString(fc(txtU) * fc(txtI));
                    }
                    else
                    {
                        if (fc(txtR) != 0.0)
                        {
                            txtP.Text = Convert.ToString(fc(txtR) * (fc(txtI)*fc(txtI)));
                        }

                    }
                }
                else
                {
                    if (fc(txtU) != 0.0)
                    {

                        if (fc(txtR) != 0.0)
                        {

                            txtP.Text = Convert.ToString((fc(txtU)*fc(txtU)) / fc(txtR));

                        }
                    }
                }
            }
            catch { }


            /*
           p = u*i
           p = r*(i*i) 
           p=(u*u)/r
           */
        }
    }
}

Comentarii

Postări populare de pe acest blog

program principal cpp

#include "clasa.h" #include <stdio.h> #include <conio.h> #include <stdlib.h> #include <string.h> #define DELAY 9000000 void delay() { for(long i=0;i<DELAY;i++); } //constructor cu initializare de la tastatura BigInt::BigInt() {char x; signed char t[400]; int i; printf("\nNumarul cu semn "); do s=getche(); while((s!='+')&&(s!='-')); n=0; do {x=getche(); t[n]=x-'0'; n++; } while((x>='0')&&(x<='9')); n--; for(i=0;i<n;i++) nr[i]=t[n-i-1]; } //constructor cu initializare prin parametri BigInt::BigInt(char semn,signed char numar[],int dim) {int i; s=semn; n=dim; for(i=0;i<n;i++) nr[i]=numar[n-i-1]; } //transform un int negativ in pozitiv int BigInt::Pozitiv(int x) {int a,vb; a=0; vb=0; while(vb==0) if((x+a)==0) vb=1; else a=a+1; x=a; return x; } //constructor dintr-un nr int obisnuit BigInt::BigInt(int x) {int i; if(x>=0) s='+'…

NUMERE PRIME ALGORITM C++

// NUMERE PRIME ALGORITM C++//  reediting from scratch //on this page is just the study for a next algoritm for generating the parime nr series like Fibonnaci or ....if possibile

74111121313417374414124343447 if u know the red part you can generate the orange part
1 0 1 111112222 1 1 23

o aplicatie php localitati romania

//APLICATIA SE REFERA LA BAZA DE DATE SIRUTA

//dragtable.js


/* dragtable v1.0 June 26, 2008 Dan Vanderkam, http://danvk.org/dragtable/ http://code.google.com/p/dragtable/ \Bsortabledraggable\B Instructions: - Download this file - Add <script src="dragtable.js"></script> to your HTML. - Add class="draggable" to any table you might like to reorder. - Drag the headers around to reorder them. This is code was based on: - Stuart Langridge's SortTable (kryogenix.org/code/browser/sorttable) - Mike Hall's draggable class (http://www.brainjar.com/dhtml/drag/) - A discussion of permuting table columns on comp.lang.javascript Licensed under the MIT license. */ // Here's the notice from Mike Hall's draggable script: //***************************************************************************** // Do not remove this notice. // // Copyright 2001 by Mike Hall. // See http…