Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
perfect square
#include <bits/stdc++.h> using namespace std; int main() { int l,r; cin>>l>>r; cout<<"Perfect square between L and R are: "; for(int i=l;i<=r;i++) { for(int j=1; j<=sqrt(i);j++) if ( i%j==0 and i/j==j ) {cout<<i<<" ";break;} } return 0; }
run
|
edit
|
history
|
help
1
Cyclically rotate an array by one
Ploshtina na krug
template
GenericPacker
MinCostKStops_BFS
DoubleListInt
no copy elision
pow implementation
Function to m_function
semiprog.cpp