当前位置:网站首页>慧通编程第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;
}
边栏推荐
- LeetCode每日一练 —— OR36 链表的回文结构
- IDEA 注释报红解决
- C# remote debugging
- Redis implements distributed locks
- Detailed explanation of TCP (1)
- els 方块向右移
- Redis 使用 sorted set 做最新评论缓存
- The BP neural network
- A brief introduction to the CheckBox component of the basic components of Flutter
- The distance value between two arrays of LeetCode simple questions
猜你喜欢

递归查询单表-单表树结构-(自用)

Ambiguous method call.both

LeetCode每日一练 —— OR36 链表的回文结构

Just debuted "Fight to Fame", safety and comfort are not lost
![[Swift]自定义点击APP图标弹出的快捷方式](/img/d4/84b237995fc3d3700916eb57f6670d.png)
[Swift]自定义点击APP图标弹出的快捷方式

type_traits元编程库学习

No qualifying bean of type 问题

web容器及IIS --- 中间件渗透方法1

The BP neural network
![[Compilation principle] Design principle and implementation of recursive descent parsing](/img/51/cd054a8246dc108520d6ff9ea26c60.png)
[Compilation principle] Design principle and implementation of recursive descent parsing
随机推荐
Daily practice of LeetCode - palindrome structure of OR36 linked list
Observer pattern
日志级别 和 打印log注意
TCP和UDP详解
Web container and IIS --- Middleware penetration method 1
Daily practice of LeetCode - 138. Copy a linked list with random pointers
5. How does the SAP ABAP OData service support the $filter operation
C语言从入门到如土——数据的存储
[C language] General method of expression evaluation
【论文阅读】Mastering the game of Go with deep neural networks and tree search
Getting Started with CefSharp - winform
Several common errors when using MP
[Swift]自定义点击APP图标弹出的快捷方式
Just debuted "Fight to Fame", safety and comfort are not lost
RESTful api接口设计规范
Based on the local, linking the world | Schneider Electric "Industrial SI Alliance" joins hands with partners to go to the future industry
How Zotero removes auto-generated tags
Redis 统计用户新增和留存
浅识Flutter 基本组件之showDatePicker方法
MP使用时的几个常见报错