1：无法执行程序。。。。
2：鼠标右键我的图标查看“目标”“目标位置都是灰色的”，正常的应该油路径信息，而我没有，个人推断是快捷图标与执行文件没产生关联

1个回答

installshield打包脚本语言中如何实现xml文件node节点属性的动态修改
Disconnect 怎么才能解决
Problem Description An enemy state of our country is occupying an island of ours. They take lots of warships around the island. Communications among the warships are transited by wireless signal, but we have to separate the warships so that at least ONE pair of warships cannot communicate with each other. For that purpose, we create a kind of Wireless Signal Shielding Device (WSSD) that WSSD can shield the wireless signal in its shielding circle with radius R. The factories could produce enough WSSDs and our patrol team discovered a lot of places that could be installed with WSSDs. In order to separate the warships, we need to know the minimum value of radius R, smaller R is better because of the cost of manufacture. Please notice that because of the inflection of wireless signal, two warships can communicate with each other even there is no sight view between them. Input The input contains multiply test cases. The first line of each test case consists of two integers, n, m (0 < n, m <= 10000), which are the number of places where we can install WSSDs and the number of warships. Each of the next n lines contains two integers, indicating the coordinate of the place where we can install WSSDs. The next m lines indicate the coordinates of warships. The last test case is followed by a single line with two zeros which should not be processed. Please notice that all the values of coordinates are between -10000 to 10000, and no two coordinates have the same value. Output Output the minimum R with two fractional digits. Sample Input 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 0 0 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 -9 0 0 0 Sample Output 0.71 8.00
InstallShield打包过程中添加redistributables

Disconnect 的程序的编写机制是什么
Problem Description An enemy state of our country is occupying an island of ours. They take lots of warships around the island. Communications among the warships are transited by wireless signal, but we have to separate the warships so that at least ONE pair of warships cannot communicate with each other. For that purpose, we create a kind of Wireless Signal Shielding Device (WSSD) that WSSD can shield the wireless signal in its shielding circle with radius R. The factories could produce enough WSSDs and our patrol team discovered a lot of places that could be installed with WSSDs. In order to separate the warships, we need to know the minimum value of radius R, smaller R is better because of the cost of manufacture. Please notice that because of the inflection of wireless signal, two warships can communicate with each other even there is no sight view between them. Input The input contains multiply test cases. The first line of each test case consists of two integers, n, m (0 < n, m <= 10000), which are the number of places where we can install WSSDs and the number of warships. Each of the next n lines contains two integers, indicating the coordinate of the place where we can install WSSDs. The next m lines indicate the coordinates of warships. The last test case is followed by a single line with two zeros which should not be processed. Please notice that all the values of coordinates are between -10000 to 10000, and no two coordinates have the same value. Output Output the minimum R with two fractional digits. Sample Input 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 0 0 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 -9 0 0 0 Sample Output 0.71 8.00

Problem Description An enemy state of our country is occupying an island of ours. They take lots of warships around the island. Communications among the warships are transited by wireless signal, but we have to separate the warships so that at least ONE pair of warships cannot communicate with each other. For that purpose, we create a kind of Wireless Signal Shielding Device (WSSD) that WSSD can shield the wireless signal in its shielding circle with radius R. The factories could produce enough WSSDs and our patrol team discovered a lot of places that could be installed with WSSDs. In order to separate the warships, we need to know the minimum value of radius R, smaller R is better because of the cost of manufacture. Please notice that because of the inflection of wireless signal, two warships can communicate with each other even there is no sight view between them. Input The input contains multiply test cases. The first line of each test case consists of two integers, n, m (0 < n, m <= 10000), which are the number of places where we can install WSSDs and the number of warships. Each of the next n lines contains two integers, indicating the coordinate of the place where we can install WSSDs. The next m lines indicate the coordinates of warships. The last test case is followed by a single line with two zeros which should not be processed. Please notice that all the values of coordinates are between -10000 to 10000, and no two coordinates have the same value. Output Output the minimum R with two fractional digits. Sample Input 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 0 0 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 -9 0 0 0 Sample Output 0.71 8.00

Problem Description An enemy state of our country is occupying an island of ours. They take lots of warships around the island. Communications among the warships are transited by wireless signal, but we have to separate the warships so that at least ONE pair of warships cannot communicate with each other. For that purpose, we create a kind of Wireless Signal Shielding Device (WSSD) that WSSD can shield the wireless signal in its shielding circle with radius R. The factories could produce enough WSSDs and our patrol team discovered a lot of places that could be installed with WSSDs. In order to separate the warships, we need to know the minimum value of radius R, smaller R is better because of the cost of manufacture. Please notice that because of the inflection of wireless signal, two warships can communicate with each other even there is no sight view between them. Input The input contains multiply test cases. The first line of each test case consists of two integers, n, m (0 < n, m <= 10000), which are the number of places where we can install WSSDs and the number of warships. Each of the next n lines contains two integers, indicating the coordinate of the place where we can install WSSDs. The next m lines indicate the coordinates of warships. The last test case is followed by a single line with two zeros which should not be processed. Please notice that all the values of coordinates are between -10000 to 10000, and no two coordinates have the same value. Output Output the minimum R with two fractional digits. Sample Input 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 0 0 4 3 -1 0 1 0 0 1 0 -1 10 0 9 0 -9 0 0 0 Sample Output 0.71 8.00

Attack
Today is the 10th Annual of “September 11 attacks”, the Al Qaeda is about to attack American again. However, American is protected by a high wall this time, which can be treating as a segment with length N. Al Qaeda has a super weapon, every second it can attack a continuous range of the wall. American deployed N energy shield. Each one defends one unit length of the wall. However, after the shield defends one attack, it needs t seconds to cool down. If the shield defends an attack at kth second, it can’t defend any attack between (k+1)th second and (k+t-1)th second, inclusive. The shield will defend automatically when it is under attack if it is ready. During the war, it is very important to understand the situation of both self and the enemy. So the commanders of American want to know how much time some part of the wall is successfully attacked. Successfully attacked means that the attack is not defended by the shield. InputThe beginning of the data is an integer T (T ≤ 20), the number of test case. The first line of each test case is three integers, N, Q, t, the length of the wall, the number of attacks and queries, and the time each shield needs to cool down. The next Q lines each describe one attack or one query. It may be one of the following formats 1. Attack si ti Al Qaeda attack the wall from si to ti, inclusive. 1 ≤ si ≤ ti ≤ N 2. Query p How many times the pth unit have been successfully attacked. 1 ≤ p ≤ N The kth attack happened at the kth second. Queries don’t take time. 1 ≤ N, Q ≤ 20000 1 ≤ t ≤ 50 OutputFor the ith case, output one line “Case i: ” at first. Then for each query, output one line containing one integer, the number of time the pth unit was successfully attacked when asked. Sample Input2 3 7 2 Attack 1 2 Query 2 Attack 2 3 Query 2 Attack 1 3 Query 1 Query 3 9 7 3 Attack 5 5 Attack 4 6 Attack 3 7 Attack 2 8 Attack 1 9 Query 5 Query 3 Sample OutputCase 1: 0 1 0 1 Case 2: 3 2
Space AI Bombs
Description The time is year 3000. Human beings have settled on planets in many solar systems and have a star war with an alien species called Romulans. The human scientists design a new weapon called AI bomb which is capable of space travel across the vast space. Before launching the weapons, humans send probes to collect Romulan's defense parameters. The data shows that Romulans have set up shields in the routes to their home worlds. Fortunately, some secret information reveals that the shield can be penetrated using an ion beam with a particular range of frequency. It is possible to pass the shield if an AI bomb emits an ion beam within that frequency. Now,human scientists have plotted an interstellar map between several human planets and Romulan planets. The map is a directed graph like Figure 4. In the figure, human planets are drawn in boxes (denoted as Hx) and Romulan worlds are drawn in triangles (denoted as Rx), where x is an integer number. A shield is drawn as a circle in the figure (denoted as Sx). Since humans only know where the shields are but do not know the frequency of each shield, they decide to launch a large number of AI bombs. Each bomb is configured to emit an ion beam at a particular frequency at first. Once an AI bomb passes a shield, it will modulate its frequency to a different value by increasing or decreasing a predefined value. For example, in Figure 4, an AI bomb B1 is launched from H3 with initial frequency 150 and an interval (+/-) 100. So, when B1 penetrates shield S5, it may modulate its frequency to 50, 250, or keep its previous frequency 150. After that, the bomb can choose any routes available in the star map. In the example, the bomb B1 is possible to reach Romulan homeworld R9 by penetrating S5 with the original frequency 150 and then passing S4 by changing its frequency to 250 and keeping frequency 250 to pass S5 again and by changing its frequency to 350 in order to penetrate S7 and then finally nuking Romulan planet R9. Unfortunately, Romulans knows what humans are planning. Their spies got the map and the bomb parameters. Of course, Romulans have shield parameters at hand.They want to know if there are any AI bombs which can reach their homeworlds under current shield settings. Please note that human AI bombs can choose any route to travel. If an AI bomb has any chance to reach a Romulan's home world, then the bomb must be reported. Please write a program for the Romulan to defend vicious humans. To simplify the problem, we restrict the frequency values between 0 and 1000. When a bomb's new frequency is outside the range, the new frequency is invalid. Input The test data begins with a number n in a line which is the number of test cases. In each test case, it begins with two numbers v and e in a line where v is the number of vertices (including human planets, Romulan planets, and shields) and e is the number of directed edges, 2<= v <= 100000 and 2 <= e <= 500000. For convenience, the vertices are indexed starting with 1. Next, a line beginning with 'human m' tells that there are m human planets. Following the string are m integers, which are the indices of human planets. Same as above, a string 'romulan k' is used to tell the vertex indices of Romulan's planets. A string 'shield x' begins the shield parameters, where x is the number of shields. Each shield parameter is described by (s l u), where s is the shield's index, l is the lower bound of the range, and u is the upper bound of the range. The values of l and u is between 0 and 1000. A string 'edge u' begins the directed edge data, where u is the number of edges.Each edge is described by (s d), where s is the index of the source vertex and d is the index of end vertex. A string 'bomb p' begins with the data of deployed AI bombs, where p is the number of bombs and 1 <= p <= 10000. Each bomb is described by (h f i), where h is the index of a vertex (i.e., a human planets where the bomb is located), f is the initial frequency,and i is the interval to be increased/decreased. Output Please output the number of bombs that can possibly reach any of the Romulan homeworlds in one line for each test case. Note that, a bomb may be able to reach more than one Romulan planets. In that case, it is still counted as 1. Sample Input 1 9 9 human 3 1 2 3 romulan 2 8 9 shield 4 4 200 400 5 100 300 6 100 200 7 350 500 edge 9 1 6 6 8 2 4 4 6 4 5 5 4 3 5 5 7 7 9 bomb 2 3 150 100 2 250 50 Sample Output 2

js设置div可以拖动之后 div里面的input无法输入

Description As you may know from the comic “Asterix and the Chieftain’s Shield”, Gergovia consists of one street, and every inhabitant of the city is a wine salesman. You wonder how this economy works? Simple enough: everyone buys wine from other inhabitants of the city. Every day each inhabitant decides how much wine he wants to buy or sell. Interestingly, demand and supply is always the same, so that each inhabitant gets what he wants. There is one problem, however: Transporting wine from one house to another results in work. Since all wines are equally good, the inhabitants of Gergovia don’t care which persons they are doing trade with, they are only interested in selling or buying a specific amount of wine. They are clever enough to figure out a way of trading so that the overall amount of work needed for transports is minimized. In this problem you are asked to reconstruct the trading during one day in Gergovia. For simplicity we will assume that the houses are built along a straight line with equal distance between adjacent houses. Transporting one bottle of wine from one house to an adjacent house results in one unit of work. Input The input consists of several test cases. Each test case starts with the number of inhabitants n (2 ≤ n ≤ 100000). The following line contains n integers ai (−1000 ≤ ai ≤ 1000). If ai ≥ 0, it means that the inhabitant living in the ith house wants to buy ai bottles of wine, otherwise if ai < 0, he wants to sell −ai bottles of wine. You may assume that the numbers ai sum up to 0. The last test case is followed by a line containing 0. Output For each test case print the minimum amount of work units needed so that every inhabitant has his demand fulfilled. You may assume that this number fits into a signed 64-bit integer (in C/C++ you can use the data type “long long” or “__int64”, in JAVA the data type “long”). Sample Input 5 5 -4 1 -3 1 6 -1000 -1000 -1000 1000 1000 1000 0 Sample Output 9 9000

Java学习的正确打开方式

linux系列之常用运维命令整理笔录

Vue + Spring Boot 项目实战（十四）：用户认证方案与完善的访问拦截

Python十大装B语法
Python 是一种代表简单思想的语言，其语法相对简单，很容易上手。不过，如果就此小视 Python 语法的精妙和深邃，那就大错特错了。本文精心筛选了最能展现 Python 语法之精妙的十个知识点，并附上详细的实例代码。如能在实战中融会贯通、灵活使用，必将使代码更为精炼、高效，同时也会极大提升代码B格，使之看上去更老练，读起来更优雅。 1. for - else 什么？不是 if 和 else 才

2019年11月中国大陆编程语言排行榜
2019年11月2日，我统计了某招聘网站，获得有效程序员招聘数据9万条。针对招聘信息，提取编程语言关键字，并统计如下： 编程语言比例 rank pl_ percentage 1 java 33.62% 2 c/c++ 16.42% 3 c_sharp 12.82% 4 javascript 12.31% 5 python 7.93% 6 go 7.25% 7

SQL-小白最佳入门sql查询一

“狗屁不通文章生成器”登顶GitHub热榜，分分钟写出万字形式主义大作

IT界知名的程序员曾说：对于那些月薪三万以下，自称IT工程师的码农们，其实我们从来没有把他们归为我们IT工程师的队伍。他们虽然总是以IT工程师自居，但只是他们一厢情愿罢了。 此话一出，不知激起了多少(码农)程序员的愤怒，却又无可奈何，于是码农问程序员。 码农：你知道get和post请求到底有什么区别？ 程序员：你看这篇就知道了。 码农：你月薪三万了？ 程序员：嗯。 码农：你是怎么做到的? 程序员：
《程序人生》系列-这个程序员只用了20行代码就拿了冠军

11月8日，由中国信息通信研究院、中国通信标准化协会、中国互联网协会、可信区块链推进计划联合主办，科技行者协办的2019可信区块链峰会将在北京悠唐皇冠假日酒店开幕。 　　区块链技术被认为是继蒸汽机、电力、互联网之后，下一代颠覆性的核心技术。如果说蒸汽机释放了人类的生产力，电力解决了人类基本的生活需求，互联网彻底改变了信息传递的方式，区块链作为构造信任的技术有重要的价值。 　　1

【技巧总结】位运算装逼指南

《C++ Primer》学习笔记（六）：C++模块设计——函数

8年经验面试官详解 Java 面试秘诀
作者 | 胡书敏 责编 | 刘静 出品 | CSDN（ID：CSDNnews） 本人目前在一家知名外企担任架构师，而且最近八年来，在多家外企和互联网公司担任Java技术面试官，前后累计面试了有两三百位候选人。在本文里，就将结合本人的面试经验，针对Java初学者、Java初级开发和Java开发，给出若干准备简历和准备面试的建议。   Java程序员准备和投递简历的实

1.两种思维方式在求职面试中，经常会考察这种问题：北京有多少量特斯拉汽车？ 某胡同口的煎饼摊一年能卖出多少个煎饼？ 深圳有多少个产品经理？ 一辆公交车里能装下多少个乒乓球？ 一
so easy！ 10行代码写个"狗屁不通"文章生成器

MySQL数据库总结