Coding Coffee Menu

<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<title>Coding Coffee</title>
</head>
<body>
<center>
<h1 ><font color="red">coding Coffee Menu</font></h1>
<br>
<br>
<hr>
<p style="color:blue"><font size="5">浓缩咖啡(Espresso)</font></p>
<p>属于意式咖啡,就是我们平常用咖啡直接冲出来的那种,味道浓郁,入口微苦,咽后留香。适合上班族。</p>
<img src="1.jpg"><br>
<hr>
<br>
<p style="color:blue"><font size="5">马琪雅朵(Machiatto</font></p>
<p>在浓缩咖啡中加上两大勺奶泡就成了一杯马琪雅朵。玛奇朵在意大利文里是印记、烙印的意思,所以象征着甜蜜的印记。
</p>
<img src="2.jpg"><br>
<hr>
<br>
<p style="color:blue"><font size="5">美式咖啡(Americano</font></p>
<p>是最普通的咖啡,属于黑咖啡的一种。在浓缩咖啡中直接加入大量的水制成,口味比较淡,咖啡因含量较高。
</p>
<img src="3.jpg">
<hr>
<p style="color:blue"><font size="5">白咖啡(Flat white</font></p>
<p>是马来西亚的特产,白咖啡的颜色并不是白色,但是比普通咖啡更清淡柔和,白咖啡味道纯正,甘醇芳香。
</p>
<img src="4.jpg">
<center>
<address><div style="color:#FF00FF">
作者郭海强</address></center>
</body>
</html>
阅读更多

扫码向博主提问

小砖块

非学,无以致疑;非问,无以广识
去开通我的Chat快问

Coffee Central

02-10

n问题描述 :nnIs it just a fad or is it here to stay? You’re not sure, but the steadily increasing number of coffee shops that are opening in your hometown has certainly become quite a draw. Apparently, people have become so addicted to coffee that apartments that are close to many coffee shops will actually fetch higher rents.nnnThis has come to the attention of a local real-estate company. They are interested in identifying the most valuable locations in the city in terms of their proximity to large numbers of coffee shops. They have given you a map of the city, marked with the locations of coffee shops. Assuming that the average person is willing to walk only a fixed number of blocks for their morning coffee, you have to find the location from which one can reach the largest numbernof coffee shops. As you are probably aware, your hometown is built on a square grid layout, with blocks aligned on north-south and east-west axes. Since you have to walk along streets, the distance between intersections (a, b) and (c, d) is |a – c| + |b – d|. nnnnn输入:nnThe input contains several test cases. Each test case describes a city. The first line of each test case contains four integers dx, dy, n, and q. These are the dimensions of the city grid dx × dy (1 <= dx, dy <= 1000), the number of coffee shops n (0 <= n <= 5 × 10^5), and the number of queries q (1 <= q <= 20). Each of the next n lines contains two integers xi and yi (1 <= xi <= dx, 1 <= yi <= dy); these specify the location of the ith coffee shop. There will be at most one coffee shop per intersection. Each of the next q lines contains a single integer m (0 <= m <= 10^6), the maximal distance that a person is willing to walk for a cup of coffee.nThe last test case is followed by a line containing four zeros. nnn输出:nnThe input contains several test cases. Each test case describes a city. The first line of each test case contains four integers dx, dy, n, and q. These are the dimensions of the city grid dx × dy (1 <= dx, dy <= 1000), the number of coffee shops n (0 <= n <= 5 × 10^5), and the number of queries q (1 <= q <= 20). Each of the next n lines contains two integers xi and yi (1 <= xi <= dx, 1 <= yi <= dy); these specify the location of the ith coffee shop. There will be at most one coffee shop per intersection. Each of the next q lines contains a single integer m (0 <= m <= 10^6), the maximal distance that a person is willing to walk for a cup of coffee.nThe last test case is followed by a line containing four zeros.nnn样例输入:n4 4 5 3n1 1n1 2n3 3n4 4n2 4n1n2n4n0 0 0 0nnn样例输出:nCase 1:n3 (3,4)n4 (2,2)n5 (3,1)n

没有更多推荐了,返回首页