diff --git "a/C++\344\275\234\344\270\232.cpp" "b/C++\344\275\234\344\270\232.cpp"
new file mode 100644
index 00000000..fa900098
--- /dev/null
+++ "b/C++\344\275\234\344\270\232.cpp"
@@ -0,0 +1,92 @@
+#include<stdio.h>
+void maopao(int a[],int n);
+int main()
+{
+	int a[20];
+	int o=0;
+	   for(int i=100;i<=999;i++)
+	   {
+	   	int c=i%10,b=(i-i%10)%10,a=i%100;
+	   	for(int x=2;x<i;x++)
+	   	{
+	   		if(i%x==0)
+	   		{
+	   			break;
+			   }		
+			   else
+			   {
+			   	for(int y=2;y<a*b*c;y++)
+			   	{
+			   		if((a*b*c)%y==0)
+			   		{
+			   			break;
+					   }
+					   else
+					   {
+					   	for(int z=2;z<(a+b+c);z++)
+					   	{
+					   		if((a+b+c)%z==0)
+					   		{
+					   			break;
+							   }
+							   else
+							   {
+							   	for(int m=2;m<(a*a+b*b+c*c);m++)
+							   	{
+							   		if((a*a+b*b+c*c)%m==0)
+							   		{
+							   			break;
+										} 
+										else
+										{
+											a[o]=i;///Having problem.Debug it
+											o++;
+										}
+								   }
+							   }
+						   }
+					   }
+				   }
+			   	
+			   }
+			   
+			   
+			   
+		   }
+	   	
+		} 
+		printf("The number: %d\n",sizeof(a));
+		int sum=0;
+	for(int q=0;q<sizeof(a);q++)
+	{
+		sum += a[q];
+	}
+	printf("The sum: %d\n",sum);
+	maopao(a,sizeof(a));
+	int t=sizeof(a)-1;
+	printf("The biggest number: %d\n",a[t]);
+	
+	return 0;
+}
+
+
+
+void maopao(int a[],int n)
+{
+	int i,j;
+	for(i=0;i<n-1;i++)
+	 {
+		for(j=0;j<n-i-1;j++)
+		 {
+		 	if( a[j]>a[j+1] )
+		    	{
+		    		int temp;
+		    		temp=a[j];
+		    		a[j]=a[j+1];
+		    		a[j+1]=temp;
+			    }  
+		 }
+	 }
+	
+	
+}
diff --git "a/testfile/C++sort\346\216\222\345\272\217.cpp" "b/testfile/C++sort\346\216\222\345\272\217.cpp"
new file mode 100644
index 00000000..674e52b4
--- /dev/null
+++ "b/testfile/C++sort\346\216\222\345\272\217.cpp"
@@ -0,0 +1,30 @@
+#include<iostream>
+#include<algorithm>
+using namespace std;
+int main()
+{
+	char a[10]="AclRqsiFp";
+
+	for(int i=0;i<10;i++)
+	{
+		std::cout<<a[i]<<"\t";
+	}
+	
+	std::cout<<"\n";
+	std::sort(a,a+10,std::greater<char>());
+	
+	for(int i=0;i<10;i++)
+	{
+		std::cout<<a[i]<<"\t";
+	}
+	
+	
+	
+	
+	//system("pause");
+	return 0;
+}
+
+
+
+
diff --git "a/testfile/\345\257\273\346\211\276\350\266\205\347\272\247\347\264\240\346\225\260.cpp" "b/testfile/\345\257\273\346\211\276\350\266\205\347\272\247\347\264\240\346\225\260.cpp"
new file mode 100644
index 00000000..374ae011
--- /dev/null
+++ "b/testfile/\345\257\273\346\211\276\350\266\205\347\272\247\347\264\240\346\225\260.cpp"
@@ -0,0 +1,111 @@
+#include<stdio.h>
+int main()
+{
+	int prime[1000];
+	int o=0;
+	for(int i=100;i<1000;i++)  //100~999
+	{
+		if(i%2==0 || i%3==0 || i%5==0)
+		{
+			continue;
+		}
+		
+		int q=0;
+		for(int j=2;j<i;j++)
+		{
+			if(i%j==0)
+			{
+				q=1;
+				break;
+			}
+		}
+		if(q==1)
+		{
+			continue;
+		}
+		else if(q==0)
+		{
+			prime[o]=i;
+			o++;
+		}
+		
+	}
+/*	for(int v=0;v<o;v++)
+	{
+		printf("%d ",prime[v]);
+	}
+	printf("\n");*/
+	int superprime[50],t=0;
+	for(int u=0;u<o;u++)
+	{
+		int a,b,c;
+		a=prime[u]/100;
+		c=prime[u]%10;
+		b=(prime[u]-100*a-c)/10;
+		int x=a+b+c,y=a*b*c,z=a*a+b*b+c*c;//构造出三个数 
+		
+		if(y==0)
+		{
+			continue;
+		}
+		int p1=0;
+		for(int j=2;j<x;j++)
+		{
+			if(x%j==0)
+			{
+				p1=1;
+				break;
+			}
+		}
+		if(p1==1)
+		{
+			continue;
+		}
+		else if(p1==0)
+		{
+			      int p2=0;
+		         for(int j=2;j<y;j++)
+		        {
+			        if(y%j==0)
+			          {
+				         p2=1;
+				         break;
+			          }
+		        }
+		     if(p2==1)
+		          {
+			           continue;
+		          }
+		     else if(p2==0)
+		          {
+			           int p3=0;
+		               for(int j=2;j<z;j++)
+		               {
+			              if(z%j==0)
+			                {
+				                p3=1;
+				                break;
+			                }
+		               }
+		               if(p3==1)
+		                 { 
+			               continue;
+		                 }
+		               else if(p3==0)
+		                 {
+			                superprime[t]=prime[u];
+		                    	t++;
+		                 }
+			            
+		          } 
+		}
+		
+	}
+	for(int u1=0;u1<t;u1++)
+	{
+		printf("%d ",superprime[u1]);
+		
+	}
+	
+	return 0;
+}