Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Ploshtina na krug
#include <iostream> #include <cstdlib> using namespace std; int main() { const float PI = 3.14;\ float r = 2.5; float p; p = PI*r*r; cout<<"p = "<<p<<endl; system ("PAUSE"); return o; }
run
|
edit
|
history
|
help
0
Hi
RecursiveFact
sin_approximation
Bad palindrom
sd5
LIS
CPP - Arrays - Ex.1
27
without HLD range Quey can be handled by just using segment tree on the FLATTENED TREE (euler tour)
shell sort