html引入了一个design.css文件后加载特别慢

我在HTML中引入了一个已经写好的css文件design.css,这个文件大约3600多KB,我用了一个js函数监测加载这个css文件需要的时间,结果竟然是三秒多,这是个不能接受的时间,怎么能够提高HTML网页对这个外部css文件的加载速度,缩短整个网页的加载时间,各路大神,小弟跪求不吝赐教

5个回答

如果非用不可,就要启用gzip并且提高压缩比

ma1030153182
马鹏程 windows下怎么使用Gzip,IIS中右击网站没有属性选项
4 年多之前 回复

启用gzip压缩,提高网页速度

引入的是本地文件还是别的服务器的

ma1030153182
马鹏程 本地的,html网页用的bootstrap,能够自适应屏幕大小,用电脑看速度还可以,但是用手机看就慢很多了,很多用户都是用手机访问的,我测了一下网页加载时间,需要六秒多
4 年多之前 回复

gzip压缩,提高网页速度

或者预先加载好,然后直接用

Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
其他相关推荐
自己发布UI库npm包怎么按需引入css
![图片说明](https://img-ask.csdn.net/upload/202001/07/1578363429_462089.png) 我自己按照ant-design的方式封装了公司需要的ui组件库,是想着按照ant-design那种方式引入模块和babel按需引入css,这部分改怎么配置呢,求大神详解。
A Famous King’s Trip 旅行的问题
Problem Description Mr. B is the chief engineer in the Kingdom of FDUCS. Recently, the King asks Mr. B to develop a new plan of the road network in the country, since the existing one is so outdated that traffic jam often occurs. Unfortunately, Mr. B is now busy preparing for the ICPC World Finals. Therefore, He asks his friends Mr. G and Mr. M to help him finish that work. When Mr. B gets the solution from his friends, he realizes some problems: Mr. B forgot to specify the budget plan to Mr. G and Mr. M, thus the new solution contains too many new roads which the government cannot afford. After a precise calculation, Mr. B finds that he only need to delete exactly two roads in term of the financial facts (Of course, Mr. B will not delete more than two roads because he wants people in his country to have a convenient traffic). Can Mr. B delete two roads arbitrarily? The answer is negative. The King would like to take a travel on the new road system to review Mr. B's work. However, the King is so busy that he does not want to take travel with redundancy. That is, the King wants Mr. B to design a road system so that he can travel from the palace (in one city), pass each road exactly once, and then return to the palace. Moreover, during his travelling, the king must visit each city at least once. Mr. B feels hard to satisfy the King’s demand by deleting two roads from the original design. As an ICPC candidate with unlimited potential, can you help him? Input For each test case, the first line contains two integers, n and m (1 <= n, m <= 200,000), indicating the number of cities in the Kingdom and the roads in Mr. B's original plan. Following this are m lines, each contains a pair of integers a and b, denoting a bidirectional road between city a and city b (1 <= a, b <= n and a != b), the number of cities are counted from 1. No two roads connect the same pair of cities. Output For each test case, if Mr. B can satisfy the King’s requirement, then output “YES” in the first line, otherwise output “NO” (quotes for clarifying). If the answer is “YES”, output two integers X and Y (X < Y) in the following line, specifying the two roads that Mr. B should delete from the original design. X and Y are the indexes of roads in the input, counting from 1. If there are more than one possible answer, output the one that makes the pair of (X, Y) lexicographically smallest. Sample Input 4 6 1 2 1 3 1 4 2 3 2 4 3 4 Sample Output Case 1: YES 1 6
Computational Geometry? 几何的计算
Problem Description Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. It often comes up with charming shapes and ideas. In this problem, our poor princess is trapped in a castle by some bad guys again, yeah, again. So, let's seize the chance to be a hero. Right now, the beautiful princess is in the original point of a Cartesian coordinate system, for simplification, the castle is treated as a coordinate system, like a common computational geometry problem. There is a bomb which can be exploded anytime, and it locates at (Xo, Yo) in the castle. To save the princess, we need design a route for her to leave away the bomb as far as possible. But she already has a plan written on her notebook, which contains some vectors, and she insists on escaping in the vectors’ direction one by one, that is, if she is in point(0, 0), and the vector is (X, Y), she will be in point(X, Y) if she escapes in this vector. You get her notebook now, and find princess's plan is a not a good plan sometimes. Then you decide to help the princess to make some slight modification, you can change the order of those vectors, and/or reverse some vectors, that is, change vector (X, Y) to vector (-X, -Y). We want to know the maximum distance to the bomb after modification. Input The first line contains a single integer T, indicating the number of test cases. Each test case begins with three integers N, Xo, Yo. Then N lines following, each line contains two integers, Xi and Yi, indicating a vector. Technical Specification 1. 1 <= T <= 100 2. 1 <= N <= 100 3. -100 <= Xi, Yi <= 100 4. -10 000 <= Xo, Yo <= 10 000 Output For each test case, output the case number first, then the distance rounded to three fractional digits. Sample Input 3 1 1 1 1 1 2 2 3 -1 2 1 -2 3 3 0 2 3 3 2 1 -1 Sample Output Case 1: 2.828 Case 2: 7.000 Case 3: 9.849
维护很久前的项目 莫名其妙的导入design
前几天维护一个很久前的项目,想转到安卓x,结果对jar包升级的时候有一个design一直存在,并且报错把jar包转移到新项目中也不会出现这个design 下面贴图![图片说明](https://img-ask.csdn.net/upload/201912/07/1575657133_874940.jpg) apply plugin: 'com.android.application' apply plugin: "findbugs" /*apply from: 'tinker-support.gradle' apply plugin: 'packer'*/ task findbugs(type: FindBugs, dependsOn: 'assembleDebug') { ignoreFailures = true effort = "default" reportLevel = "high" println("$project.buildDir") classes = files("$project.buildDir/intermediates/classes") source = fileTree("src/main/java/") classpath = files() reports { xml.enabled = false html.enabled = true xml { destination file ("$project.buildDir/findbugs.xml") } html { destination file("$project.buildDir/findbugs.html") } } } android { lintOptions { checkReleaseBuilds false abortOnError false } compileSdkVersion 29 buildToolsVersion "29.0.2" sourceSets { main { jniLibs.srcDir 'libs' } // Move the tests to tests/java, tests/res, etc... //instrumentTest.setRoot('tests') // Move the build types to build-types/<type> // For instance, build-types/debug/java, build-types/debug/AndroidManifest.xml, ... // This moves them out of them default location under src/<type>/... which would // conflict with src/ being used by the main source set. // Adding new build types or product flavors should be accompanied // by a similar customization. debug.setRoot('build-types/debug') release.setRoot('build-types/release') } defaultConfig { applicationId "com.goodlive.flying" minSdkVersion 21 targetSdkVersion 29 versionCode 20180228 versionName "1.5.9" //versionName "1.5.2"正式版 // Enabling multidex support. multiDexEnabled true ndk { // 设置支持的SO库架构 abiFilters 'armeabi' , 'x86'//, 'armeabi-v7a', 'x86_64', 'arm64-v8a' } } dexOptions { javaMaxHeapSize "4g" } signingConfigs { release { storeFile file('.jks') storePassword "" keyAlias "" keyPassword "" // 满足下面两个条件时需要此配置 // 1. Gradle版本 >= 2.14.1 // 2. Android Gradle Plugin 版本 >= 2.2.0 // 作用是只使用旧版签名,禁用V2版签名模式 v2SigningEnabled false } debug { storeFile file('.jks') storePassword "" keyAlias "" keyPassword "" } } buildTypes { release { //启用混淆配置 //Zip代码压缩优化 // zipAlignEnabled true //移除无用资源 // shrinkResources true // debuggable true //加载默认混淆文件 proguardFiles getDefaultProguardFile('proguard-android.txt'), 'proguard-rules.pro' signingConfig signingConfigs.release } debug { //启用混淆配置 minifyEnabled false //Zip代码压缩优化 // zipAlignEnabled true //移除无用资源 // shrinkResources true //debugs使用release签名 //加载默认混淆文件 proguardFiles getDefaultProguardFile('proguard-android.txt'), 'proguard-rules.pro' signingConfig signingConfigs.release } } } dependencies { implementation fileTree(dir: 'libs', include: ['*.jar']) implementation project(path: ':PushSDK') implementation 'androidx.appcompat:appcompat:1.1.0' implementation 'androidx.constraintlayout:constraintlayout:1.1.3' testImplementation 'junit:junit:4.12' androidTestImplementation 'androidx.test:runner:1.2.0' androidTestImplementation 'androidx.test.espresso:espresso-core:3.2.0' // implementation files('libs/SocialSDK_WeiXin_Full.jar') //dagger2 implementation 'com.qianwen:update-app:3.3.3' implementation 'com.lzy.net:okgo:3.0.4' implementation 'androidx.appcompat:appcompat:1.1.0' implementation 'androidx.recyclerview:recyclerview:1.1.0' implementation 'androidx.cardview:cardview:1.0.0' implementation ('com.google.android.material:material:1.0.0'){ exclude group: 'com.android.support' } implementation ('com.jakewharton:butterknife:8.1.0'){ exclude group: 'com.android.support' } implementation 'com.android.support:multidex:1.0.3' implementation 'com.mcxiaoke.gradle:packer-helper:1.0.9' implementation ('com.github.bumptech.glide:glide:4.0.0-RC0'){ exclude group: 'com.android.support' } implementation 'com.tencent.bugly:crashreport_upgrade:1.4.2' //w implementation ('com.github.lygttpod:SuperTextView:1.0.7'){ exclude group: 'com.android.support' } implementation 'com.orhanobut:logger:1.15' //w implementation ('com.github.CymChad:BaseRecyclerViewAdapterHelper:2.9.13'){ exclude group: 'com.android.support' } implementation 'com.blankj:utilcode:1.3.1' implementation 'cn.finalteam:galleryfinal:1.4.8.7' implementation 'com.google.code.gson:gson:2.8.2' implementation 'org.greenrobot:eventbus:3.0.0' implementation 'com.squareup.okhttp3:okhttp:3.10.0' implementation 'com.roughike:bottom-bar:2.0.2' implementation 'com.squareup.okhttp3:logging-interceptor:3.4.1' implementation 'com.squareup.okhttp3:okhttp-urlconnection:3.4.1' implementation 'io.reactivex:rxandroid:1.2.1' implementation 'io.reactivex:rxjava:1.2.1' implementation 'com.squareup.retrofit2:retrofit:2.1.0' implementation 'com.squareup.retrofit2:adapter-rxjava:2.1.0' implementation 'com.squareup.retrofit2:converter-gson:2.1.0' implementation 'com.trello:rxlifecycle-components:0.6.1' implementation 'com.jakewharton.rxbinding:rxbinding:0.4.0' implementation 'com.jakewharton.rxbinding:rxbinding-appcompat-v7:0.3.0' implementation 'com.jakewharton.rxbinding:rxbinding-design:0.3.0' implementation 'com.facebook.stetho:stetho:1.5.0' implementation 'com.facebook.stetho:stetho-okhttp3:1.5.0' implementation 'com.lsjwzh:materialloadingprogressbar:0.5.8-RELEASE' implementation 'me.shaohui.advancedluban:library:1.3.3' implementation 'com.dinuscxj:recycleritemdecoration:1.0.0' implementation 'com.umeng.analytics:analytics:6.1.4' implementation 'androidx.constraintlayout:constraintlayout:1.1.3' implementation 'com.zhy:flowlayout-lib:1.0.3' implementation 'com.afollestad.material-dialogs:core:0.9.4.5' implementation 'com.google.dagger:dagger:2.11-rc2' implementation 'se.emilsjolander:stickylistheaders:2.7.0' testImplementation 'junit:junit:4.12' implementation 'com.bigkoo:quicksidebar:1.0.3' annotationProcessor 'com.github.bumptech.glide:compiler:4.0.0-RC0' annotationProcessor 'com.jakewharton:butterknife-compiler:8.1.0' annotationProcessor 'com.google.dagger:dagger-compiler:2.11-rc2' implementation 'com.github.razerdp:BasePopup:1.9.1' implementation 'com.makeramen:roundedimageview:2.3.0' implementation("com.github.hotchemi:permissionsdispatcher:3.1.0") { // if you don't use android.app.Fragment you can exclude support for them exclude module: "support-v13" } annotationProcessor "com.github.hotchemi:permissionsdispatcher-processor:3.1.0" } ``` 求助大神啊 ```
C# Visio开发鱼骨图 没有注册类 异常来自 HRESULT:0x80040154
private AxVisioViewer.AxViewer axViewer1; 这行代码音用了.AxViewer控件加载不出来 我在程序中引用的有AxInterop.AxVisioViewer 我觉得问题应该是在COM组件中没有注册 可是工具箱添加COM组件中只有Drawing Control 没有AxVisioViewer 用Resvger32命令注册AxInterop.AxVisioViewer.dll 也报错 说请确保为有效的dll文件 目标平台是X86的、、、 private AxCELL50Lib.AxCell axCell1; 同样引入的这个空间就好使 引入部分和工具箱添加部分的com组件都有这个 错误的堆栈信息 在 System.Windows.Forms.UnsafeNativeMethods.CoCreateInstance(Guid& clsid, Object punkOuter, Int32 context, Guid& iid) 在 System.Windows.Forms.AxHost.CreateInstanceCore(Guid clsid) 在 System.Windows.Forms.AxHost.CreateInstance() 在 System.Windows.Forms.AxHost.GetOcxCreate() 在 System.Windows.Forms.AxHost.set_Site(ISite value) 在 System.ComponentModel.Container.Add(IComponent component, String name) 在 System.ComponentModel.Design.DesignerHost.PerformAdd(IComponent component, String name) 在 System.ComponentModel.Design.DesignerHost.System.ComponentModel.Design.IDesignerHost.CreateComponent(Type componentType, String name) 在 System.ComponentModel.Design.Serialization.DesignerSerializationManager.CreateInstance(Type type, ICollection arguments, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.DesignerSerializationManager.System.ComponentModel.Design.Serialization.IDesignerSerializationManager.CreateInstance(Type type, ICollection arguments, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.CodeDomSerializerBase.DeserializeInstance(IDesignerSerializationManager manager, Type type, Object[] parameters, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.ComponentCodeDomSerializer.DeserializeInstance(IDesignerSerializationManager manager, Type type, Object[] parameters, String name, Boolean addToContainer) 在 System.ComponentModel.Design.Serialization.CodeDomSerializerBase.DeserializeExpression(IDesignerSerializationManager manager, String name, CodeExpression expression) 在 System.ComponentModel.Design.Serialization.CodeDomSerializer.DeserializeStatementToInstance(IDesignerSerializationManager manager, CodeStatement statement) 在 System.ComponentModel.Design.Serialization.CodeDomSerializer.Deserialize(IDesignerSerializationManager manager, Object codeObject) 在 System.Windows.Forms.Design.ControlCodeDomSerializer.Deserialize(IDesignerSerializationManager manager, Object codeObject) 在 System.ComponentModel.Design.Serialization.TypeCodeDomSerializer.DeserializeName(IDesignerSerializationManager manager, String name, CodeStatementCollection statements)
Design T-Shirt
Problem Description Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a mission-impossible to have everybody perfectly satisfied. So he took a poll to collect people's opinions. Here are what he obtained: N people voted for M design elements (such as the ACM-ICPC logo, big names in computer science, well-known graphs, etc.). Everyone assigned each element a number of satisfaction. However, XKA can only put K (<=M) elements into his design. He needs you to pick for him the K elements such that the total number of satisfaction is maximized. Input The input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements XKA will put into his design. Then N lines follow, each contains M numbers. The j-th number in the i-th line represents the i-th person's satisfaction on the j-th element. Output For each test case, print in one line the indices of the K elements you would suggest XKA to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in non-increasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line. Sample Input 3 6 4 2 2.5 5 1 3 4 5 1 3.5 2 2 2 1 1 1 1 1 10 3 3 2 1 2 3 2 3 1 3 1 2 Sample Output 6 5 3 1 2 1
在编辑框中用了ant design的a-range-picker标签,怎么将该行的日期回填到该主键上
![图片说明](https://img-ask.csdn.net/upload/202001/08/1578458233_268854.png)
Graph Generation 图的生成
Problem Description You are design a graphics generator to create a graph called "GStar". GStar is defined by recursive, the first level "GStar", the GStar(1), is a square like the graph below: +-+ |.| +-+ Then we divide every edge of the GStar(1) into three part, and draw a new square outward on the middle part. Thus we get the GStar(2), like the graph below: ....+-+.... ....|.|.... ..+-+.+-+.. ..|.....|.. +-+.....+-+ |.........| +-+.....+-+ ..|.....|.. ..+-+.+-+.. ....|.|.... ....+-+.... We can get GStar(n) from GStar(n-1) by split the outer bound of every edge on GStar(n-1) into three part and draw a square outward taking place the middle part. The following graph is the GStar(3), pay attention that outer bound touches itself but the inner part are also "outer bound", so the edges are used in generation on the next level of GStar. ................+-+................ ................|.|................ ..............+-+.+-+.............. ..............|.....|.............. ............+-+.....+-+............ ............|.........|............ ..........+-+-+.....+-+-+.......... ..........|.|.|.....|.|.|.......... ........+-+.+-+.....+-+.+-+........ ........|.................|........ ......+-+.................+-+...... ......|.....................|...... ....+-+-+.................+-+-+.... ....|.|.|.................|.|.|.... ..+-+.+-+.................+-+.+-+.. ..|.............................|.. +-+.............................+-+ |.................................| +-+.............................+-+ ..|.............................|.. ..+-+.+-+.................+-+.+-+.. ....|.|.|.................|.|.|.... ....+-+-+.................+-+-+.... ......|.....................|...... ......+-+.................+-+...... ........|.................|........ ........+-+.+-+.....+-+.+-+........ ..........|.|.|.....|.|.|.......... ..........+-+-+.....+-+-+.......... ............|.........|............ ............+-+.....+-+............ ..............|.....|.............. ..............+-+.+-+.............. ................|.|................ ................+-+................ Input The input contains several test cases, the first line of test case contains an integer denoting the number of test cases. For each test cases, there are only three integers K, X, Y. Where K denoting the level of GStar. And you are to output a part of the graph from (X,Y) to (X+9,Y+9), a 10*10 matrix. Where the top-left corner is define as (0,0) and the Y-th character of X-th line is define as (X-1,Y-1). Notice that the empty cell are filled with ".". (1 <= K <= 10, 0 <= X, Y <= 30000) Output For each test cases, output the character matrix. See example for further details. Sample Input 3 1 1 1 2 1 1 5 88 72 Sample Output Case 1: .|........ -+........ .......... .......... .......... .......... .......... .......... .......... .......... Case 2: ...|.|.... .+-+.+-+.. .|.....|.. -+.....+-+ .........| -+.....+-+ .|.....|.. .+-+.+-+.. ...|.|.... ...+-+.... Case 3: +-+....... |......... +-+....... |.|....... +-+-+.+-+. ..|.|.|.|. ..+-+-+-+. ....|.|... ..+-+-+-+. ..|.|.|.|.
C#委託事件如何更新UI的值
我想在一個委託事件中更新ui值,但是總是報錯,請幫我看看: ``` System.InvalidOperationException: '跨執行緒作業無效: 存取控制項 'tb_log' 時所使用的執行緒與建立控制項的執行緒不同。' ``` 我的代碼如下: ``` using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Diagnostics; using System.Drawing; using System.IO; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; namespace MavenInstall { public partial class MavenInstall : Form { public delegate void OutDelegate(string txt); public OutDelegate outDelegate; public MavenInstall() { InitializeComponent(); tb_packaging.Text = "jar"; outDelegate = UpdateLog; //tb_command.Text = "mvn install:install-file -DgroupId={0} -DartifactId={1} -Dversion={2} -Dpackaging={3} -Dfile={4}"; } private void btn_select_Click(object sender, EventArgs e) { if (SelectJarFile.ShowDialog() == DialogResult.OK) { tb_file.Text = SelectJarFile.FileName; } } private void btn_execute_Click(object sender, EventArgs e) { tb_log.Text = null; foreach (Control control in gb_condition.Controls) { control.Enabled = false; } String cmd = String.Format(@"mvn install:install-file -DgroupId={0} -DartifactId={1} -Dversion={2} -Dpackaging={3} -Dfile={4}" , tb_groupid.Text,tb_artifactid.Text ,tb_version.Text,tb_packaging.Text,tb_file.Text); tb_command.Text = cmd; Process process = new Process(); process.StartInfo.FileName = "cmd.exe"; process.StartInfo.UseShellExecute = false; //是否使用操作系统shell启动 process.StartInfo.RedirectStandardInput = true;//接受来自调用程序的输入信息 process.StartInfo.RedirectStandardOutput = true;//由调用程序获取输出信息 process.StartInfo.RedirectStandardError = true;//重定向标准错误输出 process.StartInfo.CreateNoWindow = true;//不显示程序窗口 process.Start();//启动程序 process.OutputDataReceived += new DataReceivedEventHandler(OutputDataHandler); process.BeginOutputReadLine(); process.StandardInput.WriteLine(cmd); process.StandardInput.AutoFlush = true; process.StandardInput.WriteLine("exit"); process.WaitForExit();//等待程序执行完退出进程 foreach (Control control in gb_condition.Controls) { control.Enabled = true; } process.Close(); } private void OutputDataHandler(object sender, DataReceivedEventArgs e) { if (!string.IsNullOrEmpty(e.Data)) { //UpdateLog(e.Data); outDelegate.Invoke(e.Data); } } private void UpdateLog(string txt) { //if (tb_log.InvokeRequired) //{ // tb_log.Invoke(outDelegate, txt); //} //else //{ // this.tb_log.Text += txt + "\r\n"; //} this.tb_log.Text += txt + "\r\n"; } private void btn_clear_Click(object sender, EventArgs e) { tb_groupid.Text = null; tb_artifactid.Text = null; tb_version.Text = null; tb_packaging.Text = null; tb_file.Text = null; tb_command.Text = null; tb_log.Text = null; } } } ``` design文件 ``` namespace MavenInstall { partial class MavenInstall { /// <summary> /// 設計工具所需的變數。 /// </summary> private System.ComponentModel.IContainer components = null; /// <summary> /// 清除任何使用中的資源。 /// </summary> /// <param name="disposing">如果應該處置受控資源則為 true,否則為 false。</param> protected override void Dispose(bool disposing) { if (disposing && (components != null)) { components.Dispose(); } base.Dispose(disposing); } #region Windows Form 設計工具產生的程式碼 /// <summary> /// 此為設計工具支援所需的方法 - 請勿使用程式碼編輯器修改 /// 這個方法的內容。 /// </summary> private void InitializeComponent() { this.splitContainer1 = new System.Windows.Forms.SplitContainer(); this.panel1 = new System.Windows.Forms.Panel(); this.btn_clear = new System.Windows.Forms.Button(); this.btn_execute = new System.Windows.Forms.Button(); this.gb_condition = new System.Windows.Forms.GroupBox(); this.tb_command = new System.Windows.Forms.TextBox(); this.btn_select = new System.Windows.Forms.Button(); this.lb_Command = new System.Windows.Forms.Label(); this.tb_file = new System.Windows.Forms.TextBox(); this.lb_File = new System.Windows.Forms.Label(); this.tb_packaging = new System.Windows.Forms.TextBox(); this.lb_Packaging = new System.Windows.Forms.Label(); this.tb_version = new System.Windows.Forms.TextBox(); this.lb_Version = new System.Windows.Forms.Label(); this.tb_artifactid = new System.Windows.Forms.TextBox(); this.lb_ArtifactId = new System.Windows.Forms.Label(); this.tb_groupid = new System.Windows.Forms.TextBox(); this.lb_GroupId = new System.Windows.Forms.Label(); this.groupBox1 = new System.Windows.Forms.GroupBox(); this.tb_log = new System.Windows.Forms.TextBox(); this.SelectJarFile = new System.Windows.Forms.OpenFileDialog(); ((System.ComponentModel.ISupportInitialize)(this.splitContainer1)).BeginInit(); this.splitContainer1.Panel1.SuspendLayout(); this.splitContainer1.Panel2.SuspendLayout(); this.splitContainer1.SuspendLayout(); this.panel1.SuspendLayout(); this.gb_condition.SuspendLayout(); this.groupBox1.SuspendLayout(); this.SuspendLayout(); // // splitContainer1 // this.splitContainer1.Dock = System.Windows.Forms.DockStyle.Fill; this.splitContainer1.Location = new System.Drawing.Point(0, 0); this.splitContainer1.Margin = new System.Windows.Forms.Padding(4); this.splitContainer1.Name = "splitContainer1"; // // splitContainer1.Panel1 // this.splitContainer1.Panel1.Controls.Add(this.panel1); this.splitContainer1.Panel1.Controls.Add(this.gb_condition); // // splitContainer1.Panel2 // this.splitContainer1.Panel2.Controls.Add(this.groupBox1); this.splitContainer1.Size = new System.Drawing.Size(1067, 372); this.splitContainer1.SplitterDistance = 348; this.splitContainer1.SplitterWidth = 5; this.splitContainer1.TabIndex = 0; // // panel1 // this.panel1.Controls.Add(this.btn_clear); this.panel1.Controls.Add(this.btn_execute); this.panel1.Dock = System.Windows.Forms.DockStyle.Bottom; this.panel1.Location = new System.Drawing.Point(0, 328); this.panel1.Margin = new System.Windows.Forms.Padding(4); this.panel1.Name = "panel1"; this.panel1.Size = new System.Drawing.Size(348, 44); this.panel1.TabIndex = 1; // // btn_clear // this.btn_clear.Location = new System.Drawing.Point(240, 8); this.btn_clear.Margin = new System.Windows.Forms.Padding(4); this.btn_clear.Name = "btn_clear"; this.btn_clear.Size = new System.Drawing.Size(100, 29); this.btn_clear.TabIndex = 0; this.btn_clear.Text = "Clear(&C)"; this.btn_clear.UseVisualStyleBackColor = true; this.btn_clear.Click += new System.EventHandler(this.btn_clear_Click); // // btn_execute // this.btn_execute.Location = new System.Drawing.Point(8, 8); this.btn_execute.Margin = new System.Windows.Forms.Padding(4); this.btn_execute.Name = "btn_execute"; this.btn_execute.Size = new System.Drawing.Size(97, 29); this.btn_execute.TabIndex = 0; this.btn_execute.Text = "Execute(&E)"; this.btn_execute.UseVisualStyleBackColor = true; this.btn_execute.Click += new System.EventHandler(this.btn_execute_Click); // // gb_condition // this.gb_condition.Controls.Add(this.tb_command); this.gb_condition.Controls.Add(this.btn_select); this.gb_condition.Controls.Add(this.lb_Command); this.gb_condition.Controls.Add(this.tb_file); this.gb_condition.Controls.Add(this.lb_File); this.gb_condition.Controls.Add(this.tb_packaging); this.gb_condition.Controls.Add(this.lb_Packaging); this.gb_condition.Controls.Add(this.tb_version); this.gb_condition.Controls.Add(this.lb_Version); this.gb_condition.Controls.Add(this.tb_artifactid); this.gb_condition.Controls.Add(this.lb_ArtifactId); this.gb_condition.Controls.Add(this.tb_groupid); this.gb_condition.Controls.Add(this.lb_GroupId); this.gb_condition.Dock = System.Windows.Forms.DockStyle.Fill; this.gb_condition.Location = new System.Drawing.Point(0, 0); this.gb_condition.Margin = new System.Windows.Forms.Padding(4); this.gb_condition.Name = "gb_condition"; this.gb_condition.Padding = new System.Windows.Forms.Padding(4); this.gb_condition.Size = new System.Drawing.Size(348, 372); this.gb_condition.TabIndex = 0; this.gb_condition.TabStop = false; this.gb_condition.Text = "Condition"; // // tb_command // this.tb_command.Location = new System.Drawing.Point(92, 196); this.tb_command.Margin = new System.Windows.Forms.Padding(4); this.tb_command.Multiline = true; this.tb_command.Name = "tb_command"; this.tb_command.ReadOnly = true; this.tb_command.Size = new System.Drawing.Size(247, 115); this.tb_command.TabIndex = 1; // // btn_select // this.btn_select.Location = new System.Drawing.Point(253, 161); this.btn_select.Margin = new System.Windows.Forms.Padding(4); this.btn_select.Name = "btn_select"; this.btn_select.Size = new System.Drawing.Size(87, 29); this.btn_select.TabIndex = 0; this.btn_select.Text = "Select(&S)"; this.btn_select.UseVisualStyleBackColor = true; this.btn_select.Click += new System.EventHandler(this.btn_select_Click); // // lb_Command // this.lb_Command.AutoSize = true; this.lb_Command.Location = new System.Drawing.Point(12, 202); this.lb_Command.Margin = new System.Windows.Forms.Padding(4, 0, 4, 0); this.lb_Command.Name = "lb_Command"; this.lb_Command.Size = new System.Drawing.Size(69, 15); this.lb_Command.TabIndex = 0; this.lb_Command.Text = "Command:"; // // tb_file // this.tb_file.Location = new System.Drawing.Point(92, 161); this.tb_file.Margin = new System.Windows.Forms.Padding(4); this.tb_file.Name = "tb_file"; this.tb_file.Size = new System.Drawing.Size(152, 25); this.tb_file.TabIndex = 1; // // lb_File // this.lb_File.AutoSize = true; this.lb_File.Location = new System.Drawing.Point(55, 168); this.lb_File.Margin = new System.Windows.Forms.Padding(4, 0, 4, 0); this.lb_File.Name = "lb_File"; this.lb_File.Size = new System.Drawing.Size(33, 15); this.lb_File.TabIndex = 0; this.lb_File.Text = "File:"; // // tb_packaging // this.tb_packaging.Location = new System.Drawing.Point(92, 126); this.tb_packaging.Margin = new System.Windows.Forms.Padding(4); this.tb_packaging.Name = "tb_packaging"; this.tb_packaging.Size = new System.Drawing.Size(247, 25); this.tb_packaging.TabIndex = 1; // // lb_Packaging // this.lb_Packaging.AutoSize = true; this.lb_Packaging.Location = new System.Drawing.Point(13, 132); this.lb_Packaging.Margin = new System.Windows.Forms.Padding(4, 0, 4, 0); this.lb_Packaging.Name = "lb_Packaging"; this.lb_Packaging.Size = new System.Drawing.Size(69, 15); this.lb_Packaging.TabIndex = 0; this.lb_Packaging.Text = "Packaging:"; // // tb_version // this.tb_version.Location = new System.Drawing.Point(92, 91); this.tb_version.Margin = new System.Windows.Forms.Padding(4); this.tb_version.Name = "tb_version"; this.tb_version.Size = new System.Drawing.Size(247, 25); this.tb_version.TabIndex = 1; // // lb_Version // this.lb_Version.AutoSize = true; this.lb_Version.Location = new System.Drawing.Point(29, 98); this.lb_Version.Margin = new System.Windows.Forms.Padding(4, 0, 4, 0); this.lb_Version.Name = "lb_Version"; this.lb_Version.Size = new System.Drawing.Size(55, 15); this.lb_Version.TabIndex = 0; this.lb_Version.Text = "Version:"; // // tb_artifactid // this.tb_artifactid.Location = new System.Drawing.Point(92, 56); this.tb_artifactid.Margin = new System.Windows.Forms.Padding(4); this.tb_artifactid.Name = "tb_artifactid"; this.tb_artifactid.Size = new System.Drawing.Size(247, 25); this.tb_artifactid.TabIndex = 1; // // lb_ArtifactId // this.lb_ArtifactId.AutoSize = true; this.lb_ArtifactId.Location = new System.Drawing.Point(17, 62); this.lb_ArtifactId.Margin = new System.Windows.Forms.Padding(4, 0, 4, 0); this.lb_ArtifactId.Name = "lb_ArtifactId"; this.lb_ArtifactId.Size = new System.Drawing.Size(67, 15); this.lb_ArtifactId.TabIndex = 0; this.lb_ArtifactId.Text = "ArtifactId:"; // // tb_groupid // this.tb_groupid.Location = new System.Drawing.Point(92, 21); this.tb_groupid.Margin = new System.Windows.Forms.Padding(4); this.tb_groupid.Name = "tb_groupid"; this.tb_groupid.Size = new System.Drawing.Size(247, 25); this.tb_groupid.TabIndex = 1; // // lb_GroupId // this.lb_GroupId.AutoSize = true; this.lb_GroupId.Location = new System.Drawing.Point(24, 26); this.lb_GroupId.Margin = new System.Windows.Forms.Padding(4, 0, 4, 0); this.lb_GroupId.Name = "lb_GroupId"; this.lb_GroupId.Size = new System.Drawing.Size(59, 15); this.lb_GroupId.TabIndex = 0; this.lb_GroupId.Text = "GroupId:"; // // groupBox1 // this.groupBox1.Controls.Add(this.tb_log); this.groupBox1.Dock = System.Windows.Forms.DockStyle.Fill; this.groupBox1.Location = new System.Drawing.Point(0, 0); this.groupBox1.Margin = new System.Windows.Forms.Padding(4); this.groupBox1.Name = "groupBox1"; this.groupBox1.Padding = new System.Windows.Forms.Padding(4); this.groupBox1.Size = new System.Drawing.Size(714, 372); this.groupBox1.TabIndex = 0; this.groupBox1.TabStop = false; this.groupBox1.Text = "Log"; // // tb_log // this.tb_log.Dock = System.Windows.Forms.DockStyle.Fill; this.tb_log.Location = new System.Drawing.Point(4, 22); this.tb_log.Margin = new System.Windows.Forms.Padding(4); this.tb_log.Multiline = true; this.tb_log.Name = "tb_log"; this.tb_log.ReadOnly = true; this.tb_log.ScrollBars = System.Windows.Forms.ScrollBars.Both; this.tb_log.Size = new System.Drawing.Size(706, 346); this.tb_log.TabIndex = 0; // // SelectJarFile // this.SelectJarFile.FileName = "SelectJarFile"; // // MavenInstall // this.AutoScaleDimensions = new System.Drawing.SizeF(8F, 15F); this.AutoScaleMode = System.Windows.Forms.AutoScaleMode.Font; this.ClientSize = new System.Drawing.Size(1067, 372); this.Controls.Add(this.splitContainer1); this.Margin = new System.Windows.Forms.Padding(4); this.Name = "MavenInstall"; this.StartPosition = System.Windows.Forms.FormStartPosition.CenterScreen; this.Text = "MavenInstall"; this.splitContainer1.Panel1.ResumeLayout(false); this.splitContainer1.Panel2.ResumeLayout(false); ((System.ComponentModel.ISupportInitialize)(this.splitContainer1)).EndInit(); this.splitContainer1.ResumeLayout(false); this.panel1.ResumeLayout(false); this.gb_condition.ResumeLayout(false); this.gb_condition.PerformLayout(); this.groupBox1.ResumeLayout(false); this.groupBox1.PerformLayout(); this.ResumeLayout(false); } #endregion private System.Windows.Forms.SplitContainer splitContainer1; private System.Windows.Forms.Panel panel1; private System.Windows.Forms.Button btn_clear; private System.Windows.Forms.Button btn_execute; private System.Windows.Forms.GroupBox gb_condition; private System.Windows.Forms.TextBox tb_command; private System.Windows.Forms.Button btn_select; private System.Windows.Forms.Label lb_Command; private System.Windows.Forms.TextBox tb_file; private System.Windows.Forms.Label lb_File; private System.Windows.Forms.TextBox tb_packaging; private System.Windows.Forms.Label lb_Packaging; private System.Windows.Forms.TextBox tb_version; private System.Windows.Forms.Label lb_Version; private System.Windows.Forms.TextBox tb_artifactid; private System.Windows.Forms.Label lb_ArtifactId; private System.Windows.Forms.TextBox tb_groupid; private System.Windows.Forms.Label lb_GroupId; private System.Windows.Forms.GroupBox groupBox1; private System.Windows.Forms.TextBox tb_log; private System.Windows.Forms.OpenFileDialog SelectJarFile; } } ```
Design T-Shirt 具体是怎么做的
Problem Description Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a mission-impossible to have everybody perfectly satisfied. So he took a poll to collect people's opinions. Here are what he obtained: N people voted for M design elements (such as the ACM-ICPC logo, big names in computer science, well-known graphs, etc.). Everyone assigned each element a number of satisfaction. However, XKA can only put K (<=M) elements into his design. He needs you to pick for him the K elements such that the total number of satisfaction is maximized. Input The input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements XKA will put into his design. Then N lines follow, each contains M numbers. The j-th number in the i-th line represents the i-th person's satisfaction on the j-th element. Output For each test case, print in one line the indices of the K elements you would suggest XKA to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in non-increasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line. Sample Input 3 6 4 2 2.5 5 1 3 4 5 1 3.5 2 2 2 1 1 1 1 1 10 3 3 2 1 2 3 2 3 1 3 1 2 Sample Output 6 5 3 1 2 1
运行 tensorflow ,能正确输出结果,但同时有其他的一些提示,不懂是为什么
代码很简短,目前正在学习中。 ``` import tensorflow as tf a = [[1, 0, 3], [8, -3, 6], [5, 1, 7]] with tf.Session() as sess: print(sess.run(tf.argmax(a, 1))) print(sess.run(tf.argmax(a, 0))) ``` 输出结果如下,不知道为什么会出现这些提示,求高人指点。 E:\anaconda\python.exe D:/pycharm文件/try.py 2020-01-09 22:18:54.342546: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library cudart64_100.dll WARNING:tensorflow:From D:/pycharm文件/try.py:5: The name tf.Session is deprecated. Please use tf.compat.v1.Session instead. 2020-01-09 22:18:56.348961: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library nvcuda.dll 2020-01-09 22:18:57.534582: I tensorflow/core/common_runtime/gpu/gpu_device.cc:1618] Found device 0 with properties: name: GeForce GTX 1660 Ti with Max-Q Design major: 7 minor: 5 memoryClockRate(GHz): 1.335 pciBusID: 0000:01:00.0 2020-01-09 22:18:57.535147: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library cudart64_100.dll 2020-01-09 22:18:57.539354: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library cublas64_100.dll 2020-01-09 22:18:57.543360: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library cufft64_100.dll 2020-01-09 22:18:57.545647: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library curand64_100.dll 2020-01-09 22:18:57.550333: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library cusolver64_100.dll 2020-01-09 22:18:57.554235: I tensorflow/stream_executor/platform/default/dso_loader.cc:44] Successfully opened dynamic library cusparse64_100.dll 2020-01-09 22:18:57.556270: W tensorflow/stream_executor/platform/default/dso_loader.cc:55] Could not load dynamic library 'cudnn64_7.dll'; dlerror: cudnn64_7.dll not found 2020-01-09 22:18:57.556681: W tensorflow/core/common_runtime/gpu/gpu_device.cc:1641] Cannot dlopen some GPU libraries. Please make sure the missing libraries mentioned above are installed properly if you would like to use GPU. Follow the guide at https://www.tensorflow.org/install/gpu for how to download and setup the required libraries for your platform. Skipping registering GPU devices... 2020-01-09 22:18:57.558041: I tensorflow/core/platform/cpu_feature_guard.cc:142] Your CPU supports instructions that this TensorFlow binary was not compiled to use: AVX2 2020-01-09 22:18:57.560801: I tensorflow/core/common_runtime/gpu/gpu_device.cc:1159] Device interconnect StreamExecutor with strength 1 edge matrix: 2020-01-09 22:18:57.561152: I tensorflow/core/common_runtime/gpu/gpu_device.cc:1165] [2 0 2] [1 2 2] Process finished with exit code 0
android开发eclipse导入design,运行时出错无法加载布局
xml代码如下 ``` <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android" android:layout_width="match_parent" android:layout_height="match_parent" > <android.support.design.widget.TabLayout android:id="@+id/tablayout" android:layout_width="match_parent" android:layout_height="wrap_content" /> </RelativeLayout> ``` 当运行时,就会报错 Caused by: android.view.InflateException: Binary XML file line #7: Error inflating class android.support.design.widget.TabLayout design包导入正确,java代码中也能使用,将design作为依赖项目也试过,都是着这样,请问各位大侠这是怎么回事~~~~(>_<)~~~~
Android Studio中,layout文件下文件打开后没有design界面(已有方法无法解决)
![截图](https://img-ask.csdn.net/upload/201908/18/1566130519_208360.jpg) 找不到design,看到网上说的解决方法是在styles文件里面加上Base.,试过了没有作用。有其它的解决方案吗?
怎样去掉ant design of vue的modal对话框遮罩层box-shadow
![图片说明](https://img-ask.csdn.net/upload/201911/18/1574066257_801424.png) ![图片说明](https://img-ask.csdn.net/upload/201911/18/1574066083_777636.png) 请问一下,我在使用ant design of vue的时候遇到modal对话框的默认盒子阴影去不掉,应该怎么解决
eclipse下导入android.support.design包后clean的时候报错?
因为要用Tablayout控件,所以在eclipse里先导入android-support-v7-appcompat,然后又导入了design包。并且设置了design包依赖android-support-v7-appcompat,自己的项目依赖android-support-v7-appcompat和design包。感觉这么设置应该没问题啊,结果clean的时候报错:The container 'Android Dependencies' references non existing library 'D:\XXXX_workspace\design\bin\design.jar'。 可是我看了,D:\XXXX_workspace\design\bin\ 里面有design.jar这个文件啊。 求大神指导。 万分感谢!
如何用zybo板(zynq-7010)上实现变声功能?
网上下了soundtouch库,根据这篇文章 https://www.cnblogs.com/CodeMIRACLE/p/5514806.html 用VS编译出的exe文件效果很好,但不知如何把C++代码直接扔进板子里,用了vivado hls,出现了如下错误,现怀疑大方向就是错的?望诸位指点一二 INFO: [SIM 2] *************** CSIM start *************** INFO: [SIM 4] CSIM will launch GCC as the compiler. Compiling ../../../../../../../../Desktop/fa/src/test.cpp in debug mode csim.mk:81: recipe for target 'obj/test.o' failed ../../../../../../../../Desktop/fa/src/test.cpp: In function 'void DelArray(void*)': ../../../../../../../../Desktop/fa/src/test.cpp:52:12: warning: deleting 'void*' is undefined [-Wdelete-incomplete] delete []pData; ^~~~~ ../../../../../../../../Desktop/fa/src/test.cpp: In function 'bool CombineWaveFile(int, char (*)[256], char*)': ../../../../../../../../Desktop/fa/src/test.cpp:76:48: error: cast from 'FILE* {aka _iobuf*}' to 'int' loses precision [-fpermissive] *(pFileHandle +i)= (int)(fopen(argv[i], "rb")); ^ ../../../../../../../../Desktop/fa/src/test.cpp:90:83: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] int nRead = fread(pRiff_Header+i, 1, sizeof(RIFF_HEADER), (FILE*)(pFileHandle[i])); ^ ../../../../../../../../Desktop/fa/src/test.cpp:101:61: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] nRead = fread(pFmt_Block+i, 1, 8, (FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp:112:101: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] nRead = fread(&((pFmt_Block+i)->wavFormat), 1, (pFmt_Block+i)->dwFmtSize, (FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp:123:62: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] nRead = fread(pFact_Block+i, 1, 8, (FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp:137:106: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] nRead = fread(&((pFact_Block+i)->dwData), 1, sizeof((pFact_Block+i)->dwData), (FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp:147:80: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] nRead = fread(pData_Block+i, 1, sizeof(DATA_BLOCK), (FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp:200:75: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] int nRet = fread(strTemp, 1, sizeof(strTemp)-1, (FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp:204:72: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] nRet = fread(strTemp, 1, sizeof(strTemp)-1, (FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp:206:34: warning: cast to pointer from integer of different size [-Wint-to-pointer-cast] fclose((FILE*)(*(pFileHandle+i))); ^ ../../../../../../../../Desktop/fa/src/test.cpp: In function 'int main()': ../../../../../../../../Desktop/fa/src/test.cpp:226:39: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings] CombineWaveFile(3, strFile, "out.wav"); ^ make: *** [obj/test.o] Error 1 ERR: [SIM 100] 'csim_design' failed: compilation error(s). INFO: [SIM 3] *************** CSIM finish ***************
F1 Circuit Design 一个程序实现的问题
Description We all know that there is an exciting F1 circuit in Shanghai, but how many of you know how to design an F1 circuit? Designing an F1 circuit is a very complex task. For example, you should know how much time the best F1 driver will take to finish a lap. In this task, we will ask you to solve this problem. An F1 circuit consists of straight raceways, turns and a starting point. We use '-' (with ASCII number 45) or '|' (with ASCII number 124) to describe a section of straight raceways, and use '+' (with ASCII number 43) to describe a turn. If two straight raceways connect to a turn, we call the turn a simple turn, and the speed of an F1 race car entering and leaving a simple turn should not exceed 45 m/s. If two turns are connected with each other, this is a composite turn, and the speed of an F1 racing car entering and leaving a composite turn should not exceed 20 m/s. A simple turn is in one of the four formats shown in Figure 1: Figure 1 Formats of simple turns A composite turn is in one of the eight formats shown in Figure 2: Figure 2 Formats of composite turns You may assume that in an F1 circuit there are only the two types of turns we mentioned above. The starting point of an F1 circuit is the beginning and ending position of an F1 race car. A starting point is in one of the four formats shown in Figure 3, meaning that the start direction is going up ('^' with ASCII number 94), down ('v' with ASCII number 118), left ('<' with ASCII number 60) or right ('>' with ASCII number 62) respectively: Figure 3 Formats of starting point The straight raceways, turns and a starting point mentioned above will compose a closed F1 circuit. We know that a section of straight raceway is M meters long, which indicates that a '-' or '|' equals to M meters. To make the problem easier, we ignore the length of turns and the start point. The F1 race car enters and leaves a turn with the same speed. An F1 driver will run 3 laps in each circuit. On the first lap, the initial speed of the car leaving the starting point should be zero. There is no restriction for the second lap. On the last lap, the speed of the car arriving at the start point should also be zero. We record the running time of the second lap as the best lap time. What you need to do is to calculate the minimum best lap time. What you may also know is that the acceleration of an F1 car doesn't exceed 10 m/s2, and the deceleration doesn't exceed 30 m/s2. Input There are several test cases. The first line of each test case contains an integer M (1 <= M <= 200), which is the length of a section of straight raceways. The next several lines will contain a map of an F1 circuit. A circuit map only contains the circuit, some white spaces and some blank lines. The description will occupy 50 lines or less, and the number of characters in each line will not exceed 100. A test case with M = 0 ends the input, and should not be processed. Output For each test case, output a line containing the best loop time in seconds. You should round the result to two digits after the decimal point. Sample Input 199 +-------------+ +----+ | +----+++ ^ | || | | || | +-----++------+ 0 Sample Output 97.34
Ads Proposal 是怎么编写
Problem Description There are N customers set their M different advertisements on Baidu. Each advertisement is owned by single customer. The ads system of Baidu records the number of clicks of each advertisement this year. The proposal system wants to analysis the advertisements about the relativity of the description length and the number of clicks of the advertisements. During the analysis, it is very important to do such a query to ask the total length of the advertisements with top k clicking times for each customer. You may assume the number of clicks of all advertisements are distinct. Your task is to help Baidu to design this little toolkit. Input The input consist multiple test cases. The number of test cases is given in the first line of the input. For each test case, the first line contains three integers N, M and Q, denoting the number customer, the number of advertisement instances and the number of queries. (N <= 100000, M <= 500000, Q <= 100000) Then M lines follow, each line contains three numbers, U, C and L, indicating the owner of this advertisement, the clicks for this advertisement and the length. (1 <= U <= N, 0 <= C, L <= 1000000000) Finally Q lines come. Each line contains only one integer k, representing the query for top k clicking advertisements for each customer. Output For each test case, output Q lines, each line contains only one integer, denoting the sum of total length of the top k number of clicks for each customer. Sample Input 2 2 4 3 1 12 13 2 23 41 1 21 46 1 22 31 1 2 3 6 15 3 5 2677139 731358928 2 347112028 239095183 6 27407970 85994789 6 767687908 734935764 6 255454855 110193353 3 39860954 813158671 5 617524049 55413590 3 338773814 7907652 6 810348880 736644178 2 777664288 63811422 6 590330120 616490361 5 552407488 136492190 1 416295130 448298060 5 811513162 232437061 4 43273262 874901209 4 9 13 Sample Output Case #1: 72 118 131 Case #2: 5801137622 5887132411 5887132411
Card Collection 怎么实现这个代码
Problem Description In Card Captor Sakura, Sakura is a lovely girl. One day, she opens a magic box containing many cards. Every card has a respective natural force in the real world, such as wind, water, YY, LMY, and so on. Suddenly a gust of wind blows away these cards. Sakura only has a card called “THE_WINDY” in her hand. Sakura knows if any card is not found, disaster comes. So she must collect all the cards. Cards can only be collected one by one. Suppose there are N cards to be collected. It takes Ti to collect the ith card, 1≤i≤N. For the ith card, there is a corresponding card Pi. If card Pi has been collected, it only takes time ti to collect the ith card, where ti<Ti. Your task is to help Sakura design a schedule that takes the shortest time to collect all cards. Input The input consists of several test cases. Each test case starts with a line giving the number N of cards (1≤N≤100). Each of the next N lines describes a card. Every card has the format: Name1 Ti Name2 ti, where Name1 and Name2 are cards’ names, consisting of uppercase letters and underlines. The length of cards’ names is no more than 20 characters. Card Name1 is a card to be collected. It takes Ti to collect Card Name1 without Card Name2. And it takes ti to collect Card Name1 with Card Name2, where ti<Ti. End of input is indicated by a line consisting of a single 0. Output For each test case, output a single line. Each line should give a single integer: the shortest time. Sample Input 5 THE_FLY 67 THE_WINDY 39 THE_SHADOW 97 THE_WINDY 49 THE_WATER 139 THE_FLY 69 THE_RAIN 37 THE_WATER 18 THE_WOOD 5 THE_RAIN 1 1 THE_LOOP 35 THE_LOOP 25 0 Sample Output 176 35
爬虫福利二 之 妹子图网MM批量下载
爬虫福利一:27报网MM批量下载 点击 看了本文,相信大家对爬虫一定会产生强烈的兴趣,激励自己去学习爬虫,在这里提前祝:大家学有所成! 目标网站:妹子图网 环境:Python3.x 相关第三方模块:requests、beautifulsoup4 Re:各位在测试时只需要将代码里的变量path 指定为你当前系统要保存的路径,使用 python xxx.py 或IDE运行即可。 ...
Java学习的正确打开方式
在博主认为,对于入门级学习java的最佳学习方法莫过于视频+博客+书籍+总结,前三者博主将淋漓尽致地挥毫于这篇博客文章中,至于总结在于个人,实际上越到后面你会发现学习的最好方式就是阅读参考官方文档其次就是国内的书籍,博客次之,这又是一个层次了,这里暂时不提后面再谈。博主将为各位入门java保驾护航,各位只管冲鸭!!!上天是公平的,只要不辜负时间,时间自然不会辜负你。 何谓学习?博主所理解的学习,它是一个过程,是一个不断累积、不断沉淀、不断总结、善于传达自己的个人见解以及乐于分享的过程。
大学四年自学走来,这些私藏的实用工具/学习网站我贡献出来了
大学四年,看课本是不可能一直看课本的了,对于学习,特别是自学,善于搜索网上的一些资源来辅助,还是非常有必要的,下面我就把这几年私藏的各种资源,网站贡献出来给你们。主要有:电子书搜索、实用工具、在线视频学习网站、非视频学习网站、软件下载、面试/求职必备网站。 注意:文中提到的所有资源,文末我都给你整理好了,你们只管拿去,如果觉得不错,转发、分享就是最大的支持了。 一、电子书搜索 对于大部分程序员...
linux系列之常用运维命令整理笔录
本博客记录工作中需要的linux运维命令,大学时候开始接触linux,会一些基本操作,可是都没有整理起来,加上是做开发,不做运维,有些命令忘记了,所以现在整理成博客,当然vi,文件操作等就不介绍了,慢慢积累一些其它拓展的命令,博客不定时更新 free -m 其中:m表示兆,也可以用g,注意都要小写 Men:表示物理内存统计 total:表示物理内存总数(total=used+free) use...
比特币原理详解
一、什么是比特币 比特币是一种电子货币,是一种基于密码学的货币,在2008年11月1日由中本聪发表比特币白皮书,文中提出了一种去中心化的电子记账系统,我们平时的电子现金是银行来记账,因为银行的背后是国家信用。去中心化电子记账系统是参与者共同记账。比特币可以防止主权危机、信用风险。其好处不多做赘述,这一层面介绍的文章很多,本文主要从更深层的技术原理角度进行介绍。 二、问题引入 假设现有4个人...
程序员接私活怎样防止做完了不给钱?
首先跟大家说明一点,我们做 IT 类的外包开发,是非标品开发,所以很有可能在开发过程中会有这样那样的需求修改,而这种需求修改很容易造成扯皮,进而影响到费用支付,甚至出现做完了项目收不到钱的情况。 那么,怎么保证自己的薪酬安全呢? 我们在开工前,一定要做好一些证据方面的准备(也就是“讨薪”的理论依据),这其中最重要的就是需求文档和验收标准。一定要让需求方提供这两个文档资料作为开发的基础。之后开发...
网页实现一个简单的音乐播放器(大佬别看。(⊙﹏⊙))
今天闲着无事,就想写点东西。然后听了下歌,就打算写个播放器。 于是乎用h5 audio的加上js简单的播放器完工了。 演示地点演示 html代码如下` music 这个年纪 七月的风 音乐 ` 然后就是css`*{ margin: 0; padding: 0; text-decoration: none; list-...
Python十大装B语法
Python 是一种代表简单思想的语言,其语法相对简单,很容易上手。不过,如果就此小视 Python 语法的精妙和深邃,那就大错特错了。本文精心筛选了最能展现 Python 语法之精妙的十个知识点,并附上详细的实例代码。如能在实战中融会贯通、灵活使用,必将使代码更为精炼、高效,同时也会极大提升代码B格,使之看上去更老练,读起来更优雅。
数据库优化 - SQL优化
以实际SQL入手,带你一步一步走上SQL优化之路!
2019年11月中国大陆编程语言排行榜
2019年11月2日,我统计了某招聘网站,获得有效程序员招聘数据9万条。针对招聘信息,提取编程语言关键字,并统计如下: 编程语言比例 rank pl_ percentage 1 java 33.62% 2 cpp 16.42% 3 c_sharp 12.82% 4 javascript 12.31% 5 python 7.93% 6 go 7.25% 7 p...
通俗易懂地给女朋友讲:线程池的内部原理
餐盘在灯光的照耀下格外晶莹洁白,女朋友拿起红酒杯轻轻地抿了一小口,对我说:“经常听你说线程池,到底线程池到底是个什么原理?”
经典算法(5)杨辉三角
杨辉三角 是经典算法,这篇博客对它的算法思想进行了讲解,并有完整的代码实现。
腾讯算法面试题:64匹马8个跑道需要多少轮才能选出最快的四匹?
昨天,有网友私信我,说去阿里面试,彻底的被打击到了。问了为什么网上大量使用ThreadLocal的源码都会加上private static?他被难住了,因为他从来都没有考虑过这个问题。无独有偶,今天笔者又发现有网友吐槽了一道腾讯的面试题,我们一起来看看。 腾讯算法面试题:64匹马8个跑道需要多少轮才能选出最快的四匹? 在互联网职场论坛,一名程序员发帖求助到。二面腾讯,其中一个算法题:64匹...
面试官:你连RESTful都不知道我怎么敢要你?
干货,2019 RESTful最贱实践
JDK12 Collectors.teeing 你真的需要了解一下
前言 在 Java 12 里面有个非常好用但在官方 JEP 没有公布的功能,因为它只是 Collector 中的一个小改动,它的作用是 merge 两个 collector 的结果,这句话显得很抽象,老规矩,我们先来看个图(这真是一个不和谐的图????): 管道改造经常会用这个小东西,通常我们叫它「三通」,它的主要作用就是将 downstream1 和 downstre...
为啥国人偏爱Mybatis,而老外喜欢Hibernate/JPA呢?
关于SQL和ORM的争论,永远都不会终止,我也一直在思考这个问题。昨天又跟群里的小伙伴进行了一番讨论,感触还是有一些,于是就有了今天这篇文。 声明:本文不会下关于Mybatis和JPA两个持久层框架哪个更好这样的结论。只是摆事实,讲道理,所以,请各位看官勿喷。 一、事件起因 关于Mybatis和JPA孰优孰劣的问题,争论已经很多年了。一直也没有结论,毕竟每个人的喜好和习惯是大不相同的。我也看...
SQL-小白最佳入门sql查询一
不要偷偷的查询我的个人资料,即使你再喜欢我,也不要这样,真的不好;
项目中的if else太多了,该怎么重构?
介绍 最近跟着公司的大佬开发了一款IM系统,类似QQ和微信哈,就是聊天软件。我们有一部分业务逻辑是这样的 if (msgType = "文本") { // dosomething } else if(msgType = "图片") { // doshomething } else if(msgType = "视频") { // doshomething } else { // doshom...
【图解经典算法题】如何用一行代码解决约瑟夫环问题
约瑟夫环问题算是很经典的题了,估计大家都听说过,然后我就在一次笔试中遇到了,下面我就用 3 种方法来详细讲解一下这道题,最后一种方法学了之后保证让你可以让你装逼。 问题描述:编号为 1-N 的 N 个士兵围坐在一起形成一个圆圈,从编号为 1 的士兵开始依次报数(1,2,3…这样依次报),数到 m 的 士兵会被杀死出列,之后的士兵再从 1 开始报数。直到最后剩下一士兵,求这个士兵的编号。 1、方...
致 Python 初学者
欢迎来到“Python进阶”专栏!来到这里的每一位同学,应该大致上学习了很多 Python 的基础知识,正在努力成长的过程中。在此期间,一定遇到了很多的困惑,对未来的学习方向感到迷茫。我非常理解你们所面临的处境。我从2007年开始接触 python 这门编程语言,从2009年开始单一使用 python 应对所有的开发工作,直至今天。回顾自己的学习过程,也曾经遇到过无数的困难,也曾经迷茫过、困惑过。开办这个专栏,正是为了帮助像我当年一样困惑的 Python 初学者走出困境、快速成长。希望我的经验能真正帮到你
“狗屁不通文章生成器”登顶GitHub热榜,分分钟写出万字形式主义大作
一、垃圾文字生成器介绍 最近在浏览GitHub的时候,发现了这样一个骨骼清奇的雷人项目,而且热度还特别高。 项目中文名:狗屁不通文章生成器 项目英文名:BullshitGenerator 根据作者的介绍,他是偶尔需要一些中文文字用于GUI开发时测试文本渲染,因此开发了这个废话生成器。但由于生成的废话实在是太过富于哲理,所以最近已经被小伙伴们给玩坏了。 他的文风可能是这样的: 你发现,...
程序员:我终于知道post和get的区别
是一个老生常谈的话题,然而随着不断的学习,对于以前的认识有很多误区,所以还是需要不断地总结的,学而时习之,不亦说乎
GitHub标星近1万:只需5秒音源,这个网络就能实时“克隆”你的声音
作者 | Google团队 译者 | 凯隐 编辑 | Jane 出品 | AI科技大本营(ID:rgznai100) 本文中,Google 团队提出了一种文本语音合成(text to speech)神经系统,能通过少量样本学习到多个不同说话者(speaker)的语音特征,并合成他们的讲话音频。此外,对于训练时网络没有接触过的说话者,也能在不重新训练的情况下,仅通过未知...
《程序人生》系列-这个程序员只用了20行代码就拿了冠军
你知道的越多,你不知道的越多 点赞再看,养成习惯GitHub上已经开源https://github.com/JavaFamily,有一线大厂面试点脑图,欢迎Star和完善 前言 这一期不算《吊打面试官》系列的,所有没前言我直接开始。 絮叨 本来应该是没有这期的,看过我上期的小伙伴应该是知道的嘛,双十一比较忙嘛,要值班又要去帮忙拍摄年会的视频素材,还得搞个程序员一天的Vlog,还要写BU...
加快推动区块链技术和产业创新发展,2019可信区块链峰会在京召开
11月8日,由中国信息通信研究院、中国通信标准化协会、中国互联网协会、可信区块链推进计划联合主办,科技行者协办的2019可信区块链峰会将在北京悠唐皇冠假日酒店开幕。   区块链技术被认为是继蒸汽机、电力、互联网之后,下一代颠覆性的核心技术。如果说蒸汽机释放了人类的生产力,电力解决了人类基本的生活需求,互联网彻底改变了信息传递的方式,区块链作为构造信任的技术有重要的价值。   1...
程序员把地府后台管理系统做出来了,还有3.0版本!12月7号最新消息:已在开发中有github地址
第一幕:缘起 听说阎王爷要做个生死簿后台管理系统,我们派去了一个程序员…… 996程序员做的梦: 第一场:团队招募 为了应对地府管理危机,阎王打算找“人”开发一套地府后台管理系统,于是就在地府总经办群中发了项目需求。 话说还是中国电信的信号好,地府都是满格,哈哈!!! 经常会有外行朋友问:看某网站做的不错,功能也简单,你帮忙做一下? 而这次,面对这样的需求,这个程序员...
网易云6亿用户音乐推荐算法
网易云音乐是音乐爱好者的集聚地,云音乐推荐系统致力于通过 AI 算法的落地,实现用户千人千面的个性化推荐,为用户带来不一样的听歌体验。 本次分享重点介绍 AI 算法在音乐推荐中的应用实践,以及在算法落地过程中遇到的挑战和解决方案。 将从如下两个部分展开: AI算法在音乐推荐中的应用 音乐场景下的 AI 思考 从 2013 年 4 月正式上线至今,网易云音乐平台持续提供着:乐屏社区、UGC...
【技巧总结】位运算装逼指南
位算法的效率有多快我就不说,不信你可以去用 10 亿个数据模拟一下,今天给大家讲一讲位运算的一些经典例子。不过,最重要的不是看懂了这些例子就好,而是要在以后多去运用位运算这些技巧,当然,采用位运算,也是可以装逼的,不信,你往下看。我会从最简单的讲起,一道比一道难度递增,不过居然是讲技巧,那么也不会太难,相信你分分钟看懂。 判断奇偶数 判断一个数是基于还是偶数,相信很多人都做过,一般的做法的代码如下...
【管理系统课程设计】美少女手把手教你后台管理
【文章后台管理系统】URL设计与建模分析+项目源码+运行界面 栏目管理、文章列表、用户管理、角色管理、权限管理模块(文章最后附有源码) 1. 这是一个什么系统? 1.1 学习后台管理系统的原因 随着时代的变迁,现如今各大云服务平台横空出世,市面上有许多如学生信息系统、图书阅读系统、停车场管理系统等的管理系统,而本人家里就有人在用烟草销售系统,直接在网上完成挑选、购买与提交收货点,方便又快捷。 试想,若没有烟草销售系统,本人家人想要购买烟草,还要独自前往药...
4G EPS 第四代移动通信系统
目录 文章目录目录4G 与 LTE/EPCLTE/EPC 的架构E-UTRANE-UTRAN 协议栈eNodeBEPCMMES-GWP-GWHSSLTE/EPC 协议栈概览 4G 与 LTE/EPC 4G,即第四代移动通信系统,提供了 3G 不能满足的无线网络宽带化,主要提供数据(上网)业务。而 LTE(Long Term Evolution,长期演进技术)是电信领域用于手机及数据终端的高速无线通...
相关热词 c# 输入ip c# 乱码 报表 c#选择结构应用基本算法 c# 收到udp包后回包 c#oracle 头文件 c# 序列化对象 自定义 c# tcp 心跳 c# ice连接服务端 c# md5 解密 c# 文字导航控件
立即提问