mengzhongfeixueyi的博客

#include using namespace std; int main() { int a[101]={7,49,73,58,30,72,44,78,23,9,40,65,92,42,87,3,27,29,40,12,3,69,9,57,60,33,99,78,16,35,97,26,12,67,10,33,79,49,79,21,67,72,93,36,85,45,28,91,94,57

#include using namespace std; int prime(int m) //!!素数判断时注意特殊情况的考虑，如1,2； { int judge=1; if(m==1) judge=0; int i; for(i=2;i<m/2;i++) { if(m%i==0) { judge=0; break; } } return judge

//注意格式，最后的Result是以,分割的。 #include using namespace std; int main() { int n; cin>>n; int i,j; int *a=new int[n]; for(i=0;i<n;i++) { cin>>a[i]; } cout<<"Source:"<<endl; cout<<"("; cout<<a[0];

#include using namespace std; int a[100][2]; int main() { int n; cin>>n; int i; double area=0,sum=0; for(i=0;i<n;i++) { cin>>a[i][0]>>a[i][1]; } int j,k; for(i=0;i<n;i++) { for(j=i+1;j<n

#include using namespace std; /*class class seqlist { public: seqlist(int n); ~seqlist(); private: T *a; } seqlist::seqlist(int n) { a=new */ template void reverse(T a[],int n) { int i,j; T tem

#include using namespace std; int gcd(int a,int b) { int x,y,r; if(a>b) { x=a; y=b; } else { x=b; y=a; } r=x%y; while(r) { x=y; y=r; r=x%y; } return y; } int gongbei(int a,in

#include using namespace std; int he(int a) { int i; long int sum=0; i=a%10; a=a/10; while(a) { sum+=i; i=a%10; a=a/10; } sum+=i; return sum; } int main() { int T; long int a; cin>>T

#include using namespace std; int main() { int n; cin>>n; int i,N,R; int x,y; char c; int a[20]; memset(a,0,sizeof(a)); int num=0,judge=1; for(i=0;i<n;i++) { cin>>N>>R; if(N<0) { ju

#include using namespace std; char week[7]={'A','B','C','D','E','F','G'}; int year[2]={365,366}; int month[2][12]={31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31}; int main()