#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a[100];
int i,j,m; 
for(i=0;i<=99;i++)

a[i]=i+1;

m=sqrt(a[i]);
for (i=0;i<=99;i++)
for(j=2;j<=m;j++)


if(a[i]%j!=0)cout<<a[i]<<endl;



return 0;
}

#include<iostream>
using namespace std;
int main()
{
int i,t;
int a[10];
for(i=0;i<10;i++)
cin>>a[i];
for(i=0;i<10;i++)
{
if(a[i]>a[i+1])
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
cout<<"the numbers are:"<<a[i]<<endl;
}
return 0;
}

#include<iostream>
using namespace std;
int main()
{
int a[3][3];
int i,j;
int sum=0;
cout<<"enter the numbers:"<<endl;
for(i=0;i<3;i++)
for(j=0;j<3;j++)
cin>>a[i][j];
for(i=0;i<3;i++)
sum=sum+a[i][i];
cout<<"sum="<<sum<<endl;
return 0;
}

#include<iostream>
using namespace std;
int main()
{
int a[5];
int i,t;
cout<<"enter the numbers:"<<endl;
for(i=0;i<5;i++)
cin>>a[i];
 for(i=0;i<5;i++)
cout<<a[i]<<endl;
for(i=0;i<5/2;i++)
{
t=a[i];
a[i]=a[5-i-1];
a[5-i-1]=t;
}
cout<<"now"<<endl;
for(i=0;i<5;i++)
cout<<a[i]<<endl;
return 0;
}

#include<iostream>
using namespace std;
int leap(int )
{
int year;
bool leap;
if(year%4==0)
{
if(year%100==0)
{
if(year%400==0)
leap=true;
else leap=false;
}
else
leap=true;
}
else
leap=false;
return 0;
}
int main()
{
int year1(int);
int year2(int);int year;
 cout<<"please enter year:"; 
cin>>year;
leap(year);
if(leap)
{
year1(year);
}
else 
{year2(year);
}
return 0;
}
int year1(int year)
{int i;
int a[367];int s[367];int m[367];
for(i=0;i<367;i++)
{
a[i]=i+1;
s[i]=year-1+(year-1)/4-(year-1)/100+(year-1)/400+i;
m[i]=s[i]%7;

if(i<=31)cout<<"1yue"<<i<<"xingqi"<<m[i]<<endl;
else if(i<=60)cout<<"2ue"<<i-31<<"xingqi"<<m[i]<<endl;
else if(i<=91)cout<<"3yue"<<i-60<<"xingqi"<<m[i]<<endl;
else if(i<=121)cout<<"4yue"<<i-91<<"xingqi"<<m[i]<<endl;
else if(i<=152)cout<<"5yue"<<i-121<<"xingqi"<<m[i]<<endl;
else if(i<=182)cout<<"6yue"<<i-152<<"xingqi"<<m[i]<<endl;
 else if(i<=213)cout<<"7yue"<<i-182<<"xingqi"<<m[i]<<endl;
else if(i<=244)cout<<"8yue"<<i-213<<"xingqi"<<m[i]<<endl;
else if(i<=274)cout<<"9yue"<<i-244<<"xingqi"<<m[i]<<endl;
else if(i<=305)cout<<"10yue"<<i-274<<"xingqi"<<m[i]<<endl;
else if(i<=335)cout<<"11yue"<<i-305<<"xingqi"<<m[i]<<endl;
else if(i<=366)cout<<"12yue"<<i-335<<"xingqi"<<m[i]<<endl;}
return 0;
}
int year2(int year)
{int j;
int a[366];int s[366];int m[366];
for(j=0;j<366;j++)
{
a[j]=j+1;
s[j]=year-1+(year-1)/4-(year-1)/100+(year-1)/400+j;
m[j]=s[j]%7;

if(j<=31)cout<<"1yue"<<j<<"xingqi"<<m[j]<<endl;
else if(j<=59)cout<<"2ue"<<j-31<<"xingqi"<<m[j]<<endl;
else if(j<=90)cout<<"3yue"<<j-59<<"xingqi"<<m[j]<<endl;
else if(j<=120)cout<<"4yue"<<j-90<<"xingqi"<<m[j]<<endl;
else if(j<=151)cout<<"5yue"<<j-120<<"xingqi"<<m[j]<<endl;
else if(j<=181)cout<<"6yue"<<j-151<<"xingqi"<<m[j]<<endl;
 else if(j<=212)cout<<"7yue"<<j-181<<"xingqi"<<m[j]<<endl;
else if(j<=243)cout<<"8yue"<<j-212<<"xingqi"<<m[j]<<endl;
else if(j<=273)cout<<"9yue"<<j-243<<"xingqi"<<m[j]<<endl;
else if(j<=304)cout<<"10yue"<<j-273<<"xingqi"<<m[j]<<endl;
else if(j<=334)cout<<"11yue"<<j-304<<"xingqi"<<m[j]<<endl;
else if(j<=366)cout<<"12yue"<<j-334<<"xingqi"<<m[j]<<endl;}
return 0;
}

搜酷狗就有