zhuqi12580的专栏

#include #include const int N = 20;double c[N][N];int main(){ int n; int i, j; double num; while(scanf("%d", &n)==1&&n) { memset(c, 0, sizeof(c)); for(i=0; i<n; i++) { for(j=0; j<n;

#include #include #include using namespace std;bool judge(string str){ string s(str.rbegin(),str.rend()); return str==s;}int main(){ vector bvec; string str; while(cin>>str) { if(st

#include #include using namespace std;const int MAX = 1000;string result;bool acm2(const int& i){ if(i>MAX-3) return false; if((result[i]=='a'||result[i]=='A')&&(result[i+1]=='c'||result[i+

#include #include using namespace std;void output(const int& M, const int& N, const int& count){ cout<<"Case #"<<count+1<<":"<<endl; cout<<M*N<<" = "<<N; for(int i=1;i<M;i++) cout<<" + "<<N;

#include #include #include const int MAX = 100;int a[MAX];using namespace std;int main(){ int count; while(cin>>count) { if(count == 0) break; for(int i=0; i<count; i++) { cin>>

#include using namespace std;const int MAX = 1000000;const int SIZE = 78500;int P[SIZE];bool isPrime(int num){ if (num == 2 || num == 3) { return true; } if (num % 6 != 1 && num % 6 != 5)

#include #include using namespace std;const int N = 47;int f[N+1];int S[N+1];int find2(const int& sum){ int i; for(i=1; i<=N; i++) { if(S[i]>sum) break; } return i-1;}int main()

#include #include #include using namespace std;void printc(const int& choise, const int& size){ int cBEG = 0; int cMID = size; int cEND = 2*size; int column = 2*size+1; int j; switch(choi

#include #include #include using namespace std;void change(string& str){ for(size_t i=0; i<str.size(); i++) { char ch = str[i]; if(ch>='a'&&ch<='z') ch = 'z'-(ch-'a'); else if(ch>='A'

#include #include #include using namespace std;void max(int& a, int& b, int& c){ int d; if(a<b) { d = a; a = b; b = d; } // a max if(a<c) { d = a; a = c; c = d; }}void jud

#include #include #include using namespace std;struct Point{ double x,y;};double L(const Point&a, const Point&b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}int main(){ int

#include #include using namespace std;const int N = 1000;int score[N];double AbvAvg(){ int count, i; cin>>count; double avg = 0; for(i=0;i<count;i++) { cin>>score[i]; avg += score[i];

#include using namespace std;int main(){ int a; while(cin>>a&&a!=0) { int ans=0; while(a>>=1) ans+=a; cout<<ans<<endl; } return 0;}

#include #include using namespace std;const int MAX = 50;int a[MAX];unsigned int gcd(unsigned int a,unsigned int b){ while(b^=a^=b^=a%=b); return a;}int main(){ int count = -1,i,j; whil

#include #include //const unsigned int MAX = 4294967295;const unsigned int MAX = 100000;char b[MAX+1];int a[8];int main(){ freopen("1889.out", "w", stdout); int j; for(int i = 2; i<=MAX; ++i

#include int main(){ int a,b; scanf("%d",&a); while(a--) { int sum=0; scanf("%d",&b); while(b) { sum+=b/5; b/=5; } printf("%d\n",sum); } return 0;}

#include int a[20];int b[20];int main(){ int n; int c = 0; while(scanf("%d", &n)==1&&n) { if(c!=0) putchar('\n'); c++; for(int i=0; i<n; i++) scanf("%d", &a[i]); for(int i=0; i<n

#include int gcd(int a, int b){ int r; do { r = a%b; a = b; b = r; }while(b>0); return a;}int main(){ int a, b, g; double c; while(scanf("%d%d", &a, &b)==2&&!(a==0&&b==0)) { g =

#include const int MAX = 100;int main(){ int N, n, m, t; scanf("%d", &N); for(int k=0; k<N; k++) { if(k>0) putchar('\n'); int p = 1; while(scanf("%d%d", &n, &m)==2&&!(n==0&&m==0)) {

#include using namespace std;const int MAX = 1000000;int a[MAX+10];int main(){ int x,i,j,k,l,m,n; x=0; for(i=0;i<10;i++) for(j=0;j<10;j++) for(k=0;k<10;k++) for(l=0;l<10;l++)

#include #include #include using namespace std;void Cal(string &str, const char& qian, const int& count){ int num = count; int i=0; str[0] = qian; while(num>0) { str[8-(i++)-1] = num%2 +'

#include #include using namespace std;const double PI = 3.1415;double Area(const double& x, const double& y){ return (x*x+y*y)*PI/2;}int Judge(double area){ int count = 1; while((area-=

#include #include using namespace std;const int N = 31;int main(){ unsigned int B[N][N]={0}; for(int i=0; i<N; i++) { B[i][0] = B[0][i] = B[i][i] = 1; } for(int i=1; i<N; i++) { for(i

#include #include using std::cout;using std::endl;using std::cin;using std::vector;bool test(int num,int&last){ int tmp = num*2; int i=1; while(i*(i+1)<tmp) { i++; } if(i*(i+1)==tmp)

#include using std::cout;using std::endl;using std::cin;using std::ios;int main(){ double tmp; double result=0; while(cin>>tmp) { result+=tmp; } cout.setf(ios::fixed);

#include #include #include #include #include using namespace std;char a[200];void printrev(char* s){// strrev(s); char* h = s; char* t = s; char ch; while(*t++); t--;

#include #include #include #include using namespace std;int Count(const string& a){ int count = 0; for(size_t i=0; i<a.size()-1; i++) { for(size_t j=i; j<a.size();j++) { if(a[i]>a[j])

#include using namespace std;double M[10];int N[10];int main(){ N[0] = 1; M[0] = 1; for(int i=1; i<10; i++) { N[i] = N[i-1]*i; M[i] = M[i-1] + 1.0/N[i]; } cout<<"n e"<<endl; cout<<"- -

#include #include #include using namespace std;const int SIZE = 300;const double MIN = 0.00000000001;double M[SIZE];void init(){ double m = 0; for(int i=0; i<SIZE; i++) { m+= 1.0/(i+2);

#include #include #include using namespace std;const int N = 500;int main(){ long long a[N+1][N+1] = { 0ll}; for(int i=3;i<=N;i++) { for(int j=1;j<=i/2;j++) { for(int k = j; k<=i/2;k+

#include #include #include using namespace std;void printc(const int& choise, const int& size){ int cBEG = 0; int cEND = size+1; int column = size+2; int j; switch(choise) { case 0:// "

#include #include #include using namespace std;int CCC(const int &n){ int total = n; int a[5]= {0}; int count = 0; int rem; do{ rem = total%10; total /= 10; a[count]=rem; count++;

#include #include using std::cout;using std::endl;using std::cin;using std::vector;char change(int &num){ if((num+'a')>'z') { num -= 26; } return (char)(num+'a');}void write(int size)

#include #include using std::vector;using std::cout;using std::endl;using std::cin;int main(){ int a,b; vector ivec; while(cin>>a>>b) { ivec.push_back(a+b); } for( vect

#include #include #include #include using namespace std;unsigned int gcd(unsigned int a,unsigned int b){ while(b^=a^=b^=a%=b); return a;}void split(const string &str, unsigned int&a, unsig

#include #include #include #include using namespace std;int w[21][21][21];void init(){ for(int a=0;a<21;a++) { for(int b=0;b<21;b++) { for(int c=0;c<21;c++) { if(a==0||b==0||c

#include #include #include using std::cout;using std::endl;using std::cin;using std::string;using std::sort;int main(){ const size_t size = 21; int a[size],b[size],c[20][size]; int num;

#include #include #include #include using std::cout;using std::endl;using std::cin;using std::vector;using std::string;bool test(string str){ if(str=="") { return false; } string tm

#include #include #include #include using std::cout;using std::endl;using std::cin;using std::string;using std::stack;using std::vector;string change(int num,int m){ int n=0,e; stack s;

#include #include #include using namespace std;void printc(const int& choise, const int& size){ int cBEG = 0; int cMID = size; int cEND = 2*size; int column = 2*size+1; int j; switch(choi