jacky05110-CSDN博客

转载 wikioi约瑟夫问题c++

#include #include #include using namespace std;int main(){ int N,M; cin>>N>>M; vectorv; int before=0;for(int i=1;iwhile(!v.empty()){ before=(before+M-1)%v.

2014-07-05 20:36:47 311

原创 wikioi方格取数c

典型四维#include #include #include int n,a,b,c,m[1020][1020],dp[20][20][20][20],l,k,i,j;int maxx(int x,int y){ if(x>y){return x;} else{return y;}}int main(){ scanf("%d",&

2014-07-05 08:56:12 307

原创 wikioi 回家c

#include #define getint(i) scanf("%d\n", &i)#define getmark(a, i) if(i >= 'A' && i a = 26 + i - 'A';\}else{\a = i - 'a';\}#define MAX 52#define INF (1e9)int map[MAX][MAX];int n

2014-07-04 19:34:13 339

原创 wikioi 二叉树最大高度和宽度

#include #include int main(){ int a,b,i,j,r,l,n,som,sum,m[1024],left[1024],right[1024]; scanf("%d",&a); sum=1; som=1; l=0; r=0; if(a for(i=1;i

2014-07-04 19:33:21 331

原创 wikioi m进制转十进制c

#include #include int main(){char a[100];int m;long num;scanf("%s %d", a, &m);num = strtol(a, NULL, m);printf("%ld\n", num);return 0;}

2014-07-04 19:32:24 298

原创 wikioi 素数判定

#include main(){int i,s=0,a;scanf("%d",&a);if(a==1) printf("\\n");else{for(i=2;i*iif(a%i==0) s++;}if(s>0) printf("\\n");else printf("\\t");}}

2014-07-04 19:31:00 247

原创 wikioi 十进制转m进制

#include #include int main(){ int h,n,i,j; static int a[1024],b[1024]; scanf("%d %d",&h,&n); i=1; while(h/n!=0){ a[i]=h%n; h=h/n; i=i+

2014-07-04 19:30:33 231

原创 wikioi 最小乘车费用

#include#includeint a[15],dp[10000];int main(){ while(scanf("%d",&a[1])!=EOF){int i,j,n;for(i=2;iscanf("%d",&a[i]);scanf("%d",&n);memset(dp,127,sizeof(dp));dp[0]=0;

2014-07-04 19:30:25 400

原创 wikioi N皇后问题c++

#include #include long sum = 0, upperlim = 1;void test(long row, long ld, long rd){ if (row != upperlim) { long pos = upperlim & ~(row | ld | rd); while (pos) {

2014-07-04 19:29:45 549

原创 wikioi全排列c++

#include #include int A[10] = {1,2,3,4,5,6,7,8,9,10};int n;void print() {for (int i=0; iprintf("%d ",A[i] );}printf("\n");}int main(){scanf("%d",&n);print();while

2014-07-04 19:28:54 272

原创 wikioi不好玩的罚金c

#include #include int main(){ int a,b,c; scanf("%d %d",&a,&b); if(a>=b){printf("Congratulations, you are within the speed limit");} else{c=b-a;if(20>=c>=1){printf("You are s

2014-07-04 19:27:02 331

原创 wikioi高精度练习之减法c++

#include #include #include #include using namespace std; int main() { char a[501],b[501],c[502]; memset(a, '0', sizeof(a)); memset(b, '0', sizeof(b)); mem

2014-07-04 18:52:04 408

原创 wikioi最长不下降子序列c

#include #include int main(){ int a[1024],i,n,ma,b[1024],c[1024],p,j,mag[1024]; scanf("%d",&n); for(i=1;i scanf("%d",&a[i]); } b[n]=1;

2014-07-04 18:50:19 300

原创 wikioi汉诺塔游戏c

#include #include int n;void hanoi(int a, char q, char z, char m){ if (a!=1) { hanoi(a-1,q,m,z); } printf("%d from %c to %c\n",a,q,m); if (a!=1) {

2014-07-04 18:49:03 448

原创 wikioi迷宫c

#include#includestruct { int a; int b;}aa[2000*2000];int mx,my,n,m,k=1,i,j,f[2005][2005],x0,y0;char c[2005][2005];int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};int bf

2014-07-04 18:24:59 1044

原创 wikioi骑士游历c

#include #include int main(){ int m,n,x1,y1,x2,y2; unsigned long long d[100][100]; scanf("%d%d%d%d%d%d",&n,&m,&x1,&y1,&x2,&y2); memset(d,0,sizeof(d)); d[x1][y1]=1; int i,j; for(i=x

2014-07-04 18:24:46 418

原创 wikioi能量项链c

#include #include int main(){ int n,s[600][600],m[1024],i,j,k,e,maxx; scanf("%d",&n); e=0; for(i=1;i scanf("%d",&m[i]); m[i+n]=m[i]

2014-07-04 18:23:07 397

原创 wikioi明明的随机数pascal

var ine:longint; d:array[1..5000] of longint; a,i,h,j,g,e:longint;begin readln(a); for g:=1 to a do begin read(d[g]); end; for i:=1 to a-1 do for j:=a downto i+1

2014-07-04 18:22:09 342

原创 wikioi乌龟棋c

#include #include #include int main(){ int n,m,i,j,h,g,nt[1024],nd[1024],s1,s2,s3,s4; static int a[50][50][50][50]; scanf("%d %d",&n,&m); for(i=1;i scanf("%d",&nt[

2014-07-04 18:20:58 369

原创 wikioi石子归并c++

#include #include #define INF 0xffffff int main() { int n, num[111], sum[111] = {0}, min; int dp[111][111]; memset(dp, 0, sizeof(dp)); scanf("%d", &n);

2014-07-04 18:20:51 493

转载 wikioi拦截导弹c++

#include #include using namespace std;//inline int max(const int x,const int y){return x>y? x:y;}//inline int min(const int x,const int y){return x>y? y:x;}inline bool Value(char x){return (

2014-07-04 18:18:50 1160

转载 wikioi逃跑的拉尔夫c++

#include #include #include using namespace std;int m[ 60 ][ 60 ]; //地图，1表示能通过，0表示不能通过char newmap[ 60 ][ 60 ]; //新地图int d[ 1010 ]; //记录方向 int v[ 60 ][ 60 ][ 1010 ]; //是否查看过s

2014-07-04 18:18:43 379

原创 wikioi最大乘积

#include#include#includeusing namespace std;int main(){ int n,K,a[45]; char x; long long dp[45][45]; while(cin>>n>>K){ memset(a

2014-07-04 18:17:50 243

原创 wikioi最大公约数和最小公倍数c

#include #include int c(int a,int b);int x,y,v;int c(int a,int b){int o;while (b!=0){o=a%b;a=b;b=o;}return(a);}main(){int i,n,s;scanf("%d%d",&x,&y);n=0;v=x*y;

2014-07-04 18:16:39 267

原创 wikioi数的计算c++

#include #include using namespace std;int calc(int n){if (n == 1){return 1;}else{int nsum= 0;for (int i = 1; i {nsum +=calc(i);}return nsum + 1;}}int main(){i

2014-07-04 18:15:41 314

原创 wikioi过河卒

#include#includeint a[20][20];int main(){memset(a,-1,sizeof(a));int i,j,m,n,x,y;scanf("%d%d%d%d",&n,&m,&x,&y);m++;n++;x++;y++;for(i=0;ifor(i=0;ia[1][1]=1;a[x][y]=0;a[x+1][y+2

2014-07-04 18:13:31 287

jacky05110的专栏