Koch Curve
Write a program which reads an integer n and draws a Koch curve based on recursive calles of depth n.
The Koch curve is well known as a kind of fractals.
You can draw a Koch curve in the following algorithm:
Divide a given segment (p1, p2) into three equal segments.
Replace the middle segment by the two sides of an equilateral triangle (s, u, t) of the same length as the segment.
Repeat this procedure recursively fornew segments (p1, s),(s, u),(u, t),(t, p2).
You should start (0,0),(100,0) as the first segment.
Input
An integer n is given.
Output
Print each point (x, y) of the Koch curve. Print a point in a line. You should start the point(0,0), which is the endpoint of the first segment and end with the point (100,0), the other endpoint so that you can draw the Koch curve as an unbroken line. Each solution should be given as a decimal with an arbitrary number of fractional digits,and with an absolute error of at most 10-4.
Constraints
0 ≤ n ≤ 6
Sample Input 11
Sample Output 10.000000000.0000000033.333333330.0000000050.0000000028.8675134666.666666670.00000000100.000000000.00000000
Sample Input 22
Sample Output 20.000000000.0000000011.111111110.0000000016.666666679.6225044922.222222220.0000000033.333333330.0000000038.888888899.6225044933.3333333319.2450089744.4444444419.2450089750.0000000028.8675134655.5555555619.2450089766.6666666719.2450089761.111111119.6225044966.666666670.0000000077.777777780.0000000083.333333339.6225044988.888888890.00000000100.000000000.00000000
代码块
#include<iostream>#include<iomanip>usingnamespace std;voidKoch(pair<double,double> a, pair<double,double> b,int n){if(!n){
cout<<fixed<<setprecision(8)<<a.first<<' '<<a.second<<endl;return;}double x = b.first-a.first;double y = b.second-a.second;
pair<double,double>c(a.first+x/3, a.second+y/3);
pair<double,double>d1(a.first, a.second+2*y/3);
pair<double,double>d2(b.first, a.second+y/3);
pair<double,double>d3(a.first+x/2, a.second+1.7320508075*x/6);
pair<double,double>e(a.first+2*x/3, a.second+2*y/3);Koch(a, c, n-1);if(y>0& x>0){Koch(c, d1, n-1);Koch(d1, e, n-1);}elseif(y<0& x>0){Koch(c, d2, n-1);Koch(d2, e, n-1);}elseif(y>0& x<0){Koch(c, d2, n-1);Koch(d2, e, n-1);}elseif(y<0& x<0){Koch(c, d1, n-1);Koch(d1, e, n-1);}else{Koch(c, d3, n-1);Koch(d3, e, n-1);}Koch(e, b, n-1);}intmain(void){int n;
cin>>n;
pair<double,double> a, b;
a.first =0;
a.second =0;
b.first =100;
b.second =0;Koch(a, b, n);
cout<<fixed<<setprecision(8)<<b.first<<' '<<b.second<<endl;return0;}
题目Koch CurveWrite a program which reads an integer n and draws a Koch curve based on recursive calles of depth n.The Koch curve is well known as a kind of fractals.You can draw a Koch curve in the following algorithm:Divide a given segment (p1, p2)