fang_abc的专栏

#include #include #include #include using namespace std;int main(){ string str; int n; int i,j,len; int *a; int b[26]; while(cin>>n) { a=new int[n];

#include #include #define max 100using namespace std;int main(){ int n; int i,j; int t; int a[max][max]; while(cin>>n) { memset(a,0,sizeof(a)); t=1;

#include #include #include #include using namespace std;bool checked_ip(string ip,vector &vip){ vector part; string::size_type ip_size=ip.size(); int pointCount=0; int i,num;

#include #include using namespace std;class A{ public: string str; A() {} A(string s):str(s) {} int getEnglishCharCount(string s1); int getBlankCharCount(string s1);

#include #include using namespace std;int main(){ char str[129]; int n; int len; while(cin.getline(str,128)) { n=0; len=strlen(str)-1; while(str[len]!

#include using namespace std;int Isrelation(int m){ if(m%7==0) return 1; while(m) { if(m%10==7) return 1; m/=10; } return 0;}int main()

#include #include #include using namespace std;void Encrypt (char aucPassword[], char aucResult[]){ int i=0; while(aucResult[i]!='\0') { if(isalpha(aucResult[i])) {

#include #include using namespace std;int fama(int n, int* w, int* nums){ set iset; int i,j; int sum=0; set::iterator iter; for(i=0;i<n;i++) sum+=w[i]*nums[i]; is

始终不知道错在哪里了。。这是最痛苦的！#include #include using namespace std;string s[]={"billion","million","thousand","hundred"};string s1[]={"zero","one","two","three","four","five","six","seven","eight","nine",

#include using namespace std;int main(){ int *a,*t1,*t2; int n; int i,j; int max,temp; int result; while(cin>>n) { result=0; a=new int[n]; t1=

#include #include #include #include #define M 100using namespace std;int s[26];int i,j,k,len;char stemp[M];void encrypt1(char * key,char * data,char * encrypt){ memset(s,0,sizeof(s));

#include #include using namespace std;const int N=500001;int a[N];int isWan(int m){ int i; int t=(int)sqrt((double)m); int sum=1; for(i=2;i<=t;i++) { if(m%i==0)

#include using namespace std;typedef struct ListNode{ int m_nKey; ListNode* m_pNext;}ListNode;ListNode* FindKthToTail(ListNode* pListHead, unsigned int k);int main(){ int n,k;

#include #include using namespace std;int main(){ int n,i,k; int *a,*b; while(cin>>n) { a=new int[2*n+1]; b=new int[2*n+1]; for(i=0;i<2*n+1;i++)

#include using namespace std;const int N=10003;int a[N]={0};void Prime(){ int i,j,k; a[0]=a[1]=1; for(i=2;i<5001;i++) { if(a[i]==1) continue; k=N/i;

#include using namespace std;int apple(int m,int n){ if(m10||n10) return -1; if(m==0||n==1) return 1; if(m<n) return apple(m,m); return apple(m-n,n)+apple(

#include #include using namespace std;class rate{public: int a; int b;};rate jisuan(string &str,int a,int b){ rate r; r.b=b-a; r.a=0; for(int i=a;i<b;i++) {

#include using namespace std;class Num{public: int findNumberOf1(); void setN(int n=0);private: int num;};void Num::setN(int n){ num=n;}int Num::findNumberOf1(){ int

#include #include #include using namespace std;bool ismatch(string& s1,string& s2,string::size_type i,string::size_type j){ while(i<s1.size(),j<s2.size()) { if(s1[i]=='?')

#include #include using namespace std;const int R=24;const double E=0.000001;bool ishege(double a,int d){ if((fabs(a+d-R)<E)||(fabs(a-d-R)<E)||(fabs(d-a-R)<E)||(fabs(a*d-R)<E)||(fabs(a/d-

#includeusing namespace std;//1037. 在霍格沃茨找零钱（20）int main(){ int a1,b1,c1; int a2,b2,c2; int sum,sum1,sum2; char c; while(cin>>a1>>c>>b1>>c>>c1>>a2>>c>>b2>>c>>c2) { sum2=a1*17*29+b1*29+c1

#include#include#include#includeusing namespace std;int main(){ int a[101]; int i,t,n,m; int y[10001]; while(cin>>n) { memset(a,0,sizeof(a)); for(i=0;i<n;++i) { cin>>t; ++a[t]

#includeusing namespace std;int main(){ int a,t,i,j; char c; while(cin>>a>>c) { if(a>20||a<3) continue; t=(a+1)/2; for(i=0;i<a;i++) cout<<c; cout<<endl; for(i=1;i<t-1;i++) {

#include#include#include#includeusing namespace std;int main(){ string str; int a[33],t,index; while(getline(cin,str)) { memset(a,0,sizeof(a)); for(int i=0;i<str.length();++i) { i

#include#include#includeusing namespace std;const int N=1000000007;int main(){ string str; int result; int cntP,cntT; while(cin>>str) { result=0; cntP=0; cntT=count(str.begin(),str.

#include#includeusing namespace std;int main(){ char str1[1001],str2[1001]; int a1[128],a2[128]; int m,n,flag; while(cin>>str1>>str2) { m=n=0; flag=0; memset(a1,0,sizeof(a1)); memse

#include#include#includeusing namespace std;struct Stu{ char name[15]; int a,b;};bool cmp(const Stu &s1,const Stu &s2){ if(s1.a<s2.a) return true; return false;}int main(){ int N

#include#include#includeusing namespace std;int main(){ string str; int cnt[6]; int i,min; while(cin>>str) { cnt[0]=count(str.begin(),str.end(),'P'); cnt[1]=count(str.begin(),str.end()

#include#include#include#include#includeusing namespace std;int main(){ map m; m["tret"]=0; m["jan"]=1;m["feb"]=2;m["mar"]=3;m["apr"]=4;m["may"]=5;m["jun"]=6; m["jly"]=7;m["aug"]=8;m["sep

#include#include#includeusing namespace std;int main(){ int a[100001]; int b[100001]; int c[100001]; int N,i,cnt,max; while(cin>>N) { for(i=0;i<N;++i) { cin>>a[i]; b[i]=a[i];

#include using namespace std;int Tree[30];int main(){ char s1[4]; int n,m; int i; int level; int flag; int index1,index2,index3; while(cin>>n>>m) { if(m==

#include #include #include using namespace std;int a[100001];int main(){ int n,m,i; while(cin>>n>>m) { if(n==0 && m==0) break; for(i=0; i<n; ++i)

这道题目我也是被自己搞醉了。弄了一上午。代码有三百行。仅仅是上交一道考研机试题。利用封装思想写大整数类。。AC之后很激动，，这期间还有很多C++运算符重载细节忘记了，只能说自己不熟练。联系太少。这个例子告诉我，读源码是多么的重要……每当我们把API用的不亦乐乎的时候，是否该思考这些API是如何实现的呢。。看来得多看看源码才能有较大进步啊！#include #include #inclu

#include #include using namespace std;const int N= 1000000;int prime[10001];bool mark[N];void init(){ int i,j,t; memset(mark, 0, sizeof(mark[0])*N); for(i=2; i<1001; ++i) {

#include #include using namespace std;int main(){ int n,t; set s; set::iterator it; while(cin>>n) { s.clear(); while(n-->0) { cin>>t;

#include using namespace std;int main(){ int n,t,i; int a[15]; a[0] = 1; a[1] = 1; t = a[1]; i = 1; do { a[i+1] = a[i]*(i+1); ++i; }while(a[i]<

#include #include using namespace std;int main(){ char s1[102],s2[102]; int dp[102][102]; int len1,len2; int i,j,k; while(cin>>s1>>s2) { len1 = strlen(s1);

#include #include using namespace std;char str1[30],str2[30];int n;int Cn[22][22];void init(){ Cn[1][0] = Cn[1][1] = 1; for(int i=2; i<22; i++) { Cn[i][0] = Cn[i][i] = 1;

#include #include using namespace std;int main(){ string str[10000]; int n,i; while(cin>>n) { for(i=0; i<n; ++i) cin>>str[i]; cout<<str[n-1];

#include #include using namespace std;int cnt[3001][13][32];string week[7] = {"Saturday", "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday"};string month[12] = {"January", "Februa