#Div

DIV背景半透明

设置颜色的不透明度,一般用于调整background-color、color、box-shadow等的不透明度,后代元素不会一起跟着透明(background-color:rgba(0,0,0,0.2);/*IE6和部分IE7内核的浏览器(如QQ浏览器)会读懂,但解析为透明*/)...
代码星球 ·2020-04-17

在div上添加小三角

&::before{width:0;height:0;position:absolute;content:"";right:10px;top:9px;border-right:7pxdashedtransparent;border-bottom:7pxsolidcurrentColor;border-left:...
代码星球 ·2020-04-16

CSS3实现DIV圆角完整代码

本实例是CSS3实现DIV圆角。实现圆角的CSS3代码句是:"border-radius:20px;"。需使用支持CSS3的浏览器运行,例如新版的Chrome、火狐,或者IE9以上。IE6、7、8不支持。在线预览效果:http://hovertree.com/texiao/css/4.htm画圆型的例子:http://...

Codeforces Round #415 (Div. 2)(A,暴力,B,贪心,排序)

timelimitpertest:1secondmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputNooraisastudentofonefamoushighschool.It'sherfinalyearinschool&nbs...

Codeforces Round #416 (Div. 2)(A,思维题,暴力,B,思维题,暴力)

timelimitpertest:2secondsmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputAtregularcompetitionVladikandValerawonaandbcandiesrespectively.V...

Codeforces Round #301 (Div. 2)(A,【模拟】B,【贪心构造】C,【DFS】)

timelimitpertest:2secondsmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputScroogeMcDuckkeepshismosttreasuredsavingsinahomesafewithacombina...

Educational Codeforces Round 21 D.Array Division(二分)

timelimitpertest:2secondsmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputVasyahasanarrayaconsistingofpositiveintegernumbers.Vasyawantstod...

Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)(A.暴力,B.优先队列,C.dp乱搞)

timelimitpertest:1secondmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputInsomegamebyPlayrixittakestminutesforanoventobakekcarrotcakes,all...

Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)(A.B.C,3道暴力题,C可二分求解)

timelimitpertest:2secondsmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputIsitrated?Hereitis.TheUltimateQuestionofCompetitiveProgramming,C...

Codeforces Round #411 (Div. 2)(A,B,C,D 四水题)

timelimitpertest:1secondmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputTavakandSeyyedaregoodfriends.SeyyedisveryfunnyandhetoldTavaktosol...

喵哈哈村的魔法考试 Round #1 (Div.2) 题解&源码(A.水+暴力,B.dp+栈)

发布时间:2017年2月21日20:05  最后更新:2017年2月21日20:06  时间限制:1000ms  内存限制:128M描述传说喵哈哈村有三种神奇的魔法石:第一种魔法石叫做人铁石,拥有A的能量;第二种魔法石叫做地冈石,拥有B的能量;而第三种,则是最...

Codeforces Round #410 (Div. 2)(A,字符串,水坑,B,暴力枚举,C,思维题,D,区间贪心)

timelimitpertest:2secondsmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputMikehasastringsconsistingofonlylowercaseEnglishletters.Hewantsto...

Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)(A.思维题,B.思维题)

timelimitpertest:2secondsmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputToniohasakeyboardwithonlytwoletters,"V"and"K".Oneday,hehastypedo...

Codeforces Round #395 (Div. 2)(A.思维,B,水)

timelimitpertest:1secondmemorylimitpertest:256megabytesinput:standardinputoutput:standardoutputComradeDujikovisbusychoosingartistsforTimofey'sbirthdayandisrecie...

三维网格细分算法(Catmull-Clark subdivision & Loop subdivision)附源码(转载)

转载: https://www.cnblogs.com/shushen/p/5251070.html下图描述了细分的基本思想,每次细分都是在每条边上插入一个新的顶点,可以看到随着细分次数的增加,折线逐渐变成一条光滑的曲线。曲面细分需要有几何规则和拓扑规则,几何规则用于计算新顶点的位置,拓扑规则用于确定新顶点的...
首页上一页...1314151617...下一页尾页