https://blog.youkuaiyun.com/quizixzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/quizix/article/details/6029753https://blog.youkuaiyun.com/quizix/article/details/6029753quizixTue, 23 Nov 2010 14:37:00 +0800#include #include #define N 10 void sort(int a[], int n){ int i, k,t, j; for(i=0; ihttps://blog.youkuaiyun.com/quizix/article/details/6029698https://blog.youkuaiyun.com/quizix/article/details/6029698quizixTue, 23 Nov 2010 14:24:00 +0800#include #define N 80 void main(){ char s[N+5], c; int i, j, k=0; //输入字符串 gets(s); //找到最大字符的下标 c = s[0]; for(i=0; s[i] != '/0'; i++){ if( c < s[i]){ k = i; c = s[i]; } } //移动最大字符后面的字符 for(j=i-]]>https://blog.youkuaiyun.com/quizix/article/details/6029654https://blog.youkuaiyun.com/quizix/article/details/6029654quizixTue, 23 Nov 2010 14:05:00 +0800#include #include #define N 5 #define M 6 void main(){ double a[N][M], max; int i,j, k=0,l=0; //输入数据 for(i=0;ihttps://blog.youkuaiyun.com/quizix/article/details/6020810https://blog.youkuaiyun.com/quizix/article/details/6020810quizixFri, 19 Nov 2010 10:13:00 +0800import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args) { BigInteger array[] = new BigInteger[100]; BigInteger two = BigInteger.valueOf(2); ]]>https://blog.youkuaiyun.com/quizix/article/details/6020716https://blog.youkuaiyun.com/quizix/article/details/6020716quizixFri, 19 Nov 2010 09:40:00 +0800#include #include #define N 130 int n[N][N]; void init(){ int i,j; for(i=0;ij) ]]>https://blog.youkuaiyun.com/quizix/article/details/6020713https://blog.youkuaiyun.com/quizix/article/details/6020713quizixFri, 19 Nov 2010 09:38:00 +0800#include #include using namespace std ; const int MAX=5844 ; int humble[MAX]={0,1,}; int _min(int a, int b, int c, int d){ int m = a < b?a:b; m = m>c? c:m; return m>d? d:m; }]]>https://blog.youkuaiyun.com/quizix/article/details/6020706https://blog.youkuaiyun.com/quizix/article/details/6020706quizixFri, 19 Nov 2010 09:37:00 +0800#include #include using namespace std; const int M=2001; const int N=1001; int v[M],dp[M][N]; int main(){ int n,k; while(cin>>n>>k){ //输入一组数据 for(int]]>https://blog.youkuaiyun.com/quizix/article/details/6020697https://blog.youkuaiyun.com/quizix/article/details/6020697quizixFri, 19 Nov 2010 09:36:00 +0800#include #include using namespace std; const int MAX = 1000; int c[MAX+1][MAX+1]; int lcs(char *x, char *y, int c[][MAX+1]){ int m = strlen(x); int n = strlen(y); for(int i ]]>https://blog.youkuaiyun.com/quizix/article/details/6020691https://blog.youkuaiyun.com/quizix/article/details/6020691quizixFri, 19 Nov 2010 09:35:00 +0800#include struct Mouse{ int weight; //重量 int speed; //速度 int prev; //前一节点的下标 int seq; //排序前的序号 } mice[1000] = {{0,0,-1,0}}; //比较函数 //第一关键字：weight //第二关键字：speed ]]>https://blog.youkuaiyun.com/quizix/article/details/6020687https://blog.youkuaiyun.com/quizix/article/details/6020687quizixFri, 19 Nov 2010 09:33:00 +0800#include #include using namespace std; int main(){ int k,n,i,j; int a[100][100],dp[100][100]; scanf("%d",&k); while(k--){ scanf("%d",&n); for(i=0;ihttps://blog.youkuaiyun.com/quizix/article/details/6020685https://blog.youkuaiyun.com/quizix/article/details/6020685quizixFri, 19 Nov 2010 09:33:00 +0800#include #include using namespace std; class BigInt{ private: string s; public: BigInt():s("0"){} BigInt(string& s):s(s){} string ToString(){ return s; } ]]>https://blog.youkuaiyun.com/quizix/article/details/6020681https://blog.youkuaiyun.com/quizix/article/details/6020681quizixFri, 19 Nov 2010 09:32:00 +0800#include int main(){ __int64 n, i, odd, even; while(scanf("%I64d",&n)!=EOF){ odd=6; even=6; for(i=4;i<=n;i++){ if(i%2) odd=2*odd+even; ]]>https://blog.youkuaiyun.com/quizix/article/details/6020678https://blog.youkuaiyun.com/quizix/article/details/6020678quizixFri, 19 Nov 2010 09:31:00 +0800#include _int64 fact(int x){ _int64 s=1; int i; for(i=2;i<=x;++i){ s=s*i; } return s; } int main() { int i, n,flag; _int64 sum; ]]>https://blog.youkuaiyun.com/quizix/article/details/6020674https://blog.youkuaiyun.com/quizix/article/details/6020674quizixFri, 19 Nov 2010 09:30:00 +0800#include __int64 f[52]; void init(){ int i; f[1] = 1; f[2] = 2; f[3] = 3; for(i=4; i<=50; ++i) f[i] = f[i-1]+f[i-2]; } int main(){ int n; init();]]>https://blog.youkuaiyun.com/quizix/article/details/6020669https://blog.youkuaiyun.com/quizix/article/details/6020669quizixFri, 19 Nov 2010 09:29:00 +0800#include int f(int n){ return 2 * n * n - n +1; } void main(){ int n, i, k; scanf("%d",&n); for(i=0; ihttps://blog.youkuaiyun.com/quizix/article/details/6020653https://blog.youkuaiyun.com/quizix/article/details/6020653quizixFri, 19 Nov 2010 09:25:00 +0800#include typedef struct{ double x,y; }Point; double area(Point p1, Point p2, Point p3){ double a, b, c; // 抛物线的参数 double k, h; // 直线的参数 double s; // 抛物线 y = ax^2 + bx + c ]]>https://blog.youkuaiyun.com/quizix/article/details/6020652https://blog.youkuaiyun.com/quizix/article/details/6020652quizixFri, 19 Nov 2010 09:25:00 +0800#include typedef struct{ double x,y; }Point; double area(Point p1, Point p2, Point p3){ double a, b, c; // 抛物线的参数 double k, h; // 直线的参数 double s; // 抛物线 y = ax^2 + bx + c ]]>https://blog.youkuaiyun.com/quizix/article/details/6020649https://blog.youkuaiyun.com/quizix/article/details/6020649quizixFri, 19 Nov 2010 09:25:00 +0800#include int main() { int t, a,n, i; __int64 max,sum; scanf("%d",&t); while (t--){ max=0; sum=0; scanf("%d",&n); for (i = 0; i < n; i++) { scanf("%d]]>https://blog.youkuaiyun.com/quizix/article/details/6020646https://blog.youkuaiyun.com/quizix/article/details/6020646quizixFri, 19 Nov 2010 09:24:00 +0800#include int f(int a, int b, int n){ int f1 = 1, f2 = 1, result = 1, I; for( i=2; ihttps://blog.youkuaiyun.com/quizix/article/details/6020645https://blog.youkuaiyun.com/quizix/article/details/6020645quizixFri, 19 Nov 2010 09:23:00 +0800#include void main(){ int n; while(scanf("%d",&n)!=EOF) (n%4==2)?printf("yes/n"):printf("no/n"); }  ]]>