系统蓝屏symbols could not be loaded for topsecpf.sys

以下是dmp文件

Microsoft (R) Windows Debugger Version 6.12.0002.633 AMD64
Copyright (c) Microsoft Corporation. All rights reserved.

Loading Dump File [C:\Windows\Minidump\042516-38765-01.dmp]
Mini Kernel Dump File: Only registers and stack trace are available

WARNING: Whitespace at start of path element
Symbol search path is: SRV*C:\mysymbol*http://msdl.microsoft.com/download/symbols; SRV*c:\mysymbol* http://msdl.microsoft.com/download/symbols
Executable search path is:
Windows 7 Kernel Version 10586 MP (4 procs) Free x64
Product: WinNt, suite: TerminalServer SingleUserTS
Built by: 10586.212.amd64fre.th2_release_sec.160328-1908
Machine Name:
Kernel base = 0xfffff8005ca06000 PsLoadedModuleList = 0xfffff8005cce4cd0
Debug session time: Mon Apr 25 14:00:16.636 2016 (UTC + 8:00)
System Uptime: 0 days 0:09:38.532
Loading Kernel Symbols
.

Press ctrl-c (cdb, kd, ntsd) or ctrl-break (windbg) to abort symbol loads that take too long.
Run !sym noisy before .reload to track down problems loading symbols.

..............................................................
................................................................
.......................................................
Loading User Symbols
Loading unloaded module list
........................................


  • *
  • Bugcheck Analysis *
  • * *******************************************************************************

Use !analyze -v to get detailed debugging information.

BugCheck 139, {3, ffffd0020017a280, ffffd0020017a1d8, 0}

Unable to load image \??\C:\WINDOWS\sysWOW64\drivers\topsecpf.sys, Win32 error 0n2
*** WARNING: Unable to verify timestamp for topsecpf.sys
*** ERROR: Module load completed but symbols could not be loaded for topsecpf.sys
Probably caused by : topsecpf.sys ( topsecpf+7370 )

Followup: MachineOwner

3: kd> !analyze -v


  • *
  • Bugcheck Analysis *
  • * *******************************************************************************

Unknown bugcheck code (139)
Unknown bugcheck description
Arguments:
Arg1: 0000000000000003
Arg2: ffffd0020017a280
Arg3: ffffd0020017a1d8
Arg4: 0000000000000000

Debugging Details:

CUSTOMER_CRASH_COUNT: 1

DEFAULT_BUCKET_ID: VISTA_DRIVER_FAULT

BUGCHECK_STR: 0x139

PROCESS_NAME: System

CURRENT_IRQL: 0

LAST_CONTROL_TRANSFER: from fffff8005cb532e9 to fffff8005cb48760

SYMBOL_ON_RAW_STACK: 1

STACK_ADDR_RAW_STACK_SYMBOL: ffffd0020017a070

STACK_COMMAND: dds FFFFD0020017A070-0x20 ; kb

STACK_TEXT:

ffffd0020017a050 00000000
ffffd002
0017a054 ffffe001
ffffd0020017a058 c565637b
ffffd002
0017a05c fffff801
ffffd0020017a060 3ddb1490
ffffd002
0017a064 ffffe001
ffffd0020017a068 c6d57370
ffffd002
0017a06c fffff801
ffffd0020017a070 c6d57348
ffffd002
0017a074 fffff801
ffffd0020017a078 00000000
ffffd002
0017a07c 00000000
ffffd0020017a080 00000000
ffffd002
0017a084 00000000
ffffd0020017a088 00000000
ffffd002
0017a08c 00000000
ffffd0020017a090 c6d19700
ffffd002
0017a094 fffff801
ffffd0020017a098 5cb53610
ffffd002
0017a09c fffff800
ffffd0020017a0a0 00000002
ffffd002
0017a0a4 00000000
ffffd0020017a0a8 0017a4b0
ffffd002
0017a0ac ffffd002
ffffd0020017a0b0 0000ad13
ffffd002
0017a0b4 00000000
ffffd0020017a0b8 00000000
ffffd002
0017a0bc 00000000
ffffd0020017a0c0 3dfe7b70
ffffd002
0017a0c4 ffffe001
ffffd0020017a0c8 c624f303
ffffd002
0017a0cc fffff801

FOLLOWUP_IP:
topsecpf+7370
fffff801`c6d57370 90 nop

SYMBOL_NAME: topsecpf+7370

FOLLOWUP_NAME: MachineOwner

MODULE_NAME: topsecpf

IMAGE_NAME: topsecpf.sys

DEBUG_FLR_IMAGE_TIMESTAMP: 4d6da0f2

FAILURE_BUCKET_ID: X64_0x139_topsecpf+7370

BUCKET_ID: X64_0x139_topsecpf+7370

Followup: MachineOwner

3: kd> !analyze -v


  • *
  • Bugcheck Analysis *
  • * *******************************************************************************

Unknown bugcheck code (139)
Unknown bugcheck description
Arguments:
Arg1: 0000000000000003
Arg2: ffffd0020017a280
Arg3: ffffd0020017a1d8
Arg4: 0000000000000000

Debugging Details:

CUSTOMER_CRASH_COUNT: 1

DEFAULT_BUCKET_ID: VISTA_DRIVER_FAULT

BUGCHECK_STR: 0x139

PROCESS_NAME: System

CURRENT_IRQL: 0

LAST_CONTROL_TRANSFER: from fffff8005cb532e9 to fffff8005cb48760

SYMBOL_ON_RAW_STACK: 1

STACK_ADDR_RAW_STACK_SYMBOL: ffffd0020017a070

STACK_COMMAND: dds FFFFD0020017A070-0x20 ; kb

STACK_TEXT:

ffffd0020017a050 00000000
ffffd002
0017a054 ffffe001
ffffd0020017a058 c565637b
ffffd002
0017a05c fffff801
ffffd0020017a060 3ddb1490
ffffd002
0017a064 ffffe001
ffffd0020017a068 c6d57370
ffffd002
0017a06c fffff801
ffffd0020017a070 c6d57348
ffffd002
0017a074 fffff801
ffffd0020017a078 00000000
ffffd002
0017a07c 00000000
ffffd0020017a080 00000000
ffffd002
0017a084 00000000
ffffd0020017a088 00000000
ffffd002
0017a08c 00000000
ffffd0020017a090 c6d19700
ffffd002
0017a094 fffff801
ffffd0020017a098 5cb53610
ffffd002
0017a09c fffff800
ffffd0020017a0a0 00000002
ffffd002
0017a0a4 00000000
ffffd0020017a0a8 0017a4b0
ffffd002
0017a0ac ffffd002
ffffd0020017a0b0 0000ad13
ffffd002
0017a0b4 00000000
ffffd0020017a0b8 00000000
ffffd002
0017a0bc 00000000
ffffd0020017a0c0 3dfe7b70
ffffd002
0017a0c4 ffffe001
ffffd0020017a0c8 c624f303
ffffd002
0017a0cc fffff801

FOLLOWUP_IP:
topsecpf+7370
fffff801`c6d57370 90 nop

SYMBOL_NAME: topsecpf+7370

FOLLOWUP_NAME: MachineOwner

MODULE_NAME: topsecpf

IMAGE_NAME: topsecpf.sys

DEBUG_FLR_IMAGE_TIMESTAMP: 4d6da0f2

FAILURE_BUCKET_ID: X64_0x139_topsecpf+7370

BUCKET_ID: X64_0x139_topsecpf+7370

Followup: MachineOwner

3: kd> !analyze -v


  • *
  • Bugcheck Analysis *
  • * *******************************************************************************

Unknown bugcheck code (139)
Unknown bugcheck description
Arguments:
Arg1: 0000000000000003
Arg2: ffffd0020017a280
Arg3: ffffd0020017a1d8
Arg4: 0000000000000000

Debugging Details:

1个回答

The breakpoint will not currently be hit. No symbols have been loaded for this document

1.查看pdb文件有没有更新
2.Debug --- windows -- modules 中对应的库的加载路径是......
答案就在这里:The breakpoint will not currently be hit. No symbols have been loaded for this document
----------------------Hi,地球人,我是问答机器人小S,上面的内容就是我狂拽酷炫叼炸天的答案,除了赞同,你还有别的选择吗?

Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
其他相关推荐
win7蓝屏,求解决办法!
Microsoft (R) Windows Debugger Version 6.11.0001.404 X86 Copyright (c) Microsoft Corporation. All rights reserved. Loading Dump File [C:\Users\baby\Desktop\031315-27253-01.dmp] Mini Kernel Dump File: Only registers and stack trace are available Symbol search path is: Invalid Symbol loading may be unreliable without a symbol search path. Use .symfix to have the debugger choose a symbol path. After setting your symbol path, use .reload to refresh symbol locations. Executable search path is: Symbols can not be loaded because symbol path is not initialized. The Symbol Path can be set by: using the _NT_SYMBOL_PATH environment variable. using the -y <symbol_path> argument when starting the debugger. using .sympath and .sympath+ Unable to load image \SystemRoot\system32\ntkrnlpa.exe, Win32 error 0n2 WARNING: Unable to verify timestamp for ntkrnlpa.exe ERROR: Module load completed but symbols could not be loaded for ntkrnlpa.exe Windows 7 Kernel Version 7601 (Service Pack 1) MP (4 procs) Free x86 compatible Product: WinNt, suite: TerminalServer SingleUserTS Built by: 7601.18741.x86fre.win7sp1_gdr.150202-1526 Machine Name: Kernel base = 0x84415000 PsLoadedModuleList = 0x8455f5b0 Debug session time: Fri Mar 13 18:27:10.552 2015 (GMT+8) System Uptime: 0 days 10:17:16.598 Symbols can not be loaded because symbol path is not initialized. The Symbol Path can be set by: using the _NT_SYMBOL_PATH environment variable. using the -y <symbol_path> argument when starting the debugger. using .sympath and .sympath+ Unable to load image \SystemRoot\system32\ntkrnlpa.exe, Win32 error 0n2 WARNING: Unable to verify timestamp for ntkrnlpa.exe ERROR: Module load completed but symbols could not be loaded for ntkrnlpa.exe Loading Kernel Symbols ............................................................... ................................................................ ...................................................... Loading User Symbols Loading unloaded module list .......... Bugcheck Analysis Use !analyze -v to get detailed debugging information. BugCheck D1, {0, 2, 8, 0} Kernel symbols are WRONG. Please fix symbols to do analysis. Your debugger is not using the correct symbols In order for this command to work properly, your symbol path must point to .pdb files that have full type information. Certain .pdb files (such as the public OS symbols) do not contain the required information. Contact the group that provided you with these symbols if you need this command to work. Type referenced: nt!_KPRCB Symbols can not be loaded because symbol path is not initialized. The Symbol Path can be set by: using the _NT_SYMBOL_PATH environment variable. using the -y <symbol_path> argument when starting the debugger. using .sympath and .sympath+ Symbols can not be loaded because symbol path is not initialized. The Symbol Path can be set by: using the _NT_SYMBOL_PATH environment variable. using the -y <symbol_path> argument when starting the debugger. using .sympath and .sympath+ Probably caused by : ntkrnlpa.exe ( nt+40b4f ) Followup: MachineOwner ---------
电脑总出现蓝屏 这是代码 大家帮看看 谢谢
Microsoft (R) Windows Debugger Version 6.11.0001.404 X86 Copyright (c) Microsoft Corporation. All rights reserved. Loading Dump File [C:\Windows\Minidump\042715-12948-01.dmp] Mini Kernel Dump File: Only registers and stack trace are available Symbol search path is: *** Invalid *** **************************************************************************** * Symbol loading may be unreliable without a symbol search path. * * Use .symfix to have the debugger choose a symbol path. * * After setting your symbol path, use .reload to refresh symbol locations. * **************************************************************************** Executable search path is: ********************************************************************* * Symbols can not be loaded because symbol path is not initialized. * * * * The Symbol Path can be set by: * * using the _NT_SYMBOL_PATH environment variable. * * using the -y <symbol_path> argument when starting the debugger. * * using .sympath and .sympath+ * ********************************************************************* Unable to load image ntoskrnl.exe, Win32 error 0n2 *** WARNING: Unable to verify timestamp for ntoskrnl.exe *** ERROR: Module load completed but symbols could not be loaded for ntoskrnl.exe Windows 7 Kernel Version 7601 (Service Pack 1) MP (4 procs) Free x64 Product: WinNt, suite: TerminalServer SingleUserTS Machine Name: Kernel base = 0xfffff800`04607000 PsLoadedModuleList = 0xfffff800`0484c890 Debug session time: Mon Apr 27 22:58:44.231 2015 (GMT+8) System Uptime: 0 days 1:37:13.229 ********************************************************************* * Symbols can not be loaded because symbol path is not initialized. * * * * The Symbol Path can be set by: * * using the _NT_SYMBOL_PATH environment variable. * * using the -y <symbol_path> argument when starting the debugger. * * using .sympath and .sympath+ * ********************************************************************* Unable to load image ntoskrnl.exe, Win32 error 0n2 *** WARNING: Unable to verify timestamp for ntoskrnl.exe *** ERROR: Module load completed but symbols could not be loaded for ntoskrnl.exe Loading Kernel Symbols ............................................................... ................................................................ ................................... Loading User Symbols Loading unloaded module list .................... Unable to load image usbhub.sys, Win32 error 0n2 *** WARNING: Unable to verify timestamp for usbhub.sys *** ERROR: Module load completed but symbols could not be loaded for usbhub.sys ******************************************************************************* * * * Bugcheck Analysis * * * *******************************************************************************
GDB远程调试warning: Could not load shared library symbols for /lib/libc.so.6.
问题描述: DGB不能远程调试。 * 使用的交叉编译工具:gcc 版本 4.7.3 20130226 (prerelease) (crosstool-NG linaro-1.13.1-4.7-2013.03-20130313 - Linaro GCC 2013.03) * C代码: 简单的HelloWorld! #include <stdio.h> int main(){ printf("Hello World!"); return 0; } * 编译: arm-linux-gnueabihf-gcc -g main.c -o remote_debug * 将编译好的二进制文件remote_debug拷贝到ARM下,尝试运行程序:./remote_debug,没有问题。启动调试 :gdbserver :6666 remote_debug,到这里一切正常,ARM板提示监听6666端口。 * Ubnutu下启动GDB客户端:arm-linux-gnueabihf-gdb remote_debug * 下面是GDB操作过程: GNU gdb (crosstool-NG linaro-1.13.1-4.7-2013.03-20130313 - Linaro GCC 2013.03) 7.5-2012.12 Copyright (C) 2012 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "--host=i686-build_pc-linux-gnu --target=arm-linux-gnueabihf". For bug reporting instructions, please see: <https://bugs.launchpad.net/gcc-linaro>... Reading symbols from /home/wgco/qtwork/remote_debug/remote_debug...done. # (gdb) target remote 192.168.0.200:6666 Remote debugging using 192.168.0.200:6666 Reading symbols from /usr/local/arm/gcc-linaro-arm-linux-gnueabihf-4.7-2013.03-20130313_linux/arm-linux-gnueabihf/libc/lib/ld-linux-armhf.so.3...(no debugging symbols found)...done. Loaded symbols for /usr/local/arm/gcc-linaro-arm-linux-gnueabihf-4.7-2013.03-20130313_linux/arm-linux-gnueabihf/libc/lib/ld-linux-armhf.so.3 0x40000c80 in ?? () from /usr/local/arm/gcc-linaro-arm-linux-gnueabihf-4.7-2013.03-20130313_linux/arm-linux-gnueabihf/libc/lib/ld-linux-armhf.so.3 # (gdb) c Continuing. warning: Could not load shared library symbols for /lib/libc.so.6. Do you need "set solib-search-path" or "set sysroot"? Program received signal SIGILL, Illegal instruction. 0x4000270c in ?? () from /usr/local/arm/gcc-linaro-arm-linux-gnueabihf-4.7-2013.03-20130313_linux/arm-linux-gnueabihf/libc/lib/ld-linux-armhf.so.3 # (gdb) q A debugging session is active. Inferior 1 [process 906] will be killed. Quit anyway? (y or n) y * 根据以上信息,有一条警告warning: Could not load shared library symbols for /lib/libc.so.6. 。但是在ARM板的/lib/目录下是有libc.so.6这个文件的,不知道为什么调试的时候不能加载?
有大神能帮帮分析一下蓝屏代码吗?
No .natvis files found at C:\Windows\SYSTEM32\Visualizers. No .natvis files found at C:\Users\HR\AppData\Local\Dbg\Visualizers. Microsoft (R) Windows Debugger Version 10.0.18362.1 X86 Copyright (c) Microsoft Corporation. All rights reserved. Loading Dump File [C:\Users\HR\Desktop\010320-9796-01.dmp] Mini Kernel Dump File: Only registers and stack trace are available Symbol search path is: srv* Executable search path is: Unable to load image ntoskrnl.exe, Win32 error 0n2 *** WARNING: Unable to verify timestamp for ntoskrnl.exe ************************************************************************* *** *** *** *** *** Either you specified an unqualified symbol, or your debugger *** *** doesn't have full symbol information. Unqualified symbol *** *** resolution is turned off by default. Please either specify a *** *** fully qualified symbol module!symbolname, or enable resolution *** *** of unqualified symbols by typing ".symopt- 100". Note that *** *** enabling unqualified symbol resolution with network symbol *** *** server shares in the symbol path may cause the debugger to *** *** appear to hang for long periods of time when an incorrect *** *** symbol name is typed or the network symbol server is down. *** *** *** *** For some commands to work properly, your symbol path *** *** must point to .pdb files that have full type information. *** *** *** *** Certain .pdb files (such as the public OS symbols) do not *** *** contain the required information. Contact the group that *** *** provided you with these symbols if you need this command to *** *** work. *** *** *** *** Type referenced: nt!_MMPTE_TRANSITION *** *** *** ************************************************************************* Windows 10 Kernel Version 18362 MP (4 procs) Free x86 compatible Product: WinNt, suite: TerminalServer SingleUserTS Machine Name: Kernel base = 0x82600000 PsLoadedModuleList = 0x828b86f8 Debug session time: Fri Jan 3 14:34:43.891 2020 (UTC + 8:00) System Uptime: 0 days 2:48:45.619 Unable to load image ntoskrnl.exe, Win32 error 0n2 *** WARNING: Unable to verify timestamp for ntoskrnl.exe ************************************************************************* *** *** *** *** *** Either you specified an unqualified symbol, or your debugger *** *** doesn't have full symbol information. Unqualified symbol *** *** resolution is turned off by default. Please either specify a *** *** fully qualified symbol module!symbolname, or enable resolution *** *** of unqualified symbols by typing ".symopt- 100". Note that *** *** enabling unqualified symbol resolution with network symbol *** *** server shares in the symbol path may cause the debugger to *** *** appear to hang for long periods of time when an incorrect *** *** symbol name is typed or the network symbol server is down. *** *** *** *** For some commands to work properly, your symbol path *** *** must point to .pdb files that have full type information. *** *** *** *** Certain .pdb files (such as the public OS symbols) do not *** *** contain the required information. Contact the group that *** *** provided you with these symbols if you need this command to *** *** work. *** *** *** *** Type referenced: nt!_MMPTE_TRANSITION *** *** *** ************************************************************************* Loading Kernel Symbols ............................................................... ................................................................ .................................................. Loading User Symbols Loading unloaded module list ......... ************* Symbol Loading Error Summary ************** Module name Error ntoskrnl The system cannot find the file specified You can troubleshoot most symbol related issues by turning on symbol loading diagnostics (!sym noisy) and repeating the command that caused symbols to be loaded. You should also verify that your symbol search path (.sympath) is correct. For analysis of this file, run !analyze -v
有关BlueScreen的那些事儿
小本本最近遇到局域网内客户机频繁蓝屏问题。阴差阳错的问题抛到了我这边(what?)男人不能怂就是干。 然后,本本在网上查了大部分的蓝屏原因解决方法,并找到了客户机本地的蓝屏日志文件内容。日志贴到后面好了,目前问题还没有解决,,先来记录一下过程。希望有大腿给点意见: 本本先是按着这个说明搞得: https://jingyan.baidu.com/article/b87fe19ea527c25218356801.html 然后未见异常,找了一些其他方法未果,就去找了下面的日志: Microsoft (R) Windows Debugger Version 6.12.0002.633 AMD64 Copyright (c) Microsoft Corporation. All rights reserved. Loading Dump File [F:\zooqun\error\Minidump2\062718-12453-01.dmp] Mini Kernel Dump File: Only registers and stack trace are available Symbol search path is: *** Invalid *** **************************************************************************** * Symbol loading may be unreliable without a symbol search path. * * Use .symfix to have the debugger choose a symbol path. * * After setting your symbol path, use .reload to refresh symbol locations. * **************************************************************************** Executable search path is: ********************************************************************* * Symbols can not be loaded because symbol path is not initialized. * * * * The Symbol Path can be set by: * * using the _NT_SYMBOL_PATH environment variable. * * using the -y <symbol_path> argument when starting the debugger. * * using .sympath and .sympath+ * ********************************************************************* ****Unable to load image \SystemRoot\system32\ntoskrnl.exe, ****Win32 error 0n2 *** WARNING: Unable to verify timestamp for ntoskrnl.exe *** ERROR: Module load completed but symbols could not be loaded for ntoskrnl.exe Windows 7 Kernel Version 7601 (Service Pack 1) MP (2 procs) Free x64 Product: WinNt, suite: TerminalServer SingleUserTS Built by: 7601.17514.amd64fre.win7sp1_rtm.101119-1850 Machine Name: Kernel base = 0xfffff800`03e0d000 PsLoadedModuleList = 0xfffff800`04052e90 Debug session time: Wed Jun 27 08:33:22.599 2018 (UTC + 8:00) System Uptime: 0 days 0:00:45.021 ********************************************************************* * Symbols can not be loaded because symbol path is not initialized. * * * * The Symbol Path can be set by: * * using the _NT_SYMBOL_PATH environment variable. * * using the -y <symbol_path> argument when starting the debugger. * * using .sympath and .sympath+ * ********************************************************************* Unable to load image \SystemRoot\system32\ntoskrnl.exe, Win32 error 0n2 *** WARNING: Unable to verify timestamp for ntoskrnl.exe *** ERROR: Module load completed but symbols could not be loaded for ntoskrnl.exe Loading Kernel Symbols ............................................................... ................................................................ ........... Loading User Symbols Loading unloaded module list .... ******************************************************************************* * * * Bugcheck Analysis * * * ******************************************************************************* Use !analyze -v to get detailed debugging information. BugCheck D1, {0, 2, 0, fffff88001591401} ***** Kernel symbols are WRONG. Please fix symbols to do analysis.
Loaded 'ntdll.dll', no matching symbolic information found.
程序在启动一个播放声音的线程函数之后,当运行到程序结束时候出现异常 Loaded 'ntdll.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\kernel32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\KernelBase.dll', no matching symbolic information found. Loaded symbols for 'C:\Windows\System32\MFC42D.DLL' Loaded symbols for 'C:\Windows\System32\MSVCRTD.DLL' Loaded 'C:\Windows\System32\gdi32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\user32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\lpk.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\usp10.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\msvcrt.dll', no matching symbolic information found. Loaded symbols for 'C:\Windows\System32\MFCO42D.DLL' Loaded 'C:\Windows\System32\winmm.dll', no matching symbolic information found. Loaded 'D:\test\音频相关\PlayADPCM(台北参考)(1)20140404\新建文件夹\0411\0410\PlayFileSound\Debug\lib_VoiceEngine_dll.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\imm32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\msctf.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\MFC42LOC.DLL', no matching symbolic information found. Loaded 'C:\Windows\winsxs\x86_microsoft.windows.common-controls_6595b64144ccf1df_5.82.7601.18201_none_ec80f00e8593ece5\comctl32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\advapi32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\sechost.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\rpcrt4.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\uxtheme.dll', no matching symbolic information found. Loaded 'C:\ProgramData\Tencent\TSVulFw\TSVulFW.DAT', no matching symbolic information found. Loaded 'C:\Windows\System32\ws2_32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\nsi.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\version.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\psapi.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\shell32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\shlwapi.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\ole32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\oleaut32.dll', no matching symbolic information found. Loaded 'C:\Windows\winsxs\x86_microsoft.windows.gdiplus_6595b64144ccf1df_1.1.7601.18120_none_72d2e82386681b36\GdiPlus.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\dwmapi.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\cryptbase.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\comdlg32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\clbcatq.dll', no matching symbolic information found. Loaded 'C:\Windows\winsxs\x86_microsoft.windows.common-controls_6595b64144ccf1df_6.0.7601.17514_none_41e6975e2bd6f2b2\comctl32.dll', no matching symbolic information found. Loaded 'C:\Program Files\Common Files\microsoft shared\ink\tiptsf.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\WindowsCodecs.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\apphelp.dll', no matching symbolic information found. Loaded 'C:\Users\Public\Thunder Network\KanKan\reghelper\xappex.1.1.1.73.(478).dll', no matching symbolic information found. Loaded 'C:\Windows\System32\wintrust.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\crypt32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\msasn1.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\mlang.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\EhStorShell.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\setupapi.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\cfgmgr32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\devobj.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\propsys.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\cscui.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\cscdll.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\cscapi.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\ntshrui.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\srvcli.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\slc.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\profapi.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\cryptsp.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\rsaenh.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\RpcRtRemote.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\ntmarta.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\Wldap32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\StructuredQuery.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\secur32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\sspicli.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\actxprxy.dll', no matching symbolic information found. Loaded 'C:\Program Files\Internet Explorer\ieproxy.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\api-ms-win-downlevel-shlwapi-l1-1-0.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\api-ms-win-downlevel-shlwapi-l2-1-0.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\api-ms-win-downlevel-advapi32-l1-1-0.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\thumbcache.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\shdocvw.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\ieframe.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\api-ms-win-downlevel-user32-l1-1-0.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\api-ms-win-downlevel-shell32-l1-1-0.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\api-ms-win-downlevel-version-l1-1-0.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\api-ms-win-downlevel-normaliz-l1-1-0.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\normaliz.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\iertutil.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\SearchFolder.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\MMDevAPI.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\wdmaud.drv', no matching symbolic information found. Loaded 'C:\Windows\System32\ksuser.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\avrt.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\AudioSes.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\msacm32.drv', no matching symbolic information found. Loaded 'C:\Windows\System32\msacm32.dll', no matching symbolic information found. Loaded 'C:\Windows\System32\midimap.dll', no matching symbolic information found. The thread 0x11D0 has exited with code 0 (0x0). The thread 0x1040 has exited with code 0 (0x0). The thread 0x1158 has exited with code 0 (0x0). The thread 0x1708 has exited with code 0 (0x0). The thread 0x94 has exited with code 0 (0x0). The thread 0x1128 has exited with code 0 (0x0). The thread 0x164C has exited with code 0 (0x0). The thread 0x1650 has exited with code 0 (0x0). The thread 0x1210 has exited with code 0 (0x0). The thread 0x1710 has exited with code 0 (0x0). First-chance exception in PlayFileSound.exe (WDMAUD.DRV): 0xC0000005: Access Violation.
Unique Words 的问题求解答
Problem Description A common problem faced by electronic information providers is determining the number of unique words in a document. The case of a word does not affect its uniqueness. For example, The, tHE and The are all considered equivalent. Punctuation can appear in these documents and is handled as follows: 1) Periods '.' and exclamation marks '!' may appear at the end of a sentence and should not be considered a word, or part of a word. 2) Dashes '-' appear between hyphenated words. The hyphenated words should be considered separately. 3) Commas ',' colons ':' and semicolons ';' appear within a sentence and should not be considered a word, or part of a word. 4) Apostrophes ' appear within contractions and possessive forms. These symbols should be treated as if they never appeared (i.e., as if they were deleted from the word). Input The input file contains a series of documents, each separated by an entire line of text containing only the word EOD Each document will contain no more than 1,000 lines and at most 100 unique words. All input lines will not contain more than 80 characters. Numbers, control characters, and punctuation symbols not listed above will not appear in the text. An entire line containing only the string EOT identifies the end of the list of documents; note this last document is terminated by EOT and not EOD Output The output should be an alphabetically sorted list of all unique words, with each unique word displayed in uppercase. Sample Input The banker hammered home his two-part message! His message, at times satirical, was that the bank's situation was a mess. EOD Hello world EOD This is a final example EOT Sample Output WORDS IN DOCUMENT #1 A AT BANKER BANKS HAMMERED HIS HOME MESS MESSAGE PART SATIRICAL SITATUATION THAT THE TIMES TWO WAS WORDS IN DOCUMENT #2 HELLO WORLD WORDS IN DOCUMENT #3 A EXAMPLE FINAL IS THIS
运行的GS自动关闭,崩溃 Access violation - code c0000005
Microsoft (R) Windows Debugger Version 6.11.0001.404 X86 Copyright (c) Microsoft Corporation. All rights reserved. Loading Dump File [C:\Users\Administrator\Desktop\dump-GameServer.exe-2015-10-24-23-29-17-1480.dmp] User Mini Dump File: Only registers, stack and portions of memory are available Symbol search path is: *** Invalid *** **************************************************************************** * Symbol loading may be unreliable without a symbol search path. * * Use .symfix to have the debugger choose a symbol path. * * After setting your symbol path, use .reload to refresh symbol locations. * **************************************************************************** Executable search path is: Windows Server 2003 Version 3790 (Service Pack 2) MP (4 procs) Free x86 compatible Product: Server, suite: Enterprise TerminalServer SingleUserTS Machine Name: Debug session time: Sat Oct 24 23:29:17.000 2015 (GMT+8) System Uptime: not available Process Uptime: 0 days 0:01:54.000 ...................................... This dump file has an exception of interest stored in it. The stored exception information can be accessed via .ecxr. (fd4.5c8): Access violation - code c0000005 (first/second chance not available) eax=0bedb070 ebx=0bed8c88 ecx=00000069 edx=0bedb070 esi=0bed8c60 edi=0bed8cb8 eip=7c9585ec esp=0356ee54 ebp=0356ee64 iopl=0 nv up ei pl zr na pe nc cs=001b ss=0023 ds=0023 es=0023 fs=003b gs=0000 efl=00000246 Unable to load image C:\WINDOWS\system32\ntdll.dll, Win32 error 0n2 *** WARNING: Unable to verify timestamp for ntdll.dll *** ERROR: Module load completed but symbols could not be loaded for ntdll.dll ntdll+0x285ec: 7c9585ec c3 ret 上面是WinDbg打开日志文件后显示 求大神指点
Sokoban 完整性判断
Problem Description Soko-ban is a Japanese word for a warehouse worker, and the name of a classic computer game created in the 1980s. It is a one-player game with the following premise. A single worker is in an enclosed warehouse with one or more boxes. The goal is to move those boxes to a set of target locations, with the number of target locations equalling the number of boxes. The player indicates a direction of motion for the worker using the arrow keys (up, down, left, right), according to the following rules. 1.If the indicated direction of motion for the worker leads to an empty location (i.e., one that does not have a box or wall), the worker advances by one step in that direction. 2.If the indicated direction of motion would cause the worker to move into a box, and the location on the other side of the box is empty, then both the worker and the box move one spot in that direction (i.e., the worker pushes the box). 3.If the indicated direction of motion for a move would cause the worker to move into a wall, or to move into a box that has another box or a wall on its opposite side, then no motion takes place for that keystroke. The goal is to simultaneously have all boxes on the target locations. In that case, the player is successful (and as a formality, all further keystrokes will be ignored). The game has been studied by computer scientists (in fact, one graduate student wrote his entire Ph.D. dissertation about the analysis of sokoban). Unfortunately, it turns out that finding a solution is very difficult in general, as it is both NP-hard and PSPACE-complete. Therefore, your goal will be a simpler task: simulating the progress of a game based upon a player's sequence of keystrokes. For the sake of input and output, we describe the state of a game using the following symbols: For example, the initial configuration diagrammed at the beginning of this problem appears as the first input case below. Input Each game begins with a line containing integers R and C, where 4 ≤ R ≤ 15 represents the number of rows, and 4 ≤ C ≤ 15 represents the number of columns. Next will be R lines representing the R rows from top to bottom, with each line having precisely C characters, from left-to-right. Finally, there is a line containing at most 50 characters describing the player's sequence of keystrokes, using the symbols U, D, L, and R respectively for up, down, left, and right. You must read that entire sequence from the input, even though a particular game might end successfully prior to the end of the sequence. The data set ends with the line 0 0. We will guarantee that each game has precisely one worker, an equal number of boxes and locations, at least one initially misplaced box, and an outermost boundary consisting entirely of walls. Output For each game, you should first output a line identifying the game number, beginning at 1, and either the word complete or incomplete, designating whether or not the player successfully completed that game. Following that should be a representation of the final board configuration. Sample Input 8 9 ######### #...#...# #..bb.b.# #...#w#.# #...#b#.# #...++++# #...#..## ######### ULRURDDDUULLDDD 6 7 ####### #..#### #.+.+.# #.bb#w# ##....# ####### DLLUDLULUURDRDDLUDRR 0 0 Sample Output Game 1: incomplete ######### #...#...# #..bb...# #...#.#.# #...#.#.# #...+W+B# #...#b.## ######### Game 2: complete ####### #..#### #.B.B.# #.w.#.# ##....# #######
xp系统安装自定制Gina登录模块后,PGPfsfd.sys导致系统蓝屏重启
背景:安装指静脉操作系统登录控制软件后(类似于指纹认证,取代Windows登录时输入的密码,指静脉认证通过自动登录系统),自定制了xp系统Gina库,在部分安装pgp加密软件机器上出现蓝屏重启现象(卸载指静脉登录软件后恢复正常,不蓝屏重启),在没有安装pgp加密软件的机器没有蓝屏重启现象。 蓝屏dump文件分析结果如下: Microsoft (R) Windows Debugger Version 6.2.9200.20512 X86 Copyright (c) Microsoft Corporation. All rights reserved. Loading Dump File [C:\Users\TL\Desktop\报错日志\WER1ec0.dir00\Mini091217-03.dmp] Mini Kernel Dump File: Only registers and stack trace are available Symbol search path is: SRV*d:/temp/*http://msdl.microsoft.com/download/symbols;D:\MyDebugDump Executable search path is: Windows XP Kernel Version 2600 (Service Pack 3) MP (4 procs) Free x86 compatible Product: WinNt, suite: TerminalServer SingleUserTS Built by: 2600.xpsp_sp3_gdr.130107-0416 Machine Name: Kernel base = 0x804d8000 PsLoadedModuleList = 0x8055e720 Debug session time: Tue Sep 12 14:21:28.319 2017 (UTC + 8:00) System Uptime: 0 days 0:02:15.053 Loading Kernel Symbols ............................................................... ................................................................ . Loading User Symbols Loading unloaded module list ................. ******************************************************************************* * * * Bugcheck Analysis * * * ******************************************************************************* Use !analyze -v to get detailed debugging information. BugCheck 35, {8a4eb008, 0, 0, 0} *** WARNING: Unable to verify timestamp for PGPfsfd.sys *** ERROR: Module load completed but symbols could not be loaded for PGPfsfd.sys Probably caused by : PGPfsfd.sys ( PGPfsfd+b8ee ) Followup: MachineOwner --------- 3: kd> !analyze -v ******************************************************************************* * * * Bugcheck Analysis * * * ******************************************************************************* NO_MORE_IRP_STACK_LOCATIONS (35) A higher level driver has attempted to call a lower level driver through the IoCallDriver() interface, but there are no more stack locations in the packet, hence, the lower level driver would not be able to access its parameters, as there are no parameters for it. This is a disasterous situation, since the higher level driver "thinks" it has filled in the parameters for the lower level driver (something it MUST do before it calls it), but since there is no stack location for the latter driver, the former has written off of the end of the packet. This means that some other memory has probably been trashed at this point. Arguments: Arg1: 8a4eb008, Address of the IRP Arg2: 00000000 Arg3: 00000000 Arg4: 00000000 Debugging Details: ------------------ CUSTOMER_CRASH_COUNT: 3 DEFAULT_BUCKET_ID: DRIVER_FAULT BUGCHECK_STR: 0x35 PROCESS_NAME: winlogon.exe LAST_CONTROL_TRANSFER: from 804f01d0 to 804faf9f STACK_TEXT: 9d8365ac 804f01d0 00000035 8a4eb008 00000000 nt!KeBugCheckEx+0x1b 9d8365c4 b96eee9b 00000000 8a4eb008 8a4eb078 nt!IopfCallDriver+0x18 9d8365e8 b96fb754 9d836608 89bb0c68 00000000 fltMgr!FltpLegacyProcessingAfterPreCallbacksCompleted+0x20b 9d836624 804f01e9 89bb0c68 8a4eb008 8a4eb008 fltMgr!FltpCreate+0x26a 9d836634 b96fb6c3 8a4eb008 00000000 8a7b6b70 nt!IopfCallDriver+0x31 9d836664 804f01e9 89c0eee8 8a4eb008 8a4eb008 fltMgr!FltpCreate+0x1d9 9d836674 b96cb8ee 89c17550 8a675a00 8a04ad00 nt!IopfCallDriver+0x31 WARNING: Stack unwind information not available. Following frames may be wrong. 9d836698 b96d7e49 89c0eee8 8a675a00 89c17550 PGPfsfd+0xb8ee 9d8366c4 b96d9bed 89c17498 8a675a00 8a78b168 PGPfsfd+0x17e49 9d8366dc 804f01e9 89c17550 8a4eb008 8a7badb0 PGPfsfd+0x19bed 9d836784 804f01e9 89c13c10 8a4eb008 8a4eb008 nt!IopfCallDriver+0x31 9d8367bc 804f01e9 8a675a00 8a4eb008 8a4eb008 nt!IopfCallDriver+0x31 9d8367cc b96eee9b 00000000 8a4eb008 8a4eb0e4 nt!IopfCallDriver+0x31 9d8367f0 b96fb754 9d836810 8978a678 00000000 fltMgr!FltpLegacyProcessingAfterPreCallbacksCompleted+0x20b 9d83682c 804f01e9 8978a678 8a4eb008 9d836cc0 fltMgr!FltpCreate+0x26a 9d83683c b957a5ba 8943d62c 8943d628 00000000 nt!IopfCallDriver+0x31 9d836870 b957b974 8943d628 b956f088 8943d628 Mup!DnrRedirectFileOpen+0x443 9d8368d0 b957c894 0043d628 00f800c0 8a4eb108 Mup!DnrNameResolve+0x53c 9d836900 b9576d97 89b7b5d0 8a4eb008 8a7b7ac0 Mup!DnrStartNameResolution+0x292 9d836970 b9574fe6 89b7b5d0 8a7b7a08 8a4eb008 Mup!DfsCommonCreate+0x237 9d8369b8 b9575086 8a7b7a08 8a4eb008 8a4eb018 Mup!DfsFsdCreate+0xe0 9d836a10 804f01e9 8a7b7a08 8a4eb008 8a4eb008 Mup!MupCreate+0xbc 9d836a20 80584232 8a7b79f0 894bb414 9d836bb8 nt!IopfCallDriver+0x31 9d836b00 805c0490 8a7b7a08 00000000 894bb370 nt!IopParseDevice+0xa12 9d836b78 805bca1c 00000000 9d836bb8 00000040 nt!ObpLookupObjectName+0x53c 9d836bcc 8057816c 00000000 00000000 00000001 nt!ObOpenObjectByName+0xea 9d836d54 805426cc 02c8df7c 02c8df44 02c8dfa8 nt!NtQueryFullAttributesFile+0x124 9d836d54 7c92e514 02c8df7c 02c8df44 02c8dfa8 nt!KiFastCallEntry+0xfc 02c8dfa8 00000000 00000000 00000000 00000000 0x7c92e514 STACK_COMMAND: kb FOLLOWUP_IP: PGPfsfd+b8ee b96cb8ee ?? ??? SYMBOL_STACK_INDEX: 7 SYMBOL_NAME: PGPfsfd+b8ee FOLLOWUP_NAME: MachineOwner MODULE_NAME: PGPfsfd IMAGE_NAME: PGPfsfd.sys DEBUG_FLR_IMAGE_TIMESTAMP: 4e1bdf32 FAILURE_BUCKET_ID: 0x35_PGPfsfd+b8ee BUCKET_ID: 0x35_PGPfsfd+b8ee Followup: MachineOwner --------- 3: kd> lmvm PGPfsfd start end module name b96c0000 b96eb000 PGPfsfd T (no symbols) Loaded symbol image file: PGPfsfd.sys Image path: PGPfsfd.sys Image name: PGPfsfd.sys Timestamp: Tue Jul 12 13:44:18 2011 (4E1BDF32) CheckSum: 0002657B ImageSize: 0002B000 Translations: 0000.04b0 0000.04e4 0409.04b0 0409.04e4 请高手帮忙分析下,指个方向,拜谢。
Sokoban 的问题
Problem Description Soko-ban is a Japanese word for a warehouse worker, and the name of a classic computer game created in the 1980s. It is a one-player game with the following premise. A single worker is in an enclosed warehouse with one or more boxes. The goal is to move those boxes to a set of target locations, with the number of target locations equalling the number of boxes. The player indicates a direction of motion for the worker using the arrow keys (up, down, left, right), according to the following rules. 1.If the indicated direction of motion for the worker leads to an empty location (i.e., one that does not have a box or wall), the worker advances by one step in that direction. 2.If the indicated direction of motion would cause the worker to move into a box, and the location on the other side of the box is empty, then both the worker and the box move one spot in that direction (i.e., the worker pushes the box). 3.If the indicated direction of motion for a move would cause the worker to move into a wall, or to move into a box that has another box or a wall on its opposite side, then no motion takes place for that keystroke. The goal is to simultaneously have all boxes on the target locations. In that case, the player is successful (and as a formality, all further keystrokes will be ignored). The game has been studied by computer scientists (in fact, one graduate student wrote his entire Ph.D. dissertation about the analysis of sokoban). Unfortunately, it turns out that finding a solution is very difficult in general, as it is both NP-hard and PSPACE-complete. Therefore, your goal will be a simpler task: simulating the progress of a game based upon a player's sequence of keystrokes. For the sake of input and output, we describe the state of a game using the following symbols: For example, the initial configuration diagrammed at the beginning of this problem appears as the first input case below. Input Each game begins with a line containing integers R and C, where 4 ≤ R ≤ 15 represents the number of rows, and 4 ≤ C ≤ 15 represents the number of columns. Next will be R lines representing the R rows from top to bottom, with each line having precisely C characters, from left-to-right. Finally, there is a line containing at most 50 characters describing the player's sequence of keystrokes, using the symbols U, D, L, and R respectively for up, down, left, and right. You must read that entire sequence from the input, even though a particular game might end successfully prior to the end of the sequence. The data set ends with the line 0 0. We will guarantee that each game has precisely one worker, an equal number of boxes and locations, at least one initially misplaced box, and an outermost boundary consisting entirely of walls. Output For each game, you should first output a line identifying the game number, beginning at 1, and either the word complete or incomplete, designating whether or not the player successfully completed that game. Following that should be a representation of the final board configuration. Sample Input 8 9 ######### #...#...# #..bb.b.# #...#w#.# #...#b#.# #...++++# #...#..## ######### ULRURDDDUULLDDD 6 7 ####### #..#### #.+.+.# #.bb#w# ##....# ####### DLLUDLULUURDRDDLUDRR 0 0 Sample Output Game 1: incomplete ######### #...#...# #..bb...# #...#.#.# #...#.#.# #...+W+B# #...#b.## ######### Game 2: complete ####### #..#### #.B.B.# #.w.#.# ##....# #######
CIVIC DILL MIX 的实现
Problem Description Roman numerals are an ancient numbering system used extensively throughout Europe through the 13th century (where it was eventually replaced by our current positional system). Vestiges of this system still exist today on clock faces, building cornerstones, Super Bowls and Star Wars episodes. The system uses the following 7 symbols: Symbols I, X, C and M can be repeated as needed (though never more than three times for I, X and C), so that 3 is represented as III, 27 as XXVII and 4865 as MMMMDCCCLXV. The symbols are always written from the highest value to the lowest, but for one exception: if a lower symbol precedes a higher one, it is subtracted from the higher. Thus 4 is written not as IIII but as IV, and 900 is written as CM. The rules for this subtractive behavior are the following: 1. Only I, X and C can be subtracted. 2. These numbers can only appear once in their subtractive versions (e.g., you can’t write 8 as IIX). 3. Each can only come before symbols that are no larger than 10 times their value. Thus we can not write IC for 99 or XD for 490 (these would be XCIX and CDXC, respectively). Note that the first two words in this problem title are invalid Roman numerals, but the third is fine. Your task for this problem is simple: read in a set of Roman numeral values and output their sum as a Roman numeral. Input Input will consist of multiple test cases. Each test case starts with a positive integer n indicating the number of values to add. After this will come n values (potentially several on a line), all valid Roman numerals with whitespace only coming between values. A value of n = 0 will indicate end of input. All sums will be less than 5000. Output For each test case, output the case number and the sum, both as Roman numerals, using the format shown below. Case numbers should start at I. Sample Input 2 XII MDL 4 I I I I 0 Sample Output Case I: MDLXII Case II: IV
Alphabet Soup 是怎么写的
Problem Description Peter is having lunch at home. Unfortunately for him, today's meal is soup. As Peter's mother is aware that he doesn't like it very much, she has cooked a special soup using pasta pieces shaped like letters from the alphabet, numbers and other characters. She has a special knife with which she can prepare an unlimited supply of pasta pieces that may come in S di fferent forms. The soup always has P pasta pieces in it, and is so thick that the pieces never move. Despite her eff orts, Peter is still not happy with today's menu and asks how many days in his life he will have to eat soup. His mother promises him that she will prepare a di fferent soup every day, and that on no day will the dish contain the same shapes in all positions as any soup dish previously served. However, the number P of pasta pieces, as well as the positions in which pieces float, will remain the same every day. Peter is not easily fooled (or so he thinks), and he cleverly realizes that this can still make him eat soup for ages. In an attempt to reduce the number of confi gurations, he tells his mother he will not accept any dish which can be obtained by rotating one of the con figurations previously seen. Figure 1: Top view of Peter's dish Consider the dish as a circle of radius 2 centered at the origin. All the symbols will be floating in the soup at a given angle (in millidegrees) at distance 1 from the origin. Two plates are considered equal if you can perform a rotation of one of the dishes about its center so that the positions of the symbols, as well as the symbols themselves, are the same in both. Your program will be given the number of possible symbols Peter's mother has available, and the angles determining the location of each of the pasta pieces (measured clockwise in millidegrees). Write a program that returns the number of possible plates Peter's mother can prepare. As this number can be very large, output the number modulo 100,000,007, which is prime. Input The fi rst line of input in each test case contains two numbers: S (2<=S<=1,000), the number of symbols Peter's mother can use; and P (P > 0), the number of pasta pieces floating in the soup. Each of the next P lines contain the angle A (0<=A <360,000) of one of the P pieces (measured clockwise in millidegrees). All angles will be di fferent. Di fferent tests cases are separated by a blank line. After the last test case there is a line with S = P = -1. Output For each test case output a single integer in a line by itself, the number of diff erent plates Peter's mother can cook modulo 100,000,007. Sample Input 2 4 0 90000 180000 270000 100 5 0 45000 90000 180000 270000 -1 -1 Sample Output 6 99999307
Harmony Forever 的实现
Problem Description We believe that every inhabitant of this universe eventually will find a way to live together in harmony and peace; that trust, patience, kindness and loyalty will exist between every living being of this earth; people will find a way to appreciate and cooperate with each other instead of continuous bickering, arguing and fighting. Harmony -- the stage of society so many people dream of and yet it seems so far away from now ... Fortunately, the method of unlocking the key to true Harmony is just discovered by a group of philosophers. It is recorded on a strange meteorite which has just hit the earth. You need to decipher the true meaning behind those seemingly random symbols ... More precisely, you are to write a program which will support the following two kinds of operation on an initially empty set S : 1. B X : Add number X to set S . The Kth command in the form of B X always happens at time K , and number X does not belong to set S before this operation. 2. A Y : Of all the numbers in set S currently, find the one which has the minimum remainder when divided by Y . In case a tie occurs, you should choose the one which appeared latest in the input. Report the time when this element is inserted. It is said that if the answer can be given in the minimum possible time, true Harmony can be achieved by human races. You task is to write a program to help us. Input There are multiple test cases in the input file. Each test case starts with one integer T where 1<=T<=40000 . The following T lines each describe an operation, either in the form of ``B X " or ``A Y " where 1<=X , Y<=500000 . T = 0 indicates the end of input file and should not be processed by your program. Output Print the result of each test case in the format as indicated in the sample output. For every line in the form of ``A Y ", you should output one number, the requested number, on a new line; output -1 if no such number can be found. Separate the results of two successive inputs with one single blank line. Sample Input 5 B 1 A 5 B 10 A 5 A 40 2 B 1 A 2 0 Sample Output Case 1: 1 2 1 Case 2: 1
Here We Go(relians) Again 的思路的问题
Problem Description The Gorelians are a warlike race that travel the universe conquering new worlds as a form of recreation. Given their violent, fun-loving nature, keeping their leaders alive is of serious concern. Part of the Gorelian security plan involves changing the traffic patterns of their cities on a daily basis, and routing all Gorelian Government Officials to the Government Building by the fastest possible route. Fortunately for the Gorelian Minister of Traffic (that would be you), all Gorelian cities are laid out as a rectangular grid of blocks, where each block is a square measuring 2520 rels per side (a rel is the Gorelian Official Unit of Distance). The speed limit between two adjacent intersections is always constant, and may range from 1 to 9 rels per blip (a blip, of course, being the Gorelian Official Unit of Time). Since Gorelians have outlawed decimal numbers as unholy (hey, if you're the dominant force in the known universe, you can outlaw whatever you want), speed limits are always integer values. This explains why Gorelian blocks are precisely 2520 rels in length: 2520 is the least common multiple of the integers 1 through 9. Thus, the time required to travel between two adjacent intersections is always an integer number of blips. In all Gorelian cities, Government Housing is always at the northwest corner of the city, while the Government Building is always at the southeast corner. Streets between intersections might be one-way or two-way, or possibly even closed for repair (all this tinkering with traffic patterns causes a lot of accidents). Your job, given the details of speed limits, street directions, and street closures for a Gorelian city, is to determine the fastest route from Government Housing to the Government Building. (It is possible, due to street directions and closures, that no route exists, in which case a Gorelian Official Temporary Holiday is declared, and the Gorelian Officials take the day off.) The picture above shows a Gorelian City marked with speed limits, one way streets, and one closed street. It is assumed that streets are always traveled at the exact posted speed limit, and that turning a corner takes zero time. Under these conditions, you should be able to determine that the fastest route from Government Housing to the Government Building in this city is 1715 blips. And if the next day, the only change is that the closed road is opened to two way traffic at 9 rels per blip, the fastest route becomes 1295 blips. On the other hand, suppose the three one-way streets are switched from southbound to northbound (with the closed road remaining closed). In that case, no route would be possible and the day would be declared a holiday. Input The input consists of a set of cities for which you must find a fastest route if one exists. The first line of an input case contains two integers, which are the vertical and horizontal number of city blocks, respectively. The smallest city is a single block, or 1 by 1, and the largest city is 20 by 20 blocks. The remainder of the input specifies speed limits and traffic directions for streets between intersections, one row of street segments at a time. The first line of the input (after the dimensions line) contains the data for the northernmost east-west street segments. The next line contains the data for the northernmost row of north-south street segments. Then the next row of east-west streets, then north-south streets, and so on, until the southernmost row of east-west streets. Speed limits and directions of travel are specified in order from west to east, and each consists of an integer from 0 to 9 indicating speed limit, and a symbol indicating which direction traffic may flow. A zero speed limit means the road is closed. All digits and symbols are delimited by a single space. For east-west streets, the symbol will be an asterisk '*' which indicates travel is allowed in both directions, a less-than symbol '<' which indicates travel is allowed only in an east-to-west direction, or a greater-than symbol '>' which indicates travel is allowed only in a west-to-east direction. For north-south streets, an asterisk again indicates travel is allowed in either direction, a lowercase "vee" character 'v' indicates travel is allowed only in a north-to-south directions, and a caret symbol '^' indicates travel is allowed only in a south-to-north direction. A zero speed, indicating a closed road, is always followed by an asterisk. Input cities continue in this manner until a value of zero is specified for both the vertical and horizontal dimensions. Output For each input scenario, output a line specifying the integer number of blips of the shortest route, a space, and then the word "blips". For scenarios which have no route, output a line with the word "Holiday". Sample Input 2 2 9 * 9 * 6 v 0 * 8 v 3 * 7 * 3 * 6 v 3 * 4 * 8 * 2 2 9 * 9 * 6 v 9 * 8 v 3 * 7 * 3 * 6 v 3 * 4 * 8 * 2 2 9 * 9 * 6 ^ 0 * 8 ^ 3 * 7 * 3 * 6 ^ 3 * 4 * 8 * 0 0 Sample Output 1715 blips 1295 blips Holiday
opencv 入门问题求解!
我现在安装了opencv 2.4.10 和vs2010 我调试了下面的程序为什么摁了F5以后感觉程序没有反应?(感觉就像窗口刷新了一遍但是没有矩阵输出) 请问这是什么原因呢?另外我调试最简单的图片输出也是不能用Mat类调试,要使用Mat类的话就会说我“rR 6010 Abort has been called”就卡在那里了! 求大神指点一下!please! ``` #include<iostream> #include <opencv2/core/core.hpp> //#include <opencv2/highgui/highgui.hpp> #include <opencv2/opencv.hpp> using namespace std; using namespace cv; int main(int argc, char*argv[]) { Mat m(3,2,CV_8UC3,Scalar(0,0,255)); cout<<"M=="<< endl << ""<< m <<endl; //return 0; } ``` 'SSSSSSS.exe': Loaded 'F:\TDDOWNLOAD\SSSSSSS\Debug\SSSSSSS.exe', Symbols loaded. 'SSSSSSS.exe': Loaded 'C:\Windows\System32\ntdll.dll', Symbols loaded (source information stripped). 'SSSSSSS.exe': Loaded 'C:\Windows\System32\kernel32.dll', Symbols loaded (source information stripped). 'SSSSSSS.exe': Loaded 'C:\Windows\System32\KernelBase.dll', Symbols loaded (source information stripped). 'SSSSSSS.exe': Loaded 'F:\opencv\build\x86\vc10\bin\opencv_core2410.dll', Cannot find or open the PDB file 'SSSSSSS.exe': Loaded 'C:\Windows\System32\msvcp100.dll', Symbols loaded (source information stripped). 'SSSSSSS.exe': Loaded 'C:\Windows\System32\msvcr100.dll', Symbols loaded (source information stripped). 'SSSSSSS.exe': Loaded 'C:\Windows\System32\msvcp100d.dll', Symbols loaded (source information stripped). 'SSSSSSS.exe': Loaded 'C:\Windows\System32\msvcr100d.dll', Symbols loaded (source information stripped). The program '[8000] SSSSSSS.exe: Native' has exited with code 0 (0x0).
Here We Go(relians) Again 代码编写和实现
Problem Description The Gorelians are a warlike race that travel the universe conquering new worlds as a form of recreation. Given their violent, fun-loving nature, keeping their leaders alive is of serious concern. Part of the Gorelian security plan involves changing the traffic patterns of their cities on a daily basis, and routing all Gorelian Government Officials to the Government Building by the fastest possible route. Fortunately for the Gorelian Minister of Traffic (that would be you), all Gorelian cities are laid out as a rectangular grid of blocks, where each block is a square measuring 2520 rels per side (a rel is the Gorelian Official Unit of Distance). The speed limit between two adjacent intersections is always constant, and may range from 1 to 9 rels per blip (a blip, of course, being the Gorelian Official Unit of Time). Since Gorelians have outlawed decimal numbers as unholy (hey, if you're the dominant force in the known universe, you can outlaw whatever you want), speed limits are always integer values. This explains why Gorelian blocks are precisely 2520 rels in length: 2520 is the least common multiple of the integers 1 through 9. Thus, the time required to travel between two adjacent intersections is always an integer number of blips. In all Gorelian cities, Government Housing is always at the northwest corner of the city, while the Government Building is always at the southeast corner. Streets between intersections might be one-way or two-way, or possibly even closed for repair (all this tinkering with traffic patterns causes a lot of accidents). Your job, given the details of speed limits, street directions, and street closures for a Gorelian city, is to determine the fastest route from Government Housing to the Government Building. (It is possible, due to street directions and closures, that no route exists, in which case a Gorelian Official Temporary Holiday is declared, and the Gorelian Officials take the day off.) The picture above shows a Gorelian City marked with speed limits, one way streets, and one closed street. It is assumed that streets are always traveled at the exact posted speed limit, and that turning a corner takes zero time. Under these conditions, you should be able to determine that the fastest route from Government Housing to the Government Building in this city is 1715 blips. And if the next day, the only change is that the closed road is opened to two way traffic at 9 rels per blip, the fastest route becomes 1295 blips. On the other hand, suppose the three one-way streets are switched from southbound to northbound (with the closed road remaining closed). In that case, no route would be possible and the day would be declared a holiday. Input The input consists of a set of cities for which you must find a fastest route if one exists. The first line of an input case contains two integers, which are the vertical and horizontal number of city blocks, respectively. The smallest city is a single block, or 1 by 1, and the largest city is 20 by 20 blocks. The remainder of the input specifies speed limits and traffic directions for streets between intersections, one row of street segments at a time. The first line of the input (after the dimensions line) contains the data for the northernmost east-west street segments. The next line contains the data for the northernmost row of north-south street segments. Then the next row of east-west streets, then north-south streets, and so on, until the southernmost row of east-west streets. Speed limits and directions of travel are specified in order from west to east, and each consists of an integer from 0 to 9 indicating speed limit, and a symbol indicating which direction traffic may flow. A zero speed limit means the road is closed. All digits and symbols are delimited by a single space. For east-west streets, the symbol will be an asterisk '*' which indicates travel is allowed in both directions, a less-than symbol '<' which indicates travel is allowed only in an east-to-west direction, or a greater-than symbol '>' which indicates travel is allowed only in a west-to-east direction. For north-south streets, an asterisk again indicates travel is allowed in either direction, a lowercase "vee" character 'v' indicates travel is allowed only in a north-to-south directions, and a caret symbol '^' indicates travel is allowed only in a south-to-north direction. A zero speed, indicating a closed road, is always followed by an asterisk. Input cities continue in this manner until a value of zero is specified for both the vertical and horizontal dimensions. Output For each input scenario, output a line specifying the integer number of blips of the shortest route, a space, and then the word "blips". For scenarios which have no route, output a line with the word "Holiday". Sample Input 2 2 9 * 9 * 6 v 0 * 8 v 3 * 7 * 3 * 6 v 3 * 4 * 8 * 2 2 9 * 9 * 6 v 9 * 8 v 3 * 7 * 3 * 6 v 3 * 4 * 8 * 2 2 9 * 9 * 6 ^ 0 * 8 ^ 3 * 7 * 3 * 6 ^ 3 * 4 * 8 * 0 0 Sample Output 1715 blips 1295 blips Holiday
Cowculations 编写的思路是什么
Description A primitive cow culture was discovered by noted anthropologist Dr. Bo Vine. Hundreds of computation tablets were unearthed in a pasture somewhere near Dallas. Dr. Vine managed to decipher the mystery of the tablets when he realized they represented mathematical calculations. He says ``I've always suspected that cows are smarter than they lead us to believe and here's the proof. The big breakthrough was realizing that they are not able to do math by cownting on their fingers, but they are able to think on their feet. But now I have hundreds of these tablets and I need help in verifying my hypothesis." Write a program that helps Dr. Vine verify his hypothesis. This problem statement describes how he thinks the tablets should be interpreted. Each tablet contains six lines and each line contains a sequence of cow symbols. The first two lines represent cow numbers, the next three represent operations on those numbers and the sixth represents the result. Cow numbers make use of four symbols: V U C and D most closely represent the marks made by the cow hooves, so we will use them to represent the symbols. The numbers on the first two lines of a tablet are always a sequence of 5 of these symbols, and the number on the sixth line of a tablet is always a sequence of 8 of these symbols. To interpret the cow calculations one must keep track of two numbers, hereafter referred to as Num1 and Num2. Originally Num1 is equal to the number on line 1 of a tablet and Num2 is equal to the number on line 2 of a tablet. However the value of Num2 can change as a result of the operations. There are four possible operations, represented by the symbols A, R, L, and N. Operation A causes Num2 to become the ``sum" of Num1 and Num2, using this addition table: A | V U C D ------------------------ V | V U C D U | U C D V,U C | C D V,U U,U D | D V,U U,U C,U The first symbol in a result box represents the result of the addition. The second symbol in a box represents a carry symbol. For example: U A V = U and C A C = V with a carry of U Examples of cow addition are: VUCDV A VUCDV = VDUCV DVVCU A CVUCU = UUVCVC Operation R causes Num2 to have its symbols shifted right one position, with the rightmost symbol being lost and a V being placed into the leftmost position. For example VVCDU would become VVVCD. Operation L causes Num2 to have its symbols shifted left one position, with the leftmost symbol being kept and a V placed into the rightmost position. For example VVCDU would become VVCDUV. N is the null operation. It has no effect on Num2. After the operations have been performed on Num1 and Num2 the final value of Num2 is hopefully the value marked on the sixth line of the tablet. If the final value of Num2 does not make use of 8 symbols then it is padded with V's on the left (VDCCC becomes VVVVDCCC). Dr. Vine says ``I have already verified that all the tablets conform to the hypothesis in terms of the format of the tablets, number of lines and symbols, types of symbols, etc. But I need to verify that the result of the mathematical operation described on lines 1 through 5 is indeed on line 6." Input The first line contains an integer N between 1 and 10 describing how many tablets are represented. The next 6N lines represent the N tablets as described in the problem statement. Output There should be N+2 lines of output. The first line of output should read COWCULATIONS OUTPUT. There will then be one line of output for each tablet that states either YES (the tablet follows Dr. Vine's hypothesis) or NO (the tablet does not follow Dr. Vine's hypothesis). The final line of output should read END OF OUTPUT. Sample Input 5 VVVVU VVVVU A A A VVVVVVUV VVCCV VVDCC L R A VVVVUCVC VVCCV VVDCC R L A VVVVUCVV VVUUU VVVVU A N N VVVVVUCU DDDDD VVVVU A L L UVVVVVVV Sample Output COWCULATIONS OUTPUT YES YES YES NO YES END OF OUTPUT
最近windowsServer2008服务器总是报错重启,有没有大神能帮忙分析下dmp文件?
Microsoft (R) Windows Debugger Version 6.8.0004.0 X86 Copyright (c) Microsoft Corporation. All rights reserved. Loading Dump File [C:\Users\Administrator\Desktop\103119-9750-01.dmp] Mini Kernel Dump File: Only registers and stack trace are available Symbol search path is: SRV*C:\Symbols*http://msdl.microsoft.com/download/symbols Executable search path is: Windows Kernel Version 7601 (Service Pack 1) MP (8 procs) Free x64 Product: Server, suite: Enterprise TerminalServer SingleUserTS Built by: 7601.17514.amd64fre.win7sp1_rtm.101119-1850 Kernel base = 0xfffff800`0161e000 PsLoadedModuleList = 0xfffff800`01863e90 Debug session time: Thu Oct 31 20:30:40.829 2019 (GMT+8) System Uptime: 0 days 9:27:14.453 Loading Kernel Symbols ........................................................................................................................................... Loading User Symbols Loading unloaded module list ........ ******************************************************************************* * * * Bugcheck Analysis * * * ******************************************************************************* Use !analyze -v to get detailed debugging information. BugCheck 18, {0, fffffa800acb5070, 2, ffffffffffdff100} Probably caused by : Unknown_Image ( ANALYSIS_INCONCLUSIVE ) Followup: MachineOwner --------- 0: kd> !analyze -v ******************************************************************************* * * * Bugcheck Analysis * * * ******************************************************************************* REFERENCE_BY_POINTER (18) Arguments: Arg1: 0000000000000000, Object type of the object whose reference count is being lowered Arg2: fffffa800acb5070, Object whose reference count is being lowered Arg3: 0000000000000002, Reserved Arg4: ffffffffffdff100, Reserved The reference count of an object is illegal for the current state of the object. Each time a driver uses a pointer to an object the driver calls a kernel routine to increment the reference count of the object. When the driver is done with the pointer the driver calls another kernel routine to decrement the reference count. Drivers must match calls to the increment and decrement routines. This bugcheck can occur because an object's reference count goes to zero while there are still open handles to the object, in which case the fourth parameter indicates the number of opened handles. It may also occur when the object’s reference count drops below zero whether or not there are open handles to the object, and in that case the fourth parameter contains the actual value of the pointer references count. Debugging Details: ------------------ CUSTOMER_CRASH_COUNT: 1 DEFAULT_BUCKET_ID: DRIVER_FAULT_SERVER_MINIDUMP BUGCHECK_STR: 0x18 PROCESS_NAME: svchost.exe CURRENT_IRQL: 0 LAST_CONTROL_TRANSFER: from 0000000000000000 to 0000000000000000 STACK_TEXT: 00000000`00000000 00000000`00000000 : 00000000`00000000 00000000`00000000 00000000`00000000 00000000`00000000 : 0x0 STACK_COMMAND: kb SYMBOL_NAME: ANALYSIS_INCONCLUSIVE FOLLOWUP_NAME: MachineOwner MODULE_NAME: Unknown_Module IMAGE_NAME: Unknown_Image DEBUG_FLR_IMAGE_TIMESTAMP: 0 BUCKET_ID: INVALID_KERNEL_CONTEXT Followup: MachineOwner ---------
Kafka实战(三) - Kafka的自我修养与定位
Apache Kafka是消息引擎系统,也是一个分布式流处理平台(Distributed Streaming Platform) Kafka是LinkedIn公司内部孵化的项目。LinkedIn最开始有强烈的数据强实时处理方面的需求,其内部的诸多子系统要执行多种类型的数据处理与分析,主要包括业务系统和应用程序性能监控,以及用户行为数据处理等。 遇到的主要问题: 数据正确性不足 数据的收集主要...
volatile 与 synchronize 详解
Java支持多个线程同时访问一个对象或者对象的成员变量,由于每个线程可以拥有这个变量的拷贝(虽然对象以及成员变量分配的内存是在共享内存中的,但是每个执行的线程还是可以拥有一份拷贝,这样做的目的是加速程序的执行,这是现代多核处理器的一个显著特性),所以程序在执行过程中,一个线程看到的变量并不一定是最新的。 volatile 关键字volatile可以用来修饰字段(成员变量),就是告知程序任何对该变量...
Java学习的正确打开方式
在博主认为,对于入门级学习java的最佳学习方法莫过于视频+博客+书籍+总结,前三者博主将淋漓尽致地挥毫于这篇博客文章中,至于总结在于个人,实际上越到后面你会发现学习的最好方式就是阅读参考官方文档其次就是国内的书籍,博客次之,这又是一个层次了,这里暂时不提后面再谈。博主将为各位入门java保驾护航,各位只管冲鸭!!!上天是公平的,只要不辜负时间,时间自然不会辜负你。 何谓学习?博主所理解的学习,它是一个过程,是一个不断累积、不断沉淀、不断总结、善于传达自己的个人见解以及乐于分享的过程。
程序员必须掌握的核心算法有哪些?
由于我之前一直强调数据结构以及算法学习的重要性,所以就有一些读者经常问我,数据结构与算法应该要学习到哪个程度呢?,说实话,这个问题我不知道要怎么回答你,主要取决于你想学习到哪些程度,不过针对这个问题,我稍微总结一下我学过的算法知识点,以及我觉得值得学习的算法。这些算法与数据结构的学习大多数是零散的,并没有一本把他们全部覆盖的书籍。下面是我觉得值得学习的一些算法以及数据结构,当然,我也会整理一些看过...
有哪些让程序员受益终生的建议
从业五年多,辗转两个大厂,出过书,创过业,从技术小白成长为基层管理,联合几个业内大牛回答下这个问题,希望能帮到大家,记得帮我点赞哦。 敲黑板!!!读了这篇文章,你将知道如何才能进大厂,如何实现财务自由,如何在工作中游刃有余,这篇文章很长,但绝对是精品,记得帮我点赞哦!!!! 一腔肺腑之言,能看进去多少,就看你自己了!!! 目录: 在校生篇: 为什么要尽量进大厂? 如何选择语言及方...
大学四年自学走来,这些私藏的实用工具/学习网站我贡献出来了
大学四年,看课本是不可能一直看课本的了,对于学习,特别是自学,善于搜索网上的一些资源来辅助,还是非常有必要的,下面我就把这几年私藏的各种资源,网站贡献出来给你们。主要有:电子书搜索、实用工具、在线视频学习网站、非视频学习网站、软件下载、面试/求职必备网站。 注意:文中提到的所有资源,文末我都给你整理好了,你们只管拿去,如果觉得不错,转发、分享就是最大的支持了。 一、电子书搜索 对于大部分程序员...
linux系列之常用运维命令整理笔录
本博客记录工作中需要的linux运维命令,大学时候开始接触linux,会一些基本操作,可是都没有整理起来,加上是做开发,不做运维,有些命令忘记了,所以现在整理成博客,当然vi,文件操作等就不介绍了,慢慢积累一些其它拓展的命令,博客不定时更新 free -m 其中:m表示兆,也可以用g,注意都要小写 Men:表示物理内存统计 total:表示物理内存总数(total=used+free) use...
比特币原理详解
一、什么是比特币 比特币是一种电子货币,是一种基于密码学的货币,在2008年11月1日由中本聪发表比特币白皮书,文中提出了一种去中心化的电子记账系统,我们平时的电子现金是银行来记账,因为银行的背后是国家信用。去中心化电子记账系统是参与者共同记账。比特币可以防止主权危机、信用风险。其好处不多做赘述,这一层面介绍的文章很多,本文主要从更深层的技术原理角度进行介绍。 二、问题引入 假设现有4个人...
GitHub开源史上最大规模中文知识图谱
近日,一直致力于知识图谱研究的 OwnThink 平台在 Github 上开源了史上最大规模 1.4 亿中文知识图谱,其中数据是以(实体、属性、值),(实体、关系、实体)混合的形式组织,数据格式采用 csv 格式。 到目前为止,OwnThink 项目开放了对话机器人、知识图谱、语义理解、自然语言处理工具。知识图谱融合了两千五百多万的实体,拥有亿级别的实体属性关系,机器人采用了基于知识图谱的语义感...
程序员接私活怎样防止做完了不给钱?
首先跟大家说明一点,我们做 IT 类的外包开发,是非标品开发,所以很有可能在开发过程中会有这样那样的需求修改,而这种需求修改很容易造成扯皮,进而影响到费用支付,甚至出现做完了项目收不到钱的情况。 那么,怎么保证自己的薪酬安全呢? 我们在开工前,一定要做好一些证据方面的准备(也就是“讨薪”的理论依据),这其中最重要的就是需求文档和验收标准。一定要让需求方提供这两个文档资料作为开发的基础。之后开发...
网页实现一个简单的音乐播放器(大佬别看。(⊙﹏⊙))
今天闲着无事,就想写点东西。然后听了下歌,就打算写个播放器。 于是乎用h5 audio的加上js简单的播放器完工了。 演示地点演示 html代码如下` music 这个年纪 七月的风 音乐 ` 然后就是css`*{ margin: 0; padding: 0; text-decoration: none; list-...
微信支付崩溃了,但是更让马化腾和张小龙崩溃的竟然是……
loonggg读完需要3分钟速读仅需1分钟事件还得还原到昨天晚上,10 月 29 日晚上 20:09-21:14 之间,微信支付发生故障,全国微信支付交易无法正常进行。然...
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...
通俗易懂地给女朋友讲:线程池的内部原理
餐盘在灯光的照耀下格外晶莹洁白,女朋友拿起红酒杯轻轻地抿了一小口,对我说:“经常听你说线程池,到底线程池到底是个什么原理?”
《奇巧淫技》系列-python!!每天早上八点自动发送天气预报邮件到QQ邮箱
将代码部署服务器,每日早上定时获取到天气数据,并发送到邮箱。 也可以说是一个小型人工智障。 知识可以运用在不同地方,不一定非是天气预报。
经典算法(5)杨辉三角
杨辉三角 是经典算法,这篇博客对它的算法思想进行了讲解,并有完整的代码实现。
英特尔不为人知的 B 面
从 PC 时代至今,众人只知在 CPU、GPU、XPU、制程、工艺等战场中,英特尔在与同行硬件芯片制造商们的竞争中杀出重围,且在不断的成长进化中,成为全球知名的半导体公司。殊不知,在「刚硬」的背后,英特尔「柔性」的软件早已经做到了全方位的支持与支撑,并持续发挥独特的生态价值,推动产业合作共赢。 而对于这一不知人知的 B 面,很多人将其称之为英特尔隐形的翅膀,虽低调,但是影响力却不容小觑。 那么,在...
腾讯算法面试题:64匹马8个跑道需要多少轮才能选出最快的四匹?
昨天,有网友私信我,说去阿里面试,彻底的被打击到了。问了为什么网上大量使用ThreadLocal的源码都会加上private static?他被难住了,因为他从来都没有考虑过这个问题。无独有偶,今天笔者又发现有网友吐槽了一道腾讯的面试题,我们一起来看看。 腾讯算法面试题:64匹马8个跑道需要多少轮才能选出最快的四匹? 在互联网职场论坛,一名程序员发帖求助到。二面腾讯,其中一个算法题:64匹...
面试官:你连RESTful都不知道我怎么敢要你?
干货,2019 RESTful最贱实践
刷了几千道算法题,这些我私藏的刷题网站都在这里了!
遥想当年,机缘巧合入了 ACM 的坑,周边巨擘林立,从此过上了"天天被虐似死狗"的生活… 然而我是谁,我可是死狗中的战斗鸡,智力不够那刷题来凑,开始了夜以继日哼哧哼哧刷题的日子,从此"读题与提交齐飞, AC 与 WA 一色 ",我惊喜的发现被题虐既刺激又有快感,那一刻我泪流满面。这么好的事儿作为一个正直的人绝不能自己独享,经过激烈的颅内斗争,我决定把我私藏的十几个 T 的,阿不,十几个刷题网...
为啥国人偏爱Mybatis,而老外喜欢Hibernate/JPA呢?
关于SQL和ORM的争论,永远都不会终止,我也一直在思考这个问题。昨天又跟群里的小伙伴进行了一番讨论,感触还是有一些,于是就有了今天这篇文。 声明:本文不会下关于Mybatis和JPA两个持久层框架哪个更好这样的结论。只是摆事实,讲道理,所以,请各位看官勿喷。 一、事件起因 关于Mybatis和JPA孰优孰劣的问题,争论已经很多年了。一直也没有结论,毕竟每个人的喜好和习惯是大不相同的。我也看...
白话阿里巴巴Java开发手册高级篇
不久前,阿里巴巴发布了《阿里巴巴Java开发手册》,总结了阿里巴巴内部实际项目开发过程中开发人员应该遵守的研发流程规范,这些流程规范在一定程度上能够保证最终的项目交付质量,通过在时间中总结模式,并推广给广大开发人员,来避免研发人员在实践中容易犯的错误,确保最终在大规模协作的项目中达成既定目标。 无独有偶,笔者去年在公司里负责升级和制定研发流程、设计模板、设计标准、代码标准等规范,并在实际工作中进行...
SQL-小白最佳入门sql查询一
不要偷偷的查询我的个人资料,即使你再喜欢我,也不要这样,真的不好;
项目中的if else太多了,该怎么重构?
介绍 最近跟着公司的大佬开发了一款IM系统,类似QQ和微信哈,就是聊天软件。我们有一部分业务逻辑是这样的 if (msgType = "文本") { // dosomething } else if(msgType = "图片") { // doshomething } else if(msgType = "视频") { // doshomething } else { // doshom...
Nginx 原理和架构
Nginx 是一个免费的,开源的,高性能的 HTTP 服务器和反向代理,以及 IMAP / POP3 代理服务器。Nginx 以其高性能,稳定性,丰富的功能,简单的配置和低资源消耗而闻名。 Nginx 的整体架构 Nginx 里有一个 master 进程和多个 worker 进程。master 进程并不处理网络请求,主要负责调度工作进程:加载配置、启动工作进程及非停升级。worker 进程负责处...
YouTube排名第一的励志英文演讲《Dream(梦想)》
Idon’t know what that dream is that you have, I don't care how disappointing it might have been as you've been working toward that dream,but that dream that you’re holding in your mind, that it’s po...
“狗屁不通文章生成器”登顶GitHub热榜,分分钟写出万字形式主义大作
一、垃圾文字生成器介绍 最近在浏览GitHub的时候,发现了这样一个骨骼清奇的雷人项目,而且热度还特别高。 项目中文名:狗屁不通文章生成器 项目英文名:BullshitGenerator 根据作者的介绍,他是偶尔需要一些中文文字用于GUI开发时测试文本渲染,因此开发了这个废话生成器。但由于生成的废话实在是太过富于哲理,所以最近已经被小伙伴们给玩坏了。 他的文风可能是这样的: 你发现,...
程序员:我终于知道post和get的区别
是一个老生常谈的话题,然而随着不断的学习,对于以前的认识有很多误区,所以还是需要不断地总结的,学而时习之,不亦说乎
相关热词 c# 二进制截断字符串 c#实现窗体设计器 c#检测是否为微信 c# plc s1200 c#里氏转换原则 c# 主界面 c# do loop c#存为组套 模板 c# 停掉协程 c# rgb 读取图片
立即提问