当前位置:网站首页>慧通编程第4关 - 魔法学院第6课
慧通编程第4关 - 魔法学院第6课
2022-07-31 03:34:00 【中学生信竞】
梳子
int main(){
p.size(8).c(6);
for (int i = 1; i <= 6; i ++) {
p.fd(40).rt(90);
p.fd(40).rt(90);
p.fd(40).rt(180);
}
return 0;
}
锯齿
int main(){
for (int i = 1; i <= 7; i ++) {
p.rt(30).fd(30);
p.rt(120).fd(30);
p.lt(150);
}
return 0;
}
楼梯型
int main(){
p.c(11);
for (int i = 1; i <= 5; i ++) {
for (int j = 1; j <= 6; j ++) {
p.fd(30).rt(90);
}
p.lt(180);
}
return 0;
}
楼梯
int main(){
for (int i = 1; i <= 10; i ++) {
p.fd(20).rt(90);
p.fd(20).lt(90);
}
return 0;
}
实心矩形
int main(){
p.rr(100,80,14);
return 0;
}
2层实心矩形
int main(){
p.rr(100,80,14);
p.rr(80,50,0);
return 0;
}
6针形
int main(){
for (int i = 1; i <= 6; i ++) {
p.fd(100).bk(100).rt(60);
}
return 0;
}
彩色15针形
int main(){
pen.hide();
for (int i = 0; i < 15; i ++) {
pen.c(i);
pen.fd(100).bk(100) ;
pen.rt(360.0 / 15) ;
}
return 0;
}
4色30针形
int n = 30;
pen.size(5).hide();
for (int i = 0; i < n; i ++) {
pen.c(i % 4);
pen.fd(100).bk(100) ;
pen.rt(360.0 / n) ;
}
彩色环形
int main(){
int n = 10;
pen.size(8).hide();
for (int i = 0; i < n; i ++) {
pen.c(i);
pen.fd(50) ;
pen.rt(360.0 / n) ;
}
return 0;
}
边栏推荐
- 下载jar包的好地方
- Use of QML
- Annotation usage meaning
- Implementation of a sequence table
- The distance value between two arrays of LeetCode simple questions
- (tree) Last Common Ancestor (LCA)
- Safety 20220712
- The use of beforeDestroy and destroyed
- A brief introduction to the showDatePicker method of the basic components of Flutter
- Redis uses sorted set to cache latest comments
猜你喜欢
![[C language] Preprocessing operation](/img/69/0aef065ae4061edaf0d96b89846bf2.png)
[C language] Preprocessing operation

识Flutter 基本组件之showTimePicker 方法

Port inspection steps - 7680 port analysis - Dosvc service

5. How does the SAP ABAP OData service support the $filter operation

TCP和UDP详解

安全20220712

No qualifying bean of type question
![[Compilation principle] Design principle and implementation of recursive descent parsing](/img/51/cd054a8246dc108520d6ff9ea26c60.png)
[Compilation principle] Design principle and implementation of recursive descent parsing

数据库实现分布式锁

The distance value between two arrays of LeetCode simple questions
随机推荐
【AUTOSAR-RTE】-5-Explicit(显式)和Implicit(隐式) Sender-Receiver communication
errno错误码及含义(中文)
Analysis summary - self-use
C primer plus study notes - 8, structure
LeetCode每日一练 —— OR36 链表的回文结构
Observer pattern
BUG definition of SonarQube
Golang中的addressable
No qualifying bean of type question
Select the smoke test case, and make the first pass for the product package entering QA
Component pass value provide/inject
[C language] General method for finding the sum of the greatest common factor and the least common multiple of two integers m and n, the classical solution
Redis实现分布式锁
Redis 使用LIST做最新评论缓存
STM32 problem collection
Good place to download jar packages
Day32 LeetCode
type_traits metaprogramming library learning
CloudCompare&PCL 计算两个点云之间的重叠度
Ambiguous method call.both