a new problem

本文介绍了一种常见的前端开发中遇到的问题——Font-Awesome字体图标库在本地环境中无法正常加载显示的情况,并提供了相应的调试思路及可能的解决方案。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

to be solved!font-awesome字体库在本地用不起来,即使用的cdn,同样的代码在runjs上可以加载出来,本地就不可以,引用的cdn,字体库下载下来也没有用

.triangle-up { width: 0; height: 0; border-left: 50px solid transparent; border-right: 50px solid transparent; border-bottom: 100px solid #669; }
.triangle-down { width: 0; height: 0; border-left: 50px solid transparent; border-right: 50px solid transparent; border-top: 100px solid #669; }
.triangle-left { width: 0; height: 0; border-top: 50px solid transparent; border-right: 100px solid #669; border-bottom: 50px solid transparent; }
.triangle-right { width: 0; height: 0; border-top: 50px solid transparent; border-left: 100px solid #669; border-bottom: 50px solid transparent; }
.triangle-updown { width: 0; height: 0; border-left: 50px solid transparent; border-right: 50px solid transparent; border-bottom: 100px solid #669;position:relative;margin-bottom:50px}
.triangle-updown:after {content:" "; width: 0; height: 0; border-left: 50px solid transparent; border-right: 50px solid transparent; border-top: 100px solid #669;position:absolute;top:50px;left:-50px;}

.triangle-topleft { width: 0; height: 0; border-top: 100px solid #669; border-right: 100px solid transparent; }
.triangle-topright { width: 0; height: 0; border-top: 100px solid #669; border-left: 100px solid transparent; }
.triangle-bottomleft { width: 0; height: 0; border-bottom: 100px solid #669; border-right: 100px solid transparent; }
.triangle-bottomright { width: 0; height: 0; border-bottom: 100px solid #669; border-left: 100px solid transparent; }

 

转载于:https://www.cnblogs.com/xiaqi/p/4224978.html

Lately, the cows on Farmer John's farm have been infatuated with watching the show Apothecowry Dairies. The show revolves around a clever bovine sleuth CowCow solving problems of various kinds. Bessie found a new problem from the show, but the solution won't be revealed until the next episode in a week! Please solve the problem for her. You are given integers M and K (1≤M≤109,1≤K≤31) . Please choose a positive integer N and construct a sequence a of N non-negative integers such that the following conditions are satisfied: 1≤N≤100 a1+a2+⋯+aN=M popcount(a1)⊕ popcount(a2)⊕⋯⊕ popcount(aN)=K If no such sequence exists, print −1 . † popcount(x) is the number of bits equal to 1 in the binary representation of the integer x . For instance, the popcount of 11 is 3 and the popcount of 16 is 1 . †⊕ is the bitwise xor operator. The input will consist of T (1≤T≤5⋅103 ) independent test cases. INPUT FORMAT (input arrives from the terminal / stdin): The first line contains T . The first and only line of each test case has M and K . It is guaranteed that all test cases are unique. OUTPUT FORMAT (print output to the terminal / stdout): Output the solutions for T test cases as follows: If no answer exists, the only line for that test case should be −1 . Otherwise, the first line for that test case should be a single integer N , the length of the sequence -- (1≤N≤100 ). The second line for that test case should contain N space-separated integers that satisfy the conditions -- (0≤ai≤M ). SAMPLE INPUT: 3 2 1 33 5 10 5 SAMPLE OUTPUT: 2 2 0 3 3 23 7 -1 In the first test case, the elements in the array a=[2,0] sum to 2 . The xor sum of popcounts is 1⊕0=1 . Thus, all the conditions are satisfied. In the second test case, the elements in the array a=[3,23,7] sum to 33 . The xor sum of the popcounts is 2⊕4⊕3=5 . Thus, all conditions are satisfied. Other valid arrays are a=[4,2,15,5,7] and a=[1,4,0,27,1] . It can be shown that no valid arrays exist for the third test case.
03-24
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值