1%! 10%.

5. 맨처음부터 빈칸 0 별 9 개빈칸 1 별 7 개빈칸 2 별 5 개빈칸 3 별 3 개빈칸 4 별 1 개빈칸 5 별 0 개 4 1 개3 3 개2 5 개1 7 개#include <stdio.h> int main(){ int i,j,k; int n; scanf("%d",&n); for(i=1;i<=n;i++){ for(j=1;j<i;j++){ printf(" "); } for(k=1;k<=2*n+1-2*i;k++){ printf("*"); } printf("\n"); } for(i=n-1;i>0;i--){ for(j=1;j<i;j++){ printf(" "); } for(k=1;k

#include <stdio.h> int main() { int i,j=0; int sum=0; int min=100; int a[8]={0,}; int b[8]={0,}; for(i=0;i<7;i++){ scanf("%d",&a[i]); } for(i=0;i<7;i++){ if(a[i]%2==1){ b[j]=a[i]; j++; } } for(i=0;i<7&&b[i]!=0;i++){ if(min>b[i]){ min=b[i]; } sum+=b[i]; } if(sum==0){ printf("-1"); }else{ printf("%d\n",sum); printf("%d",min); }}홀수없으면 -1출력.

#include <stdio.h> int main(){ int a[10]={0,}; int i; int na,nb; scanf("%s",a); for(i=0;i<7;i++){ a[i]=a[i]-'0'; } na=a[0]+10*a[1]+100*a[2]; nb=a[4]+10*a[5]+100*a[6]; if(na>nb){ printf("%d",na); }else{ printf("%d",nb); }} #include <stdio.h> int main(){ int a[5]={0,}; int b[5]={0,}; int i; int na,nb;

#include <stdio.h>#define swap(a,b){int t;t=a;a=b;b=t;} int bubblesort(int *ar,int num){ int i,j; for(i=0;i<num-1;i++){ for(j=1;j<num-i;j++){ if(ar[j-1]>ar[j]){ swap(ar[j-1],ar[j]); } } }} int main(){ int n; int sum=0; int i,j; int *a; int *b; scanf("%d",&n); a=(int *)malloc(n*sizeof(int)); b=(in