A:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int score;
int main()
{
while (scanf("%d",&score)!=EOF)
{
if(score>=90&&score<=100)
printf("A\n");
else if(score>=80&&score<=89)
printf("B\n");
else if(score>=70&&score<=79)
printf("C\n");
else if(score>=60&&score<=69)
printf("D\n");
else if(score>=0&&score<=59)
printf("E\n");
else
printf("Score is error!\n");
}
return 0;
}
B:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
double d;
int main()
{
while (scanf("%lf",&d)!=EOF)
{
printf("%.2lf\n",fabs(d));
}
return 0;
}
C:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=105;
double a;
int sum[3];
int n;
int main()
{
while (scanf("%d",&n)!=EOF&&n)
{
memset (sum,0,sizeof(sum));
for (int i=0;i<n;i++)
{
scanf("%lf",&a);
if(a<0)
sum[0]++;
else if(a>0)
sum[2]++;
else
sum[1]++;
}
for (int i=0;i<3;i++)
printf("%d%c",sum[i],i==2?'\n':' ');
}
return 0;
}
D:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int n;
char c;
int sum;
int main()
{
scanf("%d",&n);
getchar();
while (n--)
{
sum=0;
while (scanf("%c",&c)&&c!='\n')
{
if(c>='0'&&c<='9')
sum++;
}
printf("%d\n",sum);
}
return 0;
}
E:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=105;
const int INF=0x3f3f3f3f;
int n;
int a[maxn];
int loc,Min;
int main()
{
while (scanf("%d",&n)!=EOF&&n)
{
Min=INF;
for (int i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(Min>a[i])
{
Min=a[i];
loc=i;
}
}
swap(a[0],a[loc]);
for (int i=0;i<n;i++)
printf("%d%c",a[i],i==n-1? '\n':' ');
}
return 0;
}
F:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=105;
char s[maxn];
int main()
{
while (gets(s)&&s!=NULL)
{
int len=strlen(s);
int flag=0;
for (int i=0;i<len;i++)
{
if(i==0||s[i]==' ')
{
flag=1;
}
if(flag&&s[i]!=' ')
{
s[i]=s[i]-'a'+'A';
flag=0;
}
}
printf("%s\n",s);
}
return 0;
}
G:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int m,n;
vector<int> v;
int Judge (int x)
{
int sum=0,t=x;
while (t)
{
int y=t%10;
sum+=y*y*y;
t/=10;
}
return sum==x? 1:0;
}
int main()
{
while (scanf("%d%d",&m,&n)!=EOF)
{
v.clear();
for (int i=m;i<=n;i++)
{
if(Judge(i))
{
v.push_back(i);
}
}
if(!v.size())
printf("no\n");
else
for (int i=0;i<v.size();i++)
printf("%d%c",v[i],i==v.size()-1?'\n':' ');
}
return 0;
}
H:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
char a,b,c;
int main()
{
while (scanf("%c%c%c",&a,&b,&c)!=EOF)
{
getchar();
if(a>b)
swap(a,b);
if(a>c)
swap(a,c);
if(b>c)
swap(b,c);
printf("%c %c %c\n",a,b,c);
}
return 0;
}
I:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int n;
int sum;
int main()
{
while (scanf("%d",&n)!=EOF)
{
sum=1;
while (n--)
{
int t;
scanf("%d",&t);
if(t%2)
sum*=t;
}
printf("%d\n",sum);
}
return 0;
}
J:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=105;
int n,t;
int a[maxn];
int main()
{
while (scanf("%d%d",&n,&t)!=EOF&&n||t)
{
for (int i=0;i<n;i++)
scanf("%d",&a[i]);
int flag=0,ci=0;
for (int i=0;i<n;i++)
{
if(a[i]>t&&!flag)
{
flag=1;
printf("%d ",t);
ci++;
}
ci++;
printf("%d%c",a[i],ci==n+1? '\n':' ');
}
if(!flag)
printf("%d\n",t);
}
return 0;
}
K:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
char c;
map<int,int> ma;
int main()
{
while (scanf("%c",&c))
{
ma.clear();
if(c=='#')
break;
int sum=0,len=0;
if(c!=' ')
{
sum+=(c-'a'+1)*(++len);
}
while (scanf("%c",&c)&&c!='\n')
{
if(c==' ')
{
len=0;
if(sum)
ma[sum]=1;
sum=0;
}
else
{
sum+=(c-'a'+1)*(++len);
}
}
if(sum)
ma[sum]=1;
printf("%d\n",ma.size());
}
return 0;
}