Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
coding!!Woo!!
//gcc 5.4.0 #include <stdio.h> #include <math.h> int main(void) { //This code calculates arithmetic functions using L, a large integer, and S, a small integer long int L=1000; int S=10; long int sum; long int product; long int difference; long int result; long int remainder; double squarerootL; double squarerootS; double cubicrootL; double cubicrootS; sum= L+S; product= L*S; difference= L-S; result= L/S; remainder=L%S; squarerootL=sqrt(L); squarerootS=sqrt(S); cubicrootL=cbrt(L); cubicrootS=cbrt(S); printf("the sum is %Ld \n", sum); printf("the product is %Ld \n", product); printf("the difference is %Ld \n", difference); printf("the result is %Ld \n", result); printf("the remainder of L divided by S is %Ld \n", remainder); printf("the squareroot of L is %Lf \n", squarerootL); printf("the squareroot of S is %Lf \n", squarerootS); printf("the cubicroot of L is %Lf \n", cubicrootL); printf("the cubicroot of S is %Lf \n", cubicrootS); return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
2.1 Comparision of Matrix Transpose Execution Time
THIS one uwu
Found arrangement:
B_141104_NotaSwitch
sume of diagonal v.1
lambda
Lab 7 v1.0
pllkkj
2
Undefined argument processing order in C
Please log in to post a comment.