wys_NO1的博客

#include int main(){ int a,b; scanf("%d%d",&a,&b) ; printf("%d\n",a+b); return 0;}

#include #define MAX 502using namespace std;int str[MAX][MAX];bool visit[MAX];//标记数组，没有加入到树中时为false,加入了为trueint distan[MAX];//用以记录当前树到各个顶点的最小距离（它会被不断的更新，加入一个顶点更新一次）int n;int prim()//prim算法{

#include using namespace std;int main(){ int s, d; int sNum, dNum; while (scanf("%d%d", &s, &d) != EOF) { if (d > 4*s) { sNum = 10; dNum = 2; }

#include int matrix[100][100]; int dp[100][100]; int R; int C; int Max (int a, int b, int c, int d){ int max1 = (a > b) ? a : b; int max2 = (c > d) ? c : d; return (

#include #include using namespace std; #define MAX 101 int D[MAX][MAX]; int n; int maxSum[MAX][MAX]; int MaxSum(int i, int j){ if( maxSum[i][j] != -1

#include #include using namespace std; int a[301]; __int64 cost[301][301]; __int64 dp[301][31]; int main() { int v,p; while(cin>>v>>p) { for(int i=1;iv;i++)

#include #include using namespace std; int a[301]; __int64 cost[301][301]; __int64 dp[301][31]; int main() { int v,p; while(cin>>v>>p) { for(int i=1;iv;i++)

#include#includeint main(){ int i,n,j,k,b,h; scanf ("%d",&b); for (h = 1;h b;h++) { k = 0; scanf ("%d",&n); for (i = 1;i n;i ++) for (j = 1;j sqrt (i);j++) //奇数个约数不含1和他本身,可

#include#include#includeusing namespace std;typedef __int64 lld;void gcd(lld a,lld b,lld &d,lld &x,lld &y){ if(!b) {d=a;x=1;y=0;} else { gcd(b,a%b,d,y,x);y-=x*(a/b);}}int main(){

#include #include using namespace std;const int N = 10010;int main(){ int x[N], y[N], n; while (scanf("%d", &n) == 1) { for (int i = 0; i n; i++) scanf("%d %d",

#include #include using namespace std; const int SIZE = 999;int dp[SIZE][SIZE] = {0}; int max(int x, int y){ return x > y ? x : y;} int main(){ int len1, len2; string str1, str2; whi

#include int main(){ int N,M,P,C; scanf("%d %d %d %d",&N,&M,&P,&C); while(N!=0&&M!=0&&P!=0&&C!=0) { printf("%d\n",N+P-M); scanf("%d %d %d %d",&N,&M,&P,&C); } return 0;}

#include using namespace std; int main() { int p, e, i, d, count = 1; int k = 21252; int x = 5544, y = 14421, z = 1288; while(cin >> p >> e >> i >> d) {

#includeint fun(int m,int n) { if(m==0||n==1) return 1; if(n>m) return fun(m,m); else return fun(m,n-1)+fun(m-n,n);}int main(){ int T,m,n; scanf(

#include int main(){ float length,n=0.0; int j=1; scanf("%f",&length); while(length5.20&&length!=0.0) { j++; n+=1.0/j; if(n>=length) { printf("%d card(s)\n",j-

#include #include #define N 103int fun(int b[N], int n){    int i, max, c;    c = 0;    max = 0;    for(i=1; i    {        if(c > 0)            c = c+b[i];        e