Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
c2p_update
//g++ 7.4.0 #include <bits/stdc++.h> using namespace std; double cof3(int k,int l,int factor) { int i; double p = 2; double x = 1; for(i=1;i<=factor/2;i++) { x += (i*8)/p; p = p*2; } if(k==factor/2 && l==factor/2) return 1/x; p = 2; for(i=1;i<=factor/2;i++) { if(-i<=(k-factor/2) && (k-factor/2)<=i && -i<=(l-factor/2) && (l-factor/2)<=i) return (1.0/(p*x)); p = p*2; } } double cof2(int k,int l,int factor) { int i; double p = 1; double x = 0; for(i=1;i<=factor/2;i++) { x += (i*4)/p; p = p*2; } p = 1; for(i=1;i<factor/2;i++) { if(-i<=(k-factor/2) && (k-factor/2)<=i && -i<=(l-factor/2) && (l-factor/2)<=i) return (1.0/(p*x)); p = p*2; } } int main() { double sum =0; int factor = 8; for(int i=0;i<=factor;i++) { for(int j=0;j<=factor;j++) { cout<<cof3(i,j,factor)<<" "; sum += cof3(i,j,factor); } cout<<endl; } cout<<sum<<endl; }
run
|
edit
|
history
|
help
0
Segmented Sieve
Minimum Vertices to Traverse Directed Graph
c++ car racing game
rstring
Finding Ocean
Вариант универсального указателя.
MatrixVectorConversion
Iviewb
data locality - fast example
Matrix multiplication naive approach