wu__peng的博客

#include __int64 e_gcd(__int64 a,__int64 b,__int64 &x,__int64 &y) { if(b==0) { x=1; y=0; return a; } __int64 ans=e_gcd(b,a%b,x,y); __int64

http://acm.hdu.edu.cn/showproblem.php?pid=5198 坑死我了，一个多小时啊，只有三中字母，不多不少，每一个都是1/3长度，这些条件都满足就YES#include<stdio.h> #include<string.h> int main() { char arr[1000]; int i,size,flag,num; while(sc

There is a board with 100 * 100 grids as shown below. The left-top gird is denoted as (1, 1) and the right-bottom grid is (100, 100). We may apply three commands to the board: WHITE x, y, L // Pai

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 0 Accepted Submission(s): 0Problem Description Master Di plans to take his girlfriend for a

二维坐标建立的时候从1开始存，把图的周围全变成0方便计算#include<stdio.h> int n , m,arr[1002][1002]; int Map(int x,int y) { int sum=0; if(arr[x][y] == 0) return sum; else { if(arr[x][y]-arr[x-1][y]

点的坐标加起来求中点，算输入的点到中点的距离，都相等就输出YES#include<stdio.h> #include<math.h> double x,y; double brr[101]; int main() { int T,n,i,num,arr[101][2]; scanf("%d",&T); while(T--) { x=0;y=0;num=

A Sweet Journey Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 0    Accepted Submission(s): 0 Problem Description Master Di plan

这个题确实有点简单，看清楚不能同列同行就好了，用一个一维数组标记哪一列用了往下搜就好了#include int flag[8]={1,1,1,1,1,1,1,1},i,j,n,k,num=0; char arr[10][11]; void dfs(int a,int b) { int ii,jj; if(b==0) { num++; return ; } for(ii=a+1;i

坑了，写程序的时候倒数第二个花括号把return 0；给我括起来了，程序一次就结束了，吃了饭回来才顿悟了#include struct point { int hang,lie; int predecessor; }queue[402],p,visit_point; char brr[30][30],c; int head=0,tail=0,n,m; void enqueue(struct p

#include //输入5*5迷宫，输出路径 #define MAX_ROW 5 #define MAX_COL 5 struct point { int row, col, predecessor; } queue[512],p; struct node{int x,y;}arr[50]; int head = 0, tail = 0; void enqueue(struct

#include char mi[1000][1000]; int arr[1000][1000]; void dfs(int x,int y) { // if(arr[x+1][y]=='W'||arr[x+1][y+1]=='W'||arr[x-1][y]=='W'||arr[x-1][y-1]=='W'||arr[x][y+1]=='W'||arr[x][y-1]=='W'||arr[x+1

#include #define maxn 10001 int n,s; __int64 ans=0; int min(int a,int b) { if(a>b) return b; else return a; } int y[maxn],c[maxn]; int main() { int i; while(~scanf("%d%d",&n,&s)&&n!=0)

#include #define INF 50001 __int64 heap[INF],arr[INF], size = 0; void push(__int64 x){ __int64 i = size++; while(i > 0){ __int64 j = (i - 1) / 2; if(heap[j] x) break; heap[i] = heap[j]; i

题意大概是给你n个人,一套纪念品有m个，买一个纪念品的价格p和买一套的价格q，让每个人都有，自己最少花多少钱