Travelling and rounded pictures

First Iwant to talk about my enjoyable travelling holidays of the National Day.It is always happy when you meeting your family members after leaving them for a quite long days,obviously it‘s the same to me.We travel to many places like Shanghai,Nanjing,Hangzhou and Suzhou. Above all the places, what I like most is Hangzhou. In Hangzhou, we see the West Lake, of course with many many people, I was deeply touched by the beautiful Broken Bridge and the moving love story. Imaging what would happend at that time. While Shanghai unquestionable is very modern and international,I don‘t want to talk anymore about it.

Then go on to some professional techniques. In html and css, to make the pages look more beautiful, so there is a need for you to change the pictures that used in your webs, In other words, it is just to make it become rounded pictures. Today, I want to share everyone about this skills or say methods.

All the properties it used is just border-radius. For example, when you set this property like "border-radius: 15px",

  to 

you only need to give this property one value, and it can both change the horizontal radius and the vertical radius of every  fillet .

When you just set one value,it will set four fillets of pictures by default. However,if you want to set two values,it represent you set the upper left fillet and lower right fillet as the first value, meanwhile you use the second value to confirm the  upper right fillet and lower left fillet.

For example:

border-radius: 15px 5px;

Also other scenario,you set three values. At this case, the upper left fillet of the picture uses the first value,while the upper right and the low left fillets of picture use the second value,and the remaining fillet,just the low right fillet is setted by the last value.

Just like the example below:

border-radius: 15px 5px 25px;

And so on,the last scenario is to set both four values.And this one is easier than other three cases, you only suggested to remember that the order is clockwise. For example:

border-radius: 15px 5px 25px 0px;

It just a part of this property,and I will introduce more about it next time.

时间: 2024-12-14 23:32:15

Travelling and rounded pictures的相关文章

hdu3001 Travelling 旅行商问题 状态压缩DP

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3001 Travelling Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4642    Accepted Submission(s): 1531 Problem Description After coding so many days,

hdu 3001 Travelling (bfs+状态压缩)

Travelling Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3905    Accepted Submission(s): 1234 Problem Description After coding so many days,Mr Acmer wants to have a good rest.So travelling is

InnoDB: auto-extending data file ./ibdata1 is of a different size 640 pages (rounded down to MB) than specified in the .cnf file: initial 768 pages, max 0 (relevant if non-zero) pages!

问题描述: centos 安装MySQL $yum install mysql-server 安装之后执行命令mysql 报错: 查看mysql的启动日志: [ERROR] InnoDB: auto-extending data file ./ibdata1 is of a different size 640 pages (rounded down to MB) than specified in the .cnf file: initial 768 pages, max 0 (relevan

URAL 1077 Travelling Tours(统计无向图中环的数目)

Travelling Tours Time limit: 1.0 secondMemory limit: 64 MB There are N cities numbered from 1 to N (1 ≤ N ≤ 200) and M two-way roads connect them. There are at most one road between two cities. In summer holiday, members of DSAP Group want to make so

Travelling

Description After coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not mind which city being his start station because superman ca

构造 - HDU 5402 Travelling Salesman Problem

Travelling Salesman Problem Problem's Link: http://acm.hdu.edu.cn/showproblem.php?pid=5402 Mean: 现有一个n*m的迷宫,每一个格子都有一个非负整数,从迷宫的左上角(1,1)到迷宫的右下角(n,m),并且使得他走过的路径的整数之和最大,问最大和为多少以及他走的路径. analyse: 首先,因为每个格子都是非负整数,而且规定每个格子只能走一次,所以为了使和尽可能大,必定是走的格子数越多越好.这样我们就需

状压DP [HDU 3001] Travelling

Travelling Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4166    Accepted Submission(s): 1339 Problem Description After coding so many days,Mr Acmer wants to have a good rest.So travelling is

zoj 2027 Travelling Fee (最短路变形)

Travelling Fee Time Limit: 2 Seconds      Memory Limit: 65536 KB Samball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next step is to determine the travel route. As this poor guy ha

hdu5402 Travelling Salesman Problem(棋盘染色+模拟)

题目: Travelling Salesman Problem Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 906    Accepted Submission(s): 331 Special Judge Problem Description Teacher Mai is in a maze with n rows and m c