Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
TraiectorieIdeala2
#include <iostream> #include <math.h> using namespace std; int main() { //constante double z=0.89,z0=0.15,g=9.81,pi=3.1416; double rhinoWheelDiameter=0.096,maxAngle=33; //variabile double d,v0,tg,cs; cin>>d; tg=2*(z-z0)/d; if(atan(tg)*180/pi>maxAngle){ tg=tan(maxAngle*pi/180.0); cs=cos(maxAngle*pi/180.0); v0=d/(cs*sqrt(2*(d*tg-(z-z0))/g)); } else v0=sqrt((tg*tg+1)*2*g*(z-z0))/tg; cout<<"Viteza: "<<v0<<endl; cout<<"RPM fara frecari: "<<60*v0/rhinoWheelDiameter/pi<<endl; cout<<"Unghi: "<<atan(tg)*180/pi<<endl; }
run
|
edit
|
history
|
help
0
akshitha
Dar
RecursiveFact
Ploshtina na krug
Reverse a string
combine c++ string with dynamically allocated c array of chars through overloaded add operator
AgeGroupHisto
Menu Combination Sum
Longest Consecutive Subsequence
project