第五周
(1)
#include
#include
int main()
{
int a,b,c,N,t=0;
scanf("%d",&N);
for(a=1;a<=N;a++)
{
for(b=a;b<=N;b++)
{
for(c=b;c<=N;c++)
{ if(c*c==a*a+b*b)
t=t+1;
}
}
}
printf("%d\n",t);
system("pause");
return 0;
}
(2)
#include
#include
main(){int i,j,k,a,b,c,d,m=0,e;
for(e=0;e>=0;e++)
{scanf("%d%d",&i,&j);
if((i==0)||(j==0)) break;
else if((i>9999||i<1000)||(j>9999||j<1000)) printf("Error\n");
else {for(k=i;k<=j;k++)
{if (k%2==1) continue;
a=k/1000;b=(k%1000)/100;c=(k%100)/10;d=k%10;
if((((a==b)||(b==c))||(c==d)) ||((d==a)||((a==c)||(d==b)))) continue;
printf("%d ",k);m+=1;}
printf("\ncounter=%d\n",m); m=0;}}}
(3)
#include
int main(){int m,n,s=0;scanf("%d",&n);
for(m=1;s
第六周
for(i=1,s=0;(s=s+i*i)<=1000;n=i++)
循环执行4次
5
x=4
1.600000
① m=n ② m>0 ③ m=m/10
第六周编程作业
(1)
#include
int main()
{
int n,i;
scanf("%d",&n);
for(i=1;i<=n*n;i++)
{
printf("%3d",i);
if(i%n==0)printf("\n");
}
}
(2)
#include
int main()
{
int n, i, q, p;
char ch;
scanf("%c%d",&ch,&n);
for(i = 0; i < n; i++)
{
for(q = i; q < n - 1; q++)
printf(" ");
printf("%c",ch + i);
for(q = 0; q < (2 * i - 1); q++)
{
printf(" ");
if(q == 2 * i - 2)
printf("%c",ch + i);
}
printf("\n");
}
for(i = n - 2; i >= 0; i--)
{
for(q = i; q < n - 1; q++)
printf(" ");
printf("%c", ch + i);
for(q = 2 * i - 1; q > 0; q--)
{
printf(" ");
if(q == 1)
printf("%c", ch + i);
}
printf("\n");
}
return 0;
}
(3)
#include
int main()
{ int a,b,c,d,i,j,k,l; static int s[1000];
scanf("%d%d%d%d",&a,&b,&c,&d);
for (i=0;i<=5;i++)
for (j=0;i+j<=5;j++)
for (k=0;k+i+j<=5;k++)
for (l=0;k+i+j+l<=5;l++)
if (a*i+b*j+c*k+d*l) s[a*i+b*j+c*k+d*l]++;
for (i=1;i<=1000;i++)
if(!s[i]) break;
printf("The max is %d.\n",--i);
return 0;}
(4)
#include
#include
#include
int main()
{
int i,j,k,n,t,sum,len,maxl;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
sum=len=0;
maxl=-1001;//maxl小于愉快度可能的最小值
while(n--)
{
scanf("%d",&k);
if(maxl
if(sum
if(maxl<0)printf("%d\n",maxl);
else printf("%d\n",sum);
}
return 0;
}
第七周
(1)
#include
#include
int main()
{
int i,j,n;
char c,a[100];
gets(a);
n=strlen(a);
for(i=0;i
for(j=
13]=='9'&&(a[14]=='6'||a[14]=='7'||a[14]=='8'||a[14]=='9'))
{b[6]='1';b[7]='8';}
else {b[6]='1';b[7]='9';}
for (j=8;j<=16;j++) b[j]=a[j-2];
b[17]=ans(b);b[18]='\0';
printf("%s\n",b);}
else if (a[17]==ans(a)) printf("Valid\n"); else printf("Invalid\n"); }
return 0; }
(4)
#include
#include
int main()
{
int n, i, j, m, log1, log2, log3, log4;
char s[100][21], t[10];
scanf("%d",&n);
gets(t);
for(i = 0; i < n; i++)
gets(s[i]);
for(i = 0; i < n; i++)
{
j = 0;
while(s[i][j] != '\0')
{
j++;
}
if(j < 6)
{
printf("Not Safe\n");
continue;
}
j = 0;
log1 = 0;
log2 = 0;
log3 = 0;
log4 = 0;
while(s[i][j] != '\0')
{
if(s[i][j] >= '0' && s[i][j] <= '9') log1 = 1;
if(s[i][j] >= 'a' && s[i][j] <= 'z') log2 = 1;
if(s[i][j] >= 'A' && s[i][j] <= 'Z') log3 = 1;
if(!(s[i][j] >= '0' && s[i][j] <= '9') && !(s[i][j] >= 'a' && s[i][j] <= 'z') && !(s[i][j] >= 'A' && s[i][j] <= 'Z')) log4 =1;
j++;
}
m = 0;
if(log1 == 1) m++;
if(log2 == 1) m++;
if(log3 == 1) m++;
if(log4 == 1) m++;
if(m == 1) printf("Not Safe\n");
if(m == 2) printf("Medium Safe\n");
if(m >= 3) printf("Safe\n");
}
return 0;
}