#include <iostream>
#include <iomanip>
#include<cmath>
using namespace std;
int main()
{
int a,k,m=0,c=1,n=0;
bool prime;
cout<<"please input n"<<endl;
cin>>n;
cout << "the prime is:" << endl;
for(c=1;c<=n;c++)
{
prime=true;
k=int(sqrt(c));
for(int i=2;i<=k;i++)
if(c%i==0)
{
prime=false;
break;
}
if(prime)
{
if(c>1)
{
cout<<setw(5)<<c;
m=m+1;
}
}
if(m%10==0)
cout<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int a,sum=0;
cin>>a;
for(int i=0;a>0;i++)//1
{
sum+=int(a%10);//3
a/=10;//3
}
cout << "The sum is: " <<sum<<endl;
return 0;
}
//时间复杂度:
//语句1执行log10 n次,频度log10 n+1次;
//若1中a为个位数,则语句2的频度为0;
//T(n)=O(log10 n).
#include <iostream>
#include<string>
using namespace std;
int main()
{
string a;
int i,j,length;
bool flag;
flag=true;
cin>>a;
length=a.size();
for(j=0; j<length/2; j++)//1
{
if(a[j]!=a[length-j-1])//2
{
flag=false;//3频度为0
break;//4
}
}
if(flag)
{
cout<<"Yes!"<<endl;//5
}
else
{
cout<<"No!"<<endl;//6
}
return 0;
}
//时间复杂度:
//语句1执行n次,频度n+1次;
//语句2为语句1执行n次,频度n次;
//因为语句3频度为0;用最坏情况下的时间复杂度计算
//T(n)=n+1+n*n+0=O(n^2).