文章列表
这是转载来的解决方法:1、在命令行中尝试重新注册mscordbi.dll(regsvr32 mscordbi.dll)文件,该文件位于(C:\WINDOWS\Microsoft.NET\Framework\v1.1.4322请找到你本机的这个对应的目录)。2、在命令行中尝试重新注册oleaut32.dll(regsvr32 oleaut32.dll)。---这部在本机用时没找到该dll3、运行C:\Program Files\Common Files\Microsoft Shared\VS7Debug下面的mdm.exe /regserver以上运行的命令都是在visual studio .ne ...
/************************************************************************/
/* lcs test */
/* 2011-2-9 */
/********************************************************************* ...
/*poj 1095 trees made to order
* antsmall
*2010-09-23
*
*/
#include<iostream>
#include<string>
using namespace std;
int c[50];
int a[50][50];
int indexes[50];
int sum[50];
const int MAX = 500000000;
int maxSeq;
string str;
void generate() {
int tmp = 1;
max ...
poj 1017 packets
- 博客分类:
- algorithm
/*
* poj 1017 packets
* antsmall 10-09-23
*/
#include<iostream>
using namespace std;
int main()
{
int cnt;
int p[7];
while(true) {
scanf("%d%d%d%d%d%d", &p[1], &p[2], &p[3], &p[4], &p[5], &p[6]);
if(p[1] == 0 && p[2] == 0 && ...
/*
* poj 1160 Post Office
* antsmall
* 2010-09-26
*/
#include<iostream>
using namespace std;
int dist[301][301];
int x[301];
int pv[31][301];
const int MIN_INT = 100000000;
void getDist(int v) {
memset(dist, 0, sizeof(dist));
for(int i = 1; i < v; i++) {
for(int j = ...
/*
* poj 1035 spell checker
* antsmall
* 10-09-30
* http://poj.org/problem?id=1035
*/
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct Word{
char*data;
int seq;
Word(char*d, int s) {
data = d;
seq = s;
}
};
const i ...
/*
* poj 1016 numbers that count
* antsmall 2010-11-7
*/
#include<iostream>
using namespace std;
const int MAX_LEN = 81;
int cnt[10];
char his[17][MAX_LEN];
void trans(char* src, char* dest) {
int len = strlen(src);
memset(cnt, 0, sizeof(cnt));
for(int i = 0; i < l ...
/*
* poj 1083 Moving Tables
* antsmall
* 2010-11-9
*/
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int t, n, a, b, tmp;
int l, h;
int pts[201];
int heaviest;
scanf("%d", &t);
while(t--) {
scanf("%d", &n);
mem ...
/*
** poj 1020 Anniversary Cake
** http://poj.org/problem?id=1020
** antsmall 2010-12-4
** this problem is about cutting a square-shaped cake into specifying pieces which lead to no waste
** i.e. the cake is 4x4, and can be cut into pieces of 1x1 1x1 1x1 1x1 1x1 3x3 1x1 1x1
**
** p.s. toda ...
/*
poj 1026 Cipher
antsmall
2010-12-5
http://poj.org/problem?id=1026
*/
#include <iostream>
using namespace std;
char msg[205];
char emsg[205];
int code[201];
int times[201];
int k;
int pos;
int mLen;
int n;
char space;
int main() {
while(scanf("%d\n", &am ...
纯粹个人总结
1. javac 用法,javac不能递归,so 有包结构的还是列出来,或是写到一个文件里,这个跟javadoc一样的道理。
如下结构:
-mywork
-src
-abc
a.java
-bcd
b.java
c.java
-bin
那么进行cd mymork,
然后javac -d bin src\*.java src\abc\*.java src\bcd\*.java就行了。
2. jar 用法,jar可以递归,假设我们要打包一个可运行的jar包,那么就要指定包里一个类为Main-Class,这时候需要 ...
纯粹个人总结
1. hide error
<script type="text/javascript">
window.onerror=function(){return true;}
</script>