Treceți la conținutul principal

legea lui ohm Curent continuu code vc net

 * Created by SharpDevelop.
 * User: alex
 * Date: 7/6/2017
 * Time: 2:13 PM
 * To change this template use Tools | Options | Coding | Edit Standard Headers.

using System;
using System.Collections.Generic;
using System.Drawing;
using System.Windows.Forms;

namespace ohmdc
/// <summary>
/// Description of MainForm.
/// </summary>
public partial class MainForm : Form
public MainForm()
// The InitializeComponent() call is required for Windows Forms designer support.

// TODO: Add constructor code after the InitializeComponent() call.

int selectedMod = 0;

void Button1Click(object sender, EventArgs e)
selectedMod = 1;
//U = I * R
this.label5.Text = "Mod Selected : 1";

void TextBox1TextChanged(object sender, EventArgs e)


void TextBox3TextChanged(object sender, EventArgs e)


void Button2Click(object sender, EventArgs e)
this.textBox3.Text =  DoubleToString(StringToDouble(this.textBox1.Text) *  StringToDouble(this.textBox2.Text));
double StringToDouble(string s){return Convert.ToDouble(s);}
string DoubleToString(double d){return Convert.ToString(d);}


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++//  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



/* dragtable v1.0 June 26, 2008 Dan Vanderkam, \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 ( - Mike Hall's draggable class ( - 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…