- 博客(23)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 笔记
若p为素数,(a,p)=1,则 a^(p-1)≡1(mod p)n若(a,m)=1,则n a,2a,3a,…,(m-1)a (1)n的最小剩余(mod m)按某种次序排列后为n 1
2011-08-30 23:10:01
200
原创 HOJ12138
#include#include#include#include#include#define inf 0x3f3f3fusing namespace std;int dp1[1000001],dp2[1000001];int main(){
2011-08-28 23:57:15
250
原创 HOJ12136
#include#define inf 0xf3f3fint x[1000],y[1000];main(){ int n,a,b,maxy,maxx,miny,minx; while(scanf("%d",&n)&&n!=0)
2011-08-28 17:03:28
179
原创 HOJ12137
#include#include#include#include#include#define inf 0x3f3f3fusing namespace std;int w[901][901],m,n,x,d[1000],t,q[1000],mn;i
2011-08-28 17:02:01
236
转载 快排用法的介绍
在进行C/C++编程的时候，C/C++的库函数中已经提供了快速排序法的函数qsort，我们只需要调用它就可以了。 qsort函数在头文件stdlib.h中。要使用qsort函数，就必须加#include（对C语言来说）或加入#include（对C++来说）。
2011-08-28 01:29:56
1326
原创 HOJ12131
#include#include#include#include#include#define inf 0x3f3f3f;#define Pi 3.141592#define end 0.000001using namespace std;do
2011-08-28 01:28:32
248
原创 HOJ12134
#include#include#include#include#include#define inf 0x3f3f3f;#define MN 10001using namespace std;int main(){ // freopen
2011-08-27 20:14:48
703
原创 同上练习bellman ford算法
#include#include#include#include#include#define inf 0x3f3f3f;using namespace std;int n,w[1001][1001],m,a,b,qy,d[1001],lj,cx;
2011-08-26 20:13:15
233
原创 FOJ2047
#include#include#include#include#includeusing namespace std;int main(){ int n,; double x01,x02,x03,v01,v02,v03,a,b,c
2011-08-26 14:50:18
239
原创 POJ2387
#include#include#include#include#include#define inf 0x3f3f3f;using namespace std;int n,w[1001][1001],m,a,b,qy,d[1001],t,mx,lj;
2011-08-26 14:43:56
598
原创 POJ1258
#include#include#include#include#include#define inf 0x3f3f3f;using namespace std;int low[101],t,n,d[101][101],ans,m;bool vis
2011-08-25 23:00:53
205
原创 HIT3051
#include#include#define g 9.8int main(){ int t,x1,y1,x0,y0,T,i; double vx,vy,s,mid1,mid2; scanf("%d",&T); for(i=
2011-08-24 00:00:07
402
原创 POJ1458
#include#include#include#include#includeusing namespace std;int ans[3][13000];int main(){ int n,m,w[3403],d[3403];
2011-08-23 23:35:09
218
原创 POJ3624
#include#include#include#include#includeusing namespace std;int ans[3][13000];int main(){ int n,m,w[3403],d[3403];
2011-08-23 23:33:37
481
原创 POJ3356
#include#include#include#include#includeusing namespace std;int m,n,ans[1001][1001];int main(){ char x[1001],y[1001
2011-08-23 23:30:41
403
原创 HOJ12119
#include#include#includeint main(){ char test[10]; int len,ans1,ans2,ans,h,vis,m; while(scanf("%s",test)&&strlen
2011-08-22 13:15:15
190
原创 HOJ12126
#include#include#include#includeconst int inf = 0x3f3f3f3f;bool vis[1001];int x[1001],y[1001],t,n;double dis[1001][1001],low[1
2011-08-22 00:18:47
269
原创 HOJ12127
#include#include#includelong long int mod(long long int a,long long int b,long long int d) { long long int i=1; while(b
2011-08-22 00:10:02
236
原创 hoj12126
#include#include#include#includeconst int inf = 0x3f3f3f3f;bool vis[1001];int x[1001],y[1001],t,n;double dis[1001][1001],low[1
2011-08-21 19:47:28
181
原创 调用随机数据跑程序
#include#include int main(){ freopen("in.txt", "r", stdin);//调用in.txt文件里面的数据(自己调试的随机数据) freopen("wangdai.out", "w", std
2011-08-19 22:03:18
230
原创 随机测试数据打印
#include #include using namespace std;int main(){ freopen("in.txt","w", stdout); // this is read打印随机数据储存在in.txt文件中 //freop
2011-08-19 22:01:29
175
原创 HDOJ3958期望
#include#include int main(){ freopen("in.txt", "r", stdin); freopen("wangdai.out", "w", stdout); __int64 fz,fm,h,m
2011-08-19 21:57:44
242
原创 hdoj3951博弈
#include#includeint main(){ int t,n,k; while(scanf("%d",&t)!=EOF) { for(int i=1;i {
2011-08-19 16:07:18
226
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人