#include
using namespace std;
int main()
{
int N;
cin>>N;
if(N>=90) cout<<"A";
if(N>=80&&N<90) cout<<"B";
if(N>=70&&N<80) cout<<"C";
if(N<70) cout<<"D";
return 0;
}
#include
using namespace std;
int main()
{
int n,sum=0,h;
cin>>n;
sum=sum+n;
for(int i=1;i<=10;i++)
{
n=n/2;
sum=sum+n*2;
}
cout<
#include
#include
using namespace std;
int main()
{
int a[10],sum=0;
for(int i=0;i<=9;i++)
{
cin>>a[i];
}
sort(a,a+10);
cout<
方案一、
#include
using namespace std;
int weifun(int o)
{
int i=0;
while(o>=1)
{
o=o/10;
i++;
}
return i;
}
int huifun(int m)
{
int b=0,k=0,wei=0,a=1;
b=m;
wei=weifun(m);
for(int j=1;j>N;
for(o=1;o<=N;o++)
{
if(o==huifun(o))
{
cout<
方案二、
//转成字符串的方式判断
#include
using namespace std;
int main() {
string s;
int n, len, cnt = 0, i, j;
cin >> n;
for ( i = 1; i <= n; i++) {
s = to_string(i);
len = s.size();
for (j = 0; j < len / 2; j++) {
if (s[j] != s[len - j - 1] ) break;
}
if (j == len / 2) {
cout << s << " ";
cnt++;
}
}
cout << "*" << cnt;
return 0;
}
方案一、
#include
using namespace std;
bool run(int m)
{
if(m%100==0)
{
if(m%400==0) return 1;
else return 0;
}
else if(m%4==0) return 1;
else return 0;
}
int main()
{
int nian,yue,ri,a,b=0,today=6,yu;
int pyue[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int ryue[12]={31,29,31,30,31,30,31,31,30,31,30,31};
cin>>nian>>yue>>ri;
a=151;
for(int i=2020;i<=nian;i++)
{
if(nian-i>=1)
{
if(run(i)==1) b=b+366;
else b=b+365;
}
else
{
for(int j=0;j